Extraction of line features in a noisy image

Pattern Recognition

Volumn 30, Issue 10, 1997, Pages 1651-1660

  Lee, Joon Woong ^a   Kweon, IN SO ^a,b,c  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Seoul National University   (South Korea)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

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

Indexed keywords

DATA PROCESSING; IMAGE ANALYSIS; PATTERN RECOGNITION;

EDGE NORMALIZATION; EDGE PROCESSING; LINE FEATURES EXTRACTION;

FEATURE EXTRACTION;

EID: 0031247430     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(96)00185-9     Document Type: Article

References (19)

1. A. D. Bimbo, L. Landi and S. Santini, Determination of road directions using feedback neural nets. Signal Process. 32, 147-160 (1993).
2. R. O. Duda and P. E. Hart, Pattern Recognition and Scene Analysis. Wiley, New York (1973).
3. N. Guil, J. Villaba and E. L. Zapata, A fast Hough transform for segment detection, IEEE Trans. Pattern Analysis Mach, Intell. 4(11), 1541-1548 (1995).
4. P. L. Palmer, K. Kittler and M. Petrou, Using of attention with the Hough transform for accurate line parameter estimation, Pattern Recognition 27(9), 1127-1134 (1994).
5. Y. Zhang and R. Webber, A windowing approach to detecting line segment using Hough transform, Pattern Recognition 29(2), 255-265 (1996).
6. T. M. Breuel, Finding lines under bounded error, Pattern Recognition 29(1), 167-178 (1996).
7. D. H. Ballard and C. M. Brown, Computer Vision. Prentice-Hall, Englewood Cliffs, New Jersey (1982).
8. R. G. Gonzalez and R. E. Woods, Digital Image Processing. Addison-Wesley, Reading, Massachusetts (1992).
9. P. C. Chung, C. T. Tasi, E. L. Chen and Y. N. Sun, Polygonal approximation using competitive Hopfield neural network, Pattern Recognition 27(11), 1505-1512 (1994).
10. A. Pikaz and I. Dinstein, Optimal polygonal approximation of digital curves, Pattern Recognition 28(3), 373-379 (1995).
11. K. Wall and P. E. Danielsson, A fast sequential method for polygonal approximation of digitized curves, CVGIP 28, 220-227 (1984).
12. J. Yuan and C. Y. Suen, An optimal O(n) algorithm for identifying line segments from a sequence of chain codes, Pattern Recognition 28(5), 635-646 (1995).
13. J. B. Burns, A. R. Hanson and E. M. Riseman, Extracting straight lines, IEEE Trans. Pattern Analysis Mach. Intell. PAMI-8(4), 425-455 (1986).
14. P. Kahn, L. Kitchen and E. M. Riseman, A fast line finder for vision-guided robot navigation, IEEE Trans. Pattern Analysis Mach. Intell. 12(11), 1098-1102 (1990).
15. R. Deriche, Fast algorithm for low-level vision, IEEE Trans. Pattern Analysis Mach. Intell. 12(1), 78-87 (1990).
16. O. Faugeras, Three-Dimensional Computer Vision - A Geometric Viewpoint. MIT Press, Cambridge, Massachusetts (1993).
17. J. L. Melsa and D. L. Cohn, Decision and Estimation Theory. McGraw-Hill, New York (1978).
18. E. Horowits and S. Sahni, Fundamentals of Data Structure in Pascal. Computer Science Press, Rockville, Maryland (1984).
19. F. van deer Heijden, Edge and line feature extraction based on covariance models, IEEE Trans. Pattern Analysis Mach. Intell. 17(1), 16-32 (1995).