Share Email Print

Journal of Electronic Imaging

Image search based on quadtree Zernike decomposition
Author(s): Alessandro Neri; Marco Carli; Veronica Palma; Luca Constantini
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A novel technique for searching for complex patterns in large multimedia databases is presented, based on rotation independent template matching. To handle objects of arbitrary shape while reducing the computational workload, the pattern to be localized is partitioned into small square blocks of sizes adapted to the local image content using quadtree decomposition. The use of Zernike polynomials for representing each block allows the design of a fast and effective maximum likelihood matching procedure to sequentially verify whether the target image contains each block of the quadtree. State of the art methods usually represent the whole pattern by using an orthogonal basis and extracting an invariant feature vector from the representation coefficients. In the proposed scheme, the use of the quadtree decomposition allows us to bind the number of terms of the truncated expansions, still guaranteeing a precise image representation.

Paper Details

Date Published: 1 October 2010
PDF: 11 pages
J. Electron. Imaging. 19(4) 043023 doi: 10.1117/1.3524827
Published in: Journal of Electronic Imaging Volume 19, Issue 4
Show Author Affiliations
Alessandro Neri, Univ. degli Studi di Roma Tre (Italy)
Marco Carli, Univ. degli Studi di Roma Tre (Italy)
Veronica Palma, Univ. degli Studi di Roma Tre (Italy)
Luca Constantini, Univ. degli Studi di Roma Tre (Italy)

© SPIE. Terms of Use
Back to Top