Share Email Print

Proceedings Paper

Hierarchical two view line segment matching using wavelet transform
Author(s): F. Mai; Y. S. Hung; W. F. Sze
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper presents a novel algorithm for line segment matching over two views. Two image pyramids are built by applying wavelet decomposition to the two images. After defining supporters for a line segment to be the edge points lying close to it, line segments are matched from the coarsest to the finest level. At each level the supporters are matched using the cross-correlation techniques. This method can match line segments over two uncalibrated views, in which the line segments need not be the images of the same section of a 3D line segment. The hierarchical strategy helps to reduce the computational complexity. Wavelet is adopted to build the hierarchical frame for its built-in multi-scale structure and fast decomposition algorithm. Furthermore, it overcomes the flattening-out problem in the traditional multi-scale Gaussian pyramid technique. Experiments on real image pairs are given to demonstrate the effectiveness and the robustness of our algorithm.

Paper Details

Date Published: 18 January 2006
PDF: 11 pages
Proc. SPIE 6066, Vision Geometry XIV, 606608 (18 January 2006); doi: 10.1117/12.642558
Show Author Affiliations
F. Mai, The Univ. of Hong Kong (Hong Kong China)
Y. S. Hung, The Univ. of Hong Kong (Hong Kong China)
W. F. Sze, The Univ. of Hong Kong (Hong Kong China)

Published in SPIE Proceedings Vol. 6066:
Vision Geometry XIV
Longin Jan Latecki; David M. Mount; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?