Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689230
Tianxiao Ye, Y. Tang, P. Xue
An enhancement of the H.264/AVC transcoding is proposed in this paper. The drift problem in the transcoder is addressed by including spatial intra prediction in image reconstruction. A two-step adaptive intra-mode decision algorithm based on angle information and SATD ranking is introduced to reduce the complexity. Experiment results show that the proposed enhancement significantly increases the speed of intra mode-decision while maintaining a similar PSNR and a slight increase of rate
{"title":"Enhanced H.263 to H.264/AVG Video Transcoding with Adaptive Intra-mode Decision","authors":"Tianxiao Ye, Y. Tang, P. Xue","doi":"10.1109/ICICS.2005.1689230","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689230","url":null,"abstract":"An enhancement of the H.264/AVC transcoding is proposed in this paper. The drift problem in the transcoder is addressed by including spatial intra prediction in image reconstruction. A two-step adaptive intra-mode decision algorithm based on angle information and SATD ranking is introduced to reduce the complexity. Experiment results show that the proposed enhancement significantly increases the speed of intra mode-decision while maintaining a similar PSNR and a slight increase of rate","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127966158","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}
Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689077
Y. Ozturk, E. Lafon
This paper presents a new family of tools developed for application performance analysis via TCP flow analysis in N-tier application domains. Given the application flow signature the DAFA (distributed application flow analyzer) monitors TCP flows and maps the transactions observed over the network to the application flow signature provided. The DAFA offers the groundwork for application flow signature discovery by mapping the interconnected TCP sessions of an N-tier application. The DAFA also provides unique statistical data pertaining to the network traffic generated by these networked applications. The ability to map TCP flows over the application signature enables one to better estimate the bottlenecks in network and application deployment
{"title":"DAFA: Distributed Application Flow Analyzer","authors":"Y. Ozturk, E. Lafon","doi":"10.1109/ICICS.2005.1689077","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689077","url":null,"abstract":"This paper presents a new family of tools developed for application performance analysis via TCP flow analysis in N-tier application domains. Given the application flow signature the DAFA (distributed application flow analyzer) monitors TCP flows and maps the transactions observed over the network to the application flow signature provided. The DAFA offers the groundwork for application flow signature discovery by mapping the interconnected TCP sessions of an N-tier application. The DAFA also provides unique statistical data pertaining to the network traffic generated by these networked applications. The ability to map TCP flows over the application signature enables one to better estimate the bottlenecks in network and application deployment","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"70 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128001476","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}
Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689283
Zuling Chang, Qiao-yan Wen
In this paper, properties and constructions of the class of PS bent functions are considered, which is one special class of bent functions having good algebraic structure and is useful for studying the general structure of bent functions. It is an open problem to characterize the algebraic normal forms of PS bent functions. To construct the bent functions of class PS, we must divide F2 n into 2n/2+1 subspace of dimension n/2 firstly. In this paper, we will study this problem and give one generalized method to divide F2 n, so we can construct PS bent functions easily. Also the algebraic normal forms of PS bent functions are provided
{"title":"On PS Bent Functions","authors":"Zuling Chang, Qiao-yan Wen","doi":"10.1109/ICICS.2005.1689283","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689283","url":null,"abstract":"In this paper, properties and constructions of the class of PS bent functions are considered, which is one special class of bent functions having good algebraic structure and is useful for studying the general structure of bent functions. It is an open problem to characterize the algebraic normal forms of PS bent functions. To construct the bent functions of class PS, we must divide F2 n into 2n/2+1 subspace of dimension n/2 firstly. In this paper, we will study this problem and give one generalized method to divide F2 n, so we can construct PS bent functions easily. Also the algebraic normal forms of PS bent functions are provided","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133303884","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}
Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689199
K. Yok-Khiong, X.J.H. Yap, Lim Woo Lip
In order to prevent inter-slot interference and enhance the system capacity in wideband code division multiple access (WCDMA) time division duplex (TDD) mode of communication, synchronization between node Bs (NBs) are necessary. Although the most straightforward way of achieving synchronization is by using the Global Positioning System (GPS), 3GPP hopes to achieve a completely independent and self-reliant communication system. Therefore 3GPP proposed using concatenated sequences for synchronizing time division duplex (TDD) Node Bs in order to compensate the timing difference among Node Bs. 3GPP suggested using the concatenated extended complementary (CEC) sequences and CEC sequences with multiple code offsets for this synchronization purpose. In this paper, we propose using cyclically extended sequences using integer numbers (mod 4) for NB synchronization. The proposed sequences have comparable autocorrelation and cross correlation properties than the CEC sequences. The purpose of using better security sequences is to prevent intentional sabotage
{"title":"Synchronization of WCDMA TDD Node B using Better Security Sequences","authors":"K. Yok-Khiong, X.J.H. Yap, Lim Woo Lip","doi":"10.1109/ICICS.2005.1689199","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689199","url":null,"abstract":"In order to prevent inter-slot interference and enhance the system capacity in wideband code division multiple access (WCDMA) time division duplex (TDD) mode of communication, synchronization between node Bs (NBs) are necessary. Although the most straightforward way of achieving synchronization is by using the Global Positioning System (GPS), 3GPP hopes to achieve a completely independent and self-reliant communication system. Therefore 3GPP proposed using concatenated sequences for synchronizing time division duplex (TDD) Node Bs in order to compensate the timing difference among Node Bs. 3GPP suggested using the concatenated extended complementary (CEC) sequences and CEC sequences with multiple code offsets for this synchronization purpose. In this paper, we propose using cyclically extended sequences using integer numbers (mod 4) for NB synchronization. The proposed sequences have comparable autocorrelation and cross correlation properties than the CEC sequences. The purpose of using better security sequences is to prevent intentional sabotage","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134232990","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}
Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689042
F. Liberal, A. Ferro, J. O. Fajardo
In last years there have been some governmental initiatives aimed at the regulation of quality of service evaluation in telecommunications services. However this has proven to be a complex task especially for Internet services, where it is difficult to objectively assess the quality of a service and to identify whether one or more of the provider agents are responsible of final dissatisfaction of users. This paper affords the cited problem and intends to provide a methodology to asses the quality of service as perceived by end users. The aims of the proposed model are twofold: the evaluation of perceived quality of service (PQoS) based on subjective and objective measurements and the identification of responsibilities of the different agents involved in a service provision
{"title":"Application of a PQoS Based Quality Management Model to Identify Relative Importance of the Agents","authors":"F. Liberal, A. Ferro, J. O. Fajardo","doi":"10.1109/ICICS.2005.1689042","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689042","url":null,"abstract":"In last years there have been some governmental initiatives aimed at the regulation of quality of service evaluation in telecommunications services. However this has proven to be a complex task especially for Internet services, where it is difficult to objectively assess the quality of a service and to identify whether one or more of the provider agents are responsible of final dissatisfaction of users. This paper affords the cited problem and intends to provide a methodology to asses the quality of service as perceived by end users. The aims of the proposed model are twofold: the evaluation of perceived quality of service (PQoS) based on subjective and objective measurements and the identification of responsibilities of the different agents involved in a service provision","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134353113","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}
Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689266
Haoyang Li, Lanlan Chang, Yap-Peng Tan
Demosaicking process is generally performed to reconstruct full color images from color filter array samples acquired by digital cameras. Over the past recent years, a large number of demosaicking algorithms have been proposed in the literature. When comparing the performances of different demosaicking algorithms, some existing work might use different experimental settings and test images. The objective of this paper is to show that different experimental settings and test images could affect the comparison results substantially. In particular, a series of experiments have been conducted to examine and demonstrate the effects of three experimental settings-CFA arrangement, image size, and image luminance-on demosaicking performance. It is advocated that for a fair comparison of different demosaicking algorithms, these performance factors should be taken into consideration
{"title":"Performance Factors for Evaluating Color Filter Array Demosaicking Algorithms","authors":"Haoyang Li, Lanlan Chang, Yap-Peng Tan","doi":"10.1109/ICICS.2005.1689266","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689266","url":null,"abstract":"Demosaicking process is generally performed to reconstruct full color images from color filter array samples acquired by digital cameras. Over the past recent years, a large number of demosaicking algorithms have been proposed in the literature. When comparing the performances of different demosaicking algorithms, some existing work might use different experimental settings and test images. The objective of this paper is to show that different experimental settings and test images could affect the comparison results substantially. In particular, a series of experiments have been conducted to examine and demonstrate the effects of three experimental settings-CFA arrangement, image size, and image luminance-on demosaicking performance. It is advocated that for a fair comparison of different demosaicking algorithms, these performance factors should be taken into consideration","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114217214","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}
Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689087
Chunbo Ma, Dake He, Jun Ao
When some one wants to sign a message for a designated group in distributed networks, he can sign the message one by one for each member in designated group, but the efficiency is very low. In this paper, we propose a new type of signature, broadcast group oriented signature, to make the signer easier. The signature has the properties: is easy to manage public keys; has no characteristic of key escrow; nobody outside the designated group can verify the signature. The signature is very fit for the condition that the signer only has limited computational resource or bandwidth and each member in designated group is asked to independently verify the signature
{"title":"Broadcast Group Oriented Signature","authors":"Chunbo Ma, Dake He, Jun Ao","doi":"10.1109/ICICS.2005.1689087","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689087","url":null,"abstract":"When some one wants to sign a message for a designated group in distributed networks, he can sign the message one by one for each member in designated group, but the efficiency is very low. In this paper, we propose a new type of signature, broadcast group oriented signature, to make the signer easier. The signature has the properties: is easy to manage public keys; has no characteristic of key escrow; nobody outside the designated group can verify the signature. The signature is very fit for the condition that the signer only has limited computational resource or bandwidth and each member in designated group is asked to independently verify the signature","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114530319","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}
Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689138
S. Luo, Li Zhang
Knowing the background model of a video scenario simplifies the problem of object segmentation and object tracking in the automated video surveillance applications. In this paper, a new algorithm for background model estimation was presented, which is useful in situations where an unobstructed view of the background is not always available. Discovering the true background interval in pixel's intensity history through local analysis of motion and spatial information, it avoids the problems of blending pixel values present in many current methods, such as mean filter and Kalman filter. Experimental results of applying our approach on a sequence of an indoor scene are provided to demonstrate the effectiveness of the proposed method
{"title":"A Background Model Estimation Algorithm Based on Analysis of Local Motion for Video Surveillance","authors":"S. Luo, Li Zhang","doi":"10.1109/ICICS.2005.1689138","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689138","url":null,"abstract":"Knowing the background model of a video scenario simplifies the problem of object segmentation and object tracking in the automated video surveillance applications. In this paper, a new algorithm for background model estimation was presented, which is useful in situations where an unobstructed view of the background is not always available. Discovering the true background interval in pixel's intensity history through local analysis of motion and spatial information, it avoids the problems of blending pixel values present in many current methods, such as mean filter and Kalman filter. Experimental results of applying our approach on a sequence of an indoor scene are provided to demonstrate the effectiveness of the proposed method","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116972632","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}
Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689272
J. Samuelsson
Gaussian mixture model (GMM) based vector quantization (VQ) using a data-dependent weighted Euclidean distortion measure is presented. It is shown how GMM-VQ can be improved by using GMMs that model the optimal VQ point density rather than the source probability density as is done in previous work. GMM training procedures as well as procedures for encoding and decoding that takes a weighted distortion measure into account are presented. The usefulness of the proposed procedures is demonstrated on a source derived from speech spectrum parameters
{"title":"Toward Optimal Mixture Model Based Vector Quantization","authors":"J. Samuelsson","doi":"10.1109/ICICS.2005.1689272","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689272","url":null,"abstract":"Gaussian mixture model (GMM) based vector quantization (VQ) using a data-dependent weighted Euclidean distortion measure is presented. It is shown how GMM-VQ can be improved by using GMMs that model the optimal VQ point density rather than the source probability density as is done in previous work. GMM training procedures as well as procedures for encoding and decoding that takes a weighted distortion measure into account are presented. The usefulness of the proposed procedures is demonstrated on a source derived from speech spectrum parameters","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117070738","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}
Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689108
T. Deng
We have theoretically proved the Liu-Wei's closed-form formula for computing the coefficients of one-dimensional (1-D) variable fractional-delay (VFD) finite-impulse-response (FIR) digital filter derived from nonlinear interpolating polynomial. In this paper, we reveal the symmetry of the VFD filter coefficients and exploit the coefficient symmetry in evaluating the VFD filter frequency characteristics with reduced computational complexity. The coefficient symmetry is also exploited in efficiently implementing the VFD filter as Farrow structure and even-odd structure for high-speed signal processing
{"title":"Coefficient Symmetry and Efficient Implementation of Lagrange-Type Variable Fractional-Delay Filters","authors":"T. Deng","doi":"10.1109/ICICS.2005.1689108","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689108","url":null,"abstract":"We have theoretically proved the Liu-Wei's closed-form formula for computing the coefficients of one-dimensional (1-D) variable fractional-delay (VFD) finite-impulse-response (FIR) digital filter derived from nonlinear interpolating polynomial. In this paper, we reveal the symmetry of the VFD filter coefficients and exploit the coefficient symmetry in evaluating the VFD filter frequency characteristics with reduced computational complexity. The coefficient symmetry is also exploited in efficiently implementing the VFD filter as Farrow structure and even-odd structure for high-speed signal processing","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116085406","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：