Extended minimum-squared error algorithm for robust face recognition via auxiliary mirror samples

The changes of face images with poses and polarized illuminations increase data uncertainty in face recognition. In fact, synthesized mirror samples can be recognized as representations of the left–right deflection of poses or illuminations of the face. Symmetrical face images generated from the original face images also provide more observations of the face which is useful for improving the accuracy of face recognition. In this paper, to the best of our knowledge, it is the first time that the well-known minimum squared error classification (MSEC) algorithm is used to perform face recognition on an extended face database using synthesized mirror training samples, which is titled as extended minimum squared error classification (EMSEC). By modifying the MSE classification rule, we append the mirror samples to the training set for gaining better classification performance. First, we merge original training samples and mirror samples synthesized from original training samples per subject as mixed training samples. Second, EMSEC algorithm exploits mixed training samples to obtain the projection matrix that can best transform the mixed training samples into predefined class labels. Third, the projection matrix is exploited to simultaneously obtain transform results of the test sample and its nearest neighbor from the mixed training sample set. Finally, we ultimately classify the test sample by combining the transform results of the test sample and the nearest neighbor. As an extension of MSEC, EMSEC reduces the uncertainty of the face observation by auxiliary mirror samples, so that it has better robustness classification performance than traditional MSEC. Experimental results on the ORL, GT, and FERET databases show that EMSEC has better generalization ability than traditional MSEC.     

Image inpainting algorithm based on TV model and evolutionary algorithm

With the development of modern image processing techniques, the numbers of images increase at a high speed in network. As a new form of visual communication, image is widely used in network transmission. However, the image information would be lost after transmission. In view of this, we are motivated to restore the image to make it complete in an effective and efficient way in order to save the network bandwidth. At present, there are two main methods for digital image restoration, texture-based method and non-textured-based method. In the texture-based method, Criminisi algorithm is a widely used algorithm. However, the inaccurate completion order and the inefficiency in searching matching patches are two main limitations of Criminisi algorithm. To overcome these shortcomings, in this paper, an exemplar image completion based on evolutionary algorithm is proposed. In the non-textured-based method, total variation method is a typical algorithm. An improved total variation algorithm is proposed in this paper. In the improved algorithm, the diffusion coefficients are defined according to the distance and direction between the damaged pixel and its neighborhood pixel. Experimental results show that the proposed algorithms have better general performance in image completion. And these two new algorithms could improve the experience of network surfing and reduce the network communication cost.     

Experimental study of stable surfaces for anti-slug control in multi-phase flow

Severe slugging flow is always challenging in oil & gas production, especially for the current offshore based production. The slugging flow can cause a lot of problems, such as those relevant to production safety, fatigue as well as capability. As one typical phenomenon in multi-phase flow dynamics, the slug can be avoided or eliminated by proper facility design or control of operational conditions. Based on a testing facility which can emulate a pipeline-riser or a gas-lifted production well in a scaled-down manner, this paper experimentally studies the correlations of key operational parameters with severe slugging flows. These correlations are reflected through an obtained stable surface in the parameter space, which is a natural extension of the bifurcation plot. The maximal production opportunity without compromising the stability is also studied. Relevant studies have already showed that the capability, performance and efficiency of anti-slug control can be dramatically improved if these stable surfaces can be experimentally determined beforehand. The paper concludes that obtaining the stable surface on the new developed map can significantly improve the production rate in a control scheme. Even though the production rate can be further improved by moving the stable surface using advanced control strategies, the constant inputs can in some cases be preferable due to the easier implementation.     

Generation of GHZ states with invariant-based shortcuts

A scheme is proposed to generate three-atom GHZ states by applying the inversely engineered control method on the basis of Lewis–Riesenfeld invariants. In the proposal, three atoms that have different configurations are trapped in a bimodal cavity. Numerical simulations indicate that our protocol has an obvious improvement of speed for the generation of GHZ states. Moreover, the present scheme is robust against both parameter fluctuations and dissipation.     

(<Emphasis Type="Italic">m</Emphasis>,<Emphasis Type="Italic">N</Emphasis>)-delay-partitioning approach to stability analysis for T-S fuzzy systems with interval time-varying delay

This paper is concerned with improved stability criteria for uncertain T-S fuzzy systems with interval time-varying delay by means of a new (m,N)-delay-partitioning approach. Based on an appropriate augmented LKF established in the framework of state vector augmentation, some tighter bounding inequalities (Seuret-Wirtinger’s integral inequality, Peng-Park’s integral inequality and the reciprocally convex approach) have been employed to deal with (time-varying) delay-dependent integral items of the derivative of LKF, therefore, less conservative delaydependent stability criteria can be obtained on account of none of any useful time-varying items are arbitrarily ignored. It’s worth mentioning that, when the delay-partitioning number m is fixed, less conservatism can be achieved by increase of another delay-partitioning number N, but without increasing any computing burden. Finally, one numerical example is provided to show that the proposed conditions are less conservative than existing ones.     

给水管网抗震对策的重要度分析方法研究

针对城市给水管线不同管段在灾后对于管网整体可靠度影响的差异性,为了能够较好地评价不同管段对管网系统连接可靠度的贡献,引入失效概率重要度和关键重要度,建立了基于历史经验方法的管网可靠度及管线失效概率重要度、关键重要度计算模型。实例计算结果表明,该模型计算的管网连接可靠度结果与其他文献方法的计算结果基本一致,验证了模型的合理性、有效性。进而应用该模型计算出各段管线的失效概率重要度、关键重要度,对管线防灾等级划分,给出了管网分割方法与管网震后恢复策略。研究结果为编制给水管网抗震防灾规划、震后管网恢复计划及制定出相应的抗灾应急措施提供依据。