Conference Proceeding

Hierarchical image matching: a chamfer matching algorithm using interesting points

Sch. of Comput. & Inf. Sci., Univ. of South Australia, The Levels, SA
12/1995; DOI:10.1109/ANZIIS.1995.705717 ISBN: 0-86422-430-3 pp.70 - 75 In proceeding of: Intelligent Information Systems, 1995. ANZIIS-95. Proceedings of the Third Australian and New Zealand Conference on
Source: IEEE Xplore

ABSTRACT Image matching in conjunction with a distance transform has played
an important role in computer vision and image analysis. This paper
presents a new hierarchical chamfer matching algorithm based on the
detection of interesting points. The algorithm extends the traditional
method by introducing interesting points to replace edge points in the
distance transform for the matching measurement. A series of images,
with different numbers of interesting points featuring in the original
image, is created in a pyramid structure through a dynamic thresholding
scheme. The matching is performed in this pyramid in a coarse-to-fine
level order, by minimizing a given matching criterion in terms of the
distance between selected interesting points. This hierarchical
structure aims to reduce the computational load. The algorithm is simple
to implement and quite insensitive to noise and other disturbances. In
addition, such a hierarchical matching scheme is implemented on a
low-cost heterogeneous PVM (Parallel Virtual Machine) network to speed
up the processing without any specific software and hardware
requirements

0 0
 · 
0 Bookmarks
 · 
34 Views
  • Source
    Article: Optimal Approach for Fast Object-Template Matching
    A. Hajdu, I. Pitas
    [show abstract] [hide abstract]
    ABSTRACT: This paper proposes a novel algorithm for an optimal reduction of object description for object matching purposes. Our aim is to decrease the computation needs by considering simplified objects, thus reducing the number of pixels involved in the matching process. We develop the appropriate theoretical background based on centroidal Voronoi tessellations. Its use within the chamfer matching framework is also discussed. We present experimental results regarding the performance of this approach for 2-D contour and region-like object matching. As a special case, we investigate how the snake based representation of target objects can be employed in chamfer matching. The experimental results concern the use of object part matching for recognizing humans and show how the proposed simplification leads to valid replacements of the original templates.
    IEEE Transactions on Image Processing 09/2007; · 3.04 Impact Factor
  • Source
    Article: Registration of 2D Points Using Geometric Algebra and Tensor Voting
    Leo Reyes-Lozano, Gerard Medioni, Eduardo Bayro-Carrochano
    [show abstract] [hide abstract]
    ABSTRACT: In this paper, we present a novel algorithm that combines the power of expression of Geometric Algebra with the robustness of Tensor Voting to find the correspondences between two sets of 2D points with an underlying rigid transformation. Unlike other popular algorithms for point registration (like the Iterated Closest Points), our algorithm does not require an initialization, works equally well with small and large transformations between the data sets, performs even in the presence of large amounts of outliers (90% and more), and have less chance to be trapped in “local minima”. Furthermore, we will show how this algorithm can be easily extended to account for multiple overlapping motions and certain non-rigid transformations. KeywordsGeometric algebra-Tensor voting-Computer vision
    Journal of Mathematical Imaging and Vision 04/2012; 37(3):249-266. · 1.39 Impact Factor
  • Source
    Conference Proceeding: Hierarchical Dental X-Ray Radiographs Matching
    O. Nomir, M. Abdel-Mottaleb
    [show abstract] [hide abstract]
    ABSTRACT: The goal of forensic dentistry is to identify individuals based on their dental characteristics. In this paper we present a new matching technique for identifying missing, and wanted individuals from their dental X-ray records. Given a dental record, usually a postmortem (PM) radiograph, the proposed technique searches a database of ante mortem (AM) radiographs and retrieves the best matches from the database. The technique is based on matching teeth contours using hierarchical Chamfer distance. The proposed technique has two main stages: feature extraction, and teeth matching. During retrieval, according to a matching distance between the AM and PM teeth, AM radiographs that are most similar to a given PM image, are found and presented to the user. The experimental results on a database of 162 AM images show that the technique is robust for identifying individuals based on their dental records
    Image Processing, 2006 IEEE International Conference on; 11/2006
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

computational load
 
computer vision
 
different numbers
 
edge points
 
hierarchical
 
images
 
insensitive
 
interesting points
 
low-cost heterogeneous PVM
 
matching measurement
 
new hierarchical chamfer
 
Parallel Virtual Machine
 
pyramid structure
 
specific software