Xiaopeng Wei

Dalian Ocean University, Lü-ta-shih, Liaoning, China

Are you Xiaopeng Wei?

Claim your profile

Publications (92)85.24 Total impact

  • Source
    Bin Wang, Xiaopeng Wei, Jing Dong, Qiang Zhang
    [Show abstract] [Hide abstract]
    ABSTRACT: The well-known massively parallel sequencing method is efficient and it can obtain sequence data from multiple individual samples. In order to ensure that sequencing, replication, and oligonucleotide synthesis errors do not result in tags (or barcodes) that are unrecoverable or confused, the tag sequences should be abundant and sufficiently different. Recently, many design methods have been proposed for correcting errors in data using error-correcting codes. The existing tag sets contain small tag sequences, so we used a modified genetic algorithm to improve the lower bound of the tag sets in this study. Compared with previous research, our algorithm is effective for designing sets of DNA tags. Moreover, the GC content determined by existing methods includes an imprecise range. Thus, we improved the GC content determination method to obtain tag sets that control the GC content in a more precise range. Finally, previous studies have only considered perfect self-complementarity. Thus, we considered the crossover between different tags and introduced an improved constraint into the design of tag sets.
    PLoS ONE 02/2015; 10(2):e0110640. DOI:10.1371/journal.pone.0110640 · 3.53 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Due to the efficient and secure requirements of image transmission, a number of research works have been done to encrypt the compressed image. Inspired by the arithmetic coding and chaotic map which are used to compress and encrypt image, respectively. In this paper, a scheme is proposed to encrypt the compressed image by chaotic map and arithmetic coding. This scheme compresses the image row by row which is firstly permuted by two logistic maps before arithmetic coding. It not only enhances the security of arithmetic coding, but also improves the compression ratio. To further improve the security of binary data which has been compressed, we use the chaotic maps to encrypt the data, and set different parameters and initial value for chaotic maps. In order to possess high sensitivities of key and plain-image, the keys that are employed to determine the parameter and initial value of chaotic maps are related to the plain-image. The experimental results validate the effect of the proposed scheme and demonstrate that the compressed and encrypted image is secure and convenient for transmission.
    Optik - International Journal for Light and Electron Optics 10/2014; 125(20). DOI:10.1016/j.ijleo.2014.06.107 · 0.77 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Face recognition is an important research hotspot. More and more new methods have been proposed in recent years. In this paper, we propose a novel face recognition method which is based on PCA and logistic regression. PCA is one of the most important methods in pattern recognition. Therefore, in our method, PCA is used to extract feature and reduce the dimensions of process data. Afterwards, we present a novel classification algorithm and use logistic regression as the classifier for face recognition. The experimental results on two different face databases are presented to illustrate the efficacy of our proposed method.
    Optik - International Journal for Light and Electron Optics 10/2014; 125(20):5916–5919. DOI:10.1016/j.ijleo.2014.07.080 · 0.77 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: A new improved hybrid optimization algorithm - PGATS algorithm, which is based on toy off-lattice model, is presented for dealing with three-dimensional protein structure prediction problems. The algorithm combines the particle swarm optimization (PSO), genetic algorithm (GA), and tabu search (TS) algorithms. Otherwise, we also take some different improved strategies. The factor of stochastic disturbance is joined in the particle swarm optimization to improve the search ability; the operations of crossover and mutation that are in the genetic algorithm are changed to a kind of random liner method; at last tabu search algorithm is improved by appending a mutation operator. Through the combination of a variety of strategies and algorithms, the protein structure prediction (PSP) in a 3D off-lattice model is achieved. The PSP problem is an NP-hard problem, but the problem can be attributed to a global optimization problem of multi-extremum and multi-parameters. This is the theoretical principle of the hybrid optimization algorithm that is proposed in this paper. The algorithm combines local search and global search, which overcomes the shortcoming of a single algorithm, giving full play to the advantage of each algorithm. In the current universal standard sequences, Fibonacci sequences and real protein sequences are certified. Experiments show that the proposed new method outperforms single algorithms on the accuracy of calculating the protein sequence energy value, which is proved to be an effective way to predict the structure of proteins.
    Journal of Molecular Modeling 07/2014; 20(7):2289. DOI:10.1007/s00894-014-2289-2 · 1.87 Impact Factor
  • International Conference on Simulation and Modeling Methodologies, Technologies and Applications; 06/2014
  • Yue Li, Jianxin Zhang, Qiang Zhang, Xiaopeng Wei
    International Conference on Simulation and Modeling Methodologies, Technologies and Applications; 06/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: The key frames extraction technique extracts key postures to describe the original motion sequence, which has been widely used in motion compression, motion retrieval, motion edition and so on. In this paper, we propose a method based on the amplitude of curve to find key frames in a motion captured sequence. First we select a group of joint distance features to represent the motion and adopt the Principal Component Analysis (PCA) method to obtain the one dimension principal component as a features curve which will be used. Then we gain the initial key-frames by extracting the local optimum points in the curve. At last, we get the final key frames by inserting frames based on the amplitude of the curve and merging key frames too close. A number of experimental examples demonstrate that our method is practicable and efficient not only in the visual performance but also in the aspect of the compression ratio and error rate.
    International Journal of Computational Intelligence Systems 05/2014; 7(3):506-514. DOI:10.1080/18756891.2013.859873 · 0.45 Impact Factor
  • Qiang Zhang, Lili Liu, Xiaopeng Wei
    [Show abstract] [Hide abstract]
    ABSTRACT: New image encryption based on DNA encoding combined with chaotic system is proposed. The algorithm uses chaotic system to disturb the pixel locations and pixel values and then DNA encodings according to quaternary code rules are carried out. The pseudo DNA operations are controlled by the quaternary chaotic sequences. At last the image encryption through DNA decoding is achieved. The theoretical analysis and experimental results show that the algorithm improves the encoding efficiency, enhances the security of the ciphertext, has a large key space and a high key sensitivity, it is able to resist the statistical and exhaustive attacks.
    AEU - International Journal of Electronics and Communications 03/2014; 68(3):186–192. DOI:10.1016/j.aeue.2013.08.007 · 0.70 Impact Factor
  • Bin Wang, Xiaopeng Wei, Qiang Zhang
    [Show abstract] [Hide abstract]
    ABSTRACT: In recent years, there has been growing interesting in image encryption based on chaotic systems. In order to improve the effect of encryption, a large amount of operations are implemented in the most chaos-based cryptosystems. However, the runtime of chaos-based cryptosystems would be increased with the rise of operations. In this paper, a novel algorithm is proposed to generate cipher key for the permutation-diffusion architecture. The cipher key not only relates to the plain-image, but also the generated time of cipher key is shorter than the conventional method. On the premise of security, a novel and fast permutation-diffusion architecture based on chaotic systems and variable control conditions is proposed. For the sake of increasing the key space and enhancing the security of proposed architecture, variable control conditions used in this cryptosystem as the parameter and initial value of same chaotic system are generated from the cipher key related to the plain-image. So the proposed algorithm can effectively resist the most attacks against permutation-diffusion architectures. Finally, theoretical analyses and numerical experimental results show that the proposed chaos-based cryptosystem possesses high security and sound time of image encryption, which is suitable for protecting the image information.
    Journal of Computational and Theoretical Nanoscience 03/2014; 11(3):731-738. DOI:10.1166/jctn.2014.3420 · 1.03 Impact Factor
  • Xiaopeng Wei, Bin Wang, Qiang Zhang, Chao Che
    [Show abstract] [Hide abstract]
    ABSTRACT: In recent years, there has been growing interesting in image encryption based on chaotic maps and wavelet transform. In this paper, a novel scheme for image encryption based on chaotic maps and reversible integer wavelet transform is proposed. Firstly, the cipher key which is related to plain-image is used to generate different parameters and initial values of chaotic maps. Then the plain-image is permuted by the order from chaotic maps, and processed by integer wavelet transform. A part of transform coefficient is diffused by the orbits of chaotic maps. Finally, the cipher image is obtained by inverse integer wavelet transform based on the diffused coefficient. Numerical experimental results and comparing with previous works show that the proposed scheme possesses higher security than previous works, which is suitable for protecting the image information.
    Journal of Electrical Engineering 02/2014; 65(2). DOI:10.2478/jee-2014-0013 · 0.42 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: For the existing motion capture (MoCap) data processing methods, manual interventions are always inevitable, most of which are derived from the data tracking process. This paper addresses the problem of tracking non-rigid 3D facial motions from sequences of raw MoCap data in the presence of noise, outliers and long time missing. We present a novel dynamic spatiotemporal framework to automatically solve the problem. First, based on a 3D facial topological structure, a sophisticated non-rigid motion interpreter (SNRMI) is put forward; together with a dynamic searching scheme, it cannot only track the non-missing data to the maximum extent but recover missing data (it can accurately recover more than five adjacent markers under long time (about 5 seconds) missing) accurately. To rule out wrong tracks of the markers labeled in open structures (such as mouth, eyes), a semantic-based heuristic checking method was raised. Second, since the existing methods have not taken the noise propagation problem into account, a forward processing framework is presented to solve the problem. Another contribution is the proposed method could track facial non-rigid motions automatically and forward, and is believed to greatly reduce even eliminate the requirements of human interventions during the facial MoCap data processing. Experimental results proved the effectiveness, robustness and accuracy of our system.
    The Visual Computer 02/2014; DOI:10.1007/s00371-013-0790-8 · 1.07 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The aim of this paper is to investigate the difference of time-varying stiffness characteristics between a semi-elliptical front crack and a straight front crack of shaft-element in order to obtain a more accurate and realistic cracked-rotor model for rotating machinery system. By calculating the correct time-varying area moments of inertia for the cross-section of cracked element and taking account the neutral axis position changes, the switching function is obtained, meanwhile the stiffness of shaft in a steady rotating cycle is determined. The result shows that a significant difference of stiffness appears as crack depth deepens. Especially, the difference between elliptical-front (EF) and straight-front (SF) cracked element is more obvious in the early crack propagation.
  • Qiang Zhang, Xiaopeng Wei
    [Show abstract] [Hide abstract]
    ABSTRACT: A novel couple images encryption algorithm based on DNA subsequence operation and chaotic system is presented. Different from the traditional DNA encryption methods, our algorithm is not use complex biological operation, but just uses the idea of DNA subsequence operation (such as elongation operation, truncation operation, and deletion operation). And then, do the DNA addition operation under the Chen's Hyper-chaotic map in this image cipher. The simulation experimental results and security analysis show that our algorithm not only has good encryption effect, but also has the ability of resisting exhaustive attack and statistical attack.
    Optik - International Journal for Light and Electron Optics 12/2013; 124(23):6276-6281. DOI:10.1016/j.ijleo.2013.05.009 · 0.77 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The prediction of protein structure that attracts many researchers to study is an NP-hard problem. In recent year, numerous algorithms are proposed. Although particle swarm optimizer has many advantages, the disadvantages of poor convergence precision and easy to trap into local optimum cannot be ignored. Tabu search which has been applied for various combination optimization problems is one of global optimization algorithms. So, in this paper, we put forward a hybrid algorithm of particle swarm optimizer (PSO) and tabu search (TS) for three-dimension protein structure prediction based on AB off-lattice protein model. Experiments show that the proposed algorithm performs better in predicting of protein structure.
    Journal of Computational and Theoretical Nanoscience 11/2013; 10(11):2701-2707. DOI:10.1166/jctn.2013.3269 · 1.03 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Face recognition has become a research hotspot in the field of pattern recognition and artificial intelligence. Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) are two traditional methods in pattern recognition. In this paper, we propose a novel method based on PCA image reconstruction and LDA for face recognition. First, the inner-classes covariance matrix for feature extraction is used as generating matrix and then eigenvectors from each person is obtained, then we obtain the reconstructed images. Moreover, the residual images are computed by subtracting reconstructed images from original face images. Furthermore, the residual images are applied by LDA to obtain the coefficient matrices. Finally, the features are utilized to train and test SVMs for face recognition. The simulation experiments illustrate the effectivity of this method on the ORL face database.
    Optik - International Journal for Light and Electron Optics 11/2013; 124(22):5599-5603. DOI:10.1016/j.ijleo.2013.04.108 · 0.77 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Biotechnological and biomolecular advances have introduced novel uses for DNA such as DNA computing, storage, and encryption. For these applications, DNA sequence design requires maximal desired (and minimal undesired) hybridizations, which are the product of a single new DNA strand from 2 single DNA strands. Here, we propose a novel constraint to design DNA sequences based on thermodynamic properties. Existing constraints for DNA design are based on the Hamming distance, a constraint that does not address the thermodynamic properties of the DNA sequence. Using a unique, improved genetic algorithm, we designed DNA sequence sets which satisfy different distance constraints and employ a free energy gap based on a minimum free energy (MFE) to gauge DNA sequences based on set thermodynamic properties. When compared to the best constraints of the Hamming distance, our method yielded better thermodynamic qualities. We then used our improved genetic algorithm to obtain lower-bound DNA sequence sets. Here, we discuss the effects of novel constraint parameters on the free energy gap.
    PLoS ONE 08/2013; 8(8):e72180. DOI:10.1371/journal.pone.0072180 · 3.53 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The problem of protein structure prediction in the hydrophobic-polar (HP) lattice model is the prediction of protein tertiary structure. This problem is usually referred to as the protein folding problem. This paper presents a method for the application of an enhanced hybrid search algorithm to the problem of protein folding prediction, using the three dimensional (3D) HP lattice model. The enhanced hybrid search algorithm is a combination of the particle swarm optimizer (PSO) and tabu search (TS) algorithms. Since the PSO algorithm entraps local minimum in later evolution extremely easily, we combined PSO with the TS algorithm, which has properties of global optimization. Since the technologies of crossover and mutation are applied many times to PSO and TS algorithms, so enhanced hybrid search algorithm is called the MCMPSO-TS (multiple crossover and mutation PSO-TS) algorithm. Experimental results show that the MCMPSO-TS algorithm can find the best solutions so far for the listed benchmarks, which will help comparison with any future paper approach. Moreover, real protein sequences and Fibonacci sequences are verified in the 3D HP lattice model for the first time. Compared with the previous evolutionary algorithms, the new hybrid search algorithm is novel, and can be used effectively to predict 3D protein folding structure. With continuous development and changes in amino acids sequences, the new algorithm will also make a contribution to the study of new protein sequences.
    Journal of Molecular Modeling 07/2013; DOI:10.1007/s00894-013-1907-8 · 1.87 Impact Factor
  • Bin Wang, Xiaopeng Wei, Qiang Zhang
    [Show abstract] [Hide abstract]
    ABSTRACT: In recent years, the studies of chaos-based image encryption have become an important aspect of the security of image transmission. So far, a large amount of chaotic maps have been used in image encryption with the permutation–diffusion architecture, such as logistic map, cat map, tent map and so on. In this paper, a defect of designing an image cryptosystem based on logistic map is proposed. According to the cryptanalysis of the defect, the initial value of logistic which is used to encrypt plain-image can be deduced by the decreased key space, when the parameter of logistic map is given. Finally, the theoretical analysis and numerical experimental results show that the defect could be used to break the image cryptosystem based on logistic map.
    Optik - International Journal for Light and Electron Optics 07/2013; 124(14):1773–1776. DOI:10.1016/j.ijleo.2012.06.020 · 0.77 Impact Factor
  • Qiang Zhang, Mingli Zhang, Xiaopeng Wei
    [Show abstract] [Hide abstract]
    ABSTRACT: To resist on general attacks, such as compression, noising and geometric distortion attacks is a common requirement for digital image watermarking or data hiding techniques comparing with rotation, scaling and translation (RST) attacks which are considered to be more challenging. Based on invariant centroid and LPM which is also used to analyze the angle of rotation and ratio of scaling influence after attacks of watermarked image combining with chaotic system and a novel adaptive coefficient α, this paper presents a robust and invisible digital image watermarking technology. The experiment results show that this method has high invisibility and robust, especially withstand RST attacks.
    Third International Conference on Photonics and Image in Agriculture Engineering (PIAGENG 2013); 03/2013
  • 02/2013; 5(4):697-704. DOI:10.4156/ijact.vol5.issue4.83

Publication Stats

821 Citations
85.24 Total Impact Points


  • 2003–2015
    • Dalian Ocean University
      Lü-ta-shih, Liaoning, China
  • 2006–2014
    • Dalian University of Technology
      • School of Management
      Lü-ta-shih, Liaoning, China
  • 2010
    • Shenyang Institute of Engineering
      Feng-t’ien, Liaoning, China