Abstract

Search algorithms in image databases usually return k nearest neighbours (kNN) of an image according to a similarity measure. This approach presents some anomalies and is based on assumptions that are not always satisfied. We have examined the causes of these anomalies and we have concluded that image query models have to exploit topological properties rather than the similarity degree. This paper proposes a topological model based on neighbourhood graphs built on automatically extracted image features. Each image is represented as a feature vector in R p and stands for a node in the neighbourhood graph. The graph exploration corresponds to database browsing, the neighbours of a node represent similar images. In order to perform query by example, the query image is represented as a R p feature vector and inserted in the graph by locally updating the neighbourhood graph. The topology of an image database is more informative than a similarity measure usually applied in content based image retrieval, as proved by our experiments. A prototype of a visualization and query tool called Smart Image Query (SIQ) is also introduced.

Full Text
Paper version not known

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 call

Disclaimer: 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.