Search

Abstract Face detection plays an important role in many computer vision applications. In recent years, much research has focused on extending the well-established Adaboost face detector algorithm for multi-view face detection. However, detecting in-plane and out-of-plane rotated faces simultaneously is still a challenging task today. In this paper, a very robust multi-view face detection algorithm, with its core functionality based on frontal face detection, is proposed to simultaneously detect in-plane and out-of-plane rotated faces. Moreover, only the training data in the frontal face is needed and we do not require the training data from different in-plane or out-of-plane rotation angles. In the proposed algorithm, first, techniques such as the skin filter and entropy rate superpixels (ERSs) are applied to obtain face candidates. Then, angle compensation and refinement are applied to improve the accuracy of face detection in the in-plane case. Moreover, the symmetry extension technique, i.e., extending the face candidate with its flipped version to create a face similar to the frontal one, is applied to detect out-of-plane faces without the need of training data. Simulations on the FEI, Pointing'04, BaoFace, Group, Utrecht, and WWW datasets demonstrate the proposed algorithm's effectiveness and superior performance as compared to state-of-the-art face detection methods. Graphical abstract Unlabelled Image Highlights • We detect in-plane and out-of-plane rotated faces by only the frontal face detector. • Training data from different in and out-of-plane rotation angles are not required. • Skin filters and ERSs can preserve the faces from different illumination and races. • Angle compensation computes the rotation angle for each rotated face. • Symmetry extension creates pseudo faces to well detect out-of-plane rotated faces. [ABSTRACT FROM AUTHOR]

This paper proposes a hierarchical multi-label matcher for patch-based face recognition. In signature generation, a face image is iteratively divided into multi-level patches. Two different types of patch divisions and signatures are introduced for 2D facial image and texture-lifted image, respectively. The matcher training consists of three steps. First, local classifiers are built to learn the local matching of each patch. Second, the hierarchical relationships defined between local patches are used to learn the global matching of each patch. Three ways are introduced to learn the global matching: majority voting, ℓ 1 -regularized weighting, and decision rule. Last, the global matchings of different levels are combined as the final matching. Experimental results on different face recognition tasks demonstrate the effectiveness of the proposed matcher at the cost of gallery generalization. Compared with the UR2D system, the proposed matcher improves the Rank-1 accuracy significantly by 3% and 0.18% on the UHDB31 dataset and IJB-A dataset, respectively. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel 2D homography computation method based on two real points. The homography is thus decomposed into three parts. The two real points and their images can be utilized to compute the first and the last parts respectively, while other primitives (could be point(s), line(s) and conic) can be utilized to compute the middle part which is a hyperbolic similarity transformation. We introduce the proposed method in a 2D pattern with a conic and a coplanar line, and apply the method in various other geometric patterns. Subsequently, many plane-based vision tasks, such as camera calibration, pose estimation and metric rectification can be solved in a unified way as polynomial systems. The experiments with simulated and real data verify the correctness and the versatility of our algorithm. [ABSTRACT FROM AUTHOR]

Robust detection of infrared dim and small target contributes significantly to the infrared systems in many applications. Due to the diversity of background scene and unique characteristic of target, the detection of infrared targets remains a challenging problem. In this paper, a novel approach based on total variation regularization and principal component pursuit (TV-PCP) is presented to deal with this problem. The principal component pursuit model only considers the low-rank feature of background images, which will result in poor detection ability in non-uniform and non-smooth scenes. We take into account the total variation regularization term to thoroughly describe background feature, which can achieve good detection result as well as good background estimation result. Firstly, the input infrared image is transformed to a patch image model. Secondly, the TV-PCP model is presented on the patch image. An effective optimization algorithm is proposed to solve this model. Experiments on six real datasets show that the proposed method has superior detection ability under various backgrounds, especially with good background suppression performance and low false alarm rate. [ABSTRACT FROM AUTHOR]

This paper presents a new set of three-dimensional rotation invariant texture descriptors based on the well-known local binary patterns (LBPs). In the approach proposed here, we extend an existing three-dimensional LBP based on the region growing algorithm using existing features developed exquisitely for two-dimensional LBPs (pixel intensities and differences). We have conducted experiments on a synthetic dataset of three-dimensional randomly rotated texture images in order to evaluate the discriminatory power and the rotation invariant properties of our descriptors as well as those of other two-dimensional and three-dimensional texture descriptors. Our results demonstrate the effectiveness of the extended LBPs and improvements against other state-of-the-art hand-crafted three-dimensional texture descriptors on this dataset. Furthermore, we prove that the extended LBPs can be used in medical datasets to discriminate between MR images of oxygenated and non-oxygenated brain tissues of newborn babies. [ABSTRACT FROM AUTHOR]

