Abstract
The traditional CBIR is sequential retrieval. However, for large and high-dimension image databases, it is obvious that this retrieval method has been unable to meet efficiency. It is more important that the image database should be preprocessed and establish indexing to improve retrieval efficiency. Focus on the hierarchical clustering algorithm's high computational complexity, this paper introduces ART2 clustering algorithm for image database preprocessing, which reduces the computational complexity, and makes the Algorithm more efficient. In order to avoid the clustering center offset of ART2, K-means algorithm is used to calculate the pattern center, improving the accuracy of clustering. Compared by retrieval efficiency and retrieval result, it is convincingly proved that hierarchical index structure based on clustering is efficient and applicable in CBIR.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
