Skip to main content

2018 | OriginalPaper | Buchkapitel

Local Orthogonal-Group Testing

verfasst von : Ahmet Iscen, Ondřej Chum

Erschienen in: Computer Vision – ECCV 2018

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This work addresses approximate nearest neighbor search applied in the domain of large-scale image retrieval. Within the group testing framework we propose an efficient off-line construction of the search structures. The linear-time complexity orthogonal grouping increases the probability that at most one element from each group is matching to a given query. Non-maxima suppression with each group efficiently reduces the number of false positive results at no extra cost. Unlike in other well-performing approaches, all processing is local, fast, and suitable to process data in batches and in parallel. We experimentally show that the proposed method achieves search accuracy of the exhaustive search with significant reduction in the search complexity. The method can be naturally combined with existing embedding methods.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Fußnoten
1
Matlab source code provided in supplementary material.
 
Literatur
1.
Zurück zum Zitat Sivic, J., Zisserman, A.: Video Google: a text retrieval approach to object matching in videos. In: ICCV (2003) Sivic, J., Zisserman, A.: Video Google: a text retrieval approach to object matching in videos. In: ICCV (2003)
2.
Zurück zum Zitat Philbin, J., Chum, O., Isard, M., Sivic, J., Zisserman, A.: Object retrieval with large vocabularies and fast spatial matching. In: CVPR, June 2007 Philbin, J., Chum, O., Isard, M., Sivic, J., Zisserman, A.: Object retrieval with large vocabularies and fast spatial matching. In: CVPR, June 2007
3.
Zurück zum Zitat Philbin, J., Chum, O., Isard, M., Sivic, J., Zisserman, A.: Lost in quantization: improving particular object retrieval in large scale image databases. In: CVPR, June 2008 Philbin, J., Chum, O., Isard, M., Sivic, J., Zisserman, A.: Lost in quantization: improving particular object retrieval in large scale image databases. In: CVPR, June 2008
4.
Zurück zum Zitat Jégou, H., Douze, M., Schmid, C.: Improving bag-of-features for large scale image search. IJCV 87(3), 316–336 (2010)CrossRef Jégou, H., Douze, M., Schmid, C.: Improving bag-of-features for large scale image search. IJCV 87(3), 316–336 (2010)CrossRef
5.
Zurück zum Zitat Jégou, H., Schmid, C., Harzallah, H., Verbeek, J.: Accurate image search using the contextual dissimilarity measure. IEEE Trans. PAMI 32(1), 2–11 (2010)CrossRef Jégou, H., Schmid, C., Harzallah, H., Verbeek, J.: Accurate image search using the contextual dissimilarity measure. IEEE Trans. PAMI 32(1), 2–11 (2010)CrossRef
6.
Zurück zum Zitat van Gemert, J.C., Veenman, C., Smeulders, A.W., Geusebroek, J.: Visual word ambiguity. IEEE Trans. PAMI 32(7), 1271–1283 (2010)CrossRef van Gemert, J.C., Veenman, C., Smeulders, A.W., Geusebroek, J.: Visual word ambiguity. IEEE Trans. PAMI 32(7), 1271–1283 (2010)CrossRef
7.
Zurück zum Zitat Babenko, A., Lempitsky, V.: The inverted multi-index. In: CVPR, June 2012 Babenko, A., Lempitsky, V.: The inverted multi-index. In: CVPR, June 2012
8.
Zurück zum Zitat Jégou, H., Douze, M., Schmid, C., Pérez, P.: Aggregating local descriptors into a compact image representation. In: CVPR, June 2010 Jégou, H., Douze, M., Schmid, C., Pérez, P.: Aggregating local descriptors into a compact image representation. In: CVPR, June 2010
9.
Zurück zum Zitat Perronnin, F., Dance, C.R.: Fisher kernels on visual vocabularies for image categorization. In: CVPR, June 2007 Perronnin, F., Dance, C.R.: Fisher kernels on visual vocabularies for image categorization. In: CVPR, June 2007
12.
Zurück zum Zitat Tolias, G., Sicre, R., Jégou, H.: Particular object retrieval with integral max-pooling of CNN activations. In: ICLR (2016) Tolias, G., Sicre, R., Jégou, H.: Particular object retrieval with integral max-pooling of CNN activations. In: ICLR (2016)
15.
Zurück zum Zitat Radenović, F., Tolias, G., Chum, O.: Fine-tuning CNN image retrieval with no human annotation. arXiv preprint arXiv:1711.02512 (2017) Radenović, F., Tolias, G., Chum, O.: Fine-tuning CNN image retrieval with no human annotation. arXiv preprint arXiv:​1711.​02512 (2017)
16.
Zurück zum Zitat Muja, M., Lowe, D.G.: Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans. PAMI 36, 2227–2240 (2014)CrossRef Muja, M., Lowe, D.G.: Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans. PAMI 36, 2227–2240 (2014)CrossRef
17.
Zurück zum Zitat Nistér, D., Stewénius, H.: Scalable recognition with a vocabulary tree. In: CVPR, pp. 2161–2168, June 2006 Nistér, D., Stewénius, H.: Scalable recognition with a vocabulary tree. In: CVPR, pp. 2161–2168, June 2006
18.
Zurück zum Zitat Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp. 604–613 (1998) Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp. 604–613 (1998)
19.
Zurück zum Zitat Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimension via hashing. In: VLDB, pp. 518–529 (1999) Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimension via hashing. In: VLDB, pp. 518–529 (1999)
20.
Zurück zum Zitat Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Symposium on Computational Geometry (2004) Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Symposium on Computational Geometry (2004)
21.
Zurück zum Zitat Lv, Q., Charikar, M., Li, K.: Image similarity search with compact data structures. In: CIKM, pp. 208–217, November 2004 Lv, Q., Charikar, M., Li, K.: Image similarity search with compact data structures. In: CIKM, pp. 208–217, November 2004
22.
Zurück zum Zitat Norouzi, M., Punjani, A., Fleet, D.J.: Fast search in hamming space with multi-index hashing. In: CVPR (2012) Norouzi, M., Punjani, A., Fleet, D.J.: Fast search in hamming space with multi-index hashing. In: CVPR (2012)
23.
Zurück zum Zitat Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: NIPS, December 2009 Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: NIPS, December 2009
24.
Zurück zum Zitat Raginsky, M., Lazebnik, S.: Locality-sensitive binary codes from shift-invariant kernels. In: NIPS (2010) Raginsky, M., Lazebnik, S.: Locality-sensitive binary codes from shift-invariant kernels. In: NIPS (2010)
25.
Zurück zum Zitat Jégou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. PAMI 33(1), 117–128 (2011)CrossRef Jégou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. PAMI 33(1), 117–128 (2011)CrossRef
26.
Zurück zum Zitat Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization for approximate nearest neighbor search. In: CVPR, June 2013 Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization for approximate nearest neighbor search. In: CVPR, June 2013
27.
Zurück zum Zitat Kalantidis, Y., Avrithis, Y.: Locally optimized product quantization for approximate nearest neighbor search. In: CVPR, (2014) Kalantidis, Y., Avrithis, Y.: Locally optimized product quantization for approximate nearest neighbor search. In: CVPR, (2014)
28.
Zurück zum Zitat Jain, H., Zepeda, J., Pérez, P., Gribonval, R.: Subic: a supervised, structured binary code for image search. In: ICCV (2017) Jain, H., Zepeda, J., Pérez, P., Gribonval, R.: Subic: a supervised, structured binary code for image search. In: ICCV (2017)
29.
Zurück zum Zitat Jain, H., Zepeda, J., Pérez, P., Gribonval, R.: Learning a complete image indexing pipeline (2018) Jain, H., Zepeda, J., Pérez, P., Gribonval, R.: Learning a complete image indexing pipeline (2018)
30.
Zurück zum Zitat Dorfman, R.: The detection of defective members of large populations. The Ann. Math. Stat. 14(4), 436–440 (1943)CrossRef Dorfman, R.: The detection of defective members of large populations. The Ann. Math. Stat. 14(4), 436–440 (1943)CrossRef
31.
Zurück zum Zitat Iscen, A., Furon, T., Gripon, V., Rabbat, M., Jégou, H.: Memory vectors for similarity search in high-dimensional spaces. IEEE Trans. Big Data 4(1), 65–77 (2018)CrossRef Iscen, A., Furon, T., Gripon, V., Rabbat, M., Jégou, H.: Memory vectors for similarity search in high-dimensional spaces. IEEE Trans. Big Data 4(1), 65–77 (2018)CrossRef
32.
Zurück zum Zitat Shi, M., Furon, T., Jégou, H.: A group testing framework for similarity search in high-dimensional spaces. In: ACM Multimedia, November 2014 Shi, M., Furon, T., Jégou, H.: A group testing framework for similarity search in high-dimensional spaces. In: ACM Multimedia, November 2014
33.
Zurück zum Zitat Iscen, A., Amsaleg, L., Furon, T.: Scaling group testing similarity search. In: ACM ICMR (2016) Iscen, A., Amsaleg, L., Furon, T.: Scaling group testing similarity search. In: ACM ICMR (2016)
34.
Zurück zum Zitat Iscen, A., Rabbat, M., Furon, T.: Efficient large-scale similarity search using matrix factorization. In: CVPR (2016) Iscen, A., Rabbat, M., Furon, T.: Efficient large-scale similarity search using matrix factorization. In: CVPR (2016)
35.
Zurück zum Zitat Rao, C.R., Mitra, S.K.: Generalized inverse of a matrix and its applications. In: Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability: Theory of Statistics, vol. 1 (1972) Rao, C.R., Mitra, S.K.: Generalized inverse of a matrix and its applications. In: Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability: Theory of Statistics, vol. 1 (1972)
36.
Zurück zum Zitat Aldridge, M., Baldassini, L., Johnson, O.: Group testing algorithms: bounds and simulations. IEEE Trans. Inform Theory 60, 3671–3687 (2014)MathSciNetCrossRef Aldridge, M., Baldassini, L., Johnson, O.: Group testing algorithms: bounds and simulations. IEEE Trans. Inform Theory 60, 3671–3687 (2014)MathSciNetCrossRef
37.
Zurück zum Zitat Bickson, D., Baron, D., Ihler, A., Avissar, H., Dolev, D.: Fault identification via nonparametric belief propagation. IEEE Trans. Signal Process. 59(6), 2602–2613 (2011)MathSciNetCrossRef Bickson, D., Baron, D., Ihler, A., Avissar, H., Dolev, D.: Fault identification via nonparametric belief propagation. IEEE Trans. Signal Process. 59(6), 2602–2613 (2011)MathSciNetCrossRef
38.
Zurück zum Zitat Cheraghchi, M., Hormati, A., Karbasi, A., Vetterli, M.: Compressed sensing with probabilistic measurements: a group testing solution. In: 47th Annual Allerton Conference on Communication, Control, and Computing (2009) Cheraghchi, M., Hormati, A., Karbasi, A., Vetterli, M.: Compressed sensing with probabilistic measurements: a group testing solution. In: 47th Annual Allerton Conference on Communication, Control, and Computing (2009)
39.
Zurück zum Zitat Gilbert, A., Indyk, P.: Sparse recovery using sparse matrices. Proc. IEEE 98(6), 937–947 (2010)CrossRef Gilbert, A., Indyk, P.: Sparse recovery using sparse matrices. Proc. IEEE 98(6), 937–947 (2010)CrossRef
40.
Zurück zum Zitat Sejdinovic, D., Johnson, O.: Note on noisy group testing: asymptotic bounds and belief propagation reconstruction. In: 48th Annual Allerton Conference on Communication, Control, and Computing (2010) Sejdinovic, D., Johnson, O.: Note on noisy group testing: asymptotic bounds and belief propagation reconstruction. In: 48th Annual Allerton Conference on Communication, Control, and Computing (2010)
41.
Zurück zum Zitat Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: ASILOMAR, pp. 40–44 (1993) Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: ASILOMAR, pp. 40–44 (1993)
42.
Zurück zum Zitat Davis, G.M., Mallat, S.G., Zhang, Z.: Adaptive time-frequency decompositions with matching pursuit. In: SPIE’s International Symposium on Optical Engineering and Photonics in Aerospace Sensing, pp. 402–413 (1994) Davis, G.M., Mallat, S.G., Zhang, Z.: Adaptive time-frequency decompositions with matching pursuit. In: SPIE’s International Symposium on Optical Engineering and Photonics in Aerospace Sensing, pp. 402–413 (1994)
43.
Zurück zum Zitat Radenović, F., Iscen, A., Tolias, G., Avrithis, Y., Chum, O.: Revisiting oxford and paris: large-scale image retrieval benchmarking. In: CVPR (2018) Radenović, F., Iscen, A., Tolias, G., Avrithis, Y., Chum, O.: Revisiting oxford and paris: large-scale image retrieval benchmarking. In: CVPR (2018)
44.
Zurück zum Zitat Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51(4), 606–635 (2004)MathSciNetCrossRef Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51(4), 606–635 (2004)MathSciNetCrossRef
45.
Zurück zum Zitat Feldman, D., Feigin, M., Sochen, N.: Learning big (image) data via coresets for dictionaries. J. Math. Imaging Vis. 46(3), 276–291 (2013)MathSciNetCrossRef Feldman, D., Feigin, M., Sochen, N.: Learning big (image) data via coresets for dictionaries. J. Math. Imaging Vis. 46(3), 276–291 (2013)MathSciNetCrossRef
46.
47.
Zurück zum Zitat Malkov, Y.A., Yashunin, D.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. arXiv preprint arXiv:1603.09320 (2016) Malkov, Y.A., Yashunin, D.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. arXiv preprint arXiv:​1603.​09320 (2016)
Metadaten
Titel
Local Orthogonal-Group Testing
verfasst von
Ahmet Iscen
Ondřej Chum
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-030-01216-8_28