Sciweavers

928 search results - page 14 / 186
» Complexity of Self-assembled Shapes
Sort
View
ICMCS
2005
IEEE
97views Multimedia» more  ICMCS 2005»
14 years 2 months ago
A computationally efficient 3D shape rejection algorithm
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...
Yinpeng Chen, Hari Sundaram
ECCV
1996
Springer
14 years 10 months ago
Learning Dynamics of Complex Motions from Image Sequences
In Proc. European Conf. Computer Vision, 1996, pp. 357{368, Cambridge, UK The performance of Active Contours in tracking is highly dependent on the availability of an appropriate ...
David Reynard, Andrew Wildenberg, Andrew Blake, Jo...
ICIP
2001
IEEE
14 years 10 months ago
Shape measures for image retrieval
One of the main goals in Content Based Image Retrieval (CBIR) is to incorporate shape into the process in a reliable manner. In order to overcome the difficulties of directly obta...
George Gagaudakis, Paul L. Rosin
CVPR
2005
IEEE
14 years 10 months ago
Using the Inner-Distance for Classification of Articulated Shapes
We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points wi...
Haibin Ling, David W. Jacobs
IJCV
2010
249views more  IJCV 2010»
13 years 7 months ago
A Computational Model of Multidimensional Shape
We develop a computational model of shape that extends existing Riemannian models of shape of curves to multidimensional objects of general topological type. We construct shape sp...
Xiuwen Liu, Yonggang Shi, Ivo D. Dinov, Washington...