Search

To better understand driver behavior, the Federal Highway Administration and the National Highway Traffic Safety Administration have collected several thousands of hours of driver video. There is now an immediate need for devising automated procedures for analyzing the video. In this paper, we look at the problem of estimating driver pose given a video of the driver as he or she drives the vehicle. A complete system is proposed to perform feature extraction and classification of each frame. The system uses a Fisherface representation of video frames and a nearest neighbor and neural network classification scheme. Experimental results show that the system can achieve high accuracy and reliable performance. Index Terms--Classification, driver pose estimation, eigenfaces, fisherfaces, neural networks, video.

This paper presents an analysis of a random access memory (RAM)-based associative memory which uses a weighted voting scheme for information retrieval. This weighted voting memory can operate in heteroassociative or autoassociative mode, can store both real-valued and binary-valued patterns and, unlike memory models, is equipped with a rejection mechanism. A theoretical analysis of the performance of the weighted voting memory is given for the case of binary and random memory sets. Performance measures are derived as a function of the model parameters: pattern size, window size, and number of patterns in the memory set. It is shown that the weighted voting model has large capacity and error correction. The results show that the weighted voting model can successfully achieve high-detection and -identification rates and, simultaneously, low-false-acceptance rates. Index Terms--Associative memory, capacity, neural network, retrieval, voting, weighted voting.

Discrete-time/discrete-state recurrent neural networks are analyzed from a dynamical Boolean systems point of view in order to devise new analytic and design methods for the class of both single and multilayer recurrent artificial neural networks. With the proposed dynamical Boolean systems analysis, we are able to formulate necessary and sufficient conditions for network stability which are more general than the well-known but restrictive conditions for the class of single layer networks: 1) symmetric weight matrix with 2) positive diagonal and 3) asynchronous update. In terms of design, we use a dynamical Boolean systems analysis to construct a high performance associative memory. With this Boolean memory, we can guarantee that all fundamental memories are stored, and also guarantee the size of the basin of attraction for each fundamental memory. Index Terms - Associative memory, Boolean systems, Hamming memory, Lyapunov function, recurrent neural networks, stability, state space.

The purpose of this work is to utilize the ideas of artificial neural networks to propose new solution methods for a class of constrained mixed-integer optimization problems. These new solution methods are more suitable to parallel implementation than the usual sequential methods of mathematical programming. Another attractive feature of the proposed approach is that some mechanisms of global search may be easily incorporated into the computation, producing results which are more globally optimal. To formulate the method of solution proposed in this work, a penalty function approach is used to define a coupled gradient-type network with an appropriate architecture, energy function, and dynamics such that high quality solutions may be obtained upon convergence of the dynamics. Finally, it is shown how the coupled gradient net may be extended to handle temporal mixed-integer optimization problems, and simulations are presented which demonstrate the effectiveness of the approach.

This paper presents an analysis of a random access memory (RAM)-based associative memory which uses a weighted voting scheme for information retrieval. This weighted voting memory can operate in heteroassociative or autoassociative mode, can store both real-valued and binary-valued patterns and, unlike memory models, is equipped with a rejection mechanism. A theoretical analysis of the performance of the weighted voting memory is given for the case of binary and random memory sets. Performance measures are derived as a function of the model parameters: pattern size, window size, and number of patterns in the memory set. It is shown that the weighted voting model has large capacity and error correction. The results show that the weighted voting model can successfully achieve high-detection and -identification rates and, simultaneously, low-false-acceptance rates. [ABSTRACT FROM AUTHOR]