Detail publikace

Effectiveness of Approaches for Rail Candidates Detection and Verification of the SVM

MUSIL, M.

Originální název

Effectiveness of Approaches for Rail Candidates Detection and Verification of the SVM

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

Rail candidates detection is the primary task in railway recognition systems based on recognition in images taken from the camera mounted on the board of the locomotive. In order to reduce the classifier complexity, effective and responsible rail candidates generation plays an important role without placing big decision responsibility on a  further classifier stage. There are two basic options. Due to the rich complex environment along the track, pixel-per-pixel methods are often omitted. The second option involving a thorough investigation around a  pixel is preferred. In this paper, we present comparison between two different approaches to rail candidates detection, each representing one of the basic groups, furthermore consequences in rail hypotheses generation. We introduce the finding that using the SVM is more efficient than the method based on pixel-per-pixel.

Klíčová slova

rails detection,computer vision,Histogram of Oriented Gradients,pixel-per-pixel method,Support Vector Machine

Autoři

MUSIL, M.

Vydáno

21. 4. 2016

Nakladatel

University of Žilina

Místo

Žilina

ISBN

978-80-554-1196-5

Kniha

ICTIC - Proceedings in Conference of Informatics and Management Sciences

Edice

Volume 5 Issue 1

Strany od

152

Strany do

156

Strany počet

5

URL

BibTex

@inproceedings{BUT130980,
  author="Marek {Musil}",
  title="Effectiveness of Approaches for Rail Candidates Detection and Verification of the SVM",
  booktitle="ICTIC - Proceedings in Conference of Informatics and Management Sciences",
  year="2016",
  series="Volume 5 Issue 1",
  pages="152--156",
  publisher="University of Žilina",
  address="Žilina",
  doi="10.18638/ictic.2016.5.1",
  isbn="978-80-554-1196-5",
  url="http://www.ictic.sk/archive/?vid=1&aid=2&kid=50501-285"
}