{"title":"Adaptive Event Synchronization Control for Distributed Virtual Environment","authors":"Jaeyoun Kim, Seokhee Lee, JongWon Kim","doi":"10.1109/MMSP.2005.248612","DOIUrl":"https://doi.org/10.1109/MMSP.2005.248612","url":null,"abstract":"In this paper, we propose an adaptive event synchronization control for distributed virtual environment (DVE) systems connected over dynamically time-varying networks. Existing adaptive synchronization approaches still have two challenges: disturbance by network traffic load fluctuation and event skipping by contracting the playout delay. Thus, by adopting so-called adaptive event synchronization (AVS) control, we attempt to improve the adaptability of DVE synchronization control. With the proposed control, the event buffer management provides a cost-effective guideline on timing based on idle time for contracting playout delay to suppress the event skipping. Simulation results are presented to show the enhanced performance of the proposed adaptive event synchronization control","PeriodicalId":191719,"journal":{"name":"2005 IEEE 7th Workshop on Multimedia Signal Processing","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123043434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secure Key Management for Flexible Digital Rights Management of Scalable Codestreams","authors":"Bin B. Zhu, Min Feng, Shipeng Li","doi":"10.1109/MMSP.2005.248617","DOIUrl":"https://doi.org/10.1109/MMSP.2005.248617","url":null,"abstract":"The key management for multi-type, multi-level scalable access control of a fine granularity scalability codestream is addressed in this paper. We first present an efficient partially ordered set (poset) to represent scalable access control so that any access control schemes for a poset can be applied and a single secret key is needed to transfer to a user. We then present a secure key scheme modified from our previous scalable access key scheme for the resulting poset. The key scheme is based on the group Diffie-Hellman key agreement, and is secure","PeriodicalId":191719,"journal":{"name":"2005 IEEE 7th Workshop on Multimedia Signal Processing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125033912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secure Quantization Based Data Embedding","authors":"Ning Liu, Palak K. Amin, K.P. Subbalakshmi","doi":"10.1109/MMSP.2005.248651","DOIUrl":"https://doi.org/10.1109/MMSP.2005.248651","url":null,"abstract":"In this paper we propose a new secure quantization based data embedding algorithm and analyze the security, capacity, robustness and embedding induced distortion of this scheme. Using a joint security, robustness and capacity measure, we show that the proposed scheme provides an enhancement in security in comparison to current secure quantization based data hiding schemes. We derive a mathematic expression for the security of our algorithm. Using this metric, we show that the security of our algorithm can be increased independent of these parameters: capacity, robustness and embedding induced distortion. The maximum security depends only on the length of key sequence, which is limited only by the size of the host image","PeriodicalId":191719,"journal":{"name":"2005 IEEE 7th Workshop on Multimedia Signal Processing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125155093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Scalable Non-Binary Distributed Source Coding Using Gray Codes","authors":"Wei Liu, W. Zeng","doi":"10.1109/MMSP.2005.248658","DOIUrl":"https://doi.org/10.1109/MMSP.2005.248658","url":null,"abstract":"In this paper we propose a bit-plane based, scalable distributed source coding (DSC) scheme for non-binary correlated sources. In the source coding part of DSC, the symbols are quantized and the quantization indices are converted into binary forms using Gray codes. The channel coding part encodes each bit-plane independently using turbo codes. The turbo decoder that works in binary domain is facilitated by an outer loop that captures the symbol-domain correlation. Simulation results show that, in asymmetric DSC of joint Gaussian sources, the overall system performance is greatly improved by using Gray codes. It is also demonstrated that progressive transmission is well supported","PeriodicalId":191719,"journal":{"name":"2005 IEEE 7th Workshop on Multimedia Signal Processing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125190774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Single access variable block size motion estimation for multimedia SoC","authors":"Saengrawee Pratoomtong, Y. Hu","doi":"10.1109/MMSP.2005.248557","DOIUrl":"https://doi.org/10.1109/MMSP.2005.248557","url":null,"abstract":"To obtain an optimum rate-distortion characteristic, it is crucial to have accurate motion and residue information to guild the optimum block size selection process. In this paper, we first modified the full search block matching motion estimation (FBME) algorithm to accommodate the motion vector and sum of absolute different (SAD) calculation of each of the 7 modes when perform FBME on one macroblock without any substantial change in the original program. Then we transform the algorithm to reduce the excessive data access to reference frame. With the reduction of redundant data access and the accuracy of the FBME algorithm, the purpose algorithm provides the most accurate motion and residue information without substantially increasing the complexity and memory requirement of the variable block size motion estimation (VBME)","PeriodicalId":191719,"journal":{"name":"2005 IEEE 7th Workshop on Multimedia Signal Processing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125925443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Improved Update Operator for H.264 Scalable Extension","authors":"Yihua Chen, Jizheng Xu, Feng Wu, H. Xiong","doi":"10.1109/MMSP.2005.248637","DOIUrl":"https://doi.org/10.1109/MMSP.2005.248637","url":null,"abstract":"This paper presents an improved update operator for H.264 scalable extension, which is a new joint standardization effort of ISO/IEC and ITU-T. Energy distributed update (EDU) is utilized to reduce decoder complexity. The relationship between EDU and the optimum update in B. Girod et al., (2005) is revealed. Moreover, for the constrained motion-compensated lifting structure employed in H.264 scalable extension, we derive a set of new update coefficients to improve coding performance based on distortion analysis. Experimental results show that the proposed update operator can improve coding efficiency with less complexity and meanwhile, frame-wise quality fluctuation is also reduced","PeriodicalId":191719,"journal":{"name":"2005 IEEE 7th Workshop on Multimedia Signal Processing","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122033172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application-Scalable Image-based Authentication Framework with JPEG2000","authors":"Giaime Ginesu, D. Giusto, T. Onali","doi":"10.1109/MMSP.2005.248643","DOIUrl":"https://doi.org/10.1109/MMSP.2005.248643","url":null,"abstract":"A novel framework for image-based authentication (IBA) is proposed and evaluated. The proposed system relies on data and application scalability in order to optimize its performance in several environments, from wired applications to mobile authentication. Data scalability is exploited through the JPEG2000 standard and JPIP framework. The wireless environment, in particular, imposes severe constraints on data transmission capability and user friendliness, which are satisfied by the devised system","PeriodicalId":191719,"journal":{"name":"2005 IEEE 7th Workshop on Multimedia Signal Processing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122173552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hrirs' Adaptive Non-Linear Approximation Model Based on Wavelet Transformation","authors":"J. Zhang, Zhen-yang Wu","doi":"10.1109/MMSP.2005.248551","DOIUrl":"https://doi.org/10.1109/MMSP.2005.248551","url":null,"abstract":"During the study of spatial hearing, it is requisite to consider how to properly model the acoustical characteristics of HRTFs (head-related transfer functions: HRTFs) or HRIRs (head-related impulse responses: HRIRs) corresponding to certain positions. In our work, we managed to carry through adaptive non-linear approximation in the field of wavelet transformation. The results show that, the HRIRs' adaptive nonlinear approximation model is a more effective data reduction model, faster and averagely 5 dB better than the traditional PCA (Karhunen-Loeve transform) model based on relative error","PeriodicalId":191719,"journal":{"name":"2005 IEEE 7th Workshop on Multimedia Signal Processing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128496688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Sequential Approach to Sparse Component Analysis","authors":"Daniel V. Smith, J. Lukasiak, I. Burnett","doi":"10.1109/MMSP.2005.248603","DOIUrl":"https://doi.org/10.1109/MMSP.2005.248603","url":null,"abstract":"A sequential approach to sparse component analysis (SeqTIF) is proposed in this paper. Although SeqTIF employs the estimation process of the simultaneous TIFROM algorithm, a source cancellation and deflation technique are also incorporated to sequentially estimate speech signals in the mixture. Results indicate that SeqTIF's separation performance shows a clear improvement upon the simultaneous TIFROM approach, due to the less restrictive assumptions it places upon the signals in the mixture. In particular, the analysis indicates SeqTIF's data efficiency is high, enabling the sequential approach to track a time-varying mixture with much greater accuracy than the simultaneous algorithm. Furthermore, SeqTIF is a more flexible approach, free from the constraints that a simultaneous approach places upon the mixing system","PeriodicalId":191719,"journal":{"name":"2005 IEEE 7th Workshop on Multimedia Signal Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124554328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Perceptual Weighting in LSP-Based Multi-Description Coding for Real-Time Low-Bit-Rate Voice Over IP","authors":"Dong Lin, B. Wah, Hang Yu","doi":"10.1109/MMSP.2005.248673","DOIUrl":"https://doi.org/10.1109/MMSP.2005.248673","url":null,"abstract":"This paper focuses on improving an LSP-based multi-description coding (MDC) scheme for concealing losses when real-time CELP-coded speech data is sent over IP networks. In that scheme, LSP vectors are interleaved because they are highly correlated and can be reconstructed by interpolations when packets are delayed or lost. However, excitation vectors are random in nature and must be replicated in order to conceal losses. To avoid increasing the bit rate of the encoded speech, the excitation vectors are generated from longer subframes. This leads to lower quality of the decoded speech because noise from outside formant regions is over-emphasized, and more excitation information is extracted there. To improve quality, we propose in this paper to modify the perceptual-weighting filter (PWF) in the coder in order to adjust the allocation of noise inside and outside formant regions. We further study a method that selects the PWF in such a way that maintains high quality of the LSP-based MDC across different voice streams and loss scenarios. Experimental results on FS-1016 CELP (4800 bps), ITU G.723.1 ACELP (5300 bps), and ITU G.723.1 MP-MLQ (6300 bps) demonstrate noticeable improvements in decoding quality","PeriodicalId":191719,"journal":{"name":"2005 IEEE 7th Workshop on Multimedia Signal Processing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129665016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}