Francisco López-Ferreras

Road-Sign Detection and Recognition Based on Support Vector Machines

This paper presents an automatic road-sign detection and recognition system based on support vector machines (SVMs). In automatic traffic-sign maintenance and in a visual driver-assistance system, road-sign detection and recognition are two of the most important functions. Our system is able to detect and recognize circular, rectangular, triangular, and octagonal signs and, hence, covers all existing Spanish traffic-sign shapes. Road signs provide drivers important information and help them to drive more safely and more easily by guiding and warning them and thus regulating their actions. The proposed recognition system is based on the generalization properties of SVMs. The system consists of three stages: 1) segmentation according to the color of the pixel; 2) traffic-sign detection by shape classification using linear SVMs; and 3) content recognition based on Gaussian-kernel SVMs. Because of the used segmentation stage by red, blue, yellow, white, or combinations of these colors, all traffic signs can be detected, and some of them can be detected by several colors. Results show a high success rate and a very low amount of false positives in the final recognition stage. From these results, we can conclude that the proposed algorithm is invariant to translation, rotation, scale, and, in many situations, even to partial occlusions

An optimization on pictogram identification for the road-sign recognition task using SVMs

Pattern recognition methods are used in the final stage of a traffic sign detection and recognition system, where the main objective is to categorize a detected sign. Support vector machines have been reported as a good method to achieve this main target due to their ability to provide good accuracy as well as being sparse methods. Nevertheless, for complete data sets of traffic signs the number of operations needed in the test phase is still large, whereas the accuracy needs to be improved. The objectives of this work are to propose pre-processing methods and improvements in support vector machines to increase the accuracy achieved while the number of support vectors, and thus the number of operations needed in the test phase, is reduced. Results show that with the proposed methods the accuracy is increased 3-5% with a reduction in the number of support vectors of 50-70%.

Traffic sign shape classification evaluation I: SVM using distance to borders

This paper deals with the detection and classification of traffic signs in outdoor environments. The information provided by traffic signs on roads is very important for the safety of drivers. However, in these situations the illumination conditions can not be predicted, the position and the orientation of signs in the scene are not known and other objects can block the vision of them. For these reasons we have developed an extensive test set which includes all kind of signs. In an artificial vision system, the key to recognize traffic signs is how to detect them and identify their geometric shapes. So, in this work we propose a method that uses a technique based on support vector machines (SVMs) for the classification. The patterns generated by the vectors represent the distances to borders (DtB) of the objects candidate to be traffic signs. Experimental results show the effectiveness of the proposed method.

Traffic sign shape classification evaluation. Part II. FFT applied to the signature of blobs

In this paper we have developed a new algorithm of artificial vision oriented to traffic sign shape classification. The classification method basically consists of a series of comparison between the FFT of the signature of a blob and the FFT of the signatures of the reference shapes used in traffic signs. The two major steps of the process are: the segmentation according to the color and the identification of the geometry of the candidate blob using its signature. The most important advances are its robustness against rotation and deformation due to camera projections.

Transient modeling by matching pursuits with a wavelet dictionary for parametric audio coding

In this letter, we propose a novel matching pursuit-based method for transient modeling with application to parametric audio coding. The overcomplete dictionary for the matching pursuit is composed of wavelet functions that implement a wavelet-packet filter bank. The proposed transient modeling method is suitable to be integrated into a parametric audio coder based on the three-part model of sines, transients, and noise (STN model). Comparative analysis between wavelet and exponentially damped sinusoidal functions are shown in experimental results. The mean-squared-error performance of the proposed approach is better than that obtained with damped sinusoids.

Application of Fisher Linear Discriminant Analysis to Speech/Music Classification

This paper proposes the application of Fisher linear discriminants to the problem of speech/music classification. Fisher linear discriminants can classify between two different classes, and are based on the calculation of some kind of centroid for the training data corresponding with each one of these classes. Based on that information a linear boundary is established, which will be used for the classification process. Some results will be given demonstrating the superior behavior of this classification algorithm compared with the well-known K-nearest neighbor algorithm. It will also be demonstrated that it is possible to obtain very good results in terms of probability of error using only one feature extracted from the audio signal, being thus possible to reduce the complexity of this kind of systems in order to implement them in real-time

Multilayer perceptrons applied to traffic sign recognition tasks

The work presented in this paper suggests a Traffic Sign Recognition (TSR) system whose core is based on a Multilayer Perceptron (MLP). A pre-processing of the traffic sign image (blob) is applied before the core. This operation is made to reduce the redundancy contained in the blob, to reduce the computational cost of the core and to improve its performance. For comparison purposes, the performance of the a statistical method like the k-Nearest Neighbour (k-NN) is included. The number of hidden neurons of the MLP is studied to obtain the value that minimizes the total classification error rate. Once obtained the best network size, the results of the experiments with this parameter show that the MLP achieves a total error probability of 3.85%, which is almost the half of the best obtained with the k-NN.

Feature Selection for Sound Classification in Hearing Aids Through Restricted Search Driven by Genetic Algorithms

Hearing loss may disqualify many people from leading a normal life, though the majority do not make use of hearing aids. This is because most hearing aids on the market cannot automatically adapt to the changing acoustical environment the user faces daily. This paper focuses on the development of an automatic sound classifier for digital hearing aids that aims to enhance listening comprehension when the user goes from one sound environment to another. Given the strong complexity constraints of these devices, reducing the number of signal-describing features which feed the automatic classifier is of great importance and becomes a challenging topic. Thus, the use of genetic algorithms with restricted search is explored for the mentioned feature selection. In an effort to evaluate its performance, the algorithm is compared with a standard unconstrained genetic algorithm and with sequential methods. The restricted search driven by the implemented genetic algorithm performs better than both the sequential methods and unconstrained genetic algorithms. It thus allows a subset of signal-describing features with lower cardinality to be selected. This may permit these selected features to be programmed on the digital signal processor that the hearing aid is based on, and to make efficient use of its limited computational facilities.

Fast Communication: Computational load reduction in decision functions using support vector machines

A new method of reducing the computational load in decision functions provided by a support vector classification machine is studied. The method exploits the geometrical relations when the kernels used are based on distances to obtain bounds of the remaining decision function and avoids to continue calculating kernel operations when there is no chance to change the decision. The method proposed achieves savings in operations of 25-90% whilst keeping the same accuracy. Although the method is explained for support vector machines, it can be applied to any kernel binary classifier that provides a similar evaluation function.

Study of Two Error Functions to Approximate the Neyman–Pearson Detector Using Supervised Learning Machines

A study of the possibility of approximating the Neyman-Pearson detector using supervised learning machines is presented. Two error functions are considered for training: the sum-of-squares error and the Minkowski error with R = 1. The study is based on the calculation of the function the learning machine approximates to during training, and the application of a sufficient condition previously formulated. Some experiments about signal detection using neural networks are also presented to test the validity of the study. Theoretical and experimental results demonstrate, on one hand, that only the sum-of-squares error is suitable to approximate the Neyman-Pearson detector and, on the other hand, that the Minkowski error with R = 1 is suitable to approximate the minimum probability of error classifier.