References

[1] I. Daubechies et al., Ten lectures on wavelets. SIAM, 1992, vol. 61.

[2] D. G. Lowe, “Distinctive image features from scale-invariant keypoints,” International Journal of Computer Vision, vol. 60, no. 2, pp. 91–110, 2004.

[3] K. E. A. Van de Sande, T. Gevers, and C. G. M. Snoek, “Evaluating color descriptors for object and scene recognition,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 9, pp. 1582–1596, 2010.

[4] H. Bay, A. Ess, T. Tuytelaars, and L. Van Gool, “Speeded-up robust features (surf),” Computer vision and image understanding, vol. 110, no. 3, pp. 346–359, 2008.

[5] N. Dalal and B. Triggs, “Histograms of oriented gradients for human detection,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 1, June 2005, pp. 886–893.

[6] T. Ojala, M. Pietik¨ainen, and D. Harwood, “A comparative study of texture measures with classification based on featured distributions,” Pattern recognition, vol. 29, no. 1, pp. 51–59, 1996.

[7] B. A. Olshausen and D. J. Field, “Emergence of simple-cell receptive field properties by learning a sparse code for natural images,” Nature, vol. 381, no. 12, pp. 607–609, 1996.

[8] H. Lee, A. Battle, R. Raina, and A. Y. Ng, “Efficient sparse coding algorithms,” in Advances in Neural Information Processing Systems 19, 2007, pp. 801–808.

[9] P. Vincent, H. Larochelle, Y. Bengio, and P.-A. Manzagol, “Extracting and composing robust features with denoising autoencoders,” in Proceedings of the 25th International Conference on Machine learning. ACM, 2008, pp. 1096–1103.

[10] Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE, vol. 86, no. 11, pp. 2278–2324, 1998.

[11] G. Hinton and R. Salakhutdinov, “Reducing the dimensionality of data with neural networks,” Science, vol. 313, no. 5786, pp. 504–507, 2006.

[12] R. Salakhutdinov and G. E. Hinton, “Deep boltzmann machines,” in Proceedings of the International Conference on Artificial Intelligence and Statistics, vol. 5, no. 2. MIT Press Cambridge, MA, 2009, pp. 448–455.

[13] L. J. P. van der Maaten, E. O. Postma, and H. J. van den Herik, “Dimensionality Reduction: A Comparative Review,” Tilburg University, Tech. Rep., 2009.

[14] K. Pearson, “On lines and planes of closest fit to systems of points in space,” Philosophical Magazine, vol. 2, pp. 559–572, 1901.

[15] S. Mika, B. Sch¨olkopf, A. Smola, K.-R. M¨uller, M. Scholz, and G. R¨atsch, “Kernel pca and de-noising in feature spaces,” in Advances in Neural Information Processing Systems 11. MIT Press, 1999, pp. 536–542.

[16] M. Turk and A. Pentland, “Eigenfaces for recognition,” Journal of Cognitive Neuroscience, vol. 3, no. 1, pp. 71–86, 1991.

[17] P. N. Belhumeur, J. a. P. Hespanha, and D. J. Kriegman, “Eigenfaces vs. fisherfaces: Recognition using class specific linear projection,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 19, no. 7, pp. 711–720, Jul. 1997.

[18] Q. Le, M. Ranzato, R. Monga, M. Devin, K. Chen, G. Corrado, J. Dean, and A. Ng., “Building high-level features using large scale unsupervised learning,” in International Conference on Machine Learning, June 2012.

[19] J. Sivic and A. Zisserman, “Video google: A text retrieval approach to object matching in videos,” in Ninth IEEE International Conference on Computer Vision, 2003. IEEE, 2003, pp. 1470–1477.

[20] G. Csurka, C. Dance, L. Fan, J. Willamowski, and C. Bray, “Visual categorization with bags of keypoints,” in Workshop on statistical learning in computer vision, ECCV, vol. 1, 2004, p. 22.

[21] L. Fei-Fei and P. Perona, “A bayesian hierarchical model for learning natural scene categories,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005, vol. 2. IEEE, 2005, pp. 524–531.

[22] F. Perronnin and C. Dance, “Fisher kernels on visual vocabularies for image categorization,” in IEEE Conference on Computer Vision and Pattern Recognition, 2007. IEEE, 2007, pp. 1–8.

[23] F. Perronnin, J. S´anchez, and T. Mensink, “Improving the fisher kernel for large-scale image classification,” Computer Vision–ECCV 2010, pp. 143–156, 2010.

[24] S. Lazebnik, C. Schmid, and J. Ponce, “Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2006, vol. 2. IEEE, 2006, pp. 2169–2178.

[25] K. Grauman and T. Darrell, “The pyramid match kernel: Discriminative classification with sets of image features,” in Tenth IEEE International Conference on Computer Vision, 2005, vol. 2. IEEE, 2005, pp. 1458–1465.