Pedestrian detection is an important image understanding problem with many potential applications. There has been little success in creating an algorithm which exhibits a high detection rate while keeping the false alarm in a relatively low rate. This paper presents a method designed to resolve this problem. The proposed method uses the Kinect or any similar type of sensors which facilitate the extraction of a distinct foreground. Then potential regions, which are candidates for the presence of human(s), are detected by employing the widely used Histogram of Oriented Gradients (HOG) technique, which performs well in terms of good detection rates but suffers from significantly high false alarm rates. Our method applies a sequence of operations to eliminate the false alarms produced by the HOG detector based on investigating the fine details of local shape information. Local shape information can be identified by efficient utilization of the edge points which, in this work, are used to formulate the so called Shape Context (SC) model. The proposed detection framework is divided in four sequential stages, with each stage aiming at refining the detection results of the previous stage. In addition, our approach employs a pre-evaluation stage to pre-screen and restrict further detection results. Extensive experimental results on the dataset created by the authors, involves 673 images collected from 11 different scenes, demonstrate that the proposed method eliminates a large percentage of the false alarms produced by the HOG pedestrian detector. [ABSTRACT FROM AUTHOR]

This paper proposes a novel method to address the registration of images with affine transformation. Firstly, the Maximally Stable Extremal Region (MSER) detection method is performed on the reference image and the image to be registered, respectively. And the coarse affine transformation matrix between the two images is estimated by the matched MSER pairs. Two circular regions containing roughly the same image content are also obtained by fitting and normalizing the centroids of the matched MSERs from the two images. Secondly, a scale invariant and approximate affine transformation invariant feature point detection algorithm based on the Gabor filter decomposition and phase congruency is performed on the two coarsely aligned regions, and two feature point sets are achieved, respectively. Finally, the affine transformation matrix between the two feature point sets is obtained by using a probabilistic point set registration algorithm, and the final affine transformation matrix between the reference image and the image to be registered is achieved according to the coarse affine transformation matrix and the affine transformation matrix between the two feature point sets. Several sets of experiments demonstrate that our proposed method performs competitively with the classical scale-invariant feature transform (SIFT) method for images with scale changes, and performs better than the traditional MSER and Affine-SIFT (ASIFT) methods for images with affine distortions. Moreover, the proposed method shows higher computation efficiency and robustness to illumination change than some existing area-based or feature-based methods do. [ABSTRACT FROM AUTHOR]

Nowadays, the technology of using computer vision to calibrate objects is widely used, which has a huge market demand in many fields. This paper provides a calibration method of computer vision system based on dual attention neural network. This paper uses the camera to simulate human eyes to obtain three-dimensional images. After obtaining the three-dimensional images, the images are input into the Residual Network (ResNet) model, and the weight of ResNet is repeatedly updated so as to accurately identify the images. On this basis, introduces dual attention mechanism that an algorithm is used in natural language to the visual image processing, using multistage feature extraction method to extract the three-dimensional image for each characteristic of regional. After extracting the feature area, the accuracy of the feature area is constantly updated to the minimum. Besides, the feature areas are brought into the calibration algorithm of Zhang Zhengyou system to obtain the spatial coordinates of the objects in the attention area. This method can realize the space position calibration of specific objects under various complex backgrounds and calculate the distance from the calibrated objects, which can not only calibrate the system but also identify it, and greatly improve the reliability and accuracy of the calibration process. • The dual attention model realizes object calibration in complex background. • The dual attention mechanism can be used to calibrate and identify the system. • The proposed algorithm makes the calibration error less than 0.1%. • The algorithm is used to identify and calibrate parking space. [ABSTRACT FROM AUTHOR]

Superpixel is one of the most popular image over-segmentations with broad applications in the computer vision field to reduce their computations by replacing pixels as primitives. The main concerns of one superpixel generation algorithm are its accuracy and efficiency. One of the most important things in superpixel accuracy is to fit the image boundaries tightly with a few pixels as possible (namely minimal contour density, which is measured by the percent of superpixel contour pixels in the whole image). In this paper, we propose a new fast algorithm based on the clustering method to produce superpixels accurately with low contour density. First, we adopt the linear path from a pixel to one superpixel seed to define a regular term and propose a new distance measurement between them. In addition, we introduce the gradient and Local Binary Pattern (LBP) features and propose formulas of parameters in the proposed method adaptively. In this way, we can use the new distance measurement to group pixels as initial regions adaptively and produce the final superpixels by merging those small ones. Finally, we test the new algorithm on two public datasets and compare it with the state-of-the-art. Our method can generate superpixels with lower contour density while being competitive in accuracy and computational time. [ABSTRACT FROM AUTHOR]