Review of Methods Inspired by Algebraic-Multigrid for Data and Image Analysis Applications

  title={Review of Methods Inspired by Algebraic-Multigrid for Data and Image Analysis Applications},
  author={Meirav Galun and Ronen Basri and Irad Yavneh},
  journal={Numerical Mathematics-theory Methods and Applications},
Algebraic Multigrid (AMG) methods were developed originally for numerically solving Partial Differential Equations (PDE), not necessarily on structured grids. In the last two decades solvers inspired by the AMG approach, were developed for non PDE problems, including data and image analysis problems, such as clustering, segmentation, quantization and others. These solvers share a common principle in that there is a crosstalk between fine and coarse representations of the problems, with flow of… 

Figures and Tables from this paper

A Multilevel Method for Self-Concordant Minimization
A Self-concordant Iterative-minimization Galerkin-based Multilevel Algorithm (SIGMA) is proposed and its super-linear convergence rate is established using the well-established theory of self-conCordant functions.
Hierarchical approximations for data reduction and learning at multiple scales
The sparse representation generated is shown to efficiently reconstruct data and minimize error in prediction and to generalize well to unseen samples, extending its prospective application to statistical learning problems.
Hierarchical regularization networks for sparsification based learning on noisy datasets
The paper presents a detailed analysis of approximation properties in the reconstruction Reproducing Kernel Hilbert Spaces with emphasis on optimality and consistency of predictions and behavior of error functionals associated with the produced sparse representations.
Landscape Image Layout Optimization Extraction Simulation of 3D Pastoral Complex under Big Data Analysis
By introducing big data into the landscape layout optimization simulation, a layout optimizationsimulation method based on big data is constructed and used in the layout optimized simulation of the landscape image layout of the three-dimensional pastoral complex to guide the participatory layout optimization Simulation.
Adaptive Recognition Method for VR Image of Wushu Decomposition Based on Feature Extraction
At present, with the vigorous development of sports and the internationalization process of Wushu competition, the competition rules are constantly improving, and the Wushu routine competition is


Algebraic multigrid (AMG): experiences and comparisons
Efficient Multilevel Eigensolvers with Applications to Data Analysis Tasks
The first solver, a version of classical algebraic multigrid (AMG) is applied to eigenproblems arising in clustering, image segmentation, and dimensionality reduction, demonstrating an order of magnitude speedup compared to the popular Lanczos algorithm.
Algebraic multigrid methods for solving generalized eigenvalue problems
Three algebraic multigrid (AMG) methods for solving generalized eigenvalue problems are presented, namely the locally optimal block preconditioned conjugate gradient, an enhancement of the previous one, and the problem of isospectral drums is addressed.
Multi-level adaptive solutions to boundary-value problems math comptr
The boundary-value problem is discretized on several grids (or finite-element spaces) of widely different mesh sizes, enabling us to conveniently adapt the discretization to the evolving solution in a nearly optimal way, obtaining "°°-order" approximations and low n, even when singularities are present.
An Introduction to Algebraic Multigrid
The author begins with a basic introduction to AMG methods, and then describes some more recent advances and theoretical developments.
A multigrid approach to discretized optimization problems
This work discusses optimization techniques suitable for nonlinear programs of this type, with an emphasis on algorithms that guarantee global convergence.
Fast multiscale image segmentation
  • E. Sharon, A. Brandt, R. Basri
  • Computer Science
    Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662)
  • 2000
A fast, multiscale algorithm for image segmentation that uses modern numeric techniques to find an approximate solution to normalized cut measures in time that is linear in the size of the image with only a few dozen operations per pixel.
Multigrid Techniques: 1984 Guide with Applications to Fluid Dynamics, Revised Edition
This chapter discusses the development of fast solvers for transonic potential equations using the Cauchy-Riemann equations, as well as applications to Fluid Dynamics.
A multigrid approach to the scalar quantization problem
A multigrid framework for the one-dimensional (scalar) fixed-rate quantization problem is presented. The framework is based on the Lloyd-Max iterative process, which is a central building block in
Truncated Newton-Based Multigrid Algorithm for Centroidal Voronoi Diagram Calculation
A new multigrid algorithm for constructing CVTs that is based on the MG/Opt algorithm that was originally designed to solve large nonlinear optimization problems is introduced.