2010 2nd International Conference on Information Engineering and Computer Science 2010
DOI: 10.1109/iciecs.2010.5678279
|View full text |Cite
|
Sign up to set email alerts
|

The Study of Sub-Pixel Edge Detection Algorithm Based on the Function Curve Fitting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…For this, sub‐pixel edge localisation algorithms can be used, categorised in the literature into three categories. The first category is the fitting methods, which uses a continuous function to fit the gradient of the greyscale value of the image, such as B‐spline [19], Gaussian function [20], Hyperbolic Tangent [21], and the Erf function [22]. The second category is the interpolation methods, which interpolate the greyscale values to a finer grid of pixels, such as Nearest Neighbour, Bilinear [23, 24], and Bicubic interpolations [25].…”
Section: Image Processing Algorithm For Grain Correlationmentioning
confidence: 99%
“…For this, sub‐pixel edge localisation algorithms can be used, categorised in the literature into three categories. The first category is the fitting methods, which uses a continuous function to fit the gradient of the greyscale value of the image, such as B‐spline [19], Gaussian function [20], Hyperbolic Tangent [21], and the Erf function [22]. The second category is the interpolation methods, which interpolate the greyscale values to a finer grid of pixels, such as Nearest Neighbour, Bilinear [23, 24], and Bicubic interpolations [25].…”
Section: Image Processing Algorithm For Grain Correlationmentioning
confidence: 99%