In Cross-Language information Retrieval (CLIR), Out-of-Vocabulary (OOV) detection and translation pair relevance evaluation still remain as key problems. In this paper, an English- Chinese Bi-Directional OOV translati...
详细信息
In this paper, the advantages of ensemble methods are applied to image categorization. A novel method is introduced for image categorization by combining various visual vocabularies with different sizes in the popular...
详细信息
Considering that travel routing costs change with time against the background of reverse logistics, this paper presents the time dependent vehicle routing problem of simultaneous delivery and pick-up(TDVRPSDP), and es...
详细信息
A 5-parameter bundle adjustment method is proposed in this paper for global mosaic of an image sequence. By decomposing the rotation matrix into a 3-parameter rotation axis and a rotation angle, to each image, there a...
详细信息
Recent research has shown that keyword search is a friendly and potentially effective way to retrieve information of interest over relational databases. Existing work has generally focused on implementing keyword sear...
详细信息
Effective identification of major histocompatibility complex (MHC) molecules restricted peptides is a critical step in discovering immune epitopes. Although many online servers have been built to predict class Ⅱ MH...
详细信息
Effective identification of major histocompatibility complex (MHC) molecules restricted peptides is a critical step in discovering immune epitopes. Although many online servers have been built to predict class Ⅱ MHC-peptide binding affinity, they have been trained on different datasets, and thus fail in providing a unified comparison of various methods. In this paper, we present our implementation of seven popular predictive methods, namely SMM-align, ARB, SVR-pairwise, Gibbs sampler. ProPred, LP-top2, and MHCPred, on a single web server named BiodMHC (http://***/BiodMHC/***, the software is available upon request). Using a standard measure of AUC (Area Under the receiver operating characteristic Curves), we compare these methods by means of not only cross validation but also prediction on independent test datasets. We find that SMM-align, ProPred, SVR-pairwise, ARB, and Gibbs sampler are the five best-performing methods. For the binding affinity prediction of class Ⅱ MHC-peptide, BiodMHC provides a convenient online platform for researchers to obtain binding information simultaneously using various methods.
To preserve the sharp features and details of the synthetic aperture radar (SAR) image effectively when despeckling, a despeckling algorithm with edge detection in nonsubsampled second generation bandelet transform ...
详细信息
To preserve the sharp features and details of the synthetic aperture radar (SAR) image effectively when despeckling, a despeckling algorithm with edge detection in nonsubsampled second generation bandelet transform (NSBT) domain is proposed. First, the Canny operator is utilized to detect and remove edges from the SAR image. Then the NSBT which has an optimal approximation to the edges of images and a hard thresholding rule are used to approximate the details while despeckling the edge-removed image. Finally, the removed edges are added to the reconstructed image. As the edges axe detected and protected, and the NSBT is used, the proposed algorithm reaches the state-of-the-art effect which realizes both despeckling and preserving edges and details simultaneously. Experimental results show that both the subjective visual effect and the mainly objective performance indexes of the proposed algorithm outperform that of both Bayesian wavelet shrinkage with edge detection and Bayesian least square-Gaussian scale mixture (BLS-GSM).
Recent studies have found that adoption of structure similarity index (SSIM) was successful in reflecting human visual characteristic better compared with traditional PSNR metrics. However this method shows some defec...
详细信息
The explicit determinations of the mean first-passage time (MFPT) for trapping problem are limited to some simple structure, e.g., regular lattices and regular geometrical fractals, and determining MFPT for random wal...
详细信息
The explicit determinations of the mean first-passage time (MFPT) for trapping problem are limited to some simple structure, e.g., regular lattices and regular geometrical fractals, and determining MFPT for random walks on other media, especially complex real networks, is a theoretical challenge. In this paper, we investigate a simple random walk on the the pseudofractal scale-free web (PSFW) with a perfect trap located at a node with the highest degree, which simultaneously exhibits the remarkable scale-free and small-world properties observed in real networks. We obtain the exact solution for the MFPT that is calculated through the recurrence relations derived from the structure of PSFW. The rigorous solution exhibits that the MFPT approximately increases as a power-law function of the number of nodes, with the exponent less than 1. We confirm the closed-form solution by direct numerical calculations. We show that the structure of PSFW can improve the efficiency of transport by diffusion, compared with some other structure, such as regular lattices, Sierpinski fractals, and T-graph. The analytical method can be applied to other deterministic networks, making the accurate computation of MFPT possible.
暂无评论