PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!
Tytuł artykułu

Clustering and dimensionality reduction for image retrieval in high-dimensional spaces

Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
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.
Rocznik
Strony
37--50
Opis fizyczny
Bibliogr. 25 poz., rys., tab.
Twórcy
autor
  • Faculty of Mathematics and Computer Science, Department of Computer Science, University of Sciences and Technology of Oran Mohamed Boudiaf, Algeria
autor
  • Faculty of Mathematics and Computer Science, Department of Computer Science, University of Sciences and Technology of Oran Mohamed Boudiaf, Algeria
autor
  • GREYC, UMR CNRS 6072, University of Caen Basse-Normandie, Caen, France
Bibliografia
  • [1] Guttman, A.: R-trees: a dynamic index structure for spatial searching. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pp. 47–57, 1984.
  • [2] Sellis, T. K., Roussopoulos, N., Faloutsos, C.: The R+-tree: A dynamic index for multidimensional object. In Proceedings of the 13h VLDB International Conference, pp. 507–578, 1987.
  • [3] Ciaccia, P. et al.: Indexing metric space with M-tree. In SEBD’97, pp. 67–86, 1997.
  • [4] White, D. A., Jain, R.: Similarity indexing with the SS-tree. In Proceedings of the 12th International Conference on Data Engineering, pp. 516–523, 1996.
  • [5] Katayama, N., Satoh, S.: The SR-Tree: An index structure for high-dimensional nearest neighbour queries. In proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, Tucson, Arizona, USA, pp. 369–380, 1997.
  • [6] Nievergelt, J., Hinterberger, H., Sevcik, K.: The grid file: An adaptable symmetric multikey files structure. ACM Transactions on Database Systems, 9(1), pp. 38–71, Mar. 1984.
  • [7] Robinson, J. T.: The K-D-B-Tree: A search structure for Large Multidimensional Dynamic Indexes. In Proceedings of the ACM SIGMOD, 1981.
  • [8] Herich, A., Six, H.-W., Widmayer, P.: The LSD-Tree: Spatial access to multidimensional point and non point object. Proceedings of the 15th International Conference on Very Large Databases, Amsterdam, The Netherlands, pp. 45-53, Morgan Kaufmann, 1989.
  • [9] Weber, R., Schek, H. J., Blott, S.: A quantitative analysis and performance study for similaritysearch methods in high-dimensional space. In: Proceedings of the 24th VLDB Conference, USA, 1998.
  • [10] Cha, G.-H., Zhu, X., Petrovic, D., Chang, C.-W.: An efficient indexing method for nearest neighbors searches in high dimensional image databases. IEEE Trans. Multimedia, 4(1), pp. 76–87, 2002.
  • [11] Cha, G. H., Chung, C. W.: The GC-Tree: a high-dimensional index structure for similarity search in image databases. IEEE Trans. Multimedia, 4(2), pp. 235–247, 2002.
  • [12] Weber, R., Bhm, K., Schek, H.-J.: Interactive-Time Similarity Search for large image collections using parallele VA-FILE. In: Proceedings of the 4th European Conference on Research and Advanced Technology for Digital Libraries, Springer-Verlag London, 2000.
  • [13] Bonato, V., Marques, E., Constantinides, G. A.: A parallel hardware architecture for image feature detection. In: Reconfigurable Computing: Architectures, Tools and Applications, pp. 137-148, Springer Berlin Heidelberg, 2008.
  • [14] Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: The VLDB Journal, pp. 518–529, 1999.
  • [15] Gorisse, D.: K Nearest Neighbours Search. ETIS, 2009.
  • [16] Yue, J., Zhang, W., Hu, H., Sh, Z.: Efficient Locality Sensitive Clustering in Multimedia Retrieval. In: Computational Science and Engineering (CSE), 2013 IEEE 16th International Conference on, pp. 403–408, 2013.
  • [17] Auclair, A., Cohen, L., Vincent, N. : Hachage de Descripteurs Locaux pour la Recherche d’Images Similaires. In : congres des jeunes chercheurs en vision par ordinateur, 2009.
  • [18] Salakhutdinov, R., Hinton, G.: Semantic Hashing. In ACM SIGIR, 2007.
  • [19] Bouveyron, C.: Modeling and classification of high-dimensional data: application to image analysis. Doctoral dissertation, University Joseph Fourier- Grenoble I, 2006.
  • [20] Smith, L. I.: A tutorial on principal components analysis. Cornell University, 2002.
  • [21] Sanchez, J. R. M.: Efficient Content-Based Retrieval in Parallel Databases of Images. Doctoral dissertation, University of Nantes, 2009.
  • [22] Pham, N., Morin, A., Poulet, F., Gros, P. : Analyse factorielle des correspondances hiérarchique pour la fouille d'images. In EGC, pp. 161–172, 2011.
  • [23] Sivic, J., Zisserman, A.: Video Google: A text retrieval approach to object matching in videos. In: Proceedings of the International Conference on Computer Vision, pp. 1470–1477, 2003.
  • [24] Benkrama, S., Zaoui, L., Charrier, C.: Accurate Image Search using Local Descriptors into a Compact Image Representation. International Journal of Computer Science Issues (IJCSI), 2013.
  • [25] Morovac, H. P.: Towards automatic visual obstacle avoidance. Proceedings of the 5th IJCAI, MIT, Cambridge, Mass., pp. 584-587, 1977.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-c620d988-7810-416b-9288-5455c4aaba85
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ć.