Regularization of inverse visual problems involving discontinuities
IEEE Transactions on Pattern Analysis and Machine Intelligence
Modeling and Segmentation of Noisy and Textured Images Using Gibbs Random Fields
IEEE Transactions on Pattern Analysis and Machine Intelligence
Scene Segmentation from Visual Motion Using Global Optimization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Visual reconstruction
Surface Reconstruction Preserving Discontinuities
Surface Reconstruction Preserving Discontinuities
IEEE Transactions on Computers - Special issue on artificial neural networks
Viewpoint Invariant Recovery of Visual Surfaces from Sparse Data
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
The application of Markov random field models to wavelet-based image denoising
Imaging and vision systems
Evolutionary Approaches to Figure-Ground Separation
Applied Intelligence
Figure-Ground Discrimination: A Combinatorial Optimization Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Experimental Comparison of Stereo Algorithms
ICCV '99 Proceedings of the International Workshop on Vision Algorithms: Theory and Practice
A New Algorithm for Energy Minimization with Discontinuities
EMMCVPR '99 Proceedings of the Second International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Neural Computation
Neural Computation
An adaptive segmentation method using MRF model for suburban aerial images
International Journal of Computer Applications in Technology
An evolutionary approach to inverse gray level quantization
VISUAL'07 Proceedings of the 9th international conference on Advances in visual information systems
Fast nonconvex nonsmooth minimization methods for image restoration and reconstruction
IEEE Transactions on Image Processing
Optimization by Stochastic Continuation
SIAM Journal on Imaging Sciences
Discontinuity preserving phase unwrapping using graph cuts
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Convex Approximation Technique for Interacting Line Elements Deblurring: a New Approach
Journal of Mathematical Imaging and Vision
A unified approach to background adaptation and initialization in public scenes
Pattern Recognition
| Hi-index | 0.14 |
Piecewise continuous reconstruction of real-valued data can be formulated in terms of nonconvex optimization problems. Both stochastic and deterministic algorithms have been devised to solve them. The simplest such reconstruction process is the weak string. Exact solutions can be obtained for it and are used to determine the success or failure of the algorithms under precisely controlled conditions. It is concluded that the deterministic algorithm (graduated nonconvexity) outstrips stochastic (simulated annealing) algorithms both in computational efficiency and in problem-solving power.