Ball-tracking is a keytechnology in processing and analyzing a ball game. Because of the complexity of visual scenes, a large number of objects are usually selected as candidates for the ball, leading to incorrect id...
详细信息
ISBN:
(纸本)9781479903573
Ball-tracking is a keytechnology in processing and analyzing a ball game. Because of the complexity of visual scenes, a large number of objects are usually selected as candidates for the ball, leading to incorrect identification, and conversely, the true position of the ball may sometimes be missed. In this paper, we propose a two layered data association method to improve the robustness of ball-tracking. At a local layer, we use a sliding window based Token Transfer method to generate a set of sub-trajectory candidates. At a global layer, a single ball trajectory is obtained by applying a dynamic programming based splice method to a graph consisting of the sub-trajectory candidates. We evaluated our approach on tennis matches from the Australian Open and the U.S. Open, and the results obtained show that our approach outperforms the state-of-art approach by around 30 %.
Answer set programming (ASP) has become an important tool for knowledge representation and reasoning. Inconsistency processing in ASP provides a way for reasoning of inconsistent knowledge. In this paper, we present a...
详细信息
ISBN:
(纸本)9781849195379
Answer set programming (ASP) has become an important tool for knowledge representation and reasoning. Inconsistency processing in ASP provides a way for reasoning of inconsistent knowledge. In this paper, we present a minimal principle based method to process inconsistency in ASP. The method is able to ensure maximum retention of certain knowledge by removing the fewest defeasible rules preferentially. Then, we propose corresponding algorithms for simple logic programs and extended logic programs, and analyze the complexity of our method. After that, we compare this method with related work. Finally, we conclude and indicate the prospect of the further research.
In this paper, we propose a specification approach combining interface automata and Z language. This approach can be used to describe behavioural properties and data properties of software components. We also study th...
详细信息
In this paper, an efficient approach for extracting semantic object using artificial bee colonyalgorithm (ABCA) has been proposed. First, we reduce speckle noise in the image. Then fitness function of ABC algorithm is...
详细信息
Video-on-Demand (VoD), which is an important application in peer-to-peer (P2P) networks, attracts a lot of researchers' interest at present. Data scheduling is significant in P2P VoD applications to gain desirable...
详细信息
ISBN:
(纸本)9781467329637
Video-on-Demand (VoD), which is an important application in peer-to-peer (P2P) networks, attracts a lot of researchers' interest at present. Data scheduling is significant in P2P VoD applications to gain desirable user experience and better satisfaction. In unstructured mesh-based overlay, peers in the overlay learn about the chunks availability from neighbors using Buffer Map. The peer can only know the information of its neighbors and is not aware of other peers. So some peers (busy peer) could get a lot of requests and other peers(free peers) receive fewer requests. The busy peer usually ignores the surplus requests and the peers that send these ignored requests will request the chunk again after the timeout. At the same time, the free peers can't effectively utilize the upload bandwidth. In this paper, we propose a hybrid Push/Pull algorithm in P2P VoD. Simulation results shows that the average utilization of upload bandwidth and average playback quality may be improved efficiently.
A robust image watermarking scheme based on singular value decomposition (SVD) and discrete wavelet transform (DWT) with Artificial Bee Colony Algorithm is proposed in this paper. Previous SVD based watermarking algor...
详细信息
A robust image watermarking scheme based on singular value decomposition (SVD) and discrete wavelet transform (DWT) with Artificial Bee Colony Algorithm is proposed in this paper. Previous SVD based watermarking algorithms have a major drawback of false positive detection. For solving this problem, the similarity measure of U matrix for ownership is checked. To achieve the highest possible robustness without losing the transparency, an adaptive scale factor is obtained by the artificial bee colony (ABC) algorithm. Experimental results demonstrate that the performance of the proposed approach outperforms the existing methods.
Image segmentation evaluation is still a hotspot problem. Various methods of image segmentation evaluation have been proposed. Amongst all the evaluation approaches, Segmentation Entropy Quantitative Assessment (SEQA)...
详细信息
Image segmentation evaluation is still a hotspot problem. Various methods of image segmentation evaluation have been proposed. Amongst all the evaluation approaches, Segmentation Entropy Quantitative Assessment (SEQA) is one of the most popular methods. In this paper, segmentation entropy is proposed. In experiments, some standard images which are segmented by multi-level thresholds are tested and used to conclude the characteristics of SEQA, including its application conditions, advantages and disadvantages in image segmentation evaluation.
We introduce a new logic programming paradigm-answer set programming with uncertain facts (LPuF for short). A LPuF program is an extension of answer set programs (ASP for short). We first define the syntax of LPuF pro...
详细信息
YCH scheme is a multi-secret sharing scheme based on two-variable one-way function and Shamir's threshold secret sharing scheme,but the scheme does not have the property of *** paper presents a verifiable multi-se...
详细信息
YCH scheme is a multi-secret sharing scheme based on two-variable one-way function and Shamir's threshold secret sharing scheme,but the scheme does not have the property of *** paper presents a verifiable multi-secret sharing scheme based on YCH scheme,RSA cryptosystem,and Schnorr *** dose not need a secure channel and each participant chooses his secret shadow by himself,and it can defend positive attack of dealer and participants.
In（k,m）-DOT~nScheme,the sender's privacy can not be guaranteed,even if the protocol itself is security,if we can not ensure that a receiver gets information from at most k *** Naor and Pinkas' s scheme,they ...
详细信息
In（k,m）-DOT~nScheme,the sender's privacy can not be guaranteed,even if the protocol itself is security,if we can not ensure that a receiver gets information from at most k *** Naor and Pinkas' s scheme,they give two solutions that are applicable for the case k>m/2,in Nikov et al.'s scheme,they avoid this problem by means of implementing a m-out-of-m access *** this paper,we put forward a settlement for arbitrary k,in which the receiver only can choose k servers to interactive and solve the problem getting the desired security.
暂无评论