Discrete Representation of Top Points via Scale Space Tessellation

In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construction that encodes the scale space description of top points in the form of a directed acyclic graph. This representation allows us to utilize graph matching algorithms for comparing images represented in terms of top point configurations instead of using solely the top points and their features in a point matching algorithm, as was done previously. The nodes of the graph represent the critical paths together with their top points. The edge set will capture the neighborhood distribution of vertices in scale space, and is constructed through a Delaunay triangulation scheme. We also will present a many-to-many matching algorithm for comparing such graph-based representations. This algorithm is based on a metric-tree representation of labelled graphs and their low-distortion embeddings into normed vector spaces v...

• Type: Conference
• Year: 2005
• Where: SCALESPACE
• Authors: Bram Platel, M. Fatih Demirci, Ali Shokoufandeh, Luc Florack, Frans Kanters, Bart M. ter Haar Romeny, Sven J. Dickinson
• Keywords: Matching Algorithm, Scale Space, Scale Space Representation, SCALESPACE 2005