[26] I. Borg and P. J. F. Groenen, Modern Multidimensional Scaling: Theory and Applications (Springer Series in Statistics), 2nd ed. Springer, 2005.

[27] E. L. Schwartz, A. Shaw, and E. Wolfson, “A numerical solution to the generalized mapmaker’s problem: flattening nonconvex polyhedral surfaces,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 9, pp. 1005–1008, 1989.

[28] A. Elad and R. Kimmel, “On bending invariant signatures for surfaces,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 10, pp. 1285–1295, 2003.

[29] J. Kruskal, “Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis,” Psychometrika, vol. 29, pp. 1–27, 1964.

[30] J. de Leeuw, “Applications of convex analysis to multidimensional scaling,” in Recent Developments in Statistics, J. Barra, F. Brodeau, G. Romier, and B. V. Cutsem, Eds. Amsterdam: North Holland Publishing Company, 1977, pp. 133–146.

[31] C. K. Williams, “On a connection between kernel pca and metric multidimensional scaling,” Machine Learning, vol. 46, no. 1, pp. 11–19, 2002.

[32] J. Besag, “On the Statistical Analysis of Dirty Pictures,” Journal of the Royal Statistical Society. Series B (Methodological), vol. 48, no. 3, pp. 259–302, 1986.

[33] K. Levenberg, “A method for the solution of certain non-linear problems in least squares,” Quarterly of Applied Mathematics, vol. 2, pp. 164–168, 1944.

[34] D. Marquardt, “An algorithm for least-squares estimation of nonlinear parameters,” Journal of the Society for Industrial and Applied Mathematics, vol. 11, no. 2, pp. 431–441, 1963.

[35] R. Datta, D. Joshi, J. Li, and J. Z. Wang, “Image retrieval: Ideas, influences, and trends of the new age,” ACM Computing Surveys (CSUR), vol. 40, no. 2, p. 5, 2008.

[36] A. W. M. Smeulders, M. Worring, S. Santini, A. Gupta, and R. Jain, “Content-based image retrieval at the end of the early years,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 12, pp. 1349–1380, 2000.

[37] Y. Rubner, C. Tomasi, and L. J. Guibas, “The earth mover’s distance as a metric for image retrieval,” International Journal of Computer Vision, vol. 40, no. 2, pp. 99–121, 2000.

[38] L. Wang, Y. Zhang, and J. Feng, “On the euclidean distance of images,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 8, pp. 1334–1339, Aug. 2005.

[39] S. T. Roweis and L. K. Saul, “Nonlinear dimensionality reduction by locally linear embedding,” Science, vol. 290, no. 5500, pp. 2323–2326, 2000.

[40] M. M. Bronstein, A. M. Bronstein, R. Kimmel, and I. Yavneh, “Multigrid multidimensional scaling,” Numerical linear algebra with applications, vol. 13, no. 2-3, pp. 149–171, 2006.

[41] G. Rosman, A. M. Bronstein, M. M. Bronstein, A. Sidi, and R. Kimmel, “Fast multidimensional scaling using vector extrapolation,” SIAM J. Sci. Comput, vol. 2, 2008.

[42] G. Rosman, A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Topologically constrained isometric embedding,” in Human Motion. Springer, 2008, pp. 243–262.

[43] A. M. Bronstein, M. Bronstein, M. M. Bronstein, and R. Kimmel, Numerical geometry of non-rigid shapes. Springer, 2008.

[44] S. Agarwal, A. Awan, and D. Roth, “Learning to detect objects in images via a sparse, part-based representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 11, pp. 1475–1490, Nov. 2004.

[45] Q. Wang, “Kernel principal component analysis and its applications in face recognition and active shape models,” arXiv preprint arXiv:1207.3538, 2012.

[46] C. Cortes and V. Vapnik, “Support-vector networks,” Machine Learning, vol. 20, pp. 273–297, 1995.

[47] C.-C. Chang and C.-J. Lin, “LIBSVM: A library for support vector machines,” ACM Transactions on Intelligent Systems and Technology, vol. 2, pp. 27:1–27:27, 2011.

[48] J. Wang, J. Li, and G. Wiederhold, “Simplicity: semantics-sensitive integrated matching for picture libraries,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 9, pp. 947–963, Sep. 2001.

[49] L. Fei-Fei, R. Fergus, and P. Perona, “Learning generative visual models from few training examples: an incremental bayesian approach tested on 101 object categories,” in Computer Vision and Pattern Recognition Workshop, 2004. IEEE, 2004, pp. 178–178.

[50] D. Tao, X. Tang, X. Li, and X. Wu, “Asymmetric bagging and random subspace for support vector machines-based relevance feedback in image retrieval,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 7, pp. 1088–1099, July 2006.