TY - JOUR
T1 - Edge detection from truncated Fourier data using spectral mollifiers
AU - Cochran, Douglas
AU - Gelb, Anne
AU - Wang, Yang
N1 - Funding Information:
A. Gelb and D. Cochran were supported in part by NSF-DMS-FRG award 0652833. Y. Wang was supported in part by NSF-DMS awards 0813750 and 1043034.
PY - 2013/5
Y1 - 2013/5
N2 - Edge detection from a finite number of Fourier coefficients is challenging as it requires extracting local information from global data. The problem is exacerbated when the input data is noisy since accurate high frequency information is critical for detecting edges. The noise furthermore increases oscillations in the Fourier reconstruction of piecewise smooth functions, especially near the discontinuities. The edge detection method in Gelb and Tadmor (Appl Comput Harmon Anal 7:101-135, 1999, SIAM J Numer Anal 38(4):1389-1408, 2000) introduced the idea of "concentration kernels" as a way of converging to the singular support of a piecewise smooth function. The kernels used there, however, and subsequent modifications to reduce the impact of noise, were generally oscillatory, and as a result oscillations were always prevalent in the neighborhoods of the jump discontinuities. This paper revisits concentration kernels, but insists on uniform convergence to the "sharp peaks" of the function, that is, the edge detection method converges to zero away from the jumps without introducing new oscillations near them. We show that this is achievable via an admissible class of spectral mollifiers. Our method furthermore suppresses the oscillations caused by added noise.
AB - Edge detection from a finite number of Fourier coefficients is challenging as it requires extracting local information from global data. The problem is exacerbated when the input data is noisy since accurate high frequency information is critical for detecting edges. The noise furthermore increases oscillations in the Fourier reconstruction of piecewise smooth functions, especially near the discontinuities. The edge detection method in Gelb and Tadmor (Appl Comput Harmon Anal 7:101-135, 1999, SIAM J Numer Anal 38(4):1389-1408, 2000) introduced the idea of "concentration kernels" as a way of converging to the singular support of a piecewise smooth function. The kernels used there, however, and subsequent modifications to reduce the impact of noise, were generally oscillatory, and as a result oscillations were always prevalent in the neighborhoods of the jump discontinuities. This paper revisits concentration kernels, but insists on uniform convergence to the "sharp peaks" of the function, that is, the edge detection method converges to zero away from the jumps without introducing new oscillations near them. We show that this is achievable via an admissible class of spectral mollifiers. Our method furthermore suppresses the oscillations caused by added noise.
KW - Edge detection
KW - Gibbs phenomenon
KW - Poisson summation formula
KW - Spectral mollifier
KW - Truncated Fourier data
UR - http://www.scopus.com/inward/record.url?scp=84876424520&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84876424520&partnerID=8YFLogxK
U2 - 10.1007/s10444-011-9258-4
DO - 10.1007/s10444-011-9258-4
M3 - Article
AN - SCOPUS:84876424520
SN - 1019-7168
VL - 38
SP - 737
EP - 762
JO - Advances in Computational Mathematics
JF - Advances in Computational Mathematics
IS - 4
ER -