Fifty years of driving safety research

OBJECTIVE: This brief review covers the 50 years of driving-related research published in Human Factors, its contribution to driving safety, and emerging challenges. BACKGROUND: Many factors affect driving safety, making it difficult to assess the impact of specific factors such as driver age, cell phone distractions, or collision warnings. METHOD: The author considers the research themes associated with the approximately 270 articles on driving published in Human Factors in the past 50 years. RESULTS: To a large extent, current and past research has explored similar themes and concepts. Many articles published in the first 25 years focused on issues such as driver impairment, individual differences, and perceptual limits. Articles published in the past 25 years address similar issues but also point toward vehicle technology that can exacerbate or mitigate the negative effect of these issues. Conceptual and computational models have played an important role in this research. CONCLUSION: Improved crash-worthiness has contributed to substantial improvements in driving safety over the past 50 years, but future improvements will depend on enhancing driver performance and perhaps, more important, improving driver behavior. Developing models to guide this research will become more challenging as new technology enters the vehicle and shifts the focus from driver performance to driver behavior. APPLICATION: Over the past 50 years, Human Factors has accumulated a large base of driving-related research that remains relevant for many of today's design and policy concerns.     

Classifying mental tasks based on features of higher-order statistics from EEG signals in brain-computer interface

In order to characterize the non-Gaussian information contained within the EEG signals, a new feature extraction method based on bispectrum is proposed and applied to the classification of right and left motor imagery for developing EEG-based brain-computer interface systems. The experimental results on the Graz BCI data set have shown that based on the proposed features, a LDA classifier, SVM classifier and NN classifier outperform the winner of the BCI 2003 competition on the same data set in terms of either the mutual information, the competition criterion, or misclassification rate.     

The impact of misregistration on SRTM and DEM image differences

Image differences between Shuttle Radar Topography Mission (SRTM) data and other Digital Elevation Models (DEMs) are often performed for either accuracy assessment or for estimating vegetation height across the landscape. It has been widely assumed that the effect of sub-pixel misregistration between the two models on resultant image differences is negligible, yet this has not previously been tested in detail. The aim of this study was to determine the impact that various levels of misregistration have on image differences between SRTM and DEMs. First, very accurate image co-registration was performed at two study sites between higher resolution DEMs and SRTM data, and then image differences (SRTM–DEM) were performed after various levels of misregistration were systematically introduced into the SRTM data. It was found that: (1) misregistration caused an erroneous and dominant correlation between elevation difference and aspect across the landscape; (2) the direction of the misregistration defined the direction of this erroneous and systematic elevation difference; (3) for sub-pixel misregistration the error due solely to misregistration was greater than, or equal to the true difference between the two models for substantial proportions of the landscape (e.g., greater than 33% of the area for a half-pixel misregistration); and (4) the strength of the erroneous relationship with aspect was enhanced by steeper terrain. Spatial comparisons of DEMs were found to be sensitive to even sub-pixel misregistration between the two models, which resulted in a strong erroneous correlation with aspect. This misregistration induced correlation with aspect is not likely specific to SRTM data only; we expect it to be a generic relationship present in any DEM image difference analysis.     

Using local transition probability models in Markov random fields for forest change detection

Change detection based on the comparison of independently classified images (i.e. post-classification comparison) is well-known to be negatively affected by classification errors of individual maps. Incorporating spatial-temporal contextual information in the classification helps to reduce the classification errors, thus improving change detection results. In this paper, spatial-temporal Markov Random Fields (MRF) models were used to integrate spatial-temporal information with spectral information for multi-temporal classification in an attempt to mitigate the impacts of classification errors on change detection. One important component in spatial-temporal MRF models is the specification of transition probabilities. Traditionally, a global transition probability model is used that assumes spatial stationarity of transition probabilities across an image scene, which may be invalid if areas have varying transition probabilities. By relaxing the stationarity assumption, we developed two local transition probability models to make the transition model locally adaptive to spatially varying transition probabilities. The first model called locally adjusted global transition model adapts to the local variation by multiplying a pixel-wise probability of change with the global transition model. The second model called pixel-wise transition model was developed as a fully local model based on the estimation of the pixel-wise joint probabilities. When applied to the forest change detection in Paraguay, the two local models showed significant improvements in the accuracy of identifying the change from forest to non-forest compared with traditional models. This indicates that the local transition probability models can present temporal information more accurately in change detection algorithms based on spatial-temporal classification of multi-temporal images. The comparison between the two local transition models showed that the fully local model better captured the spatial heterogeneity of the transition probabilities and achieved more stable and consistent results over different regions of a large image scene.     

Performance analysis challenges and framework for high-performance reconfigurable computing

Reconfigurable computing (RC) applications employing both microprocessors and FPGAs have potential for large speedup when compared with traditional (software) parallel applications. However, this potential is marred by the additional complexity of these dual-paradigm systems, making it difficult to identify performance bottlenecks and achieve desired performance. Performance analysis concepts and tools are well researched and widely available for traditional parallel applications but are lacking in RC, despite being of great importance due to the applications’ increased complexity. In this paper, we explore challenges and present new techniques in automated instrumentation, runtime measurement, and visualization of RC application behavior. We also present ideas for integration with conventional performance analysis tools to create a unified tool for RC applications as well as our initial framework for FPGA instrumentation and measurement. Results from a case study are provided using a prototype of this new tool.     

Guest Editors' Introduction: Hot Chips 19

This special issue showcases articles written from five of the best presentations at the Hot Chips 19 conference, held in August 2007. The guest editors give highlights of the conference and introduce the articles, which cover the mobile-optimized northbridge of AMD's Griffin microprocessor family; the IBM z10 next-generation mainframe microprocessor; fault tolerance in IBM's Power6 microprocessor; NVIDIA's Tesla unified graphics and computing architecture; and SiBEAM's 4-Gbps 1080p-capable uncompressed HD A/V wireless 60-GHz transceiver chipset.     

Approximate factorization of multivariate polynomials using singular value decomposition

We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficients that contain numerical noise. Our algorithms are based on a generalization of the differential forms introduced by W. Ruppert and S. Gao to many variables, and use singular value decomposition or structured total least squares approximation and Gauss–Newton optimization to numerically compute the approximate multivariate factors. We demonstrate on a large set of benchmark polynomials that our algorithms efficiently yield approximate factorizations within the coefficient noise even when the relative error in the input is substantial (10⁻³).     

Continuous State Dynamic Programming via Nonexpansive Approximation

This paper studies fitted value iteration for continuous state numerical dynamic programming using nonexpansive function approximators. A number of approximation schemes are discussed. The main contribution is to provide error bounds for approximate optimal policies generated by the value iteration algorithm.      

A generalized autocovariance least-squares method for Kalman filter tuning

This paper discusses a method for estimating noise covariances from process data. In linear stochastic state-space representations the true noise covariances are generally unknown in practical applications. Using estimated covariances a Kalman filter can be tuned in order to increase the accuracy of the state estimates. There is a linear relationship between covariances and autocovariance. Therefore, the covariance estimation problem can be stated as a least-squares problem, which can be solved as a symmetric semidefinite least-squares problem. This problem is convex and can be solved efficiently by interior-point methods. A numerical algorithm for solving the symmetric is able to handle systems with mutually correlated process noise and measurement noise.