• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Obstacle Detection for Intelligent Transportation Systems Using Deep Stacked Autoencoder and k-Nearest Neighbor Scheme

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    08352801.pdf
    Size:
    4.470Mb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    Article
    Authors
    Dairi, Abdelkader
    Harrou, Fouzi cc
    Sun, Ying cc
    Senouci, Mohamed
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Statistics Program
    KAUST Grant Number
    OSR-2015-CRG4-2582
    Date
    2018-04-30
    Online Publication Date
    2018-04-30
    Print Publication Date
    2018-06-15
    Permanent link to this record
    http://hdl.handle.net/10754/627823
    
    Metadata
    Show full item record
    Abstract
    Obstacle detection is an essential element for the development of intelligent transportation systems so that accidents can be avoided. In this study, we propose a stereovisionbased method for detecting obstacles in urban environment. The proposed method uses a deep stacked auto-encoders (DSA) model that combines the greedy learning features with the dimensionality reduction capacity and employs an unsupervised k-nearest neighbors algorithm (KNN) to accurately and reliably detect the presence of obstacles. We consider obstacle detection as an anomaly detection problem. We evaluated the proposed method by using practical data from three publicly available datasets, the Malaga stereovision urban dataset (MSVUD), the Daimler urban segmentation dataset (DUSD), and Bahnhof dataset. Also, we compared the efficiency of DSA-KNN approach to the deep belief network (DBN)-based clustering schemes. Results show that the DSA-KNN is suitable to visually monitor urban scenes.
    Citation
    Dairi A, Harrou F, Sun Y, Senouci M (2018) Obstacle Detection for Intelligent Transportation Systems Using Deep Stacked Autoencoder and k-Nearest Neighbor Scheme. IEEE Sensors Journal: 1–1. Available: http://dx.doi.org/10.1109/jsen.2018.2831082.
    Sponsors
    This publication is based upon work supported by the King Abdullah University of Science and Technology (KAUST) Office of Sponsored Research (OSR) under Award No: OSR- 2015-CRG4-2582. The authors (Abdelkader Dairi and Mohamed Senouci) would like to thank the Computer Science Department, University of Oran 1 Ahmed Ben Bella for the continued support during the research. We are grateful to the five referees, the Associate Editor, and the Editor-in-Chief for their comments.
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    IEEE Sensors Journal
    DOI
    10.1109/jsen.2018.2831082
    Additional Links
    https://ieeexplore.ieee.org/document/8352801/
    ae974a485f413a2113503eed53cd6c53
    10.1109/jsen.2018.2831082
    Scopus Count
    Collections
    Articles; Statistics Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.