Supervised local and non-local structure preserving projections with application to just-in-time learning for adaptive soft sensor

In soft sensor field, just-in-time learning(JITL) is an effective approach to model nonlinear and time varying processes. However, most similarity criterions in JITL are computed in the input space only while ignoring important output information, which may lead to inaccurate construction of relevant sample set. To solve this problem, we propose a novel supervised feature extraction method suitable for the regression problem called supervised local and non-local structure preserving projections(SLNSPP), in which both input and output information can be easily and effectively incorporated through a newly defined similarity index. The SLNSPP can not only retain the virtue of locality preserving projections but also prevent faraway points from nearing after projection,which endues SLNSPP with powerful discriminating ability. Such two good properties of SLNSPP are desirable for JITL as they are expected to enhance the accuracy of similar sample selection. Consequently, we present a SLNSPP-JITL framework for developing adaptive soft sensor, including a sparse learning strategy to limit the scale and update the frequency of database. Finally, two case studies are conducted with benchmark datasets to evaluate the performance of the proposed schemes. The results demonstrate the effectiveness of LNSPP and SLNSPP.

Face recognition using illuminant locality preserving projections

A novel supervised manifold learning method was proposed to realize high accuracy face recognition under varying illuminant conditions. The proposed method, named illuminant locality preserving projections （ILPP）, exploited illuminant directions to alleviate the effect of illumination variations on face recognition. The face images were first projected into low dimensional subspace, Then the ILPP translated the face images along specific direction to reduce lighting variations in the face. The ILPP reduced the distance between face images of the same class, while increase the dis tance between face images of different classes. This proposed method was derived from the locality preserving projections （LPP） methods, and was designed to handle face images with various illumi nations. It preserved the face image＇ s local structure in low dimensional subspace. The ILPP meth od was compared with LPP and discriminant locality preserving projections （DLPP）, based on the YaleB face database. Experimental results showed the effectiveness of the proposed algorithm on the face recognition with various illuminations.

Supervised Kernel Uncorrelated Discriminant Neighborhood Preserving Projections

To separate each pattern class more strongly and deal with nonlinear ease, a new nonlinear manifold learning algorithm named supervised kernel uneorrelated diseriminant neighborhood preserving projections （SKUDNPP） is proposed. The algorithm utilizes supervised weight and kernel technique which makes the algorithm cope with classifying and nonlinear problems competently. The within-class geometric structure is preserved, while maximizing the between-class distance. And the features extracted are statistically uneorrelated by introducing an uneorrelated constraint. Experiment results on millimeter wave （MMW） radar target recognition show that the method can give competitive results in comparison with current papular algorithms.

SELF-DEPENDENT LOCALITY PRESERVING PROJECTION WITH TRANSFORMED SPACE-ORIENTED NEIGHBORHOOD GRAPH

Locality preserving projection （LPP） is a typical and popular dimensionality reduction （DR） method,and it can potentially find discriminative projection directions by preserving the local geometric structure in data. However,LPP is based on the neighborhood graph artificially constructed from the original data,and the performance of LPP relies on how well the nearest neighbor criterion work in the original space. To address this issue,a novel DR algorithm,called the self-dependent LPP （sdLPP） is proposed. And it is based on the fact that the nearest neighbor criterion usually achieves better performance in LPP transformed space than that in the original space. Firstly,LPP is performed based on the typical neighborhood graph; then,a new neighborhood graph is constructed in LPP transformed space and repeats LPP. Furthermore,a new criterion,called the improved Laplacian score,is developed as an empirical reference for the discriminative power and the iterative termination. Finally,the feasibility and the effectiveness of the method are verified by several publicly available UCI and face data sets with promising results.

DUAL-SPARSITY PRESERVING PROJECTION

Sparsity preserving projection（SPP） is a popular graph-based dimensionality reduction（DR） method, which has been successfully applied to solve face recognition recently. SPP contains natural discriminating information by preserving sparse reconstruction relationship of data sets. However, SPP suffers from the fact that every new feature learned from data sets is linear combinations of all the original features, which often makes it difficult to interpret the results. To address this issue, a novel DR method called dual-sparsity preserving projection （DSPP） is proposed to further impose sparsity constraints on the projection directions of SPP. Specifically, the proposed method casts the projection function learning of SPP into a regression-type optimization problem, and then the sparse projections can be efficiently computed by the related lasso algorithm. Experimental results from face databases demonstrate the effectiveness of the proposed algorithm.

