Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction
From MaRDI portal
Publication:4732315
DOI10.1109/34.23109zbMath0682.90087OpenAlexW2063494315MaRDI QIDQ4732315
Publication date: 1989
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/34.23109
simulated annealingnonconvex optimizationdeterministic algorithmsstochastic algorithmsvisual reconstructionweak stringgraduated nonconvexityPiecewise continuous reconstructionreal-valued data
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Pattern recognition, speech recognition (68T10)
Related Items
A class of singular diffusion equations based on the convex-nonconvex variation model for noise removal, Nonconcave penalized likelihood with a diverging number of parameters., An algorithmic framework for Mumford–Shah regularization of inverse problems in imaging, Optimization Methods for Synthetic Aperture Radar Imaging, Recursive reconstruction of piecewise constant signals by minimization of an energy function, Convex approximation technique for interacting line elements deblurring: a new approach, Half-quadratic image restoration with a non-parallelism constraint, Comparison of deterministic and stochastic approaches to global optimization, Robust and direct estimation of 3-D motion and scene depth from stereo image sequences, A generalized regularization method for nonlinear ill-posed problems enhanced for nonlinear regularization terms, Stochastic networks for constraint satisfaction and optimization., Smoothing for signals with discontinuities using higher order Mumford-Shah models, Multi-channel Potts-based reconstruction for multi-spectral computed tomography
