Cited by 141Data Visualization and AnalyticsTraffic and Road SafetyHuman-Automation Interaction and Safety

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Visualization of Driving Behavior Based on Hidden Feature Extraction by Using Deep Learning

Liu, HaiLong, Taniguchi, Tadahiro, Tanaka, Yusuke, Takenaka, Kazuhito, Bando, Takashi·2017·IEEE Transactions on Intelligent Transportation Systems

Abstract

In this paper, we propose a visualization method for driving behavior that helps people to recognize distinctive driving behavior patterns in continuous driving behavior data. Driving behavior can be measured using various types of sensors connected to a control area network. The measured multi-dimensional time series data are called driving behavior data. In many cases, each dimension of the time series data is not independent of each other in a statistical sense. For example, accelerator opening rate and longitudinal acceleration are mutually dependent. We hypothesize that only a small number of hidden features that are essential for driving behavior are generating the multivariate driving behavior data. Thus, extracting essential hidden features from measured redundant driving behavior data is a problem to be solved to develop an effective visualization method for driving behavior. In this paper, we propose using deep sparse autoencoder (DSAE) to extract hidden features for visualization of driving behavior. Based on the DSAE, we propose a visualization method called adriving color mapby mapping the extracted 3-D hidden feature to the red green blue (RGB) color space. A driving color map is produced by placing the colors in the corresponding positions on the map. The subjective experiment shows that feature extraction method based on the DSAE is effective for visualization. In addition, its performance is also evaluated numerically by using pattern recognition method. We a…

Overview

Integrity signals

Registry

Crossref · 10.1109/tits.2017.2649541

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Route planning is formulated as finding the point-to-point shortest path in a directed graph, and conventional methods are examined under four categories.

    “Route planning is formulated as finding the point-to-point shortest path in a directed graph, and conventional methods are examined under four categories in [248].”
  • HL is the fastest query time algorithm for route planning, at the expense of high storage usage.

    “HL is the fastest query time algorithm for route planning [248], in the expense of high storage usage.”

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 27

  1. wilcoxon, 1970, Critical values and probability levels for the Wilcoxon rank sum test and the Wilcoxon signed rank test, Selected Tables in Mathematical Statistics, 1, 171
  2. 10.1109/TITS.2015.2484421 · DOI
  3. 10.1109/IVS.2015.7225824 · DOI
  4. 10.1109/TCST.2010.2043104 · DOI
  5. 10.1109/IVS.2014.6856506 · DOI
  6. 10.1057/ivs.2010.14 · DOI
  7. treiber, 2002, Reconstructing the spatio-temporal traffic dynamics from stationary detector data, Coop Transp Dyn, 1, 1
  8. 10.1109/TVCG.2015.2467771 · DOI
  9. 10.1109/IVS.2014.6856420 · DOI
  10. 10.1109/TITS.2012.2205917 · DOI
  11. 10.1016/0169-7439(87)80084-9 · DOI
  12. 10.1109/TITS.2011.2158424 · DOI
  13. tagawa, 2014, Structured denoising autoencoder for fault detection and analysis, Proc Asian Conf Mach Learn, 96
  14. 10.1109/IVS.2015.7225680 · DOI
  15. 10.1016/S0893-6080(00)00026-5 · DOI
  16. 10.1049/iet-its.2013.0119 · DOI
  17. 10.1109/IVS.2014.6856468 · DOI
  18. 10.1007/978-3-540-85845-4_13 · DOI
  19. 10.1109/IVS.2007.4290122 · DOI
  20. 10.1109/OPTIM.2012.6231809 · DOI
  21. zhou, 2004, Driver assisted fuzzy control of yaw dynamics for 4WD vehicles, Proc IEEE Intell Vehicles Symp, 425
  22. hyvärinen, 2004, Independent Component Analysis, 46
  23. smolensky, 1986, Information processing in dynamical systems: Foundations of harmony theory, Parallel Distributed Processing Explorations in the Microstructures of Cognition, 194
  24. 10.1007/BFb0020217 · DOI
  25. masci, 2011, Stacked convolutional auto-encoders for hierarchical feature extraction, Artificial Neural Networks in Machine Learning, 52
  26. alvarez, 2014, Modeling the driving behavior of electric vehicles using smartphones and neural networks, IEEE Intell Transp Syst Mag, 6, 44, 10.1109/MITS.2014.2322651 · DOI
  27. 10.1561/2200000006 · DOI

Cited by

Sorted by citations

Metadata

Authors
Liu, H., Taniguchi, T., Tanaka, Y., Takenaka, K., & Bando, T.
Affiliations
  • Ritsumeikan University (JP)
  • Denso (Japan) (JP)
Venue
IEEE Transactions on Intelligent Transportation Systems
Published
2017-09
Volume
18
Issue
9
Pages
2477-2489
ISSN
  • 1524-9050 (ISSN-L)
  • 1558-0016
OpenAlex
W2586457790
Cited by
141
References
2
Citations by year
2026: 3 · 2025: 4 · 2024: 6 · 2023: 10 · 2022: 22 · 2021: 22 · 2020: 29 · 2019: 23 · 2018: 16 · 2017: 6
FWCI
8.40
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Intelligent Transportation Systems (publishedVersion)
Funders
Japan Society for the Promotion of Science (16J08577, 16H06569)
Topics
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Data Visualization and Analytics
  • Physical Sciences › Engineering › Safety, Risk, Reliability and Quality › Traffic and Road Safety
  • Social Sciences › Human Factors and Ergonomics › Human-Automation Interaction and Safety
Keywords
deep sparse autoencoder, multivariate time series, pattern recognition, driver behavior recognition

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review