35782406
License management scheme with anonymous trust for digital rights management
One of the major issues raised by digital rights management systems concerns the protection of the user's privacy and anonymous consumption of content. However, most existing license management schemes for DRM systems do not support the protection of user privacy. Moreover, some other schemes such as PrecePt can only bind the license with a specified device though they concern privacy protection. In this paper, we propose a license management scheme named LMSAT (License Management Scheme with Anonymous Trust) which provides a more powerful and flexible license acquisition and usage tracking scheme to allow the user access the contents anytime, anywhere, and on any compliant devices anonymously.
28617398
An Unbalanced Multiple Description Coding Scheme for Video Transmission Over Wireless Ad Hoc Networks
8253940
A pinhole camera modeling of motion vector field for tennis video analysis
The motion vector field (MVF) represents motion characteristics in video sequences, and has been widely used and been proved to be effective in sports video analysis. However, in tennis video analysis, MVF-based methods are seldom utilized for the reasons that: (i) the players' true motion is not accurately represented by the extracted motion vector, due to the deformation caused by the diagonal shooting of the camera; and (ii) the motion vector's magnitude is not prominent enough and is prone to be disturbed by noises. In this paper, a pinhole camera modeling of the motion vector field is proposed to revise the deformed motion vector. In this modeling, a foreground object mask is adopted and global motion compensation is incorporated as the pre-processing steps. Evaluation of the proposed modeling using four hours of tennis videos shows very encouraging results.
5295208
Bit rate reduction of H.264/AVC video coding for mobile applications
The increasing use of mobile applications requires higher compression efficiency for video coding. However, in mobile applications, the capability of the processor is limited and the channel is unreliable. Since the emerging H.264/AVC video coding standard provides superior compression performance compared to all the existing video coding standards, many research efforts concentrate on the compression efficiency of intra-frame coding in H.264/AVC. In this paper, we propose a novel algorithm to reduce the bit rate compressed by H.264/AVC intra-frame coding. We focus on the method to code the intra-frame prediction modes. Our proposed method significantly reduces the bits used to code the modes and do not change the syntax of the bit stream. Experimental results demonstrate it is effective and efficient
5815107
SIKAS: A Scalable Distributed Key Management Scheme for Dynamic Collaborative Groups
The increasing popularity of distributed and collaborative applications prompts the need for secure communication in collaborative groups. Some distributed collaborative key management protocols have been proposed to provide group communication privacy and data confidentiality for collaborative groups. However, most of them rekey on each member change, and the costs of group rekeying can be quite substantial for large groups with frequent membership changes. In this paper, we propose a scalable distributed key management scheme using a distributed one-way function tree named SIKAS which can significantly reduce the computation and communication costs of maintaining the group key based upon period-based group rekeying. A comparison with previous work has shown that SIKAS provides scalability and rekeying efficiency while preserving both distributed and collaborative properties
16772027
CCL-SVC: Optimizing user experience of broadcasting video on computation capability limited handheld devices
In this paper, we propose a novel scheme using computing complexity layered scalable video coding (CCLSVC) to optimize the user experience of broadcasting video in the computing capability limited handheld terminals. To address the heterogeneity of computing capability among different handheld devices, we employ hierarchal B reference structure of SVC to divide the frames into multiple computing complexity layers (CC Layers) in server side. The handheld clients simply choose to decode the frames in their corresponding layers in terms of their computation capability to maximize the video PSNR. We have proved that the optimal CC Layers division problem is a precedence constrained scheduling problem, which is an NP-complete problem. And we further propose our fast greedy method to approximately get optimized broadcasting video playback PSNR. The simulation shows that our method is superior to temporal SVC and random frame discarding method.
14574047
LRED: a robust active queue management scheme based on packet loss ratio
Active queue management (AQM) is an effective method to enhance congestion control, and to achieve tradeoff between link utilization and delay. The de facto standard, random early detection (RED), and most of its variants use queue length as a congestion indicator to trigger packet dropping. The proportional-integral (PI), use both queue length and traffic input rate as congestion indicators; effective stability model and practical design rules built on the TCP control model and abstracted AQM model reveal that such schemes enhance the stability of a system. In this paper, we propose an AQM scheme with fast response time, yet good robustness. The scheme, called loss ratio based RED (LRED), measures the latest packet loss ratio, and uses it as a complement to queue length in order to dynamically adjust packet drop probability. Employing the closed-form relationship between packet loss ratio and the number of TCP flows, this scheme is responsive even if the number of TCP flows varies significantly. We also provide the design rules for this scheme based on the well-known TCP control model. This scheme's performance is examined under various network configurations, and compared to existing AQM schemes, including PI, random exponentially marking (REM), and adaptive virtual queue (AVQ). Our simulation results show that, with comparable complexity', this scheme has short response time, better robustness, and more desirable tradeoff than PI, REM, and AQV, especially under highly dynamic network and heavy traffic load.
17891437
Call admission control for voice/data integrated cellular networks: performance analysis and comparative study
In this paper, we propose a new call admission control scheme called dual threshold bandwidth reservation, or DTBR scheme. The main novelty is that it builds upon a complete sharing approach, in which the channels in each cell are shared among the different traffic types and multiple thresholds are used to meet the specific quality-of-service (QoS) requirements. We present a detailed comparative study based on mathematical and simulation models, and quantitatively demonstrate that the DTBR is capable of providing the QoS guarantee for each type of traffic, while at the same time leading to much better channel efficiency. We further show that the DTBR scheme with elastic data service can offer both service guarantee and service differentiation for voice and data services, and enhance the bandwidth utilization.
20021213
Trust and Privacy in Dissemination Control
Dissemination control is concerned with controlling electronic resources even after they have been delivered to a legitimate recipient. This paper proposes a secure resource dissemination system framework in which resource providers and recipients are interacted mutually in an anonymous, accountable, and trustworthy way, while security constraints on diverse resources can be continuously protected along resource distribution. We specify the three-party context-aware trust management and privacy protection mechanism based on part behavior using Dempster-Shafer (D-S) theory. We also discuss main logic functions and procedures in the resource dissemination and usage transaction process.
20301405
Unequal-arm Adaptive Rood Pattern Search with Early Terminations For Fast Block-matching Motion Estimation on H.264
Based on a rood-shaped pattern of the motion-vector displacement distribution inherently resulted from block-matching motion estimation, a series of adaptive rood pattern search (ARPS) algorithms have been introduced. Among them, the unequal-arm ARPS has achieved superior performance on many accounts while maintaining a fairly close rate-distortion performance compared with that of the full search. In this paper, an enhanced version of the unequal-arm ARPS is introduced by incorporating early terminations at both the initial search and the refined local search stages. Its performance was compared with that of the UMHexagonS fast block-matching motion estimation algorithm based on the JM-9.3 software encoder. The experimental results show that the unequal-arm ARPS with early terminations has yielded significant search efficiency gain while consistently maintaining a fairly close rate-distortion performance compared with that of the UMHexagonS. Furthermore, the proposed algorithm is fairly simple on implementation
206574982
Battle Damage Assessment based on Bayesian Network
With the quickening rhythm of the war and the complication of battlefield environment,the battle damage assessment(BDA) has had a more important effect on the commander's decision.Because of the complexity of modern battlefield and the uncertainty of battle damage information,it is more and more difficult to determine the damage level of target.Bayesian network is a reasoning and predicting tool coming into vogue only in recent decades.It can correctly reason a problem of interest based on the uncertainty and incomplete information,which is suited to evaluate the battle damage based on the uncertainty and incomplete target damage information.According to the study of BDA based on Bayesian network,the building and updating process of Bayesian network model were discussed.The feasibility and validity of Bayesian network for BDA were analyzed by taking airport runway for example.