Energy Minimization Methods in Computer Vision and Pattern Recognition

Simplicity of linear representations makes them a popular tool in several imaging analysis, and indeed many other applications involving high-dimensional data. In image analysis, the two widely used linear representations are: (i) linear projections of images to lowdimensional Euclidean subspaces, and (ii) linear spectral filtering of images. In view of the orthogonality and other constraints imposed on these representations (the subspaces or the filters), they take values on nonlinear manifolds (Grassmann, Stiefel, or rotation group). We present a family of algorithms that exploit the geometry of the underlying manifolds to find optimal linear representations for specified tasks. We illustrate the effectiveness of algorithms by finding optimal subspaces and sparse filters both in the context of image-based object recognition.

[1]  Y. Shan,et al.  Sub-pixel location of edges with non-uniform blurring: a finite closed-form approach , 2000 .

[2]  Wang,et al.  Nonuniversal critical dynamics in Monte Carlo simulations. , 1987, Physical review letters.

[3]  Davi Geiger,et al.  Scaling images and image features via the renormalization group , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[4]  Robert L. Stevenson,et al.  A Bayesian approach to image expansion for improved definitio , 1994, IEEE Trans. Image Process..

[5]  Charles A. Bouman,et al.  A multiscale random field model for Bayesian image segmentation , 1994, IEEE Trans. Image Process..

[6]  J. Sethian.  Level set methods : evolving interfaces in geometry, fluid mechanics, computer vision, and materials science , 1996 .

[7]  K. Wilson,et al.  The Renormalization group and the epsilon expansion , 1973 .

[8]  Stephen M. Smith,et al.  SUSAN—A New Approach to Low Level Image Processing , 1997, International Journal of Computer Vision.

[9]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Wolfgang Hackbusch,et al.  Multi-grid methods and applications , 1985, Springer series in computational mathematics.

[11]  Kim L. Boyer,et al.  Perceptual organization in computer vision: a review and a proposal for a classificatory structure , 1993, IEEE Trans. Syst. Man Cybern..

[12]  Charles A. Bouman,et al.  Multiple Resolution Segmentation of Textured Images , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  O. Torsæter,et al.  Stochastic reconstruction of particulate media from two-dimensional images. , 2002, Journal of colloid and interface science.

[14]  P. Pérez,et al.  Multiscale minimization of global energy functions in some visual recovery problems , 1994 .

[15]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[16]  D. Stoyan,et al.  Fractals, random shapes and point fields : methods of geometrical statistics , 1996 .

[17]  J. Besag,et al.  Bayesian Computation and Stochastic Systems , 1995 .

[18]  B. Gidas.  Nonstationary Markov chains and convergence of the annealing algorithm , 1985 .

[19]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[20]  Joachim M. Buhmann,et al.  Multiscale Annealing for Grouping and Unsupervised Texture Segmentation , 1999, Comput. Vis. Image Underst..

[21]  Basilis Gidas,et al.  A Renormalization Group Approach to Image Processing Problems , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[23]  Rupert Paget,et al.  Texture synthesis via a noncausal nonparametric multiscale Markov random field , 1998, IEEE Trans. Image Process..

[24]  Josiane Zerubia,et al.  A Hierarchical Markov Random Field Model and Multitemperature Annealing for Parallel Image Classification , 1996, CVGIP Graph. Model. Image Process..

[25]  W. Clem Karl,et al.  Multiscale representations of Markov random fields , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.