Paper
26 April 2006 Fast computation of thresholding hysteresis for edge detection
Artur Nowakowski, Wladyslaw Skarbek
Author Affiliations +
Proceedings Volume 6159, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments IV; 615948 (2006) https://doi.org/10.1117/12.674959
Event: Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments IV, 2005, Wilga, Poland
Abstract
The fast implementation of thresholding hysteresis for edge detection is presented. Hysteresis, the optional final part of edge detection algorithms, aims at finding these parts of real edges, which were not detected, because their strength is depreciated by the noise in image. Hysteresis can be effectively computing using connected components analysis from graph theory. Using algorithm presented in [2] called in this paper as UNION-FIND the computation of hysteresis can be done with referring to the gradient information only in two image passes.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Artur Nowakowski and Wladyslaw Skarbek "Fast computation of thresholding hysteresis for edge detection", Proc. SPIE 6159, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments IV, 615948 (26 April 2006); https://doi.org/10.1117/12.674959
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Edge detection

Detection and tracking algorithms

Gaussian filters

Algorithm development

Imaging systems

Infrared search and track

Optical filters

RELATED CONTENT

Illumination optimization: The revolution has begun
Proceedings of SPIE (December 23 2002)
Camera Edge Response
Proceedings of SPIE (March 12 1988)
Good processing method of interference patterns
Proceedings of SPIE (September 20 2001)

Back to Top