Efficient implementations of edge localization algorithms

Ramakrishnan Sundaram

doi:10.1117/12.458777

12 March 2002 Efficient implementations of edge localization algorithms

Ramakrishnan Sundaram

Proceedings Volume 4665, Visualization and Data Analysis 2002; (2002) https://doi.org/10.1117/12.458777
Event: Electronic Imaging, 2002, San Jose, California, United States

Abstract

Edges in grayscale digital imagery are detected by localizing the zero crossings of filtered data. To achieve this objective, truncated time or frequency sampled forms (TSF/FSF) of the Laplacian-of-Gaussian (LOG) filter are employed in the transform domain. Samples of the image are transformed using the discrete symmetric cosine transform (DSCT) prior to adaptive filtering and the isolation of zero crossings. This paper evaluates an adaptive block-wise filtering procedure based on the FSF of the LOG filter which diminishes the edge localization error, emphasizes the signal-to-noise ratio (SNR) around the edge, and extends easily to higher dimensions. Theoretical expressions and applications to digital images are presented.

Citation Download Citation

Ramakrishnan Sundaram "Efficient implementations of edge localization algorithms", Proc. SPIE 4665, Visualization and Data Analysis 2002, (12 March 2002); https://doi.org/10.1117/12.458777

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available