Please login to be able to save your searches and receive alerts for new content matching your search criteria.
The detection method of microblog false information has been constructed based on block matching and fuzzy neural network to improve the detection accuracy of microblog false information effectively. With this method, we can calculate the rank distance and sample entropy of microblog data according to the evaluation word rank vector of microblog false information, carry out the block matching of false information in fuzzy data set and input the characteristic quantity of microblog false information extracted into the fuzzy neural network classifier for data classification and recognition. So that it has achieved the optimized detection of false information and improved the judgment ability of false information. Finally, the key factors that affect the algorithm are deeply studied through simulation experiments according to the real data of Sina microblog, and the performance state between the proposed algorithm and Fuzzy C-means and Spectral Analysis algorithms is compared and analyzed correspondingly. The results show that the algorithm has good adaptability.
The most important part of frame rate up-conversion (FRUC) is block matching. The geometric properties of the image were not taken into consideration in traditional block matching algorithm, so the matching result of motion estimation cannot reach the optimal. A novel FRUC algorithm based on Bandelet was proposed in this paper. The algorithm includes: Firstly, a soft threshold Bandelet transform of matching block was performed. The optimal matching block was determined through detection of direction similarity and Bandelet coefficient similarity; secondly, vector median filtering (VMF) and overlapped block motion compensation (OBMC) were carried out by adopting motion vector to realize interpolated frame algorithm. Experimental results show that the FRUC algorithm based on Bandelet can further promote the quality of FRUC.
In this paper, we present a new geometric algorithm for the 3-D static leaf sequencing (SLS) problem arising in intensity-modulated radiation therapy (IMRT), a modern cancer treatment technique. The treatment time and machine delivery error are two crucial factors for measuring the quality of a solution (i.e., a treatment plan) for the SLS problem. In the current clinical practice, physicians prefer to use treatment plans with the lowest possible amount of delivery error, and are also very concerned about the treatment time. Previous SLS methods in both the literature and commercial treatment planning systems either cannot minimize the error or achieve that only by using treatment plans which require a prolonged treatment time. In comparison, our new geometric algorithm is computationally efficient; more importantly, it guarantees that the output treatment plans have the lowest possible amount of delivery error, and the treatment time for the plans is significantly shorter. Our solution is based on a number of novel schemes and ideas (e.g., mountain reduction, block matching, profile-preserving cutting, etc) which may be of interest in their own right. Experimental results based on real medical data showed that our new algorithm runs fast and produces much better quality treatment plans than current commercial planning systems and well-known algorithms in medical literature.