A binarization algorithm based on shade-planes for road marking recognition

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A binarization algorithm tolerant to both gradual change of intensity caused by shade and the discontinuous changes caused by shadows is described in this paper. This algorithm is based on "shade-planes", in which intensity changes gradually and no edges are included. These shade-planes are produced by selecting a "principal-intensity" in each small block by a quasi-optimization algorithm. One shade-plane is then selected as the background to eliminate the gradual change in the input image. Consequently, the image, with its gradual change removed, is binarized by a conventional global thresholding algorithm. The binarized image is provided to a road marking recognition system, for which influence of shade and shadows is inevitable in the sunlight. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Suzuki, T., Kodaira, N., Mizutani, H., Nakai, H., & Shinohara, Y. (2009). A binarization algorithm based on shade-planes for road marking recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5575 LNCS, pp. 51–60). https://doi.org/10.1007/978-3-642-02230-2_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free