One-dimensional regularization with discontinuities

1988 IEEE Transactions on Pattern Analysis and Machine Intelligence 71 citations

Abstract

Regularization is equivalent to fitting smoothing splines to the data so that efficient and reliable numerical algorithms exist for finding solutions. however, the results exhibit poor performance along edges and boundaries. To cope with such anomalies, a more general class of smoothing splines that preserve corners and discontinuities is studied. Cubic splines are investigated in detail, since they are easy to implement and produce smooth curves near all data points except those marked as discontinuities or creases. A discrete regularization method is introduced to locate corners and discontinuities in the data points before the continuous regularization is applied.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

Classification of discontinuitiesRegularization (linguistics)SmoothingData pointSmoothing splineMathematicsAlgorithmComputer scienceApplied mathematicsArtificial intelligenceMathematical analysisComputer vision

Affiliated Institutions

Related Publications

Publication Info

Year
1988
Type
article
Volume
10
Issue
6
Pages
822-829
Citations
71
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

71
OpenAlex

Cite This

D. Lee, T. Pavlidis (1988). One-dimensional regularization with discontinuities. IEEE Transactions on Pattern Analysis and Machine Intelligence , 10 (6) , 822-829. https://doi.org/10.1109/34.9105

Identifiers

DOI
10.1109/34.9105