Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Optimised quantisation method for approximate nearest neighbour search

We propose optimised group quantisation (OGQ) for approximate nearest neighbour (ANN) search. Specifically, we construct a group of codebooks and select a group of codewords from the codebooks to approximate the original data such that small quantisation error is obtained. We also propose an effective learning algorithm for optimisation. The experiments show that OGQ can significantly outperform several state-of-the-art ANN methods.

References

    1. 1)
    2. 2)
      • 6. Babenko, A., Lempitsky, V.S.: ‘Additive quantization for extreme vector compression’. IEEE Conf. on CVPR, Columbus, OH, USA, June 2014, pp. 931938.
    3. 3)
    4. 4)
    5. 5)
      • 2. Guo, Y., Ding, G., Jin, X., Wang, J.: ‘Learning predictable and discriminative attributes for visual recognition’. AAAI Conference on Artificial Intelligence, Austin, TX, USA, January 2015, pp. 37833789.
    6. 6)
      • 3. Heo, J.P., Lee, Y., He, J., Chang, S.F., Yoon, S.E.: ‘Spherical hashing’. IEEE Conference on CVPR, Rhode Island, USA, June 2012, pp. 29572964.
    7. 7)
      • 1. Shakhnarovich, G., Darrell, T., Indyk, P.: ‘Nearest neighbor methods in learning and vision: theory and practice’ (MIT press, Cambridge, MA, USA, 2015).
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2016.2810
Loading

Related content

content/journals/10.1049/el.2016.2810
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address