Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

SSPR
2004
Springer

favoriteEmaildiscussreport

111views Pattern Recognition» more SSPR 2004»

Matching Concavity Trees

13 years 9 months ago

Matching Concavity Trees

Download pami.uwaterloo.ca

Concavity trees are structures for 2-D shape representation. In this paper, we present a new recursive method for concavity tree matching that returns the distance between two attributed concavity trees. The matching is based both on the structure of the tree as well as on the attributes stored at each node. Moreover, the method can be implemented on parallel architectures, and it supports occluded and partial matching. To the best of our knowledge, this is the ﬁrst work to detail a method for concavity tree matching. We test our method on 625 silhouettes in the context of shape-based nearest-neighbour retrieval.

Ossama El Badawy, Mohamed Kamel

Real-time Traffic

2-D Shape Representation | Concavity Tree | Pattern Recognition | SSPR 2004 | Tree |

claim paper

Related Content

» Shape Retrieval using Concavity Trees

» Shape Representation Using Concavity Graphs

» Simultaneous optimization for concave costs single sink aggregation or single source buyat...

» OneBitMatching ICA Theorem ConvexConcave Programming and Combinatorial Optimization

» A general twosided matching market with discrete concave utility functions

» Compressing 2D Shapes Using Concavity Trees

» Brief Announcement Universal Data Aggregation Trees for Sensor Networks in Low Doubling Me...

» Envelope Detection of Multiobject Shapes

» The VPN Problem with Concave Costs

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	SSPR
Authors	Ossama El Badawy, Mohamed Kamel

Comments (0)