A robust line extraction method by unsupervised line clustering

作者:

Highlights:

摘要

This paper describes a new method of extracting straight lines based on unsupervised line clustering. It is assumed that each line support region (LSR) in an image is composed of pixels that share similar gradient orientation values. Therefore, by an appropriate partitioning of gradient space, the sets of parallel lines can be more easily extracted. Previous works on partitioning gradient space, however, relied on ad hoc methods, and cannot be used as reliable tools for the extraction of the number of clusters in gradient space. In order to handle such a clustering issue, the Bhattacharyya distance is introduced to define a measure for cluster separability and thereafter to estimate the number of inherent clusters. Subsequent to the clustering stage, each extracted line support region undergoes a consistency test to evaluate its validity in terms of uncertainty descriptors. For the consistency test, an entropy-based line selection scheme is formulated and a theory from robust statistics is adopted. The feasibility of the proposed line extraction method is assessed by considering the issue of vanishing point detection.

论文关键词:Clustering,Thresholding,Entropy,Robust statistics,Consistency test,Vanishing point

论文评审过程:Received 21 May 1997, Revised 8 June 1998, Available online 7 June 2001.

论文官网地址:https://doi.org/10.1016/S0031-3203(98)00100-9