A Fast Sub-pixel Edge Detection Algorithm
XU Zhong-y
Abstract
XU Zhong-y
Abstract
A sub-pixel edge detection algorithm based on orthogonal polynomial fitting was proposed, and the direct expression to calculate edge points was given.The algorithm has higher detection accuracy and uses less detection time.However,previous sub-pixel edge detection algorithms can not solve these two problems simultaneously and effectively.Compared with Gauss and spatial moment algorithms,this algorithm can obtain the sub-pixel level edge position fast and accurately.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A sub-pixel edge detection algorithm based on orthogonal polynomial fitting was proposed, and the direct expression to calculate edge points was given.The algorithm has higher detection accuracy and uses less detection time.However,previous sub-pixel edge detection algorithms can not solve these two problems simultaneously and effectively.Compared with Gauss and spatial moment algorithms,this algorithm can obtain the sub-pixel level edge position fast and accurately.
Key concepts: Pixel, Edge detection, Algorithm, Enhanced Data Rates for GSM Evolution, Deriche edge detector, Gauss, Position (finance), Computer science