publication . Preprint . 2017

PQk-means: Billion-scale Clustering for Product-quantized Codes

Matsui, Yusuke; Ogaki, Keisuke; Yamasaki, Toshihiko; Aizawa, Kiyoharu;
Open Access English
  • Published: 12 Sep 2017
Abstract
Comment: To appear in ACMMM 2017
Subjects
free text keywords: Computer Science - Computer Vision and Pattern Recognition, Computer Science - Multimedia
Download from
43 references, page 1 of 3

[1] David Arthur and Sergei Vassilvitskii. 2007. k-means++: Œe Advantages of Careful Seeding. In Proc. ACM SODA.

[2] Yannis Avrithis, Yannis Kalantidis, Evangelos Anagnostopoulos, and Ioannis Z. Emiris. 2015. Web-scale Image Clustering Revisited. In Proc. IEEE ICCV. [OpenAIRE]

[3] Artem Babenko and Victor Lempitsky. 2014. Additive ‹antization for Extreme Vector Compression. In Proc. IEEE CVPR. [OpenAIRE]

[4] Artem Babenko and Victor Lempitsky. 2015. Tree ‹antization for Large-Scale Similarity Search and Classi€cation. In Proc. IEEE CVPR. [OpenAIRE]

[5] Artem Babenko and Victor Lempitsky. 2016. Ecient Indexing of Billion-Scale Datasets of Deep Descriptors. In Proc. IEEE CVPR.

[6] Olivier Bachem, Mario Lucic, Hamed Hassani, and Andreas Krause. 2016. Fast and Provably Good Seedings for k-Means. In Proc. NIPS.

[7] Olivier Bachem, Mario Lucic, S. Hamed Hassani, and Andreas Krause. 2016. Approximated K-Means++ in Sublinear Time. In Proc. AAAI.

[8] Andrei Broder, Lluis Garcia-Pueyo, Vanja Josifovski, Sergei Vassilvitskii, and Srihari Venkatesan. 2014. Scalable K-Means by Ranked Retrieval. In Proc. ACM WSDM. [OpenAIRE]

[9] Qi Dai, Jianguo Li, Jingdong Wang, and Yu-Gang Jiang. 2016. Binary Optimized Hashing. In Proc. MM. [OpenAIRE]

[10] MaŠhijs Douze, Herve´ Je´gou, and Florent Perronnin. 2016. Polysemous Codes. In Proc. ECCV. [OpenAIRE]

[11] Charles Elkan. 2003. Using the Triangle Inequality to Accelerate k-Means. In Proc. ICML.

[12] Tiezheng Ge, Kaiming He, Qifa Ke, and Jian Sun. 2014. Optimized Product ‹antization. IEEE TPAMI 36, 4 (2014), 744-755.

[13] Yunchao Gong, Svetlana Lazebnik, Albert Gordo, and Florent Perronnin. 2013. Iterative ‹antization: A Procrustean Approach to Learning Binary Codes for Large-scale Image Retrieval. IEEE TPAMI 35, 12 (2013), 2916-2929.

[14] Yunchao Gong, Marcin Pawlowski, Fei Yang, Louis Brandy, Lubomir Bourdev, and Rob Fergus. 2015. Web Scale Photo Hash Clustering on A Single Machine. In Proc. IEEE CVPR. [OpenAIRE]

[15] Robert M. Gray. 1984. Vector ‹antization. IEEE ASSP Magazine 1, 2 (1984), 4-29.

43 references, page 1 of 3
Abstract
Comment: To appear in ACMMM 2017
Subjects
free text keywords: Computer Science - Computer Vision and Pattern Recognition, Computer Science - Multimedia
Download from
43 references, page 1 of 3

[1] David Arthur and Sergei Vassilvitskii. 2007. k-means++: Œe Advantages of Careful Seeding. In Proc. ACM SODA.

[2] Yannis Avrithis, Yannis Kalantidis, Evangelos Anagnostopoulos, and Ioannis Z. Emiris. 2015. Web-scale Image Clustering Revisited. In Proc. IEEE ICCV. [OpenAIRE]

[3] Artem Babenko and Victor Lempitsky. 2014. Additive ‹antization for Extreme Vector Compression. In Proc. IEEE CVPR. [OpenAIRE]

[4] Artem Babenko and Victor Lempitsky. 2015. Tree ‹antization for Large-Scale Similarity Search and Classi€cation. In Proc. IEEE CVPR. [OpenAIRE]

[5] Artem Babenko and Victor Lempitsky. 2016. Ecient Indexing of Billion-Scale Datasets of Deep Descriptors. In Proc. IEEE CVPR.

[6] Olivier Bachem, Mario Lucic, Hamed Hassani, and Andreas Krause. 2016. Fast and Provably Good Seedings for k-Means. In Proc. NIPS.

[7] Olivier Bachem, Mario Lucic, S. Hamed Hassani, and Andreas Krause. 2016. Approximated K-Means++ in Sublinear Time. In Proc. AAAI.

[8] Andrei Broder, Lluis Garcia-Pueyo, Vanja Josifovski, Sergei Vassilvitskii, and Srihari Venkatesan. 2014. Scalable K-Means by Ranked Retrieval. In Proc. ACM WSDM. [OpenAIRE]

[9] Qi Dai, Jianguo Li, Jingdong Wang, and Yu-Gang Jiang. 2016. Binary Optimized Hashing. In Proc. MM. [OpenAIRE]

[10] MaŠhijs Douze, Herve´ Je´gou, and Florent Perronnin. 2016. Polysemous Codes. In Proc. ECCV. [OpenAIRE]

[11] Charles Elkan. 2003. Using the Triangle Inequality to Accelerate k-Means. In Proc. ICML.

[12] Tiezheng Ge, Kaiming He, Qifa Ke, and Jian Sun. 2014. Optimized Product ‹antization. IEEE TPAMI 36, 4 (2014), 744-755.

[13] Yunchao Gong, Svetlana Lazebnik, Albert Gordo, and Florent Perronnin. 2013. Iterative ‹antization: A Procrustean Approach to Learning Binary Codes for Large-scale Image Retrieval. IEEE TPAMI 35, 12 (2013), 2916-2929.

[14] Yunchao Gong, Marcin Pawlowski, Fei Yang, Louis Brandy, Lubomir Bourdev, and Rob Fergus. 2015. Web Scale Photo Hash Clustering on A Single Machine. In Proc. IEEE CVPR. [OpenAIRE]

[15] Robert M. Gray. 1984. Vector ‹antization. IEEE ASSP Magazine 1, 2 (1984), 4-29.

43 references, page 1 of 3
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue