The scalability of indexing techniques and image retrieval pose many problems. Indeed, their performance degrades rapidly when the database size increases. In this paper, we propose an efficient indexing method for high-dimensional spaces. We investigate how high-dimensional indexing methods can be used on a partitioned space into clusters to help the design of an efficient and robust CBIR scheme. We develop a new method for efficient clustering is used for structuring objects in the feature space; this method allows dividing the base into data groups according to their similarity, in function of the parameter threshold and vocabulary size. A comparative study is presented between the proposed method and a set of classification methods. The experiments results on the Pascal Visual Object Classes challenges (VOC) of 2007 and Caltech-256 dataset show that our method significantly improves the performance. Experimental retrieval results based on the precision/recall measures show interesting results.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.