A Binarization Algorithm Based on Shade-Planes for Road Marking Recognition
Identifieur interne : 000A36 ( Main/Exploration ); précédent : 000A35; suivant : 000A37A Binarization Algorithm Based on Shade-Planes for Road Marking Recognition
Auteurs : Tomohisa Suzuki ; Naoaki Kodaira ; Hiroyuki Mizutani ; Hiroaki Nakai ; Yasuo ShinoharaSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
Abstract
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.
Url:
DOI: 10.1007/978-3-642-02230-2_6
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001F55
- to stream Istex, to step Curation: 001E21
- to stream Istex, to step Checkpoint: 000559
- to stream Main, to step Merge: 000A45
- to stream Main, to step Curation: 000A36
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Binarization Algorithm Based on Shade-Planes for Road Marking Recognition</title><author><name sortKey="Suzuki, Tomohisa" sort="Suzuki, Tomohisa" uniqKey="Suzuki T" first="Tomohisa" last="Suzuki">Tomohisa Suzuki</name></author><author><name sortKey="Kodaira, Naoaki" sort="Kodaira, Naoaki" uniqKey="Kodaira N" first="Naoaki" last="Kodaira">Naoaki Kodaira</name></author><author><name sortKey="Mizutani, Hiroyuki" sort="Mizutani, Hiroyuki" uniqKey="Mizutani H" first="Hiroyuki" last="Mizutani">Hiroyuki Mizutani</name></author><author><name sortKey="Nakai, Hiroaki" sort="Nakai, Hiroaki" uniqKey="Nakai H" first="Hiroaki" last="Nakai">Hiroaki Nakai</name></author><author><name sortKey="Shinohara, Yasuo" sort="Shinohara, Yasuo" uniqKey="Shinohara Y" first="Yasuo" last="Shinohara">Yasuo Shinohara</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1D462FDE92B36FBFB44B7C29B55D1C5C49CA6A1D</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-02230-2_6</idno><idno type="url">https://api.istex.fr/document/1D462FDE92B36FBFB44B7C29B55D1C5C49CA6A1D/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001F55</idno><idno type="wicri:Area/Istex/Curation">001E21</idno><idno type="wicri:Area/Istex/Checkpoint">000559</idno><idno type="wicri:doubleKey">0302-9743:2009:Suzuki T:a:binarization:algorithm</idno><idno type="wicri:Area/Main/Merge">000A45</idno><idno type="wicri:Area/Main/Curation">000A36</idno><idno type="wicri:Area/Main/Exploration">000A36</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Binarization Algorithm Based on Shade-Planes for Road Marking Recognition</title><author><name sortKey="Suzuki, Tomohisa" sort="Suzuki, Tomohisa" uniqKey="Suzuki T" first="Tomohisa" last="Suzuki">Tomohisa Suzuki</name><affiliation><wicri:noCountry code="no comma">Toshiba Solutions Corporation</wicri:noCountry></affiliation></author><author><name sortKey="Kodaira, Naoaki" sort="Kodaira, Naoaki" uniqKey="Kodaira N" first="Naoaki" last="Kodaira">Naoaki Kodaira</name><affiliation><wicri:noCountry code="no comma">Toshiba Solutions Corporation</wicri:noCountry></affiliation></author><author><name sortKey="Mizutani, Hiroyuki" sort="Mizutani, Hiroyuki" uniqKey="Mizutani H" first="Hiroyuki" last="Mizutani">Hiroyuki Mizutani</name><affiliation><wicri:noCountry code="no comma">Toshiba Solutions Corporation</wicri:noCountry></affiliation></author><author><name sortKey="Nakai, Hiroaki" sort="Nakai, Hiroaki" uniqKey="Nakai H" first="Hiroaki" last="Nakai">Hiroaki Nakai</name><affiliation><wicri:noCountry code="no comma">Toshiba Corporation</wicri:noCountry></affiliation></author><author><name sortKey="Shinohara, Yasuo" sort="Shinohara, Yasuo" uniqKey="Shinohara Y" first="Yasuo" last="Shinohara">Yasuo Shinohara</name><affiliation><wicri:noCountry code="no comma">Toshiba Corporation</wicri:noCountry></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">1D462FDE92B36FBFB44B7C29B55D1C5C49CA6A1D</idno><idno type="DOI">10.1007/978-3-642-02230-2_6</idno><idno type="ChapterID">6</idno><idno type="ChapterID">Chap6</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Kodaira, Naoaki" sort="Kodaira, Naoaki" uniqKey="Kodaira N" first="Naoaki" last="Kodaira">Naoaki Kodaira</name><name sortKey="Mizutani, Hiroyuki" sort="Mizutani, Hiroyuki" uniqKey="Mizutani H" first="Hiroyuki" last="Mizutani">Hiroyuki Mizutani</name><name sortKey="Nakai, Hiroaki" sort="Nakai, Hiroaki" uniqKey="Nakai H" first="Hiroaki" last="Nakai">Hiroaki Nakai</name><name sortKey="Shinohara, Yasuo" sort="Shinohara, Yasuo" uniqKey="Shinohara Y" first="Yasuo" last="Shinohara">Yasuo Shinohara</name><name sortKey="Suzuki, Tomohisa" sort="Suzuki, Tomohisa" uniqKey="Suzuki T" first="Tomohisa" last="Suzuki">Tomohisa Suzuki</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A36 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000A36 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:1D462FDE92B36FBFB44B7C29B55D1C5C49CA6A1D
|texte= A Binarization Algorithm Based on Shade-Planes for Road Marking Recognition
}}
| This area was generated with Dilib version V0.6.32. |  |