We present an algorithm for compressing 2D vector fields that preserves topology. Our approach is to simplify the given data set using constrained clustering. We employ different...
Suresh K. Lodha, Jose C. Renteria, Krishna M. Rosk...
In this paper we discuss the feasibility of using singular points in a scale space representation (referred to as top points) for image matching purposes. These points are easily ...
Bram Platel, Frans Kanters, Luc Florack, Evguenia ...
Abstract--A new framework, termed Spatially Aligned Pyramid Matching (SAPM), is proposed for Near Duplicate Image Identification. The proposed method robustly handles spatial shift...
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...
We present a new metric between histograms such as SIFT descriptors and a linear time algorithm for its computation. It is common practice to use the L2 metric for comparing SIFT d...