Translator Disclaimer
1 October 2010 Image search based on quadtree Zernike decomposition
Author Affiliations +
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.
©(2010) Society of Photo-Optical Instrumentation Engineers (SPIE)
Alessandro Neri, Marco Carli, Veronica Palma, and Luca Constantini "Image search based on quadtree Zernike decomposition," Journal of Electronic Imaging 19(4), 043023 (1 October 2010). https://doi.org/10.1117/1.3524827
Published: 1 October 2010
JOURNAL ARTICLE
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Automatic image categorization using MPEG-7 description
Proceedings of SPIE (January 10 2003)
RIME a replicated image detector for the World Wide...
Proceedings of SPIE (October 05 1998)
Rotation invariant fast features for large-scale recognition
Proceedings of SPIE (October 15 2012)
Segmentation-based image retrieval
Proceedings of SPIE (December 23 1997)

Back to Top