Subscribe Now Subscribe Today
Science Alert
Curve Top
Journal of Applied Sciences
  Year: 2011 | Volume: 11 | Issue: 1 | Page No.: 16-25
DOI: 10.3923/jas.2011.16.25
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Partitioning an Image Database by K_means Algorithm

Houaria Abed and Lynda Zaoui

Unsupervised classification has emerged as a popular technique for pattern recognition, image processing and data mining. It has a crucial contribution in the resolution of the problems arising from content-based image retrieval. In this study, we present K_means clustering algorithm that partitions an image database in cluster of images similar. We adapt K_means method to a very special structure which is quadree. The goal is to minimize the search time of images similar to an image request. We associate to each image a quad-tree which represents the characteristics of the image and store a base of images in a data structure called generic quadtree. It minimizes the memory space of set of image by the sharing of common parts between quad trees and speeds up several operations applied to images. The image similarity is based on a distance computed from the differences between the quad trees encoding images.
PDF Fulltext XML References Citation Report Citation
  •    A New Exact Pattern Matching Algorithm (WEMA)
  •    Constrained Association Rules for Medical Data
  •    Medical Data Classification with Naive Bayes Approach
  •    A Modified Tabu Search Approach for the Clustering Problem
  •    An Efficient Method of Organizing Bit-String Signatures for Searching Symbolic Images
How to cite this article:

Houaria Abed and Lynda Zaoui, 2011. Partitioning an Image Database by K_means Algorithm. Journal of Applied Sciences, 11: 16-25.

DOI: 10.3923/jas.2011.16.25






Curve Bottom