Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing

Several algorithms for problems including image segmentation, gradient inpainting and total variation are based on solving symmetric diagonally dominant (SDD) linear systems. These algorithms generally produce results of high quality. However, existing solvers are not always efficient, and in many cases they operate only on restricted topologies. The unavailability of reliably efficient solvers has arguably hindered the adoptability of approaches and algorithms based on SDD systems, especially in applications involving very large systems. A central claim of this paper is that SDD-based approaches can now be considered practical and reliable. To support our claim we present Combinatorial Multigrid (CMG), the first reliably efficient SDD solver that tackles problems in general and arbitrary weighted topologies. The solver borrows the structure and operators of multigrid algorithms, but embeds into them powerful and algebraically sound combinatorial preconditioners, based on novel tools from support graph theory. In order to present the derivation of CMG, we review and exemplify key notions of support graph theory that can also guide the future development of specialized solvers. We validate our claims on very large systems derived from imaging applications. Finally, we outline two new reductions of non-linear filtering problems to SDD systems and review the integration of SDD systems into selected algorithms.

[1]  Leo Grady,et al.  A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[2]  Berthold K. P. Horn,et al.  Determining lightness from an image , 1974, Comput. Graph. Image Process..

[3]  Yvan Notay,et al.  Analysis of Aggregation-Based Multigrid , 2008, SIAM J. Sci. Comput..

[4]  Jianbo Shi,et al.  Segmentation given partial grouping constraints , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  G. Miller,et al.  Combinatorial and algebraic tools for optimal multilevel algorithms , 2007 .

[6]  Berthold K. P. Horn,et al.  Determining Optical Flow , 1981, Other Conferences.

[7]  Gary L. Miller,et al.  Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning , 2008, SPAA '08.

[8]  Dani Lischinski,et al.  Spectral Matting , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Jitendra Malik,et al.  Scale-Space and Edge Detection Using Anisotropic Diffusion , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Guy Gilboa,et al.  Nonlocal Operators with Applications to Image Processing , 2008, Multiscale Model. Simul..

[11]  Jake K. Aggarwal,et al.  Experiments in Intensity Guided Range Sensing Recognition of Three-Dimensional Objects , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Daniel A. Spielman,et al.  Faster approximate lossy generalized flow via interior point algorithms , 2008, STOC.

[13]  Daniel Cremers,et al.  Efficient Nonlocal Means for Denoising of Textural Patterns , 2008, IEEE Transactions on Image Processing.

[14]  Gary L. Miller,et al.  Automatic Multiple Retinal Layer Segmentation in Spectral Domain OCT Scans via Spectral Rounding , 2008 .

[15]  Christopher V. Alvino,et al.  Reformulating and Optimizing the Mumford-Shah Functional on a Graph - A Faster, Lower Energy Solution , 2008, ECCV.

[16]  Michael F. Cohen,et al.  Fourier Analysis of the 2D Screened Poisson Equation for Gradient Domain Problems , 2008, ECCV.

[17]  William Bialek,et al.  Statistics of Natural Images: Scaling in the Woods , 1993, NIPS.

[18]  Gary L. Miller,et al.  Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[19]  Gary L. Miller,et al.  A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians , 2007, SODA '07.

[20]  Y. Notay An aggregation-based algebraic multigrid method , 2010 .

[21]  Marian Brezina,et al.  Convergence of algebraic multigrid based on smoothed aggregation , 1998, Numerische Mathematik.

[22]  Sivan Toledo,et al.  Support-Graph Preconditioners , 2005, SIAM J. Matrix Anal. Appl..

[23]  Ann B. Lee,et al.  Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[24]  Zoubin Ghahramani,et al.  Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions , 2003, ICML 2003.

[25]  J. W. Ruge,et al.  4. Algebraic Multigrid , 1987 .

[26]  Gary L. Miller,et al.  Approaching Optimality for Solving SDD Linear Systems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[27]  Shang-Hua Teng,et al.  Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs , 2010, STOC '11.

[28]  Leo Grady,et al.  A Lattice-Preserving Multigrid Method for Solving the Inhomogeneous Poisson Equations Used in Image Analysis , 2008, ECCV.

[29]  Leo Grady,et al.  Multilabel random walker image segmentation using prior models , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[30]  Guy E. Blelloch,et al.  Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid , 2010, 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis.

[31]  Michael Elad,et al.  Generalizing the Nonlocal-Means to Super-Resolution Reconstruction , 2009, IEEE Transactions on Image Processing.

[32]  Laurent D. Cohen,et al.  Non-local Regularization of Inverse Problems , 2008, ECCV.

[33]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[34]  Sung Yong Shin,et al.  On pixel-based texture synthesis by non-parametric sampling , 2006, Comput. Graph..

[35]  A. Brandt General highly accurate algebraic coarsening. , 2000 .

[36]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[37]  Richard Szeliski,et al.  Locally adapted hierarchical basis preconditioning , 2006, SIGGRAPH '06.

[38]  Jean-Michel Morel,et al.  Nonlocal Image and Movie Denoising , 2008, International Journal of Computer Vision.

[39]  Andrew P. Witkin,et al.  Scale-Space Filtering , 1983, IJCAI.

[40]  Leo Grady,et al.  Random Walks for Image Segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[41]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[42]  Tony F. Chan,et al.  Image processing and analysis - variational, PDE, wavelet, and stochastic methods , 2005 .

[43]  Jianbo Shi,et al.  Solving Markov Random Fields with Spectral Relaxation , 2007, AISTATS.

[44]  Bruce Hendrickson,et al.  Support Theory for Preconditioning , 2003, SIAM J. Matrix Anal. Appl..

[45]  Anders P. Eriksson,et al.  Normalized Cuts Revisited: A Reformulation for Segmentation with Linear Grouping Constraints , 2007, ICCV.

[46]  V. E. Henson,et al.  BoomerAMG: a parallel algebraic multigrid solver and preconditioner , 2002 .

[47]  Leo Grady,et al.  Fast approximate Random Walker segmentation using eigenvector precomputation , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[48]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[49]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[50]  Berthold K. P. Horn SHAPE FROM SHADING: A METHOD FOR OBTAINING THE SHAPE OF A SMOOTH OPAQUE OBJECT FROM ONE VIEW , 1970 .

[51]  Gary L. Miller,et al.  Solving SDD linear systems in time $\tilde{O}(m\log{n}\log(1/\epsilon))$ , 2011 .

[52]  Anil Joshi Topics in optimization and sparse linear systems , 1997 .

[53]  O. Axelsson Iterative solution methods , 1995 .

[54]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[55]  Gary L. Miller,et al.  Approaching optimality for solving SDD systems , 2010, ArXiv.

[56]  Nancy S. Pollard,et al.  Real-time gradient-domain painting , 2008, ACM Trans. Graph..

[57]  Ronen Basri,et al.  Segmentation and boundary detection using multiscale intensity measurements , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.