The DCT-based real discrete Gabor transform (RDGT) is briefly reviewed in this paper, and then, block time-recursive algorithms for the efficient and fast computation of the RDGT coefficients and for the fast reconstr...
详细信息
The DCT-based real discrete Gabor transform (RDGT) is briefly reviewed in this paper, and then, block time-recursive algorithms for the efficient and fast computation of the RDGT coefficients and for the fast reconstruction of the original signal from the coefficients are developed in both the critical sampling case and the oversampling case. Unified parallel lattice structures for the implementation of the algorithms are studied. Computational complexity analysis and comparison have shown that the proposed algorithms provide a more efficient and faster approach for discrete Gabor transforms as compared to the existing discrete Gabor transform algorithms.
The different approaches used for target decomposition (TD) theory in radar polarimetry are reviewed and three main types of theorems are introduced: those based on Mueller matrix, those using an eigenvector analysis ...
详细信息
The different approaches used for target decomposition (TD) theory in radar polarimetry are reviewed and three main types of theorems are introduced: those based on Mueller matrix, those using an eigenvector analysis of the coherency matrix, and those employing coherent decomposition of the scattering matrix. Support vector machine (SVM), as a novel approach in pattern recognition, has demonstrated success in many fields. A new algorithm of target classification, by combining target decomposition and the support vector machine, is *** conduct the experiment, the polarimetric synthetic aperture radar (SAR) data are used. Experimental results show that it is feasible and efficient to target classification by applying target decomposition to extract scattering mechanisms, and the effects of kernel function and its parameters on the classification efficiency are significant.
The spacing distance of amino acids is used to study the relationship between the primary structure and structural classification of large proteins. Rescaled-range (R/S) analysis was adopted to examine long-range corr...
详细信息
Structure alignment could help to find shape similarities between proteins and guide structure classification and fold recognition. Common substructure detection and extraction are especially important, for which coul...
详细信息
ISBN:
(纸本)9781424415786
Structure alignment could help to find shape similarities between proteins and guide structure classification and fold recognition. Common substructure detection and extraction are especially important, for which could guide the biologist to discover binding site or active site. We represent each segment of alpha-carbon backbone by using dihedral angles and curve moment invariants. Then, local and global structure alignment could be performed by iterative closest point algorithm. Maximum common substructures between a pair of proteins or within a protein could be found. Active sites also could be detected by the proposed algorithm.
Learning methods of constructive neural network aims to overcome the disadvantages of BP algorithm, which has many advantages such as fast convergent rate, less computation, good fault-tolerant and strong generalizati...
详细信息
ISBN:
(纸本)9781615677214
Learning methods of constructive neural network aims to overcome the disadvantages of BP algorithm, which has many advantages such as fast convergent rate, less computation, good fault-tolerant and strong generalization ability, etc. Its structure is constructed step by step in the processing of the data rather than being prescribed in advance. This paper mainly introduces the developing motivations, research status quo and development directions, laying stress on two kinds of constructive learning methods: FP algorithm and covering algorithm. After discussing the construction and basic properties of FP network, we construct an FP network as a general clustering unit, and analyze its main properties. On the base of summarizing covering algorithm we present a general neighborhood covering algorithm and its corresponding network. According to the characteristics of the algorithm we analyze its existing problems and propose the further research orientations.
THz wave generated by difference-frequency in nonlinear crystal in normal temperature is theoretically studied. The conclifton of phase matching is deduced and an experimental setup is proposed. With this method, THz ...
详细信息
THz wave generated by difference-frequency in nonlinear crystal in normal temperature is theoretically studied. The conclifton of phase matching is deduced and an experimental setup is proposed. With this method, THz wave can be generated without rigorous condition and can work continuously for a long period of time in room temperature.
This paper presents a novel algorithm for point correspondences using graph spectral analysis. Firstly, the correspondence probabilities are computed by using the eigenvectors and eigenvalues of the proximity matrix a...
详细信息
This paper presents a novel algorithm for point correspondences using graph spectral analysis. Firstly, the correspondence probabilities are computed by using the eigenvectors and eigenvalues of the proximity matrix as well as the method of alternated row and column normalizations. Secondly, local similarity evaluated by shape context is incorporated into our spectral method to refine the results of spectral correspondence via a probabilistic relaxation approach. Experiments on both real-world and synthetic data show that our method possesses comparatively high accuracy.
A novel image content authentication algorithm based on Laplace spectra was proposed. Outstanding feature points are extracted from the original image and a cipher point is inserted. A relational graph is then built, ...
详细信息
A novel image content authentication algorithm based on Laplace spectra was proposed. Outstanding feature points are extracted from the original image and a cipher point is inserted. A relational graph is then built, and the Laplace spectra of the graph are calculated to serve as image features. The Laplace spectra are quantized then embedded into the original image as a watermark. In the authentication step, the Laplace spectra of the authenticating image are calculated and compared with that of the watermark embedded in the authenticating image. If both of the spectra are identical, the image passes the authentication test. Otherwise, the tamper is found. The experimental results show that the proposed authentication algorithm can effectively detect the event and the location when the original image content is tampered viciously.
In this paper, a parallel genetic algorithm for finding all roots of complex functional equation based on Parallel Virtual Machine (PVM) is present, research are made in some technical problems for realizing. We descr...
详细信息
In this paper, a parallel genetic algorithm for finding all roots of complex functional equation based on Parallel Virtual Machine (PVM) is present, research are made in some technical problems for realizing. We describe the design and implement of parallel genetic algorithm for finding roots complex functional equation.
Based on geometrical facial features and progressive thresholding, this paper presents a novel algorithm for automatic detection and localization of human eyes in grayscale or color still images with complex backgroun...
详细信息
ISBN:
(纸本)9781424417612;9781424417582;1424417619
Based on geometrical facial features and progressive thresholding, this paper presents a novel algorithm for automatic detection and localization of human eyes in grayscale or color still images with complex background. First of all, a determination criterion of eye location is established by the priori knowledge of geometrical facial features. Secondly, a range of threshold values that would separate eye blocks from others in a segmented face image is estimated. Thirdly, with the progressive increase of the threshold by an appropriate step in that range, once two eye blocks appear from the segmented image, they will be detected by the determination criterion of eye location. Finally, the 2-D correlation coefficient is used as a symmetry similarity measure to check the factuality of the two detected eyes. To avoid the background interference, skin color segmentation can be applied in order to enhance the accuracy of eye detection. The experimental results demonstrate the high efficiency of the algorithm in runtime and correct localization rate.
暂无评论