Efficient local adaptive thresholding for night-time vehicle candidate detection
by Yeongyu Choi; Hyojin Lim; Cuong Nguyen Khac; Ju H. Park; Ho-Youl Jung
International Journal of Computational Vision and Robotics (IJCVR), Vol. 7, No. 5, 2017

Abstract: In the current commercial automotive market, the need for intelligent headlight control systems has increased more and more. Camera-based night-time vehicle detection has become a crucial issue in determining the performance of such control systems. The purpose of this paper is to offer an answer to the question, 'Which thresholding method is suitable in terms of detection performance for a night-time vehicle candidate selection process?' For such purposes, two local adaptive thresholding methods are introduced and tested. One is local maximum-based thresholding, and the other is local mean-based thresholding. Efficient implementation methodologies are also introduced for real-time processing. Through the simulations tested on road image sequences with different exposure times, we prove that local adaptive thresholding methods have better performance than other well-known global thresholding methods. In particular, the simulations show that the proposed mean-based thresholding method has better performance on both long- and short-exposure sequences.

Online publication date: Mon, 04-Sep-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Vision and Robotics (IJCVR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com