Sparse Kernel Locality Preserving Projection and Its Application in Nonlinear Process Fault Detection

Locality preserving projection (LPP) is a newly emerging fault detection method which can discover local manifold structure of a data set to be analyzed, but its linear assumption may lead to monitoring performance degradation for complicated nonlinear industrial processes. In this paper, an improved LPP method, referred to as sparse kernel locality preserving projection (SKLPP) is proposed for nonlinear process fault detection. Based on the LPP model, kernel trick is applied to construct nonlinear kernel model. Furthermore, for reducing the computational complexity of kernel model, feature samples selection technique is adopted to make the kernel LPP model sparse. Lastly, two monitoring statistics of SKLPP model are built to detect process faults. Simulations on a continuous stirred tank reactor (CSTR) system show that SKLPP is more effective than LPP in terms of fault detection performance.

Fault Diagnosis Model Based on Feature Compression with Orthogonal Locality Preserving Projection

Based on feature compression with orthogonal locality preserving projection（OLPP）,a novel fault diagnosis model is proposed in this paper to achieve automation and high-precision of fault diagnosis of rotating machinery.With this model,the original vibration signals of training and test samples are first decomposed through the empirical mode decomposition（EMD）,and Shannon entropy is constructed to achieve high-dimensional eigenvectors.In order to replace the traditional feature extraction way which does the selection manually,OLPP is introduced to automatically compress the high-dimensional eigenvectors of training and test samples into the low-dimensional eigenvectors which have better discrimination.After that,the low-dimensional eigenvectors of training samples are input into Morlet wavelet support vector machine（MWSVM） and a trained MWSVM is obtained.Finally,the low-dimensional eigenvectors of test samples are input into the trained MWSVM to carry out fault diagnosis.To evaluate our proposed model,the experiment of fault diagnosis of deep groove ball bearings is made,and the experiment results indicate that the recognition accuracy rate of the proposed diagnosis model for outer race crack、inner race crack and ball crack is more than 90%.Compared to the existing approaches,the proposed diagnosis model combines the strengths of EMD in fault feature extraction,OLPP in feature compression and MWSVM in pattern recognition,and realizes the automation and high-precision of fault diagnosis.

Multimode Process Monitoring Based on Fuzzy C-means in Locality Preserving Projection Subspace

For complex industrial processes with multiple operational conditions, it is important to develop effective monitoring algorithms to ensure the safety of production processes. This paper proposes a novel monitoring strategy based on fuzzy C-means. The high dimensional historical data are transferred to a low dimensional subspace spanned by locality preserving projection. Then the scores in the novel subspace are classified into several overlapped clusters, each representing an operational mode. The distance statistics of each cluster are integrated though the membership values into a novel BID (Bayesian inference distance) monitoring index. The efficiency and effectiveness of the proposed method are validated though the Tennessee Eastman benchmark process.

Ship recognition based on HRRP via multi-scale sparse preserving method

In order to extract the richer feature information of ship targets from sea clutter, and address the high dimensional data problem, a method termed as multi-scale fusion kernel sparse preserving projection(MSFKSPP) based on the maximum margin criterion(MMC) is proposed for recognizing the class of ship targets utilizing the high-resolution range profile(HRRP). Multi-scale fusion is introduced to capture the local and detailed information in small-scale features, and the global and contour information in large-scale features, offering help to extract the edge information from sea clutter and further improving the target recognition accuracy. The proposed method can maximally preserve the multi-scale fusion sparse of data and maximize the class separability in the reduced dimensionality by reproducing kernel Hilbert space. Experimental results on the measured radar data show that the proposed method can effectively extract the features of ship target from sea clutter, further reduce the feature dimensionality, and improve target recognition performance.

Locality Preserving Discriminant Projection for Speaker Verification

