1 August 1990 From template matching to optimal approximation by piecewise smooth curves
Author Affiliations +
Abstract
Smoothing spline preserving discontinuities, are defined by standard energy minimization problems except that discontinuities are allowed at some fixed breakpoints. A natural approach to locate discontinuities is to further minimize the spline energy also with respect to the breakpoints. Such approaches have been much studied in computer vision (Blake and Zisserman, 1987). We show that, in the case ofn equally spaced data points and large n, such a highly nonconvex minimization problem has strong connections with the usual template matching techniques, and that it can be exactly solved by 0(n) direct algorithms (even for not equally spaced abscissae) provided all the breakpoints are distant enough compared to the smoothing scale. Otherwise a few (Gaus-Seidel type) iterations, based on the previous algorithms, are sufficient in many cases.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Didier Girard, "From template matching to optimal approximation by piecewise smooth curves", Proc. SPIE 1251, Curves and Surfaces in Computer Vision and Graphics, (1 August 1990); doi: 10.1117/12.19744; http://dx.doi.org/10.1117/12.19744
PROCEEDINGS
9 PAGES


SHARE
KEYWORDS
Smoothing

Computer vision technology

Machine vision

Surface plasmons

Computer graphics

Visualization

Radon

Back to Top