Comparative Study On The Influence Of Mahalanobis Distance And Skin Color Range For Face Detection Using Adaboost.

This paper reports a comparative study on using Mahalanobis distance and skin color range to segment the skin Region

Real-time human detection in urban scenes: Local descriptors and classifiers selection with adaboost-like algorithms

This paper deals with the study of various implementations of the AdaBoost algorithm in order to address the issue of real-time pedestrian detection in images. We use gradient-based local descriptors and we combine them to form strong classifiers organized in a cascaded detector. We compare the original AdaBoost algorithm with two other boosting algorithms we developed. One optimizes the use of each selected descriptor to minimize the operations done in the image (method 1), leading to an acceleration of the detection process without any loss in detection performances. The second algorithm (method 2) improves the selection of the descriptors by associating to each of them a more powerful weak-learner – a decision tree built from the components of the whole descriptor – and by evaluating them locally. We compare the results of these three learning algorithms on a reference database of color images and we then introduce our preliminary results on the adaptation of this detector on infrared vision. Our methods give better detection rates and faster processing than the original boosting algorithm and also provide interesting results for further studies. 1

Cascaded Random Forest for Fast Object Detection ∗

Abstract. A Random Forest consists of several independent decision trees arranged in a forest. A majority vote over all trees leads to the final decision. In this paper we propose a Random Forest framework which incorporates a cascade structure consisting of several stages together with a bootstrap approach. By introducing the cascade, 99 % of the test images can be rejected by the first and second stage with minimal computational effort leading to a massively speeded-up detection framework. Three different cascade voting strategies are implemented and evaluated. Additionally, the training and classification speed-up is analyzed. Several experiments on public available datasets for pedestrian detection, lateral car detection and unconstrained face detection demonstrate the benefit of our contribution.

Cascaded Facial Detection Algorithms To Improve Recognition

The desire to be able to use computer programs to recognize certain biometric qualities of people have been desired by several different types of organizations. One of these qualities worked on and has achieved moderate success is facial detection and recognition. Being able to use computers to determine where and who a face is has generated several different algorithms to solve this problem with different benefits and drawbacks. At the backbone of each algorithm is the desire for it to be quick and accurate. By cascading face detection algorithms, accuracy can be improved but runtime will subsequently be increased. Neural networks, once trained, have the ability to quickly categorize objects and assign them identifiers. Combining cascaded face detectors and neural networks, a face in an image can be detected and recognized. In this paper, three different types of facial detection algorithms are combined in various configurations to test the accuracy of face detection at the cost of runtime. By feeding these faces into a convolution neural network, we can begin identifying who the person is

Enhanced Face Detection Based on Haar-Like and MB-LBP Features

The effective real-time face detection framework proposed by Viola and Jones gained much popularity due its computational efficiency and its simplicity. A notable variant replaces the original Haar-like features with MB-LBP (Multi-Block Local Binary Pattern) which are defined by the local binary pattern operator, both detector types are integrated into the OpenCV library. However, each descriptor and its evaluation method has its own set of strengths and setbacks. In this paper, an enhanced two-layer face detector composed of both Haar-like and MB-LBP features is presented. Haar-like features are employed as a coarse filter but with a new evaluation involving dual threshold. The already established MB-LBPs are arranged as the fine filter of the detector. The Gentle AdaBoost learning algorithm is deployed for the training of the proposed detector to reach the classification and performance potential. Experiments show that in the early stages of classification, Haar features with dual threshold are more discriminative than MB-LBP and original Haar-like features with respect to number of features required and computation. Benchmarking the proposed detector demonstrate overall 12% higher detection rate at 17% false alarm over using MB-LBP features singly while performing with ×3 speedup

Ear Contour Detection and Modeling Using Statistical Shape Models

Ear detection is an actively growing area of research because of its applications in human head tracking and biometric recognition. In head tracking, it is used to augment face detectors and to perform pose estimation. In biometric systems, it is used both as an independent modality and in multi-modal biometric recognition. The ear shape is the preferred feature used to perform detection because of its unique structure in both 2D color images and 3D range images. Ear shape models have also been used in literature to perform ear detection, but at a cost of a loss in information about the exact ear structure. In this thesis, we seek to address these issues in existing methods by a combination of techniques including Viola Jones Haar Cascades, Active Shape Models (ASM) and Dijkstra\u27s shortest path algorithm to devise a shape model of the ear using geometric parameters and mark an accurate contour around the ear using only 2D color images. The Viola Jones Haar Cascades classifier is used to mark a rectangular region around the ear in a left side profile image. Then a set of key landmark points around the ear including the ear outer helix, the ear anti-helix and the ear center is extracted using the ASM. This set of landmarks is then fed into Dijkstra\u27s shortest path algorithm which traces out the strongest edge between adjacent landmarks, to extract the entire ear outer contour, while maintaining a high computational efficiency

Designing a Visual Front End in Audio-Visual Automatic Speech Recognition System

Audio-visual automatic speech recognition (AVASR) is a speech recognition technique integrating audio and video signals as input. Traditional audio-only speech recognition system only uses acoustic information from an audio source. However the recognition performance degrades significantly in acoustically noisy environments. It has been shown that visual information also can be used to identify speech. To improve the speech recognition performance, audio-visual automatic speech recognition has been studied. In this paper, we focus on the design of the visual front end of an AVASR system, which mainly consists of face detection and lip localization. The front end is built upon the AVICAR database that was recorded in moving vehicles. Therefore, diverse lighting conditions and poor quality of imagery are the problems we must overcome. We first propose the use of the Viola-Jones face detection algorithm that can process images rapidly with high detection accuracy. When the algorithm is applied to the AVICAR database, we reach an accuracy of 89% face detection rate. By separately detecting and integrating the detection results from all different color channels, we further improve the detection accuracy to 95%. To reliably localize the lips, three algorithms are studied and compared: the Gabor filter algorithm, the lip enhancement algorithm, and the modified Viola-Jones algorithm for lip features. Finally, to increase detection rate, a modified Viola-Jones algorithm and lip enhancement algorithms are cascaded based on the results of three lip localization methods. Overall, the front end achieves an accuracy of 90% for lip localization