Nonlinear total variation based noise removal algorithms
Proceedings of the eleventh annual international conference of the Center for Nonlinear Studies on Experimental mathematics : computational issues in nonlinear science: computational issues in nonlinear science
A proximal-based decomposition method for convex minimization problems
Mathematical Programming: Series A and B
Non-parametric local transforms for computing visual correspondence
ECCV '94 Proceedings of the third European conference on Computer Vision (Vol. II)
A compact algorithm for rectification of stereo pairs
Machine Vision and Applications
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optical-Flow Estimation while Preserving Its Discontinuities: A Variational Approach
ACCV '95 Invited Session Papers from the Second Asian Conference on Computer Vision: Recent Developments in Computer Vision
Dynamic histogram warping of image pairs for constant image brightness
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2
The evaluation of normalized cross correlations for defect detection
Pattern Recognition Letters
Image Decomposition into a Bounded Variation Component and an Oscillating Component
Journal of Mathematical Imaging and Vision
BRDF Invariant Stereo Using Light Transport Constancy
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Adaptive Support-Weight Approach for Correspondence Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Disparity Map Estimation Using A Total Variation Bound
CRV '06 Proceedings of the The 3rd Canadian Conference on Computer and Robot Vision
Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
A Convex Formulation of Continuous Multi-label Problems
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
Probing the Pareto Frontier for Basis Pursuit Solutions
SIAM Journal on Scientific Computing
A convex optimization approach for depth estimation under illumination variation
IEEE Transactions on Image Processing
Robust recovery of signals from a structured union of subspaces
IEEE Transactions on Information Theory
Deblurring Poissonian images by split Bregman techniques
Journal of Visual Communication and Image Representation
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
Journal of Mathematical Imaging and Vision
SIAM Journal on Imaging Sciences
Global stereo matching leveraged by sparse ground control points
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
IEEE Transactions on Image Processing
Image restoration subject to a total variation constraint
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
Relaxing Tight Frame Condition in Parallel Proximal Methods for Signal Restoration
IEEE Transactions on Signal Processing
Parallel Proximal Algorithm for Image Restoration Using Hybrid Regularization
IEEE Transactions on Image Processing
Hessian-Based Norm Regularization for Image Restoration With Biomedical Applications
IEEE Transactions on Image Processing
A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
SIAM Journal on Optimization
ICCV '11 Proceedings of the 2011 International Conference on Computer Vision
Hi-index | 0.00 |
Proximal splitting algorithms play a central role in finding the numerical solution of convex optimization problems. This paper addresses the problem of stereo matching of multi-component images by jointly estimating the disparity and the illumination variation. The global formulation being non-convex, the problem is addressed by solving a sequence of convex relaxations. Each convex relaxation is non trivial and involves many constraints aiming at imposing some regularity on the solution. Experiments demonstrate that the method is efficient and provides better results compared with other approaches.