Enforcing integrability by error correction using ℓ1-minimization

Surface reconstruction from gradient fields is an important final step in several applications involving gradient manipulations and estimation. Typically, the resulting gradient field is non-integrable due to linear/non-linear gradient manipulations, or due to presence of noise/outliers in gradient estimation. In this paper, we analyze integrability as error correction, inspired from recent work in compressed sensing, particulary ℓ<inf>0</inf> - ℓ<inf>1</inf> equivalence. We propose to obtain the surface by finding the gradient field which best fits the corrupted gradient field in ℓ<inf>1</inf> sense. We present an exhaustive analysis of the properties of ℓ<inf>1</inf> solution for gradient field integration using linear algebra and graph analogy. We consider three cases: (a) noise, but no outliers (b) no-noise but outliers and (c) presence of both noise and outliers in the given gradient field. We show that ℓ<inf>1</inf> solution performs as well as least squares in the absence of outliers. While previous ℓ<inf>0</inf> - ℓ<inf>1</inf> equivalence work has focused on the number of errors (outliers), we show that the location of errors is equally important for gradient field integration. We characterize the ℓ<inf>1</inf> solution both in terms of location and number of outliers, and outline scenarios where ℓ<inf>1</inf> solution is equivalent to ℓ<inf>0</inf> solution. We also show that when ℓ<inf>1</inf> solution is not able to remove outliers, the property of local error confinement holds: i.e., the errors do not propagate to the entire surface as in least squares. We compare with previous techniques and show that ℓ<inf>1</inf> solution performs well across all scenarios without the need for any tunable parameter adjustments.

[1]  E. Candès Presented by????? , 2022 .

[2]  Piotr Indyk,et al.  Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[3]  Stephen P. Boyd,et al.  An Interior-Point Method for Large-Scale $\ell_1$-Regularized Least Squares , 2007, IEEE Journal of Selected Topics in Signal Processing.

[4]  Rama Chellappa,et al.  What Is the Range of Surface Reconstructions from a Gradient Field? , 2006, ECCV.

[5]  E.J. Candes Compressive Sampling , 2022 .

[6]  Peter Kovesi,et al.  Shapelets correlated with surface normals produce surfaces , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[7]  Rama Chellappa,et al.  An algebraic approach to surface reconstruction from gradient fields , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[8]  Takeo Kanade,et al.  Robust L/sub 1/ norm factorization in the presence of outliers and missing data by alternative convex programming , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[9]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[10]  Shmuel Peleg,et al.  Seamless Image Stitching in the Gradient Domain , 2004, ECCV.

[11]  Berthold K. P. Horn Height and gradient from shading , 1989, International Journal of Computer Vision.

[12]  B. Ripley,et al.  Robust Statistics , 2018, Wiley Series in Probability and Statistics.

[13]  Patrick Pérez,et al.  Poisson image editing , 2003, ACM Trans. Graph..

[14]  Dani Lischinski,et al.  Gradient Domain High Dynamic Range Compression , 2023 .

[15]  Brendan J. Frey,et al.  Enforcing integrability for surface reconstruction algorithms using belief propagation in graphical models , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[16]  David J. Kriegman,et al.  From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[18]  H. Vincent Poor,et al.  An Introduction to Signal Detection and Estimation , 1994, Springer Texts in Electrical Engineering.

[19]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[20]  Jitendra Malik,et al.  Scale-Space and Edge Detection Using Anisotropic Diffusion , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Rama Chellappa,et al.  Direct Analytical Methods for Solving Poisson Equations in Computer Vision Problems , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Rama Chellappa,et al.  A Method for Enforcing Integrability in Shape from Shading Algorithms , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[24]  Robert J. Woodham,et al.  Photometric method for determining surface orientation from multiple images , 1980 .