By Topic

Hierarchical matching of panoramic images

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Glantz, R. ; Dipt. di Informatica, Univ. Ca'' Foscari di Venezia, Venezia Mestre, Italy ; Pelillo, M. ; Kropatsch, W.G.

When matching regions from "similar" images, one typically has the problem of missing counterparts due to local or even global variations of segmentation fineness. Matching segmentation hierarchies, however, not only increases the chances of finding counterparts, but also allows us to exploit the manifold constraints coming from the topological relations between the regions in a hierarchy. In this paper we match hierarchies from panoramic images by constructing an association graph GA whose vertices represent potential matches and whose edges indicate topological consistency. Specifically, a maximal [maximum] weight clique of GA corresponds to a topologically consistent mapping with maximal [maximum] total similarity. To find "heavy" cliques, we adapt a greedy pivoting-based heuristic to the weighted case. Experiments on pairs of panoramic images demonstrate the reliability of the results.

Published in:

Image Analysis and Processing, 2003.Proceedings. 12th International Conference on

Date of Conference:

17-19 Sept. 2003