[1990] Proceedings Third International Conference on Computer Vision
DOI: 10.1109/iccv.1990.139493
|View full text |Cite
|
Sign up to set email alerts
|

Multiple widths yield reliable finite differences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(20 citation statements)
references
References 13 publications
0
20
0
Order By: Relevance
“…This allows the cost functions for these features to adapt to a variety of image types by automatically selecting, on a pixel by pixel basis, the kernel width that best matches the line-spread function of the imaging hardware used to obtain the current image [13,16].…”
Section: Image Feature Formulationmentioning
confidence: 99%
“…This allows the cost functions for these features to adapt to a variety of image types by automatically selecting, on a pixel by pixel basis, the kernel width that best matches the line-spread function of the imaging hardware used to obtain the current image [13,16].…”
Section: Image Feature Formulationmentioning
confidence: 99%
“…Then the edges can be located simply by finding the local maxima of the derivative of the image or using the zero-crossing points of the second derivative. This approach was later developed by Marr and Hildreth [9], Canny [10,11] and others [12,13] where the gradient of the image I is given by the vector…”
Section: Starburst Pattern Center Estimationmentioning
confidence: 99%
“…Second, the edge features used here are more robust and comprehensive than previous implementations: we maximize over different gradient kernels sizes to encompass the various edge types and scales while simultaneously attempting to balance edge detail with noise suppression [7], and we use the laplacian zero-crossing for boundary localization and fine detail livewire "snapping". Third, the discrete, bounded nature of the local edge costs permit the use of a specialized sorting algorithm that inserts points into a sorted list (called the active list) in constant time.…”
Section: Two-dimensional Dynamic Programmingmentioning
confidence: 99%
“…The laplacian zero-crossing is a binary edge feature used for edge localization [7,9]. Convolution of an image with a laplacian kernel approximates the 2 nd partial derivative of the image.…”
Section: Local Costsmentioning
confidence: 99%