Paper
1 September 1995 Using the centroid operator for faster multiresolution image compression and pattern recognition
Author Affiliations +
Abstract
It is possible to build a multiresolution image encoding technique using the fractal transform. Fractal encoding methods rely on measuring least mean square difference between image blocks at two different spatial scales for most efficient block matching. If we instead, compute the centroid of the blocks to be matched before matching occurs and preserve this centroid information in the encoding process we both speed up the encoding process and have information that will allow us to interpret the shape of the objects in the encoded scenes. This ability may dramatically increase the speed at which pattern identification in large volumes of image data may be performed since less data would have to be processed for searches over large number of images.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Robert J. Bonneau "Using the centroid operator for faster multiresolution image compression and pattern recognition", Proc. SPIE 2569, Wavelet Applications in Signal and Image Processing III, (1 September 1995); https://doi.org/10.1117/12.217635
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Image compression

Rockets

Fractal analysis

Satellites

Image processing

Pattern recognition

RELATED CONTENT

Hierarchical Contour Coding And Generalization Of Shape
Proceedings of SPIE (February 16 1984)
Satellite image compression based on fractal theory
Proceedings of SPIE (April 02 2010)
Low-bit-rate fractal image coding
Proceedings of SPIE (June 24 1994)

Back to Top