What's wrong with the murals at the Mogao Grottoes : a near-infrared hyperspectral imaging method

Although a significant amount of work has been performed to preserve the ancient murals in the Mogao Grottoes by Dunhuang Cultural Research, non-contact methods need to be developed to effectively evaluate the degree of flaking of the murals. In this study, we propose to evaluate the flaking by automatically analyzing hyperspectral images that were scanned at the site. Murals with various degrees of flaking were scanned in the 126th cave using a near-infrared (NIR) hyperspectral camera with a spectral range of approximately 900 to 1700 nm. The regions of interest (ROIs) of the murals were manually labeled and grouped into four levels: normal, slight, moderate, and severe. The average spectral data from each ROI and its group label were used to train our classification model. To predict the degree of flaking, we adopted four algorithms: deep belief networks (DBNs), partial least squares regression (PLSR), principal component analysis with a support vector machine (PCA + SVM) and principal component analysis with an artificial neural network (PCA + ANN). The experimental results show the effectiveness of our method. In particular, better results are obtained using DBNs when the training data contain a significant amount of striping noise

FACE RECOGNITION – MACHINE LEARNING HIGHWAY TO EFFICIENCY

Face recognition describes the automated computer managed human face recognition on digital media, image or video. Even though started in the 1960’s, the hype surrounding face recognition nowadays is more increasing, partially because of security applications it could provide and reduce possible security oriented threats. This paper is going to show directions of recent research in this fi eld, with an accent on used algorithms, data sets for higher effi ciency, and an overview of predominantly used sensors. One of the concept that is introduced lately in the fi eld are various types of machine learning as means for creating more effi cient face recognition systems. By presenting diff erent approaches, possible directions are given for future research

OPTIMIZED BIOMETRIC SYSTEM BASED ON COMBINATION OF FACE IMAGES AND LOG TRANSFORMATION

The biometrics are used to identify a person effectively. In this paper, we propose optimised Face recognition system based on log transformation and combination of face image features vectors. The face images are preprocessed using Gaussian filter to enhance the quality of an image. The log transformation is applied on enhanced image to generate features. The feature vectors of many images of a single person image are converted into single vector using average arithmetic addition. The Euclidian distance(ED) is used to compare test image feature vector with database feature vectors to identify a person. It is experimented that, the performance of proposed algorithm is better compared to existing algorithms

NIRFaceNet: A Convolutional Neural Network for Near-Infrared Face Identification

Near-infrared (NIR) face recognition has attracted increasing attention because of its advantage of illumination invariance. However, traditional face recognition methods based on NIR are designed for and tested in cooperative-user applications. In this paper, we present a convolutional neural network (CNN) for NIR face recognition (specifically face identification) in non-cooperative-user applications. The proposed NIRFaceNet is modified from GoogLeNet, but has a more compact structure designed specifically for the Chinese Academy of Sciences Institute of Automation (CASIA) NIR database and can achieve higher identification rates with less training time and less processing time. The experimental results demonstrate that NIRFaceNet has an overall advantage compared to other methods in the NIR face recognition domain when image blur and noise are present. The performance suggests that the proposed NIRFaceNet method may be more suitable for non-cooperative-user applications

Dimensionality reduction based on determinantal point process and singular spectrum analysis for hyperspectral images

Dimensionality reduction is of high importance in hyperspectral data processing, which can effectively reduce the data redundancy and computation time for improved classification accuracy. Band selection and feature extraction methods are two widely used dimensionality reduction techniques. By integrating the advantages of the band selection and feature extraction, the authors propose a new method for reducing the dimension of hyperspectral image data. First, a new and fast band selection algorithm is proposed for hyperspectral images based on an improved determinantal point process (DPP). To reduce the amount of calculation, the dual-DPP is used for fast sampling representative pixels, followed by k-nearest neighbour-based local processing to explore more spatial information. These representative pixel points are used to construct multiple adjacency matrices to describe the correlation between bands based on mutual information. To further improve the classification accuracy, two-dimensional singular spectrum analysis is used for feature extraction from the selected bands. Experiments show that the proposed method can select a low-redundancy and representative band subset, where both data dimension and computation time can be reduced. Furthermore, it also shows that the proposed dimensionality reduction algorithm outperforms a number of state-of-the-art methods in terms of classification accuracy

MIMN-DPP: Maximum-information and minimum-noise determinantal point processes for unsupervised hyperspectral band selection

Band selection plays an important role in hyperspectral imaging for reducing the data and improving the efficiency of data acquisition and analysis whilst significantly lowering the cost of the imaging system. Without the category labels, it is challenging to select an effective and low-redundancy band subset. In this paper, a new unsupervised band selection algorithm is proposed based on a new band search criterion and an improved Determinantal Point Processes (DPP). First, to preserve the original information of hyperspectral image, a novel band search criterion is designed for searching the bands with high information entropy and low noise. Unfortunately, finding the optimal solution based on the search criteria to select a low-redundancy band subset is a NP-hard problem. To solve this problem, we consider the correlation of bands from both original hyperspectral image and its spatial information to construct a double-graph model to describe the relationship between spectral bands. Besides, an improved DPP algorithm is proposed for the approximate search of a low-redundancy band subset from the double-graph model. Experiment results on several well-known datasets show that the proposed optical band selection algorithm achieves better performance than many other state-of-the-art methods