Sciweavers

417 search results - page 15 / 84
» Convex Shape Decomposition
Sort
View
IPPS
2000
IEEE
13 years 12 months ago
A New Computation of Shape Moments via Quadtree Decomposition
Chin-Hsiung Wu, Shi-Jinn Horng, Pei-Zong Lee, Shun...
CG
2006
Springer
13 years 7 months ago
Optimal blurred segments decomposition of noisy shapes in linear time
Blurred segments were introduced by Debled-Rennesson et al. [Segmentation of discrete curves into fuzzy segments. In: 9th IWCIA, Electronic notes in discrete mathematics, vol. 12;...
Isabelle Debled-Rennesson, Fabien Feschet, Jocelyn...
DGCI
2009
Springer
13 years 10 months ago
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
Xavier Provençal, Jacques-Olivier Lachaud
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 7 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux
CVPR
2010
IEEE
14 years 4 months ago
Simultaneous Point Matching and 3D Deformable Surface Reconstruction
It has been shown that the 3D shape of a deformable surface in an image can be recovered by establishing correspondences between that image and a reference one in which the shape ...
Appu Shaji, Aydin Varol, Lorenzo Torresani, Pascal...