An efficient algorithm for image segmentation, Markov random fields and related problems
From MaRDI portal
Publication:5441355
DOI10.1145/502090.502093zbMath1127.68474OpenAlexW2013347084MaRDI QIDQ5441355
Publication date: 11 February 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/502090.502093
Random fields; image analysis (62M40) Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10)
Related Items (39)
On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations ⋮ On total variation minimization and surface evolution using parametric maximum flows ⋮ Image restoration with discrete constrained total variation. I: Fast and exact optimization ⋮ A unified approach for a 1D generalized total variation problem ⋮ Measured continuous greedy with differential privacy ⋮ Total Variation on a Tree ⋮ On Hamilton-Jacobi PDEs and image denoising models with certain nonadditive noise ⋮ Exact solution to median surface problem using 3D graph search and application to parameter space exploration ⋮ The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables ⋮ Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time ⋮ \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables ⋮ Applications and efficient algorithms for integer programming problems on monotone constraints ⋮ A graph-based decomposition method for convex quadratic optimization with indicators ⋮ A dynamic programming approach for generalized nearly isotonic optimization ⋮ Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix ⋮ On the convex hull of convex quadratic optimization problems with indicators ⋮ Unnamed Item ⋮ Invariant $\varphi$-Minimal Sets and Total Variation Denoising on Graphs ⋮ A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems ⋮ A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function ⋮ Geometric properties of solutions to the total variation denoising problem ⋮ Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing ⋮ Maximize a monotone function with a generic submodularity ratio ⋮ On Decomposition Models in Imaging Sciences and Multi-time Hamilton--Jacobi Partial Differential Equations ⋮ A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions ⋮ Deterministic approximation algorithm for submodular maximization subject to a matroid constraint ⋮ Approximating the total variation with finite differences or finite elements ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ Global optimization for first order Markov random fields with submodular priors ⋮ An introduction to continuous optimization for imaging ⋮ A capacity scaling algorithm for M-convex submodular flow ⋮ Total Variation in Imaging ⋮ A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions ⋮ On Bayesian posterior mean estimators in imaging sciences and Hamilton-Jacobi partial differential equations ⋮ Finite-dimensional approximation of convex regularization via hexagonal pixel grids ⋮ New algorithms for convex cost tension problem with application to computer vision ⋮ Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization ⋮ An adaptive algorithm for maximization of non-submodular function with a matroid constraint ⋮ Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
This page was built for publication: An efficient algorithm for image segmentation, Markov random fields and related problems
