Share Email Print

Proceedings Paper

General stereo image matching using symmetric complex wavelets
Author(s): HePing Pan
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

General stereo image matching provides an adequate but hard problem with sufficient complexity, with which the potential of wavelets may be exploited to a full extend. An ideal stereo image matching algorithm is supposed to be invariant to the scale, translation, rotation, and partial correspondence between two given stereo images. While the multi-resolution of wavelets is good at scale adaptivity, we also require the wavelet transform and pyramids to be translation- and rotation-invariant. This paper is intended to serve for three purposes: (1) To present the general problem of stereo image matching in a sufficient depth and extent, so that pure wavelet mathematicians could think on adequate and efficient solutions, (2) To present a complete algorithm for top-down image matching including surface reconstruction by using wavelet pyramids, (3) To search for a wavelet family optimal for image matching. It is expected that a family of adequately designed wavelets could provide a generic and robust solution to the stereo image matching problem, which could be an important breakthrough in computer vision, photogrammetry, and pattern recognition.

Paper Details

Date Published: 23 October 1996
PDF: 24 pages
Proc. SPIE 2825, Wavelet Applications in Signal and Image Processing IV, (23 October 1996); doi: 10.1117/12.255278
Show Author Affiliations
HePing Pan, Cooperative Research Ctr. for Sensor Signal and Information Processing (Australia)

Published in SPIE Proceedings Vol. 2825:
Wavelet Applications in Signal and Image Processing IV
Michael A. Unser; Akram Aldroubi; Andrew F. Laine, 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?