One-dimensional regularization with discontinuities
Lee, D.
Pavlidis, T.
AT&T Bell Labs., Murray Hill, NJ;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Nov 1988
Volume: 10,
Issue: 6
On page(s): 822-829
ISSN: 0162-8828
References Cited: 28
CODEN: ITPIDJ
INSPEC Accession Number: 3322962
Digital Object Identifier: 10.1109/34.9105
Current Version Published: 2002-08-06
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
