In this paper, we offers a new algebraic point of view for DNA molecules and introduce the algebraic system by using the natural operation based on the Sigma = {A, C, G, T} . We characterize its structure by using the...
详细信息
In this paper, we offers a new algebraic point of view for DNA molecules and introduce the algebraic system by using the natural operation based on the Sigma = {A, C, G, T} . We characterize its structure by using the algebraic theory. We show that (L, oplus, otimes ) is the distribution lattice of rings with identical element. Furthermore,we generalize this result to the Wrho(V) , a set which elements simulates the DNA molecules with sticky ends, the element is called an incomplete double stranded molecules consist of mixed DNA molecules with double and single strands.
This paper investigates the spectral description methods for unweighted graph sequences and the clustering of spectral features in feature spaces. First, the corner features in 2D images of 3D polyhedral objects are r...
详细信息
This paper investigates the spectral description methods for unweighted graph sequences and the clustering of spectral features in feature spaces. First, the corner features in 2D images of 3D polyhedral objects are represented as neighborhood graphs. Adjacency matrices are constructed from Delaunay graphs of the corners. Then the eigenmodes are defined by the leading eigenvectors of the adjacency matrices. For each eigenmode, we compute the vectors of spectral properties, which include the eigenmode perimeter, eigenmode volume, Cheeger number, inter-mode adjacency matrix and inter-mode edge distance. Then these vectors are embedded into a pattern space by multidimensional scaling on the L2 norm for pairs of pattern vectors. Meanwhile, the performances of different embedding methods are compared. Finally, the clustering results by k-means method are shown
At present the most widely used technology of pinyin-Chinese character conversion combines statistics with linguistic rules. Although it basically solves such problems as long distance restriction and language recursi...
详细信息
At present the most widely used technology of pinyin-Chinese character conversion combines statistics with linguistic rules. Although it basically solves such problems as long distance restriction and language recursion phenomenon,it relies on a great deal of computation because there are too many candidate paths. This paper tries to simplify the candidate paths by using quotient space granularity computation theory, first obtains the scope of the best path in the coarser granularity world, and then uses more language rules to obtain the best path. The experiments indicate that this method can reduce the computation, speed up the conversion, and enhance the rate of accuracy by nearly 2％.
An online infomax algorithm is proposed in this paper. The performances and properties of this online algorithm is investigated in detail. To the problem of the artifacts removal in real life EEG signal, both the onli...
详细信息
An online infomax algorithm is proposed in this paper. The performances and properties of this online algorithm is investigated in detail. To the problem of the artifacts removal in real life EEG signal, both the online-and batch infomax algorithm are applied and compared. The experiment results show that the online infomax algorithm proposed in this paper has the good performance both in artifacts removal and convergence in time-varying mixing system
Barcode has been widely applied in the modern world. This paper presents a fast and robust recognition method of noisy code 39 barcode. The proposed method can be divided into two steps: search and decoding. In the fi...
详细信息
Barcode has been widely applied in the modern world. This paper presents a fast and robust recognition method of noisy code 39 barcode. The proposed method can be divided into two steps: search and decoding. In the first step, all asterisks in the image are found with evenly defined scan lines and then those with the same directions are matched together to get a valid barcode region. In the second step, a local denoise method is first applied to eliminate noise in the barcode region and then a middle band filter is used to decode the barcode. Our method is simple in comparison with former methods and experimental results show that it is efficient for fast barcode recognition on noisy images.
This paper aims to carry out granular analysis of time sequence based on quotient space. Granular methods have long before been adopted to analyze time sequence, but the granularity was based on time, for example, day...
详细信息
This paper aims to carry out granular analysis of time sequence based on quotient space. Granular methods have long before been adopted to analyze time sequence, but the granularity was based on time, for example, day mean, month mean, year mean and so on in finance forecast. In this paper, the granularity is based on space and some significant results are obtained: we can, in certain circumstances, get characteristics of time sequence in an original space when carrying out granular analysis of it in its coarser-grain space; granular analysis of a Markov chain is equivalent to an hidden Markov model (HMM), contrarily, any HMM is equivalent to granular analysis of a Markov chain. These results deepened our understanding of HMM from the perspective of granular analysis. We can not only use the methods of HMM to study time sequence, but also use the methods of granular analysis based on quotient space theory to solve the problems of HMM.
Label is denoted by disparity and the energy function is established. Then the problem of matching can be transformed into that of energy function minimization. A network is constructed such that the energies can be r...
详细信息
Label is denoted by disparity and the energy function is established. Then the problem of matching can be transformed into that of energy function minimization. A network is constructed such that the energies can be related to the capacities of the cuts of the network. Finally, the minimal energy is obtained by the network-flows theory, and hence the disparity data are solved. Comparing with some known algorithms based on graph cuts, the algorithm extends the label from 1 dimension vector to 2 dimension vector, and adapts vision matching of more general conditions;furthermore the algorithm can gain the minimization in global. Experimental results show that the algorithm has a high accuracy.
The theory of granule computing based on the quotient space is one of the three main granule computing theories. The emphasis is on the structure of the quotient space theory in this paper. Comparing with Rough Set th...
详细信息
In this paper, a new image classification method is developed. This approach applies graph decomposition and probabilistic neural networks (PNN) to the task of supervised image classification. We use relational graphs...
详细信息
In this paper, a new image classification method is developed. This approach applies graph decomposition and probabilistic neural networks (PNN) to the task of supervised image classification. We use relational graphs to represent image. These graphs are constructed from the feature points of images. Spectra of these graphs are obtained as feature vectors for classification. PNN is adopted to classify image according to the feature vectors. Experimental results show that this method can achieve best result of images classification.
暂无评论