Linear reconstruction measure steered nearest neighbor classification framework

The linear reconstruction measure (LRM), which determines the nearest neighbors of the query sample in all known training samples by sorting the minimum L₂-norm error linear reconstruction coefficients, is introduced in this paper. The intuitive interpretation and mathematical proofs are presented to reveal the efficient working mechanism of LRM. Through analyzing the physical meaning of coefficients and regularization items, we find that LRM provides more useful information and advantages than the conventional similarity measure model which calculates the distance between two entities (i.e. conventional point-to-point, C-PtP). Inspired by the advantages of LRM, the linear reconstruction measure steered nearest neighbor classification framework (LRM-NNCF) is designed with eight classifiers according to different decision rules and models of LRM. Evaluation on several face databases and the experimental results demonstrate that these proposed classifiers can achieve greater performance than the C-PtP based 1-NNs and competitive recognition accuracy and robustness compared with the state-of-the-art classifiers.     

3D fingerprint reconstruction system using feature correspondences and prior estimated finger model

The paper studies a 3D fingerprint reconstruction technique based on multi-view touchless fingerprint images. This technique offers a solution for 3D fingerprint image generation and application when only multi-view 2D images are available. However, the difficulties and stresses of 3D fingerprint reconstruction are the establishment of feature correspondences based on 2D touchless fingerprint images and the estimation of the finger shape model. In this paper, several popular used features, such as scale invariant feature transformation (SIFT) feature, ridge feature and minutiae, are employed for correspondences establishment. To extract these fingerprint features accurately, an improved fingerprint enhancement method has been proposed by polishing orientation and ridge frequency maps according to the characteristics of 2D touchless fingerprint images. Therefore, correspondences can be established by adopting hierarchical fingerprint matching approaches. Through an analysis of 440 3D point cloud finger data (220 fingers, 2 pictures each) collected by a 3D scanning technique, i.e., the structured light illumination (SLI) method, the finger shape model is estimated. It is found that the binary quadratic function is more suitable for the finger shape model than the other mixed model tested in this paper. In our experiments, the reconstruction accuracy is illustrated by constructing a cylinder. Furthermore, results obtained from different fingerprint feature correspondences are analyzed and compared to show which features are more suitable for 3D fingerprint images generation.     

A distributed solution to the network reconstruction problem

It has been recently shown in Ren et al. (2010) that by collecting noise-contaminated time series generated by a coupled-oscillator system at each node of a network, it is possible to robustly reconstruct its topology, i.e. determine the graph Laplacian. Restricting ourselves to linear consensus dynamics over undirected communication networks, in this paper we introduce a new dynamic average consensus least-squares algorithm to locally estimate these time series at each node, thus making the reconstruction process fully distributed and more easily applicable in the real world. We also propose a novel efficient method for separating the off-diagonal entries of the reconstructed Laplacian, and examine several concepts related to the trace of the dynamic correlation matrix of the coupled single integrators, which is a distinctive element of our network reconstruction method. The theory is illustrated with examples from computer, power and transportation systems.     

基于灰度形态重构的颗粒图像分割方法

提出了一种基于距离变换、形态重构和分水岭算法的图像分割算法。将一幅图像通过距离变换得到距离灰度图,与形态重构算法结合,得到颗粒图像的标识点图,用标识点图对距离灰度图进行分割,再用分水岭变换对分割后的距离灰度图进行变换。试验表明,该算法能有效合理地解决粘连或者重叠颗粒等物体的分割。     

Multi-Wavelength vs. Binary Code Pattern Unwrapping in Fringe Projection Method

Phase extraction, phase unwrapping and phase to height conversion are consecutive steps within the fringe projection method for reconstruction of 3D objects. The procedure of determining discontinuities on the wrapped phase, resolving them and achieving the unwrapped phase is called phase unwrapping. A software system was developed that provides the ability to create many kinds of patterns with a verity of desirable properties suitable for different demands in fringe projection systems. In our previous work, an experimental study was reported based on a multi-wavelength unwrapping approach. In the following work, we implemented a new method called binary code pattern unwrapping that is based on time analysis. A comparison of the two unwrapping approaches in terms of resolution, quality, noise, depth accuracy, and computational cost is provided.     

基于前向预测策略的块正交匹配追踪算法研究

在块正交匹配追踪算法中,候选集匹配原子块的选择策略对信号重建具有重要作用,但是该算法在迭代选择原子块的过程中,每次选择当次最优迭代的原子块,并不能保证最终迭代性能是最优的。为此,提出一个基于前向预测的最优匹配原子块选择策略的块正交匹配追踪算法,通过预测原子块在未来迭代过程中的性能选择最优匹配的原子块。实验结果表明,与块正交匹配追踪算法相比,该算法的重建误差随前向预测参数的增大而减小。     

面向图像局部重建的梯度分析

在基于场方向导数的图像局部区域重建过程中,梯度计算对图像边缘的重建效果有很大影响。分析选择单向计算梯度分量的必要性,提出梯度计算的就近原则,对参与梯度分量单向计算的相邻点设置优先级,将缺损点与已知点之间的边缘特征反映在已知点的梯度中,进而影响重建过程,从而实现对图像中边缘特征的重建。实验结果表明,采用该梯度计算模式能有效改善对图像边缘特征的重建效果。     

支持依赖修复的热部署技术

热部署机制是主流应用服务器的典型功能之一。但是目前的应用服务器仅仅支持独立应用的热部署,并不能满足具有依赖注入的复杂企业级应用在线更新的需求。如果在线更新部分模块,会出现程序调用失效的问题,并会导致整个应用平台的失效。为了解决这个问题,介绍一种支持依赖修复的热部署技术。在首次部署应用的各模块时,用该技术建立模块之间的依赖关系。而在其更新时,通过查找依赖关系,找出受到更新影响的模块,修复依赖并进行局部的热部署,避免重启应用服务器的代价。最后通过实验表明,该热部署技术可以保证依赖注入下的应用正确性;在实际工程应用的场景下,该技术也能够大幅度提升应用服务器的性能和运行效率。