Conversion database of the shapes into XML data for shape matching
Authors:
Preprint
Abstract
We present a new approach to the matching of 2D shapes using XML language and dynamic programming. Given a 2D shape, we extract its contour and which is represented by set of points. The contour is divided into curves using corner detection. After, each curve is described by local and global features; these features are coded in a string of symbols and stored in a XML file. Finally, using the dynamic programming, we find the optimal alignment between sequences of symbols. Results are presented and compared with existing methods using MATLAB for KIMIA-25 database and MPEG7 databases.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- RETRIEVAL FROM SHAPE DATABASES USING CHANCE PROBABILITY FUNCTIONS AND FIXED CORRESPONDENCEInternational Journal of Pattern Recognition and Artificial Intelligence, 2006
- Robust shape similarity retrieval based on contour segmentation polygonal multiresolution and elastic matchingPattern Recognition, 2005
- Matching and retrieval of distorted and occluded shapes using dynamic programmingIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- Learning string-edit distanceIEEE Transactions on Pattern Analysis and Machine Intelligence, 1998
- 3-D model localization using high-resolution reconstruction of monocular image sequencesIEEE Transactions on Image Processing, 1997
- Dynamic programming for detecting, tracking, and matching deformable contoursIEEE Transactions on Pattern Analysis and Machine Intelligence, 1995
- 3‐D curve matching using splinesJournal of Robotic Systems, 1991
- Surface versus edge-based determinants of visual recognitionCognitive Psychology, 1988