ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Pattern Recognition
Volume 31, Issue 10, October 1998, Pages 1443-1454
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (794 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0031-3203(97)00085-X    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1998 Pattern Recognition Society. Published by Elsevier Science B.V.

2-D OBJECT RECOGNITION BY MULTISCALE TREE MATCHING

V. CANTONI, L. CINQUE, Corresponding Author Contact Information, C. GUERRA, §, S. LEVIALDI and L. LOMBARDI

Dipartimento di Informatica e Sistemistica, Università di Pavia Via Ferrata 1, 27100 Pavia, Italy Dipartimento di Scienze dell’Informazione, Università “La Sapienza” di Roma Via Salaria 113, 00198 Roma, Italy § Dipartimento di Elettronica e Informatica, Università di Padova, Italy, Department of Computer Science, Purdue University, West Lafayette, USA

Received 4 March 1997;
revised 22 July 1997.
Available online 5 April 1999.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In this paper we present an efficient 2D object recognition method that uses multiscale tree representations. A planar object is represented by means of a tree, in which each node corresponds to a boundary segment at some level of resolution and an arc connects nodes corresponding to segments at successive levels that are spatially related. The problem of matching an object against a model is formulated as the one of determining the best mapping between nodes at all levels of the two associated trees. The proposed matching algorithm is based on dynamic programming and has optimal O(midT midmidTmid) time complexity, where midTmid and midTmid are the number of nodes in the two trees.

Author Keywords: Shape and object representation; Object recognition; Tree matching; Dynamic programming

Partially supported by the National Research Council of Italy and by the ESPRIT III Basic Research Programme of the EC under contract No. 9072 (Project GEPPCOM).

Corresponding Author Contact Information Author to whom correspondence should be addressed


Pattern Recognition
Volume 31, Issue 10, October 1998, Pages 1443-1454
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.