Sciweavers

935 search results - page 134 / 187
» A computationally efficient 3D shape rejection algorithm
Sort
View
ICPR
2004
IEEE
16 years 15 days ago
Shape Retrieval using Concavity Trees
y trees are well-known abstract structures. This paper proposes a new shape-based image retrieval method based on concavity trees. The proposed method has two main components. The...
Mohamed Kamel, Ossama El Badawy
TIP
2008
122views more  TIP 2008»
14 years 11 months ago
Efficient 2-D Grayscale Morphological Transformations With Arbitrary Flat Structuring Elements
Abstract--An efficient algorithm is presented for the computation of grayscale morphological operations with arbitrary 2-D flat structuring elements (S.E.). The required computing ...
Erik R. Urbach, Michael H. F. Wilkinson
CVIU
2008
82views more  CVIU 2008»
14 years 11 months ago
Shape matching and registration by data-driven EM
In this paper, we present an efficient and robust algorithm for shape matching, registration, and detection. The task is to geometrically transform a source shape to fit a target ...
Zhuowen Tu, Songfeng Zheng, Alan L. Yuille
TMM
2008
201views more  TMM 2008»
14 years 11 months ago
Fast Best-Match Shape Searching in Rotation-Invariant Metric Spaces
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis p...
Dragomir Yankov, Eamonn J. Keogh, Li Wei, Xiaopeng...
TPDS
2002
136views more  TPDS 2002»
14 years 11 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert