TY - JOUR
T1 - Adaptive edge detectors for piecewise smooth data based on the minmod limiter
AU - Gelb, Anne
AU - Tadmor, E.
N1 - Funding Information:
Research was supported in part by NSF DMS #01-07428 (AG and ET), by NSF EAR #02-22327, CNS #03-24957 and NIH EB #02533-01 (AG) and by ONR #N00014-91-J-1076 and NSF #DMS04-07704 (ET). Part of the research was carried out while A. Gelb was visiting the Center for Scientific Computation and Mathematical Modeling (CSCAMM) at the University of Maryland, College Park.
PY - 2006/9
Y1 - 2006/9
N2 - We are concerned with the detection of edges-the location and amplitudes of jump discontinuities of piecewise smooth data realized in terms of its discrete grid values. We discuss the interplay between two approaches. One approach, realized in the physical space, is based on local differences and is typically limited to low-order of accuracy. An alternative approach developed in our previous work [Gelb and Tadmor, Appl. Comp. Harmonic Anal., 7, 101-135 (1999)] and realized in the dual Fourier space, is based on concentration factors; with a proper choice of concentration factors one can achieve higher-orders-in fact in [Gelb and Tadmor, SIAM J. Numer. Anal., 38, 1389-1408 (2001)] we constructed exponentially accurate edge detectors. Since the stencil of these highly-accurate detectors is global, an outside threshold parameter is required to avoid oscillations in the immediate neighborhood of discontinuities. In this paper we introduce an adaptive edge detection procedure based on a cross-breading between the local and global detectors. This is achieved by using the minmod limiter to suppress spurious oscillations near discontinuities while retaining high-order accuracy away from the jumps. The resulting method provides a family of robust, parameter-free edge-detectors for piecewise smooth data. We conclude with a series of one- and two-dimensional simulations.
AB - We are concerned with the detection of edges-the location and amplitudes of jump discontinuities of piecewise smooth data realized in terms of its discrete grid values. We discuss the interplay between two approaches. One approach, realized in the physical space, is based on local differences and is typically limited to low-order of accuracy. An alternative approach developed in our previous work [Gelb and Tadmor, Appl. Comp. Harmonic Anal., 7, 101-135 (1999)] and realized in the dual Fourier space, is based on concentration factors; with a proper choice of concentration factors one can achieve higher-orders-in fact in [Gelb and Tadmor, SIAM J. Numer. Anal., 38, 1389-1408 (2001)] we constructed exponentially accurate edge detectors. Since the stencil of these highly-accurate detectors is global, an outside threshold parameter is required to avoid oscillations in the immediate neighborhood of discontinuities. In this paper we introduce an adaptive edge detection procedure based on a cross-breading between the local and global detectors. This is achieved by using the minmod limiter to suppress spurious oscillations near discontinuities while retaining high-order accuracy away from the jumps. The resulting method provides a family of robust, parameter-free edge-detectors for piecewise smooth data. We conclude with a series of one- and two-dimensional simulations.
KW - Concentration method
KW - Edge detection
KW - Local difference formulas
KW - Minmod algorithm
KW - Piecewise smoothness
UR - http://www.scopus.com/inward/record.url?scp=33747884037&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33747884037&partnerID=8YFLogxK
U2 - 10.1007/s10915-006-9088-6
DO - 10.1007/s10915-006-9088-6
M3 - Article
AN - SCOPUS:33747884037
SN - 0885-7474
VL - 28
SP - 279
EP - 306
JO - Journal of Scientific Computing
JF - Journal of Scientific Computing
IS - 2-3
ER -