In this paper, we propose an entropy coding method to further compress quantized mel-frequency cepstral coefficients (MFCCs) extracted for distributed speech recognition (DSR). In the ETSI extended DSR standard, MFCCs are compressed with additional parameters such as pitch and voicing class. It is observed that the distribution of MFCCs varies according to the voicing class, thereby enabling the design of different Huffman trees for MFCCs according to voicing class. Based on this observation, we could further reduce the bit-rates of compressed MFCCs compared to the Huffman coding method that does not consider voicing class. Subsequent experiments show that the bit-rate of the proposed method is 34.18 bits per frame, which is 1.84 bits/frame lower than that of the Huffman coding method without voicing.
{"title":"Voicing Class Dependent Huffman Coding of Compressed Front-End Feature Vector for Distributed Speech Recognition","authors":"Deok Su Kim, H. Kim","doi":"10.1109/FGCNS.2008.44","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.44","url":null,"abstract":"In this paper, we propose an entropy coding method to further compress quantized mel-frequency cepstral coefficients (MFCCs) extracted for distributed speech recognition (DSR). In the ETSI extended DSR standard, MFCCs are compressed with additional parameters such as pitch and voicing class. It is observed that the distribution of MFCCs varies according to the voicing class, thereby enabling the design of different Huffman trees for MFCCs according to voicing class. Based on this observation, we could further reduce the bit-rates of compressed MFCCs compared to the Huffman coding method that does not consider voicing class. Subsequent experiments show that the bit-rate of the proposed method is 34.18 bits per frame, which is 1.84 bits/frame lower than that of the Huffman coding method without voicing.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131396600","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}
Unequal error protection on video transmission is widely used to combat with bit errors in the wireless channel. However, current UEP schemas are based on heuristic approaches and taking no account of the characteristics of human visual system. In this paper, a novel unequal error protection schema for wireless H.264 video transmission based on a modified perceived motion energy (PME) model is presented. According to the sensitive characteristics to video motions of human eyes, the proposed modified PME model taking account to the encoding features of H.264/AVC standard to analyze and model the motions in H.264/AVC encoded video. Based on this model, the video bitstream is divided into several quality layers and unequal error protection is designed to protect the layered bitstream for the transmission over wireless channels. Experiment results show that higher video transmission quality is obtained.
{"title":"Unequal Error Protection Schema for Wireless H.264 Video Transmission Based on Perceived Motion Energy Model","authors":"Gang Zhao, Gao Ming, Shuhui Wang, Tai Wang","doi":"10.1109/FGCNS.2008.45","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.45","url":null,"abstract":"Unequal error protection on video transmission is widely used to combat with bit errors in the wireless channel. However, current UEP schemas are based on heuristic approaches and taking no account of the characteristics of human visual system. In this paper, a novel unequal error protection schema for wireless H.264 video transmission based on a modified perceived motion energy (PME) model is presented. According to the sensitive characteristics to video motions of human eyes, the proposed modified PME model taking account to the encoding features of H.264/AVC standard to analyze and model the motions in H.264/AVC encoded video. Based on this model, the video bitstream is divided into several quality layers and unequal error protection is designed to protect the layered bitstream for the transmission over wireless channels. Experiment results show that higher video transmission quality is obtained.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125631557","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}
In this paper we show two modifications of the gpICA (geometric post non-linear independent component analysis) algorithm. gpICA algorithm is a novel method to solve the PNL (post non-linear) scheme. We propose these modifications to improve the mean squared error, the correlation of the recovered signals and algorithm reliability. The first improvement, called compensation, takes advantage from the implicit information given by the point to be linearized. On the other hand, while the original gpICA algorithm uses two sets of two points to make an update, our second modification uses two sets of four points. We present experimental results which validates the effectiveness of each modification.
{"title":"Improvement to Geometric Linearization of gpICA Algortihm by Compensation and Multiple Points","authors":"E. Torres, P. Ulloa, A. Gaona","doi":"10.1109/FGCNS.2008.52","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.52","url":null,"abstract":"In this paper we show two modifications of the gpICA (geometric post non-linear independent component analysis) algorithm. gpICA algorithm is a novel method to solve the PNL (post non-linear) scheme. We propose these modifications to improve the mean squared error, the correlation of the recovered signals and algorithm reliability. The first improvement, called compensation, takes advantage from the implicit information given by the point to be linearized. On the other hand, while the original gpICA algorithm uses two sets of two points to make an update, our second modification uses two sets of four points. We present experimental results which validates the effectiveness of each modification.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130743150","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}
Recently, the number of people who want to study online has gradually increased. In addition, the desire of people is also increasing, which represents their special knowledge and personality with the advent of the new paradigm of UCC (User Created Contents). Most of the educational Web-sites currently offer boring and unified educational contents with no interesting objects. Thus, this thesis aims to solve these problems of existing online educational web-sites by proposing a new method of design for an educational and useful space that everyone can enjoy and that will manifest the disposition of users. This study shows that it is possible to make a pleasant environment and improve educational effects in cyber space by designing various design elements in accordance with individual tastes, and emphasizing beauty and facility through the customized design method. In short, this study proposes the model of an online educational web-site that carries various interfaces and focuses on customized designs.
{"title":"FID : Facility-Connected Interface Design Method for Maximizing Usability in Cyber Education","authors":"Eun-Young Park, Young-Ho Park","doi":"10.1109/FGCNS.2008.90","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.90","url":null,"abstract":"Recently, the number of people who want to study online has gradually increased. In addition, the desire of people is also increasing, which represents their special knowledge and personality with the advent of the new paradigm of UCC (User Created Contents). Most of the educational Web-sites currently offer boring and unified educational contents with no interesting objects. Thus, this thesis aims to solve these problems of existing online educational web-sites by proposing a new method of design for an educational and useful space that everyone can enjoy and that will manifest the disposition of users. This study shows that it is possible to make a pleasant environment and improve educational effects in cyber space by designing various design elements in accordance with individual tastes, and emphasizing beauty and facility through the customized design method. In short, this study proposes the model of an online educational web-site that carries various interfaces and focuses on customized designs.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132977218","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}
E. Hyun, Sangdong Kim, Chi-Hwan Park, Jong-hun Lee
In this paper, the proposed technique can provide the range profile with adaptive range resolution for automotive frequency modulation continuous wave (FMCW radar.) For long-distance targets, the range is extracted with rough resolution using the basic FFT. The high resolution algorithm is used for near-distance targets, for which the collision probability is high.
{"title":"Automotive FMCW Radar with Adaptive Range Resolution","authors":"E. Hyun, Sangdong Kim, Chi-Hwan Park, Jong-hun Lee","doi":"10.1109/FGCNS.2008.48","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.48","url":null,"abstract":"In this paper, the proposed technique can provide the range profile with adaptive range resolution for automotive frequency modulation continuous wave (FMCW radar.) For long-distance targets, the range is extracted with rough resolution using the basic FFT. The high resolution algorithm is used for near-distance targets, for which the collision probability is high.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133341906","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}
Recently, the open mobile alliance (OMA) has been set to define open DRM technologic specifications to protect copyrighted content against piracy, unauthorized use and distribution over mobile networks. This paper proposes an efficient OMA DRM v2.0 ROAP for protecting a rights object for a device. Our proposed ROAP can offer a more efficient DRM system for future mobile networks.
{"title":"Efficient OMA DRM v2.0 ROAP for Protecting a Rights Object for a Device","authors":"Eunjun Yoon, Jeung-Seop Kim, Byung-Ho Cho, K. Yoo","doi":"10.1109/FGCNS.2008.82","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.82","url":null,"abstract":"Recently, the open mobile alliance (OMA) has been set to define open DRM technologic specifications to protect copyrighted content against piracy, unauthorized use and distribution over mobile networks. This paper proposes an efficient OMA DRM v2.0 ROAP for protecting a rights object for a device. Our proposed ROAP can offer a more efficient DRM system for future mobile networks.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133367535","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}
A lossless information hiding scheme based on neighboring correlation is proposed in this paper. The scheme hides secret information into gray-level images according to the correlation between neighboring pixels. The performance of the proposed scheme has been evaluated in terms of payload capacity, image distortion, as well as embedding rate, and the experimental results show that the proposed lossless information scheme is capable of providing a great payload capacity without causing noticeable distortion, and the embedding rate is quite high. In addition, the proposed scheme can completely restore the host image after secret data extraction.
{"title":"Lossless Information Hiding Scheme Based on Neighboring Correlation","authors":"Chinchen Chang, T. Lu","doi":"10.1109/FGCNS.2008.14","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.14","url":null,"abstract":"A lossless information hiding scheme based on neighboring correlation is proposed in this paper. The scheme hides secret information into gray-level images according to the correlation between neighboring pixels. The performance of the proposed scheme has been evaluated in terms of payload capacity, image distortion, as well as embedding rate, and the experimental results show that the proposed lossless information scheme is capable of providing a great payload capacity without causing noticeable distortion, and the embedding rate is quite high. In addition, the proposed scheme can completely restore the host image after secret data extraction.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114068404","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}
Jinyoung Youn, Younguk Park, Jeongho Shin, J. Paik
This paper presents a spatially adaptive image restoration for EDoF lens images. A practical implementation method is also discussed for real-time applications. For basic image restoration we adopt the truncated constrained least squares (TCLS) filter, and for adaptively selecting the weights of the observed and the restored images we compute local variance. Based on experimental results, we can claim that the proposed restoration algorithm can successfully remove the image degradation with suppressing noise amplification.
{"title":"Spatially Adaptive Image Restoration and its FIR Implementation","authors":"Jinyoung Youn, Younguk Park, Jeongho Shin, J. Paik","doi":"10.1109/FGCNS.2008.54","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.54","url":null,"abstract":"This paper presents a spatially adaptive image restoration for EDoF lens images. A practical implementation method is also discussed for real-time applications. For basic image restoration we adopt the truncated constrained least squares (TCLS) filter, and for adaptively selecting the weights of the observed and the restored images we compute local variance. Based on experimental results, we can claim that the proposed restoration algorithm can successfully remove the image degradation with suppressing noise amplification.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114873183","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}
In this paper, we propose a clustering method to solve computing resource problem that may arise in very large scale on-line Chinese character recognition using HMM and structure code. The basic concept of our method is to collect HMMs that have same number of parameters, then to cluster those HMMs. In our system, the number of classes is 98,639, which makes it almost impossible to load all the models in main memory. We load only cluster centers in main memory while the individual HMM is loaded only when it is needed. We got 0.92 sec/char recognition speed and 96.03% 30-candidate recognition accuracy for Kanji, using less than 250 MB RAM for the recognition system.
{"title":"Comparison of Distance Computation Methods in Trained HMM Clustering for Huge-Scale Online Handwritten Chinese Character Recognition","authors":"KwangSeob Kim, J. Ha","doi":"10.1109/FGCNS.2008.29","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.29","url":null,"abstract":"In this paper, we propose a clustering method to solve computing resource problem that may arise in very large scale on-line Chinese character recognition using HMM and structure code. The basic concept of our method is to collect HMMs that have same number of parameters, then to cluster those HMMs. In our system, the number of classes is 98,639, which makes it almost impossible to load all the models in main memory. We load only cluster centers in main memory while the individual HMM is loaded only when it is needed. We got 0.92 sec/char recognition speed and 96.03% 30-candidate recognition accuracy for Kanji, using less than 250 MB RAM for the recognition system.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116339157","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}
Zhaohui Ding, Xiaohui Wei, Yifan Zhu, Y. Yuan, W.W. Li, O. Tatebe
Grid computing technology is able to integrate and share large-scale distributed computation and data resource to facilitate the scientific researches. Recently, the grid workflow support and large-scale distributed data management are becoming two main requirements of scientists and researchers in many fields, such as bioinformatics, high-energy physics etc. In this paper, we proposed to support grid workflow for data intensive applications using scheduling plug-ins in meta-scheduler. We improved the CSF4 scheduling plug-in framework and implemented two scheduling plug-ins, grid workflow and grid data aware. In the new framework, the decision conflict problem of multiple scheduling plug-ins was resolved so that the two scheduling plug-ins can work together smoothly. Moreover, the system is fully extensible and configurable. At last, the experiment results are given to show the improvement of system performance and optimization of scheduling.
{"title":"Implementation of the Grid Workflow Scheduling for Data Intensive Applications as Scheduling Plug-ins","authors":"Zhaohui Ding, Xiaohui Wei, Yifan Zhu, Y. Yuan, W.W. Li, O. Tatebe","doi":"10.1109/FGCNS.2008.150","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.150","url":null,"abstract":"Grid computing technology is able to integrate and share large-scale distributed computation and data resource to facilitate the scientific researches. Recently, the grid workflow support and large-scale distributed data management are becoming two main requirements of scientists and researchers in many fields, such as bioinformatics, high-energy physics etc. In this paper, we proposed to support grid workflow for data intensive applications using scheduling plug-ins in meta-scheduler. We improved the CSF4 scheduling plug-in framework and implemented two scheduling plug-ins, grid workflow and grid data aware. In the new framework, the decision conflict problem of multiple scheduling plug-ins was resolved so that the two scheduling plug-ins can work together smoothly. Moreover, the system is fully extensible and configurable. At last, the experiment results are given to show the improvement of system performance and optimization of scheduling.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"99 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116436841","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
扫码关注我们
求助内容：
应助结果提醒方式：