• DocumentCode
    2339903
  • Title

    Obstacle localization with a binarized v-disparity map using local maximum frequency values in stereo vision

  • Author

    Lee, Chung-Hee ; Lim, Young-Chul ; Kwon, Soon ; Lee, Jong-Hun

  • Author_Institution
    Div. of Adv. Ind. Sci.&Technol., Daegu Gyeongbuk Inst. of Sci. & Technol., Daegu
  • fYear
    2008
  • fDate
    7-9 Nov. 2008
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    In this paper, we propose an obstacle localization method using column detection with a binarized v-disparity map. For localizing obstacles robustly in environments where there exist many obstacles, such as roadside trees, pedestrians, or where median strips exist, we also propose a new method which extracts a road feature. We create a binarized v-disparity map using local maximum frequency values in each row for emphasizing a diagonal straight line, namely a road feature. And to further eliminate noise, we use a comparing method which compares all road feature values with median values. Finally, we use a linear interpolation for rows which have no value. We can extract a road feature through this method robustly. And we adopt this new standard to localize obstacles. An experimental result which uses a real road image proved that our proposed method has the advantage of extracting a road feature and localizing obstacles in environments where many obstacles exist.
  • Keywords
    collision avoidance; feature extraction; image denoising; robot vision; stereo image processing; binarized v-disparity map; column detection; linear interpolation; local maximum frequency; median strips; obstacle localization; pedestrians; roadside trees; stereo vision; Computer vision; Data processing; Feature extraction; Frequency; Intelligent vehicles; Roads; Robustness; Sonar navigation; Stereo vision; Strips;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Circuits and Systems, 2008. SCS 2008. 2nd International Conference on
  • Conference_Location
    Monastir
  • Print_ISBN
    978-1-4244-2627-0
  • Electronic_ISBN
    978-1-4244-2628-7
  • Type

    conf

  • DOI
    10.1109/ICSCS.2008.4746894
  • Filename
    4746894