In this paper, a manifold subspace learning algorithm based on locality preserving discriminant projection (LPDP) is used for speaker verification. LPDP can overcome the deficiency of the total variability factor analysis and locality preserving projection (LPP). LPDP can effectively use the speaker label information of speech data. Through optimization, LPDP can maintain the inherent manifold local structure of the speech data samples of the same speaker by reducing the distance between them. At the same time, LPDP can enhance the discriminability of the embedding space by expanding the distance between the speech data samples of different speakers. The proposed method is compared with LPP and total variability factor analysis on the NIST SRE 2010 telephone-telephone core condition. The experimental results indicate that the proposed LPDP can overcome the deficiency of LPP and total variability factor analysis and can further improve the system performance.

A Comparative Study of Locality Preserving Projection and Principle Component Analysis on Classification Performance Using Logistic Regression

There are a variety of classification techniques such as neural network, decision tree, support vector machine and logistic regression. The problem of dimensionality is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity, however, we need to use dimensionality reduction methods. These methods include principal component analysis (PCA) and locality preserving projection (LPP). In many real-world classification problems, the local structure is more important than the global structure and dimensionality reduction techniques ignore the local structure and preserve the global structure. The objectives is to compare PCA and LPP in terms of accuracy, to develop appropriate representations of complex data by reducing the dimensions of the data and to explain the importance of using LPP with logistic regression. The results of this paper find that the proposed LPP approach provides a better representation and high accuracy than the PCA approach.

Evaluation of the oil and gas preservation conditions, source rocks, and hydrocarbongenerating potential of the Qiangtang Basin: New evidence from the scientific drilling project

The Qiangtang Basin of the Tibetan Plateau,located in the eastern Tethys tectonic domain,is the largest new marine petroliferous region for exploration in China.The scientific drilling project consisting primarily of well QK-1 and its supporting shallow boreholes for geological surveys(also referred to as the Project)completed in recent years contributes to a series of new discoveries and insights into the oil and gas preservation conditions and source rock evaluation of the Qiangtang Basin.These findings differ from previous views that the Qiangtang Basin has poor oil and gas preservation conditions and lacks high-quality source rocks.As revealed by well QK-1 and its supporting shallow boreholes in the Project,the Qiangtang Basin hosts two sets of high-quality regional seals,namely an anhydrite layer in the Quemo Co Formation and the gypsum-bearing mudstones in the Xiali Formation.Moreover,the Qiangtang Basin has favorable oil and gas preservation conditions,as verified by the comprehensive study of the sealing capacity of seals,basin structure,tectonic uplift,magmatic activity,and groundwater motion.Furthermore,the shallow boreholes have also revealed that the Qiangtang Basin has high-quality hydrocarbon source rocks in the Upper Triassic Bagong Formation,which are thick and widely distributed according to the geological and geophysical data.In addition,the petroleum geological conditions,such as the type,abundance,and thermal evolution of organic matter,indicate that the Qiangtang Basin has great hydrocarbon-generating potential.

Surface Detection of Continuous Casting Slabs Based on Curvelet Transform and Kernel Locality Preserving Projections

Longitudinal cracks are common defects of continuous casting slabs and may lead to serious quality accidents. Image capturing and recognition of hot slabs is an effective way for on-line detection of cracks, and recognition of cracks is essential because the surface of hot slabs is very complicated. In order to detect the surface longitudinal cracks of the slabs, a new feature extraction method based on Curvelet transform and kernel locality preserving projections （KLPP） is proposed. First, sample images are decomposed into three levels by Curvelet transform. Second, Fourier transform is applied to all sub-band images and the Fourier amplitude spectrum of each sub-band is computed to get features with translational invariance. Third, five kinds of statistical features of the Fourier amplitude spectrum are computed and combined in different forms. Then, KLPP is employed for dimensionality reduction of the obtained 62 types of high-dimensional combined features. Finally, a support vector machine （SVM） is used for sample set classification. Experiments with samples from a real production line of continuous casting slabs show that the algorithm is effective to detect longitudinal cracks, and the classification rate is 91.89%.

Projected Runge-Kutta methods for constrained Hamiltonian systems

