Extraction of line features in a noisy image

Cited 29 time in webofscience Cited 0 time in scopus
  • Hit : 427
  • Download : 0
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. (C) 1997 Pattern Recognition Society. Published by Elsevier Science Ltd.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1997
Language
English
Article Type
Article
Keywords

POLYGONAL-APPROXIMATION; HOUGH TRANSFORM; SEGMENTS; CURVES; VISION

Citation

PATTERN RECOGNITION, v.30, pp.1651 - 1660

ISSN
0031-3203
URI
http://hdl.handle.net/10203/73982
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 29 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0