Implementation of clustering-based image retrieval system

Authors:
Yuk Ying Chung
Affiliations:
School of Information Technologies, University of Sydney, Sydney, NSW, Australia
Venue:
ICECS'05 Proceedings of the 4th WSEAS international conference on Electronics, control and signal processing
Year:
2005

Citing 5
Cited 0

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Color indexing

International Journal of Computer Vision
Pattern recognition and image analysis

Pattern recognition and image analysis
VisualSEEk: a fully automated content-based image query system

MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

Digital images are useful media for storing spatial, spectral and temporal components of information. Large image databases often store the images in compressed format, JPEG for example. This paper examines the algorithms of direct extraction of low level features from compressed images, working with three different clustering techniques. Results indicate that a K-Harmonic means clustering algorithm not only has the advantage of shorter in both clustering and searching time but also can have a higher accuracy rate.