Active and dynamic fusion for fuzzy and uncertain data have key challenges such as high complexity and difficult to guarantee accuracy, etc. In order to resolve the challenging issues, in this article a selective and ...
详细信息
Image registration is a vital research branch in medical image processing and analysis. In this paper, we proposed a new framework for rigid medical image registration. It can also be regarded as a pre-processing of n...
详细信息
Image registration is a vital research branch in medical image processing and analysis. In this paper, we proposed a new framework for rigid medical image registration. It can also be regarded as a pre-processing of non-rigid image registration algorithms. The interest of the algorithm lies in its simplicity and high e±ciency. In the registration algorithm, we firstly segmented the reference image and °oat image into two parts: tissue parts and background parts. Then the centers of the two images were located through performing distance transform on the two segmented tissue images. Finally, we detected the longest radius of the two tissue regions, by which we determined the rotating angle. We tested the registration algorithm on dozens of medical images, and the experimental results show us that the algorithm is competent for medical image registration.
In order to detect lane rapidly and accurately, the integration of scanning and image processing algorithms (SIP) based on the fuzzy method is proposed. Further, combination of the proposed algorithm with an adaptive ...
详细信息
Detecting susceptibility genes and gene-gene interactions (epistasis) is an important issue in genetic association analysis and genetic epidemiology. Due to the huge number of single nucleotide polymorphisms (SNPs) an...
详细信息
Detecting susceptibility genes and gene-gene interactions (epistasis) is an important issue in genetic association analysis and genetic epidemiology. Due to the huge number of single nucleotide polymorphisms (SNPs) and inappropriate statistical tests, epistasis detection is a computational and statistical challenge and becomes a "needle-in-a-haystack" problem. Also some epistasis detection algorithms proposed in lots of literature have demonstrated their successes for small scale data, while most of them cannot be directly applied into genome-wide association studies (GWAS) and the pathogenesis of many common complex human diseases is mysterious. Here we adopted a random forest method incorporating information theory and a powerful statistical test, B-stat to detect epistasis. We conducted sufficient artificial experiments on a wide range of simulated datasets and compared performance of our random forest method with its two competitors, COE and BEAM. Experimental results demonstrated that this method is quite available and time efficiency for the haystack problem. We also presented the results of the application of the method to the WTCCC type 1 diabetes dataset. We reported some previously well known genes as well as some significant SNP interactions.
Bridging virtualized environments with physical environments, virtual network plays an important role in Cloud Computing infrastructures. How to allocate physical resources for virtual nodes/links to construct virtual...
详细信息
A method to simplify the calculation in the process of measuring graph similarity is proposed, where lots of redundant operations are avoided in order to quickly obtain the initial tickets matrixIn this proposal, the ...
详细信息
ISBN:
(纸本)9783319483535
A method to simplify the calculation in the process of measuring graph similarity is proposed, where lots of redundant operations are avoided in order to quickly obtain the initial tickets matrixIn this proposal, the element value of the initial tickets matrix is assigned to 1 when it is positive in corresponding position of the paths matrix at the first timeThe proposed method calculates the initial tickets matrix value based on the positive value in the paths matrix in a forward and backward wayAn example is provided to illustrate that the method is feasible and effective.
Compared with traditional VANET(Vehicular Ad-Hoc Networks) routing techniques, geographic routing has been proven to be more fittable for highly mobile scenes. Traditional routings use greedy modes or fixed forwarding...
详细信息
Compared with traditional VANET(Vehicular Ad-Hoc Networks) routing techniques, geographic routing has been proven to be more fittable for highly mobile scenes. Traditional routings use greedy modes or fixed forwarding paths to sent packets. But, the dynamic features of VANET such as fast changed topology, vehicles density and radio obstacles, could cause local maximum and sparse connectivity. Due to the characteristics of wireless channel, while there are too many packets transmit through a path, the delay and the number of packets loss will both increase clearly. We propose DMPR, a Dynamic Multipath Routing, combined with node location and digital map. The proposed DMPR detects transmission delay of different paths every once in a period of time, and dynamically determine the transmission ratio of each path. We execute NS2 simulation to exhibit that DMPR routing protocol significantly outperform three well known VANET ones in terms of the average packet delivery ratio and end-to-end delay.
Traditional Collaborative Filtering has been one of the most widely used recommender systems, unfortunately it suffers from cold-start and data sparsity problems. With the development of social networks, more recommen...
详细信息
ISBN:
(纸本)9781467375931
Traditional Collaborative Filtering has been one of the most widely used recommender systems, unfortunately it suffers from cold-start and data sparsity problems. With the development of social networks, more recommendation systems are trying to generate more eligible recommendation through excavating users' potential preferences using their social relationships. Almost all social recommender systems employ only positive inter-user relations such as friendship or trust information. However, incorporating negative relations in recommendation has not been investigated thoroughly in literature. In this paper, we propose a novel model-based method which takes advantage of both positive and negative inter-user relations. We apply matrix factorization techniques and utilize both rating and trust information to learn users' reasonable latent preference. We also incorporate two regularization terms to take distrust information into consideration. Our experiments on real-world and open datasets demonstrate the superiority of our model over the other state-of-the-art methods.
With the development of high-throughput microarray chip technology, there are a large number of microarray expression data, which have few samples compared to the genes of high dimensions. And in recent years, more an...
详细信息
In order to avoid the defect of lip identification about one single picture and enhance the accuracy of the recognition, this paper applies the dynamic lip identification and puts forward the method to calibrate the f...
详细信息
暂无评论