Paper Info
Title
From Edges To Linear Features: A Pca And Graph Based Approach
Abstract
Linear features such as line segments and contour fragments are important cues for object detection and scene analysis. Least square based and Hough-like approaches are quite popular and powerful. However, least square approaches are sensitive to outliers, and are unable to handle the case where there is more than one underlying line segment; while Hough-like approaches do not work well when extracting fragments which are not very 'straight'. The goal of this work is to extract linear features locally in natural scenes using PCA and graph analysis. The whole process has five stages: first, for each local area, we create a graph using edge points as vertexes and distance measurements as links. Then, some edge-point sets which may contain underlying line segments are obtained by finding connected components in the graph; second, PCA is employed to estimate the existence of linear feature in each point set, and to compute the principal axis orientation; third, the relation between any two vertexes in each set is recalculated according to the principal axis orientation, and a new graph which only contains several trees is generated; fourth, one linear feature is detected by finding a best chain in each tree according to some criteria; fifth, all the line segments in the image are refined and organized according to global information.
Year
DOI
Venue
2010
10.1109/ICASSP.2010.5495304
2010 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING
Keywords
Field
DocType
linear feature, PCA, graph analysis
Graph theory,Line segment,Strength of a graph,Tree (graph theory),Pattern recognition,Computer science,Edge detection,Directed graph,Power graph analysis,Connected component,Artificial intelligence
Conference
ISSN
Citations 
PageRank 
1520-6149
0
0.34
References 
Authors
4
4
Name
Order
Citations
PageRank
Jian Li1496.61
Xiangjing An222612.15
Jun Tan39517.49
Hangen He430723.86