By Topic

Image compression in real-time multiprocessor systems using divisive K-means clustering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
D. Fradkin ; Dept. of Comput. Sci., Rutgers Univ., USA ; I. B. Muchnik ; S. Streltsov

In recent years, clustering became one of the fundamental methods of large dataset analysis. In particular, clustering is an important component of real-time image compression and exploitation algorithms, such as vector quantization, segmentation of SAR, EO/IR, and hyperspectral imagery, group tracking, and behavior pattern analysis. Thus, development of fast scalable real-time clustering algorithms is important to enable exploitation of imagery coming from surveillance and reconnaissance airborne platforms. Clustering methods are widely used in pattern recognition, data compression, data mining, but the problem of using them in real-time systems has not been a focus of most algorithm designers. We describe a practical clustering procedure that is designed specifically for compression of 2D images and can satisfy stringent requirements of real-time onboard processing.

Published in:

Integration of Knowledge Intensive Multi-Agent Systems, 2003. International Conference on

Date of Conference:

30 Sept.-4 Oct. 2003