A Fully Continuous Supercritical Fluid Extraction System for Contaminated Soil

A fully continuous lab scale supercritical fluid extraction system has been designed, built and tested. The system continuously pumps carbon dioxide under supercritical conditions and soil slurry into a counter‐current contacting column. Delhi Loamy Sand, spiked with approximately 10 mg/g of naphthalene, was used as the testing soil. The soil slurry ranged from 0.0028 g dry soil per g slurry to 0.072 g/g. The operating temperature was 43°C and the operating pressure was 7.7 MPa. Near steady state, fully continuous flow was achieved with runs lasting as long as 2 h. All carbon dioxide samples contained measurable quantities of naphthalene and the measured mass transfer coefficients were as high as 4.6×10^?4 s^?1.     

Nighttime face recognition at large standoff: Cross-distance and cross-spectral matching

Face recognition in surveillance systems is important for security applications, especially in nighttime scenarios when the subject is far away from the camera. However, due to the face image quality degradation caused by large camera standoff and low illuminance, nighttime face recognition at large standoff is challenging. In this paper, we report a system that is capable of collecting face images at large standoff in both daytime and nighttime, and present an augmented heterogeneous face recognition (AHFR) approach for cross-distance (e.g., 150 m probe vs. 1 m gallery) and cross-spectral (near-infrared probe vs. visible light gallery) face matching. We recover high-quality face images from degraded probe images by proposing an image restoration method based on Locally Linear Embedding (LLE). The restored face images are matched to the gallery by using a heterogeneous face matcher. Experimental results show that the proposed AHFR approach significantly outperforms the state-of-the-art methods for cross-spectral and cross-distance face matching.     

Fast and robust face recognition via coding residual map learning based adaptive masking

Robust face recognition (FR) is an active topic in computer vision and biometrics, while face occlusion is one of the most challenging problems for robust FR. Recently, the representation (or coding) based FR schemes with sparse coding coefficients and coding residual have demonstrated good robustness to face occlusion; however, the high complexity of l₁-minimization makes them less useful in practical applications. In this paper we propose a novel coding residual map learning scheme for fast and robust FR based on the fact that occluded pixels usually have higher coding residuals when representing an occluded face image over the non-occluded training samples. A dictionary is learned to code the training samples, and the distribution of coding residuals is computed. Consequently, a residual map is learned to detect the occlusions by adaptive thresholding. Finally the face image is identified by masking the detected occlusion pixels from face representation. Experiments on benchmark databases show that the proposed scheme has much lower time complexity but comparable FR accuracy with other popular approaches.     

Multi-resolution feature fusion for face recognition

For face recognition, image features are first extracted and then matched to those features in a gallery set. The amount of information and the effectiveness of the features used will determine the recognition performance. In this paper, we propose a novel face recognition approach using information about face images at higher and lower resolutions so as to enhance the information content of the features that are extracted and combined at different resolutions. As the features from different resolutions should closely correlate with each other, we employ the cascaded generalized canonical correlation analysis (GCCA) to fuse the information to form a single feature vector for face recognition. To improve the performance and efficiency, we also employ “Gabor-feature hallucination”, which predicts the high-resolution (HR) Gabor features from the Gabor features of a face image directly by local linear regression. We also extend the algorithm to low-resolution (LR) face recognition, in which the medium-resolution (MR) and HR Gabor features of a LR input image are estimated directly. The LR Gabor features and the predicted MR and HR Gabor features are then fused using GCCA for LR face recognition. Our algorithm can avoid having to perform the interpolation/super-resolution of face images and having to extract HR Gabor features. Experimental results show that the proposed methods have a superior recognition rate and are more efficient than traditional methods.     

西石门铁矿南区崩落卸压采矿法试验及应用效果

在缓倾斜中厚矿体底板岩性不稳固的条件下，采用有底柱崩落法，由于电耙道大多处于空区边部应力集中的部位，致使堑沟及底部结构巷道破坏严重而使回收率极低，采用无底柱崩落卸压则可有效解决上述难题。本文简要介绍该方法的原理、方案结构、安全措施及应用效果，供借鉴。     

综采工作面初采初放期间矿压显现规律分析与总结

2903综采工作面是城郊煤矿二水平第一个单顺槽沿空掘巷综采工作面。项目针对该工作面初采、初放期间的矿压显现规律进行了数据采集、分析和总结。     

基于曲面形变的三维人脸样本配准

三维人脸样本是人脸识别、人脸动画等领域进行模型训练、算法设计及性能比较的重要数据平台。为了提高三维人脸样本的配准效果和配准速度,提出一种基于曲面变形的三维人脸样本配准方法。该方法通过对标准化样本实施一系列的变形操作来建立原始样本与标准样本之间的对应关系。然后基于该对应关系对原始样本进行配准处理,在处理过程中使用统计方法对样本上的毛刺点和空洞进行修补。实验结果表明,使用该方法可以快速、有效地对不同格式的原始样本进行配准。     

联合 LTP 和 LPQ 的人脸识别方法

提出一种联合局部三值模式（LTP）和局部相位量化（LPQ）的人脸识别方法,该方法首先对预处理后的人脸分别采用LTP算子、LPQ算子提取各自的直方图,然后,通过特征选择将两者联合为LTP＿LPQ直方图,最后通过最近邻分类器进行分类识别。在ORL和YALE标准人脸数据库上的实验表明,该方法能有效地提高人脸的识别率。     

基于OpenCV 的智能相册系统

为了对日益增多的数码照片进行有效管理,提出并设计一种可以对大量数码照片进行智能分类的相册管理系统. 关键技术包括照片附加信息提取、人脸检测、人脸标注、人脸识别和特征匹配,主要通过OpenCV 视觉库有效实现. 实验表明,该系统可以有效全自动的实现时间分类和人数分类,并通过人机交互的方式半自动实现人物分类和场景分类,有较高的实用价值.     

Adaptive Face Recognition via Structed Representation

In this paper, we propose a face recognition approach-Structed Sparse Representation-based classification when the measurement of the test sample is less than the number training samples of each subject. When this condition is not satisfied, we exploit Nearest Subspaee approach to classify the test sample. In order to adapt all the eases, we combine the two approaches to an adaptive classification method-Adaptive approach. The adaptive approach yields greater recognition accuracy than the SRC approach and CRC_RLS approach with low ~ample rate on the Extend Yale B dataset. And it is more efficient than other two approaches.