Book chapter
Multi-layer Tree Matching Using HSTs
Graph-Based Representations in Pattern Recognition, pp 198-207
2015
Abstract
Matching two images by mapping image features play a fundamental role in many computer vision task. Due to noisy nature of feature extraction, establishing a one-to-one matching of features may not always be possible. Although many-to-many matching techniques establishes the desired multi map between features, they ignore the spatial structure of the nodes. In this paper, we propose a novel technique that utilizes both the individual node features and the clustering information of nodes for image matching where image features are represented as hierarchically well-separated trees (HSTs). Our method uses the fact that non-leaf nodes of an HST represent a constellation of nodes in the original image and obtains a matching by finding a mapping between non-leaf nodes among the two HSTs. Empirical evaluation of the method on an extensive set of recognition tests shows the robustness and efficiency of the overall approach.
Metrics
7 Record Views
3 citations in Scopus
Details
- Title
- Multi-layer Tree Matching Using HSTs
- Creators
- Yusuf Osmanlıoğlu - Department of Computer Science, Drexel University, Philadelphia, USAAli Shokoufandeh - Drexel University
- Publication Details
- Graph-Based Representations in Pattern Recognition, pp 198-207
- Series
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing; Cham
- Resource Type
- Book chapter
- Language
- English
- Academic Unit
- Computer Science
- Scopus ID
- 2-s2.0-84937427542
- Other Identifier
- 991019174002504721