Pub Date : 2013-12-01DOI: 10.1109/ICICS.2013.6782878
Cheng-Hung Chen, Yen-Yun Liao, Shu-Wei Liu
This study presents tribal particle swarm optimization (TPSO) to optimize the parameters of the specific neurofuzzy inference system (NIS) for forecasting sunspot numbers. The proposed TPSO uses particle swarm optimization (PSO) as evolution strategies of the tribes optimization algorithm (TOA) to balance local and global exploration of the search space. Experimental results demonstrated that the proposed TPSO method converges quickly and yields a lower RMS error than other current methods.
{"title":"Neurofuzzy inference systems based on tribal particle swarm optimization for forecasting sunspot numbers","authors":"Cheng-Hung Chen, Yen-Yun Liao, Shu-Wei Liu","doi":"10.1109/ICICS.2013.6782878","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782878","url":null,"abstract":"This study presents tribal particle swarm optimization (TPSO) to optimize the parameters of the specific neurofuzzy inference system (NIS) for forecasting sunspot numbers. The proposed TPSO uses particle swarm optimization (PSO) as evolution strategies of the tribes optimization algorithm (TOA) to balance local and global exploration of the search space. Experimental results demonstrated that the proposed TPSO method converges quickly and yields a lower RMS error than other current methods.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134027497","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782897
Desi Luo, Qiyue Yu, W. Meng
The physical layer network coding (PNC) takes advantages of signal interference at relay node and improves the channel capacity, therefore, PNC becomes an important research topic. However, the frequency-selective fading channel would destroy the performances of PNC. This paper considers orthogonal frequency division multiplex (OFDM) in PNC, when signals transmitted over a frequency-selective fading channel, and an optimum power allocation scheme is proposed. Simulation results show that the presented system not only eliminates the multi-path interference, but also maximizes the channel capacity by the optimum power allocation.
{"title":"Optimum power allocation for OFDM in physical-layer network coding over a flat frequency-selective fading channel","authors":"Desi Luo, Qiyue Yu, W. Meng","doi":"10.1109/ICICS.2013.6782897","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782897","url":null,"abstract":"The physical layer network coding (PNC) takes advantages of signal interference at relay node and improves the channel capacity, therefore, PNC becomes an important research topic. However, the frequency-selective fading channel would destroy the performances of PNC. This paper considers orthogonal frequency division multiplex (OFDM) in PNC, when signals transmitted over a frequency-selective fading channel, and an optimum power allocation scheme is proposed. Simulation results show that the presented system not only eliminates the multi-path interference, but also maximizes the channel capacity by the optimum power allocation.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125057939","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782782
Ganglong Duan, Long Wei, Jianren Wang, Hongqi Wang
Adaptive Weighted Multi-Element Collaborative Representation for Visual Classification is proposed in this paper. To address the weak discriminative power of SRC (sparse representation classifier) method, we propose using multiple elements to represent each element and construct multiple collaborative representation for classification. To reflect the different element with different importance and discriminative power, we present an adaptive weighted residuals method to linearly combine different element representations for classification. Experimental results demonstrate the effectiveness and better classification accuracy of our proposed method.
{"title":"Adaptive Weighted Multi-Element Collaborative Representation for Visual Classification","authors":"Ganglong Duan, Long Wei, Jianren Wang, Hongqi Wang","doi":"10.1109/ICICS.2013.6782782","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782782","url":null,"abstract":"Adaptive Weighted Multi-Element Collaborative Representation for Visual Classification is proposed in this paper. To address the weak discriminative power of SRC (sparse representation classifier) method, we propose using multiple elements to represent each element and construct multiple collaborative representation for classification. To reflect the different element with different importance and discriminative power, we present an adaptive weighted residuals method to linearly combine different element representations for classification. Experimental results demonstrate the effectiveness and better classification accuracy of our proposed method.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134268419","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782887
Feng-Jie Yeh, B. Su
In this paper, two subspace (SS) based blind channel estimation methods for cyclic prefixing (CP) based multi-input and multi-output (MIMO) OFDM systems are proposed. The first one generalized a previously reported single-input and single-output (SISO) based method into the MIMO case. The second one is an extension to the first one by smartly introducing additional columns per received block in the channel matrix equation. These two SS methods require few received blocks to satisfy the persistency of excitation (POE) criterion and do not require the number of receive antennas to be greater than that of transmit antennas. Simulation results demonstrate the capability of the proposed methods to perform blind channel estimation using few received blocks. Compared to multiple existing SS methods, significant performance improvements of the proposed methods are observed given the same amount of available received data.
针对基于循环前缀(CP)的多输入多输出OFDM系统，提出了两种基于子空间(SS)的盲信道估计方法。第一个将先前报道的基于单输入单输出(SISO)的方法推广到MIMO案例中。第二个是对第一个的扩展，它巧妙地在通道矩阵方程中为每个接收块引入了额外的列。这两种SS方法只需较少的接收块即可满足POE (persistence of excitation)标准，并且不要求接收天线的数量大于发射天线的数量。仿真结果表明，该方法能够利用较少的接收块进行盲信道估计。与现有的多种SS方法相比，在接收到的可用数据量相同的情况下，所提出的方法的性能得到了显著提高。
{"title":"Subspace-based blind channel estimation for cyclic prefixed MIMO-OFDM systems using few received blocks","authors":"Feng-Jie Yeh, B. Su","doi":"10.1109/ICICS.2013.6782887","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782887","url":null,"abstract":"In this paper, two subspace (SS) based blind channel estimation methods for cyclic prefixing (CP) based multi-input and multi-output (MIMO) OFDM systems are proposed. The first one generalized a previously reported single-input and single-output (SISO) based method into the MIMO case. The second one is an extension to the first one by smartly introducing additional columns per received block in the channel matrix equation. These two SS methods require few received blocks to satisfy the persistency of excitation (POE) criterion and do not require the number of receive antennas to be greater than that of transmit antennas. Simulation results demonstrate the capability of the proposed methods to perform blind channel estimation using few received blocks. Compared to multiple existing SS methods, significant performance improvements of the proposed methods are observed given the same amount of available received data.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133610377","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782935
Zhiguo Zhang, Z. Fu, S. Chan, Y. Hung, G. Motta, X. Di, B. Biswal
Investigation of the intrinsic brain networks using the resting-state functional magnetic resonance imaging (rs-fMRI) is generally based on the assumption that the functional organization is stationary across the duration of the scan. Hence, the presence and potential of temporal and spatial dynamics of the functional connectivity (FC), which is usually measured by the correlation coefficients between rs-fMRI signals of two regions, are not taken into account in most of the research. Recent studies have shown that the resting-state brain activities are time-varying in nature with substantial dynamic characteristics. However, an effective method for estimating the time-varying FC is lacking, which is mainly due to the difficulty in choosing an appropriate window to localize the time-varying correlation coefficients (TVCC). In this paper, we introduce a novel method for adaptively estimating the TVCC of non-stationary signals and study its application to infer dynamic FC of rs-fMRI data. The proposed method employs a sliding window with adaptive size, which is selected by a local plug-in rule to minimize the mean square error, to estimate the TVCC locally. Simulation results on synthetic data show that the proposed method outperforms the conventional TVCC estimators with a fixed window. Furthermore, the proposed method is used on real rs-fMRI signals, and the results demonstrate that the FC in the resting state are transient and the variability of FCs between different brain regions differs substantially.
{"title":"Adaptive window selection in estimating dynamic functional connectivity of resting-state fMRI","authors":"Zhiguo Zhang, Z. Fu, S. Chan, Y. Hung, G. Motta, X. Di, B. Biswal","doi":"10.1109/ICICS.2013.6782935","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782935","url":null,"abstract":"Investigation of the intrinsic brain networks using the resting-state functional magnetic resonance imaging (rs-fMRI) is generally based on the assumption that the functional organization is stationary across the duration of the scan. Hence, the presence and potential of temporal and spatial dynamics of the functional connectivity (FC), which is usually measured by the correlation coefficients between rs-fMRI signals of two regions, are not taken into account in most of the research. Recent studies have shown that the resting-state brain activities are time-varying in nature with substantial dynamic characteristics. However, an effective method for estimating the time-varying FC is lacking, which is mainly due to the difficulty in choosing an appropriate window to localize the time-varying correlation coefficients (TVCC). In this paper, we introduce a novel method for adaptively estimating the TVCC of non-stationary signals and study its application to infer dynamic FC of rs-fMRI data. The proposed method employs a sliding window with adaptive size, which is selected by a local plug-in rule to minimize the mean square error, to estimate the TVCC locally. Simulation results on synthetic data show that the proposed method outperforms the conventional TVCC estimators with a fixed window. Furthermore, the proposed method is used on real rs-fMRI signals, and the results demonstrate that the FC in the resting state are transient and the variability of FCs between different brain regions differs substantially.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"317 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116364752","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782791
Jen-Ho Yang, Ya-Fen Chang, Chih-Cheng Huang
In the cloud computing, user authentication is an important security mechanism because it provides the functions of authentication, authorization, and accounting for cloud servers. However, the previously proposed user authentication schemes have many security and efficiency problems. In addition, these schemes can only work on single server environments. To solve the above problems, we propose a new user authentication scheme on multi-server environments for cloud computing in this paper. Compared with the related works, the proposed scheme has less computation costs. In addition, the proposed scheme can be applied to multi-server environments because the ID-based concept is used. Therefore, the proposed user authentication scheme provides efficiency, security, and flexibility for the cloud computing applications.
{"title":"A user authentication scheme on multi-server environments for cloud computing","authors":"Jen-Ho Yang, Ya-Fen Chang, Chih-Cheng Huang","doi":"10.1109/ICICS.2013.6782791","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782791","url":null,"abstract":"In the cloud computing, user authentication is an important security mechanism because it provides the functions of authentication, authorization, and accounting for cloud servers. However, the previously proposed user authentication schemes have many security and efficiency problems. In addition, these schemes can only work on single server environments. To solve the above problems, we propose a new user authentication scheme on multi-server environments for cloud computing in this paper. Compared with the related works, the proposed scheme has less computation costs. In addition, the proposed scheme can be applied to multi-server environments because the ID-based concept is used. Therefore, the proposed user authentication scheme provides efficiency, security, and flexibility for the cloud computing applications.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115239484","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782830
Yuri Umezaki, S. Goto
With the popularity of mobile devices such as mobile phones and cameras, zooming and displaying an arbitrary region of interest (ROI) from a high-resolution video has gained considerable importance. In this study, we implement two methods - partial decoding and tiled encoding - for ROI-based streaming in High Efficiency Video Coding (HEVC). In partial decoding, only the ROI and dependence area are decoded; this approach reduces the calculation cost. In tiled encoding, video frames are split into a grid of tiles, each of which is encoded independently; this approach requires a compatible decoder, and it reduces the streaming bitrate and decoding calculation cost. We evaluated these two methods in terms of the decoding calculation cost, bandwidth efficiency, and video quality. Experimental results show that partial decoding reduced the decoding calculation cost by 35-55%. Tiled encoding showed optimal decoding calculation cost and bandwidth efficiency for a tile size of 128 pixels.
随着移动设备(如移动电话和相机)的普及，从高分辨率视频中缩放和显示任意感兴趣区域(ROI)变得相当重要。在本研究中，我们针对高效率视讯编码(High Efficiency Video Coding, HEVC)中基于roi的串流，实现了部分解码和平铺编码两种方法。在部分解码中，只对感兴趣区域和相关区域进行解码;这种方法降低了计算成本。在平铺编码中，视频帧被分割成一个平铺网格，每个平铺网格独立编码;这种方法需要一个兼容的解码器，并且降低了流比特率和解码计算成本。我们从解码计算成本、带宽效率和视频质量三个方面对这两种方法进行了评价。实验结果表明，部分译码可使译码计算成本降低35 ~ 55%。对于128像素的平铺编码，显示出最佳的解码计算成本和带宽效率。
{"title":"Image segmentation approach for realizing zoomable streaming HEVC video","authors":"Yuri Umezaki, S. Goto","doi":"10.1109/ICICS.2013.6782830","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782830","url":null,"abstract":"With the popularity of mobile devices such as mobile phones and cameras, zooming and displaying an arbitrary region of interest (ROI) from a high-resolution video has gained considerable importance. In this study, we implement two methods - partial decoding and tiled encoding - for ROI-based streaming in High Efficiency Video Coding (HEVC). In partial decoding, only the ROI and dependence area are decoded; this approach reduces the calculation cost. In tiled encoding, video frames are split into a grid of tiles, each of which is encoded independently; this approach requires a compatible decoder, and it reduces the streaming bitrate and decoding calculation cost. We evaluated these two methods in terms of the decoding calculation cost, bandwidth efficiency, and video quality. Experimental results show that partial decoding reduced the decoding calculation cost by 35-55%. Tiled encoding showed optimal decoding calculation cost and bandwidth efficiency for a tile size of 128 pixels.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115475539","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782937
Qi Cai, Li Song
Integrating efficient visual perceptual cues into standardized video coding framework can improve performance significantly. In this paper we propose to enhance AVS encoder by using the latest just noticeable distortion (JND) model to adjust DCT coefficients of prediction residues in a content adaptive way. To better modeling JND profile in AVS integer DCT domain, we further derive the JND mapping from the classical DCT domain to AVS Integer DCT domain. The experiment shows that the proposed algorithm can reduce the bitrate by about 13% on average, compared to the AVS standard encoder at similar visual quality.
{"title":"AVS encoding optimization with perceptual just noticeable distortion model","authors":"Qi Cai, Li Song","doi":"10.1109/ICICS.2013.6782937","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782937","url":null,"abstract":"Integrating efficient visual perceptual cues into standardized video coding framework can improve performance significantly. In this paper we propose to enhance AVS encoder by using the latest just noticeable distortion (JND) model to adjust DCT coefficients of prediction residues in a content adaptive way. To better modeling JND profile in AVS integer DCT domain, we further derive the JND mapping from the classical DCT domain to AVS Integer DCT domain. The experiment shows that the proposed algorithm can reduce the bitrate by about 13% on average, compared to the AVS standard encoder at similar visual quality.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116944866","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782815
Soni Prattipati, M. Swamy, P. Meher
In the field of image and data compression there is always a need for novel transform coding techniques promising improved reconstruction and reduced computational complexity. The usage of integer adaptation of the popular discrete cosine transform (DCT) with fixed quantization is prevalent in the field of video compression due to its ease of computation and acceptable performance. However, there exist other polynomial-based orthogonal transforms like discrete Tchebichef transform (DTT), which possess valuable properties like energy compaction, but are potentially unexploited in comparison. The influence of specific features, such as the structure and content, of the image on the quality of reconstructed image after decompression is undeniable. This paper aims to harness this aspect and introduces a technique to adapt the quantization performed during compression according to the characteristics of the image block without any additional computational or transmission overhead. The image compression performance of integer DTT and integer DCT, using both variable and fixed quantization, are evaluated and compared.
{"title":"A variable quantization technique for image compression using integer Tchebichef transform","authors":"Soni Prattipati, M. Swamy, P. Meher","doi":"10.1109/ICICS.2013.6782815","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782815","url":null,"abstract":"In the field of image and data compression there is always a need for novel transform coding techniques promising improved reconstruction and reduced computational complexity. The usage of integer adaptation of the popular discrete cosine transform (DCT) with fixed quantization is prevalent in the field of video compression due to its ease of computation and acceptable performance. However, there exist other polynomial-based orthogonal transforms like discrete Tchebichef transform (DTT), which possess valuable properties like energy compaction, but are potentially unexploited in comparison. The influence of specific features, such as the structure and content, of the image on the quality of reconstructed image after decompression is undeniable. This paper aims to harness this aspect and introduces a technique to adapt the quantization performed during compression according to the characteristics of the image block without any additional computational or transmission overhead. The image compression performance of integer DTT and integer DCT, using both variable and fixed quantization, are evaluated and compared.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121148847","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782913
Danyang Zhang, Fan Li, Chao Zhang
In this paper, a dual-decoder-based scheduling algorithm is proposed for H.264 video transmission over wireless networks. In the algorithm, the packet is scheduled by the packet quality contribution index (PQCI). The PQCI is defined and estimated not only by the quality distortion made for the current frame, but also by that made for the frames which directly or indirectly related with the current frame. A dual-decoder-model algorithm is proposed for the PQCI estimation. A novel architecture with two simulated decoders in the sender is developed. The simulations show that the proposed algorithm significantly outperforms the conventional methods in terms of received video qualities.
{"title":"Dual-decoder-model scheduling for H.264 video transmission over wireless networks","authors":"Danyang Zhang, Fan Li, Chao Zhang","doi":"10.1109/ICICS.2013.6782913","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782913","url":null,"abstract":"In this paper, a dual-decoder-based scheduling algorithm is proposed for H.264 video transmission over wireless networks. In the algorithm, the packet is scheduled by the packet quality contribution index (PQCI). The PQCI is defined and estimated not only by the quality distortion made for the current frame, but also by that made for the frames which directly or indirectly related with the current frame. A dual-decoder-model algorithm is proposed for the PQCI estimation. A novel architecture with two simulated decoders in the sender is developed. The simulations show that the proposed algorithm significantly outperforms the conventional methods in terms of received video qualities.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123483357","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
扫码关注我们
求助内容：
应助结果提醒方式：