Abstract

We address the problem of reconstructing a smooth curve from sparse and noisy information that is invariant to the choice of the coordinate system. Tikhonov regularization is used to form a well-posed mathematical problem statement, and conditions for an invariant reconstruction are given. The resulting functional minimization problem is shown to be nonconvex. Approximations to the invariant functional are often used to form a convex problem that can be solved efficiently. Two common approximations, those of cubic and weighted cubic splines, are detailed, and examples are given to show that the approximations are often invalid. To form a valid approximation to the invariant functional we propose a two-step algorithm. The first step forms a piecewise-linear curve, which is invariant to the coordinate system. This piecewise-linear curve is then used to construct a parameterization of the curve for which we can make a valid approximation to the invariant functional. Examples are given to demonstrate the effectiveness of the algorithm, and two example applications for which the invariant property is important are given.

© 1990 Optical Society of America

Nonuniform sampling, image recovery from sparse data and the discrete sampling theorem

Leonid P. Yaroslavsky, Gil Shabat, Benjamin G. Salomon, Ianir A. Ideses, and Barak Fishbain
J. Opt. Soc. Am. A 26(3) 566-575 (2009)

Image recovery from edge primitives

Rachel Alter-Gartenberg, Friedrich O. Huck, and Ramkumar Narayanswamy
J. Opt. Soc. Am. A 7(5) 898-911 (1990)

Optimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model

Yi Jun Xiao and Y. F. Li
J. Opt. Soc. Am. A 22(9) 1746-1762 (2005)

Inversion of spatiotemporally averaged data using a regularized spline collocation scheme

Wilhelmus M. Ruyten
J. Opt. Soc. Am. A 7(2) 216-224 (1990)

Method of evaluating image-recovery algorithms based on task performance

K. M. Hanson
J. Opt. Soc. Am. A 7(7) 1294-1304 (1990)