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.     

Ensemble clustering by means of clustering embedding in vector spaces

Ensemble clustering is a recently evolving research direction in cluster analysis and has found several different application domains. In this work the complex ensemble clustering problem is reduced to the well-known Euclidean median problem by clustering embedding in vector spaces. The Euclidean median problem is solved by the Weiszfeld algorithm and an inverse transformation maps the Euclidean median back into the clustering domain. In the experiment study different evaluation strategies are considered. The proposed embedding strategy is compared to several state-of-art ensemble clustering algorithms and demonstrates superior performance.     

Continuous Levels‐of‐Detail and Visual Abstraction for Seamless Molecular Visualization

Molecular visualization is often challenged with rendering of large molecular structures in real time. We introduce a novel approach that enables us to show even large protein complexes. Our method is based on the level‐of‐detail concept, where we exploit three different abstractions combined in one visualization. Firstly, molecular surface abstraction exploits three different surfaces, solvent‐excluded surface (SES), Gaussian kernels and van der Waals spheres, combined as one surface by linear interpolation. Secondly, we introduce three shading abstraction levels and a method for creating seamless transitions between these representations. The SES representation with full shading and added contours stands in focus while on the other side a sphere representation of a cluster of atoms with constant shading and without contours provide the context. Thirdly, we propose a hierarchical abstraction based on a set of clusters formed on molecular atoms. All three abstraction models are driven by one importance function classifying the scene into the near‐, mid‐ and far‐field. Moreover, we introduce a methodology to render the entire molecule directly using the A‐buffer technique, which further improves the performance. The rendering performance is evaluated on series of molecules of varying atom counts.     

TWO-STEP MECHANISM IN HETEROGENEOUS CATALYSIS AND DYNAMIC ANALYSIS

Recent development of the dynamic analysis technique has made it possible to measure separately kinetic parameters of a catalytic reaction as well as to study the effect of catalyst preparation parameters. But its application is still limned to first-order reaction. This work is aimed to demonstrate in some detail that,by comparison of the reaction rate expressions with the two-step mechanism used in catalytic kinetics and dynamic analysis, these methods can be extended to non-first-order reaction, and the kinetic parameters measured by dynamic techniques are interpreted for different reaction mechanisms.     

污水处理厂PPP项目优选研究

如何在众多污水处理厂PPP项目中挑选出风险低、回报适宜的优质项目不仅是社会资本方关注的重点,也是推动PPP项目顺利开展的关键。从社会资本方的角度出发,建立政府能力及环境、项目特征、项目影响3个方面的较为完善的污水处理厂PPP项目评价体系,采用聚类分析法从类别内、类别间两方面综合计算专家权重,以此修正AHP法确定的指标权重,并结合TOPSIS模型对众多污水处理厂PPP项目进行比较,优选出最适宜投资的项目。通过实例验证,此方法可行、有效,且社会资本方对项目特征、政府能力及环境两方面非常重视。     

New results on PWARX model identification based on clustering approach

This paper deals with the problem of piecewise auto regressive systems with exogenous input(PWARX) model identification based on clustering solution. This problem involves both the estimation of the parameters of the affine sub-models and the hyper planes defining the partitions of the state-input regression. The existing identification methods present three main drawbacks which limit its effectiveness. First, most of them may converge to local minima in the case of poor initializations because they are based on the optimization using nonlinear criteria. Second, they use simple and ineffective techniques to remove outliers. Third, most of them assume that the number of sub-models is known a priori. To overcome these drawbacks, we suggest the use of the density-based spatial clustering of applications with noise(DBSCAN) algorithm. The results presented in this paper illustrate the performance of our methods in comparison with the existing approach. An application of the developed approach to an olive oil esterification reactor is also proposed in order to validate the simulation results.     

A DISTANCE MEASURE FOR CLASSIFYING ARIMA MODELS

Abstract. In a number of practical problems where clustering or choosing from a set of dynamic structures is needed, the introduction of a distance between the data is an early step in the application of multivariate statistical methods. In this paper a parametric approach is proposed in order to introduce a well-defined metric on the class of autoregressive integrated moving-average (ARIMA) invertible models as the Euclidean distance between their autoregressive expansions. Two case studies for clustering economic time series and for assessing the consistency of seasonal adjustment procedures are discussed. Finally, some related proposals are surveyed and some suggestions for further research are made.     

到达数据中时空异常聚簇发现

在时空数据中有一类表示用户在某一时间到达某一地点的数据——到达数据,到达数据可以是社交网站的签到数据、轨迹数据中的停留点及公共交通中乘客抵达的位置数据,这些数据的聚簇可以反映用户的聚集行为.基于到达数据,提出一类新的时空数据查询——时空异常聚簇发现.将到达数据进行周期性划分,通过时空聚类算法对一个时间段的数据进行聚类,比较不同时间段内聚簇的差异度,发现具有最大簇异常度的前k个簇.通过该查询发现的时空异常聚簇可以应用于城市安全管理、基于位置的服务和交通调度等方面.定义了异常簇查询模型,提出了针对任意形状聚簇的簇差异度度量,将异常簇查询转化为二分图最大匹配问题,对二分图构建与匹配进行了优化并提出了高效的查询算法.利用真实数据集进行了充分实验,验证了查询结果的实际意义,评估了所提出的各查询算法在不同参数设置下的查询效率.     

基于密度调整的改进自适应谱聚类算法

针对谱聚类存在构造相似度矩阵时对尺度参数敏感以及处理多重尺度数据集效果不理想的缺陷, 提出一种基于密度调整的改进自适应谱聚类算法. 该算法将样本点所处领域的密度引入谱聚类, 利用密度差来调整样本点之间的相似度, 使其更符合实际簇类中样本点间的内在关系, 在一定程度上解决了多尺度聚类问题; 同时, 通过样本点的近邻距离自适应得到尺度参数, 使算法对尺度参数相对不敏感. 仿真实验验证了所提出算法的有效性和优越性.

     

基于稀疏流形聚类嵌入模型和L1范数正则化的标签错误检测

综合利用含错标签中的有用信息和数据结构中蕴含的鉴别信息,提出一种基于稀疏流形聚类嵌入模型和L1范数正则化的标签错误检测修正方法.首先,用稀疏流形聚类嵌入模型将数据投影到易分类的空间,利用标注正确的极少量样本和最近邻分类器获得新标签;然后,构造标签错误检测模型,获得仅含0、1元素的检测向量,正确、错误的标签分别对应着1、0的位置;最后,给出了相应的优化算法及收敛证明,并在相关实验上验证了算法的有效性.