z-logo
open-access-imgOpen Access
Vanishing point detection using random forest and patch‐wise weighted soft voting
Author(s) -
Fan Xue,
Riaz Irfan,
Rehman Yawar,
Shin Hyunchul
Publication year - 2016
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2016.0068
Subject(s) - random forest , computer science , voting , benchmark (surveying) , artificial intelligence , pattern recognition (psychology) , noise (video) , point (geometry) , representation (politics) , image (mathematics) , mathematics , geometry , geodesy , politics , political science , law , geography
Variations in road types and its ambient environment make the single image based vanishing point detection a challenging task. In this study, a novel and efficient vanishing point detection method is proposed by using random forest and patch‐wise weighted soft voting. To eliminate the noise votes introduced by background region and to reduce the workload of voting stage, random forest based valid patch extraction technique is developed, which distinguishes the informative road patches from the background noise. To prepare training data for the random forest, a training patch generation method is proposed, and a variety of road relevant features are introduced for training patch representation. Since the traditional pixel‐wise voting scheme is time consuming and imprecise, a patch‐wise weighted soft voting scheme is proposed to generate a more precise voting map and to further reduce the computational complexity of voting stage. The experimental results on the benchmark dataset show that the proposed method reveals a step forward in performance. The authors’ approach is about 6 times faster in detection speed and 5.6% better in detection accuracy than the generalised Laplacian of Gaussian filter based method, which is a well‐known state‐of‐the‐art approach.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here