Vanishing point detection using random forest and patch-wise weighted soft voting

Title
Vanishing point detection using random forest and patch-wise weighted soft voting
Author
신현철
Keywords
ROAD DETECTION
Issue Date
2016-12
Publisher
INST ENGINEERING TECHNOLOGY-IET
Citation
IET IMAGE PROCESSING, v. 10, No. 11, Page. 900-907
Abstract
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.
URI
http://digital-library.theiet.org/content/journals/10.1049/iet-ipr.2016.0068https://repository.hanyang.ac.kr/handle/20.500.11754/71337
ISSN
1751-9659; 1751-9667
DOI
10.1049/iet-ipr.2016.0068
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > ELECTRICAL ENGINEERING(전자공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE