2011•Journal of Applied OpticsRequires access

Fast polynomial fits sub-pixel edge detection algorithms

Junwei Tian

Open publisher page 2 citations

Abstract

Since traditional edge detection algorithms have the disadvantages of low precision and efficiency in measuring the edge,a sub-pixel edge detection algorithm based on the polynomial fittings is proposed.According to the grey level distribution of the picture,this algorithm uses cubic polynomial to fit the edges to realize sub-pixel localization.Traditional sub-pixel edge detection algorithms detect coarse position at first,and then carry out the sub-divide,therefore the running time is relatively long.This method first fetches some points near the edge,and then carries out the sub-pixel edge detection algorithm,so the running time is reduced.Finally,the experimental results show that the proposed algorithm is very reliable and efficient.

About this research paper

What this paper is about

Since traditional edge detection algorithms have the disadvantages of low precision and efficiency in measuring the edge,a sub-pixel edge detection algorithm based on the polynomial fittings is proposed.According to the grey level distribution of the picture,this algorithm uses cubic polynomial to fit the edges to realize sub-pixel localization.Traditional sub-pixel edge detection algorithms detect coarse position at first,and then carry out the sub-divide,therefore the running time is relatively long.This method first fetches some points near the edge,and then carries out the sub-pixel edge detection algorithm,so the running time is reduced.Finally,the experimental results show that the proposed algorithm is very reliable and efficient.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Since traditional edge detection algorithms have the disadvantages of low precision and efficiency in measuring the edge,a sub-pixel edge detection algorithm based on the polynomial fittings is proposed.According to the grey level distribution of the picture,this algorithm uses cubic polynomial to fit the edges to realize sub-pixel localization.Traditional sub-pixel edge detection algorithms detect coarse position at first,and then carry out the sub-divide,therefore the running time is relatively long.This method first fetches some points near the edge,and then carries out the sub-pixel edge detection algorithm,so the running time is reduced.Finally,the experimental results show that the proposed algorithm is very reliable and efficient.

Key concepts: Pixel, Enhanced Data Rates for GSM Evolution, Algorithm, Edge detection, Polynomial, Computer science, Position (finance), Time complexity

Related papers

Back to paper searchBrowse research topicsOriginal source
Fast polynomial fits sub-pixel edge detection algorithms — Research Paper | ScholarLens