Bibliographic References
- [1]
- R. Achanta, A. Shaji, K. Smith, A. Lucchi, P. Fua, and S. Susstrunk. SLIC superpixels. Technical report, EPFL, 2010.
- [2]
- D. Arthur and S. Vassilvitskii. k-means++: The advantages of careful seeding. In Proc. ACM-SIAM Symp. on Discrete Algorithms, 2007.
- [3]
- J. S. Beis and D. G. Lowe. Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. In Proc. CVPR, 1997.
- [4]
- C. Elkan. Using the triangle inequality to accelerate $k$-means. In Proc. ICML, 2003.
- [5]
- S. Lloyd. Least square quantization in PCM. IEEE Trans. on Information Theory, 28(2), 1982.
- [6]
- D. G. Lowe. Object recognition from local scale-invariant features. In Proc. ICCV, 1999.
- [7]
- J. Matas, O. Chum, M. Urban, and T. Pajdla. Robust wide baseline stereo from maximally stable extremal regions. In Proc. BMVC, 2002.
- [8]
- M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithmic configuration. In Proc. VISAPP, 2009.
- [9]
- S. Shalev-Shwartz, Y. Singer, and N. Srebro. Pegasos: Primal estimated sub-GrAdient SOlver for SVM. In Proc. ICML, 2007.
- [10]
- C. Silpa-Anan and R. Hartley. Optimised KD-trees for fast image descriptor matching. In Proc. CVPR, 2008.
- [11]
- N. Slonim and N. Tishby. Agglomerative information bottleneck. In Proc. NIPS, 1999.
- [12]
- A. Vedaldi and S. Soatto. Quick shift and kernel methods for mode seeking. In Proc. ECCV, 2008.
- [13]
- A. Vedaldi and A. Zisserman. Efficient additive kernels via explicit feature maps. In Proc. CVPR, 2010.
- [14]
- A. Vedaldi and A. Zisserman. Efficient additive kernels via explicit feature maps. In PAMI, 2011.