
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Effrosyni Kokiopoulou, Pascal Frossard, "Minimum Distance between Pattern Transformation Manifolds: Algorithm and Applications," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 7, pp. 12251238, July, 2009.  
BibTex  x  
@article{ 10.1109/TPAMI.2008.156, author = {Effrosyni Kokiopoulou and Pascal Frossard}, title = {Minimum Distance between Pattern Transformation Manifolds: Algorithm and Applications}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {31}, number = {7}, issn = {01628828}, year = {2009}, pages = {12251238}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2008.156}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Minimum Distance between Pattern Transformation Manifolds: Algorithm and Applications IS  7 SN  01628828 SP1225 EP1238 EPD  12251238 A1  Effrosyni Kokiopoulou, A1  Pascal Frossard, PY  2009 KW  Transformation invariance KW  pattern manifolds KW  sparse approximations. VL  31 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] R.F.I Ventura, P. Vandergheynst, and P. Frossard, “Low Rate and Flexible Image Coding with Redundant Representations,” IEEE Trans. Image Processing, vol. 15, no. 3, pp. 726739, Mar. 2006.
[2] E. Kokiopoulou and P. Frossard, “Image Alignment with Rotation Manifolds Built on Sparse Geometric Expansions,” Proc. IEEE Int'l Workshop Multimedia Signal Processing, Oct. 2007.
[3] N. Vasconcelos and A. Lippman, “A Multiresolution Manifold Distance for Invariant Image Similarity,” IEEE Trans. Multimedia, vol. 7, no. 1, pp. 127142, Feb. 2005.
[4] P. Simard, Y.L. Cun, J. Denker, and B. Victorri, “Transformation Invariance in Pattern Recognition—Tangent Distance and Tangent Propagation,” Neural Networks: Tricks of the Trade, pp. 239274, 1998.
[5] D. Keysers, J. Dahmen, T. Theiner, and H. Ney, “Experiments with an Extended Tangent Distance,” Proc. 15th IEEE Int'l Conf. Pattern Recognition, vol. 2, pp. 3842, 2000.
[6] A. Fitzgibbon and A. Zisserman, “Joint Manifold Distance: A New Approach to Appearance Based Clustering,” Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, 2003.
[7] D. DeCoste and M. Burl, “DistortionInvariant Recognition via Jittered Queries,” Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, 2000.
[8] D. Decoste and B. Schölkopf, “Training Invariant Support Vector Machines,” Machine Learning, vol. 46, no. 1, pp. 161190, 2002.
[9] B. Haasdonk and D. Keysers, “Tangent Distance Kernels for Support Vector Machines,” Proc. 16th IEEE Int'l Conf. Pattern Recognition, vol. 2, pp. 864868, 2002.
[10] B. Schölkopf, C. Burges, and V. Vapnik, “Incorporating Invariances in Support Vector Learning Machines,” Artificial Neural Networks—ICANN, vol. 96, pp. 4752, 1996.
[11] B. Schölkopf, P. Simard, A. Smola, and V. Vapnik, “Prior Knowledge in Support Vector Kernels,” Proc. Advances in Neural Information Processing Systems, vol. 10, pp. 640646, 1998.
[12] T. Graepel and R. Herbrich, “Invariant Pattern Recognition by Semidefinite Programming Machines,” Proc. Advances in Neural Information Processing Systems, vol. 16, pp. 3340, 2004.
[13] P. Thévenaz, U.E. Ruttimann, and M. Unser, “A Pyramidal Approach to Subpixel Registration Based on Intensity,” IEEE Trans. Image Processing, vol. 7, no. 1, pp. 2741, Jan. 1998.
[14] A. Neri and G. Jacovitti, “Maximum Likelihood Localization of 2D Patterns in the GaussLaguerre Transform Domain: Theoretic Framework and Preliminary Results,” IEEE Trans. Image Processing, vol. 13, no. 1, pp. 7285, Jan. 2004.
[15] M. Carli, F. Coppola, G. Jacovitti, and A. Neri, “Translation, Orientation and Scale Estimation Based on LaguerreGauss Circular Harmonic Pyramids,” Proc. SPIE, Image Processing: Algorithms and Systems, vol. 4667, pp. 5565, 2002.
[16] B. Zitová and J. Flusser, “Image Registration Methods: A Survey,” Image and Vision Computing, vol. 21, no. 11, pp. 9771000, 2003.
[17] S. Mallat, A Wavelet Tour of Signal Processing, second ed. Academic Press, 1998.
[18] A.J. Smola and B. Schölkopf, “Sparse Greedy Matrix Approximation for Machine Learning,” Proc. Int'l Conf. Machine Learning, pp.911918, 2000.
[19] B. Schölkopf and A.J. Smola, Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, Dec. 2001.
[20] P. Jost, P. Vandergheynst, and P. Frossard, “TreeBased Pursuit: Algorithm and Properties,” IEEE Trans. Signal Processing, vol. 54, no. 12, pp. 46854697, 2006.
[21] J. Nocedal and S.J. Wright, Numerical Optimization, P. Glynn and S.M. Robinson, eds. Springer, 1999.
[22] R. Horst and N.V. Thoai, “DC Programming: Overview,” J.Optimization Theory and Applications, vol. 102, no. 1, pp. 143, Oct. 1999.
[23] R. Horst, P.M. Pardalos, and N.V. Thoai, Introduction to Global Optimization, second ed. Kluwer Academic Publishers, 2000.
[24] R. Horst and P.M. Pardalos, Handbook of Global Optimization, Kluwer Academic Publishers, 1995.
[25] S. Ellis and M. Nayakkankuppam, “Phylogenetic Analysis via DC Programming (Preprint),” Dept. of Math. and Statistics, Univ. of Maryland, Baltimore County, 2003.
[26] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2004.
[27] L.T.H. An and P.D. Tao, “The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems,” Annals of Operations Research, vol. 133, pp. 2346, 2005.
[28] F. Samaria and A. Harter, “Parameterisation of a Stochastic Model for Human Face Identification,” Proc. Second IEEE Workshop Applications of Computer Vision, Dec. 1994.