Projected Runge-Kutta （R-K） methods for constrained Hamiltonian systems are proposed. Dynamic equations of the systems, which are index-3 differential-algebraic equations （DAEs） in the Heisenberg form, are established under the framework of Lagrangian multipliers. R-K methods combined with the technique of projections are then used to solve the DAEs. The basic idea of projections is to eliminate the constraint violations at the position, velocity, and acceleration levels, and to preserve the total energy of constrained Hamiltonian systems by correcting variables of the position, velocity, acceleration, and energy. Numerical results confirm the validity and show the high precision of the proposed method in preserving three levels of constraints and total energy compared with results reported in the literature.

Full-viewpoint 3D Space Object Recognition Based on Kernel Locality Preserving Projections

Space object recognition plays an important role in spatial exploitation and surveillance, followed by two main problems： lacking of data and drastic changes in viewpoints. In this article, firstly, we build a three-dimensional （3D） satellites dataset named BUAA Satellite Image Dataset （BUAA-SID 1.0） to supply data for 3D space object research. Then, based on the dataset, we propose to recognize full-viewpoint 3D space objects based on kernel locality preserving projections （KLPP）. To obtain more accurate and separable description of the objects, firstly, we build feature vectors employing moment invariants, Fourier descriptors, region covariance and histogram of oriented gradients. Then, we map the features into kernel space followed by dimensionality reduction using KLPP to obtain the submanifold of the features. At last, k-nearest neighbor （kNN） is used to accomplish the classification. Experimental results show that the proposed approach is more appropriate for space object recognition mainly considering changes of viewpoints. Encouraging recognition rate could be obtained based on images in BUAA-SID 1.0, and the highest recognition result could achieve 95.87%.

Energy Efficient Access Point Selection and Signal Projection for Accurate Indoor Positioning

We propose a method to improve positioning accuracy while reducing energy consumption in an indoor Wireless Local Area Network(WLAN) environment.First,we intelligently and jointly select the subset of Access Points(APs) used in positioning via Maximum Mutual Information(MMI) criterion.Second,we propose Orthogonal Locality Preserving Projection(OLPP) to reduce the redundancy among selected APs.OLPP effectively extracts the intrinsic location features in situations where previous linear signal projection techniques failed to do,while maintaining computational efficiency.Third,we show that the combination of AP selection and OLPP simultaneously exploits their complementary advantages while avoiding the drawbacks.Experimental results indicate that,compared with the widely used weighted K-nearest neighbor and maximum likelihood estimation method,the proposed method leads to 21.8%(0.49 m) positioning accuracy improvement,while decreasing the computation cost by 65.4%.

A Foundation for Developing Digital Preservation Policy： The InterPARES Policy Framework

近年来,数字资源长期保存领域经历了从基础理论研究、个体实验,到最佳实践的发展过程。继2004年北京、2005年德国、2006年北美成功举办之后,2007年10月11-12日,数字资源长期保存国际会议(iPRES2007)再次回归北京,由国家科技图书文献中心主办,中国科学院国家科学图书馆组织承办。本次会议主题为"数字资源长期保存:项目进展和最佳实践",结合具体项目和实践经验,分别从数字资源长期保存的战略计划与基础设施、相关管理问题、技术研究与实践、认证与评估、教育与培训5个方面进行了介绍,并就面临的问题和下一步发展进行了交流。《现代图书情报技术》杂志作为此次会议协办媒体,组织部分参会论文形成专辑发表,集中反映国内外数字资源长期保存领域重大项目的研究进展以及实施路线,供广大研究人员参考、借鉴。

A PERTURBATION ANALYSIS FOR THE PROJECTION OF A STIFFLY SCALED MATRIX

In this paper we study the perturbation bound of the projection ( W A ) ( W A )+,where both the matrices A and W are given with W positive diagonal and severely stiff.When the perturbed matrix (A)= A + δA satisfy several row rank preserving conditions,we derive a new perturbation bound of the projection.

Creation and Long-term Preservation of Digital Multimedia Resources:Some Preliminary Practices

This paper gives a comprehensive introduction of National Cultural Information Resources Sharing Project. It discusses the best practices in creation and long-term preservation of multimedia digital resources, and recommends solutions to the key issues in resource selection, standards & specifications and copyright.