EXTRACTION OF LINE FEATURES IN A NOISY IMAGE

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 278
  • Download : 33
Finding line segments in an intensity image has been one of the most fundamental issues in the area of computer vision. In complex scenes, it is hard to detect the locations of point features. Line features are more robust in providing greater positional accuracy. In this paper we present a robust “line feature extraction” algorithm which extracts line features in a single pass without using any assumptions and constraints. Our algorithm consists of six steps: (1) edge extraction, (2) edge scanning, (3) edge normalization, (4) line-blob extraction, (5) line-feature computation and (6) line linking. By using an edge scanning, the computational complexity due to too many edge pixels is drastically reduced. Edge normalization improves the local quantization error induced from the gradient space partitioning and minimizes perturbations on edge orientation. We also analyze the effects of edge processing, and the least squares-based method and the principal axis-based method on the computation of line orientation. We show its efficiency with some real images.
Publisher
Elsevier
Issue Date
1997
Keywords

Line features extraction; Edge processing; Edge normalization; Line linking

Citation

Pattern Recognition, Vol.30, No.10, pp.1651-1660

URI
http://hdl.handle.net/10203/24776
Appears in Collection
EE-Conference Papers(학술회의논문)

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0