Pub Date : 2006-12-01DOI: 10.1109/ISPACS.2006.364732
R. Hashimoto, K. Katou, G. Fujita, T. Onoye
A novel approach to hardware implementation of H.264 block size decision is proposed, which is based on rate-distortion (RD) optimization. Utilization of RD cost for block size decision can improve up to 2.0 dB of PSNR in compared with conventional SAD/SATD based approaches. However, calculation of RD cost for a block incurs considerable computational costs since distortion can be determined only after completing the whole encoding processes of the block. Thus the proposed approach simplifies VLC process and our hardware employs 7 stage pipeline architecture for the cost calculation. As a result, the proposed architecture, which can be implemented by 20k gates, achieves real-time processing of SD (720times480) frames at a rate of 30 fps in 23.7 MHz operation
{"title":"VLSI Architecture of 1.264 Block Size Decision based on Rate-Distortion Optimization","authors":"R. Hashimoto, K. Katou, G. Fujita, T. Onoye","doi":"10.1109/ISPACS.2006.364732","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364732","url":null,"abstract":"A novel approach to hardware implementation of H.264 block size decision is proposed, which is based on rate-distortion (RD) optimization. Utilization of RD cost for block size decision can improve up to 2.0 dB of PSNR in compared with conventional SAD/SATD based approaches. However, calculation of RD cost for a block incurs considerable computational costs since distortion can be determined only after completing the whole encoding processes of the block. Thus the proposed approach simplifies VLC process and our hardware employs 7 stage pipeline architecture for the cost calculation. As a result, the proposed architecture, which can be implemented by 20k gates, achieves real-time processing of SD (720times480) frames at a rate of 30 fps in 23.7 MHz operation","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116102680","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364735
Y. Chau, Ying-Yuan Yang, Jeng-Fan Chen
Based on the flying-adder structure, an all-digital frequency synthesizer with dual resolutions is designed and implemented. The range of the output frequencies of the all-digital frequency synthesizer is analyzed. The devised frequency synthesizer with dual resolutions is realized using the UMC 0.18- mum cell-based CMOS process. Corresponding simulation results and realization performance are presented.
{"title":"All-Digital Frequency Synthesizer with Dual Resolutions","authors":"Y. Chau, Ying-Yuan Yang, Jeng-Fan Chen","doi":"10.1109/ISPACS.2006.364735","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364735","url":null,"abstract":"Based on the flying-adder structure, an all-digital frequency synthesizer with dual resolutions is designed and implemented. The range of the output frequencies of the all-digital frequency synthesizer is analyzed. The devised frequency synthesizer with dual resolutions is realized using the UMC 0.18- mum cell-based CMOS process. Corresponding simulation results and realization performance are presented.","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114362473","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364845
N. Kawanishi, Kim Seung Jinj, Hua Sit, Yoshihiro Kawaharat, Hiroyuki Morikawa
In this paper, we describe an approach for building context-aware applications in the ubiquitous computing environment, where a huge number of sensors are embedded in our living space. The raw data from sensors can be used as low level context information, and also be used to infer higher level context information. We present several ubiquitous computing applications using these context information, such as a context-aware service platform called "Synapse" and a real-world oriented monster collection game called "Ubiquitous Monster". In addition, we show a probe space infrastructure which we have built in Akihabara for efficiently implementing and evaluating context-aware services
{"title":"Building Context-Aware Applications and Probe Space Infrastructure","authors":"N. Kawanishi, Kim Seung Jinj, Hua Sit, Yoshihiro Kawaharat, Hiroyuki Morikawa","doi":"10.1109/ISPACS.2006.364845","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364845","url":null,"abstract":"In this paper, we describe an approach for building context-aware applications in the ubiquitous computing environment, where a huge number of sensors are embedded in our living space. The raw data from sensors can be used as low level context information, and also be used to infer higher level context information. We present several ubiquitous computing applications using these context information, such as a context-aware service platform called \"Synapse\" and a real-world oriented monster collection game called \"Ubiquitous Monster\". In addition, we show a probe space infrastructure which we have built in Akihabara for efficiently implementing and evaluating context-aware services","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125252261","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364909
A. Itai, H. Yasukawa
The characteristics of a footstep are determined by the gait, the footwear and the floor. Accurate footstep analysis would be useful in various applications, home security service, surveillance and understanding of human action since the gait expresses personality, age and gender. The feasibility of personal identification has been confirmed by using the feature parameter of footsteps, however, it is necessary to use more effective parameters since the recognition rate of this method decreases as the number of subjects increases. In this paper, wavelet transform is applied to feature extraction from footsteps. In audio classification, Fourier and wavelet transform are used to extract the feature of audio signals. Results show that the parameter proposed herein yields effective and practical personal identification
{"title":"Personal Identification Using Footstep Based on Wavelets","authors":"A. Itai, H. Yasukawa","doi":"10.1109/ISPACS.2006.364909","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364909","url":null,"abstract":"The characteristics of a footstep are determined by the gait, the footwear and the floor. Accurate footstep analysis would be useful in various applications, home security service, surveillance and understanding of human action since the gait expresses personality, age and gender. The feasibility of personal identification has been confirmed by using the feature parameter of footsteps, however, it is necessary to use more effective parameters since the recognition rate of this method decreases as the number of subjects increases. In this paper, wavelet transform is applied to feature extraction from footsteps. In audio classification, Fourier and wavelet transform are used to extract the feature of audio signals. Results show that the parameter proposed herein yields effective and practical personal identification","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127083006","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364911
S. Kinoshita, D. Muramatsu, T. Matsumoto
Personal authentication is becoming increasingly important. Biometrics, that is, the use of biological information, is one of the most promising techniques for this application. This paper proposes an online signature verification system. A serious problem in online signature verification is the difficulty of collecting enough signature data to generate a reliable model. In this paper, we propose a user-generic fusion model to resolve this problem. In the model generation, we use available datasets composed of genuine and forged signatures of many signers. The model's parameters are trained using the Markov chain Monte Carlo method. We report experimental results of our proposed algorithm using two public databases
{"title":"Online Signature Verification based on User-generic Fusion Model with Markov Chain Monte Carlo Method","authors":"S. Kinoshita, D. Muramatsu, T. Matsumoto","doi":"10.1109/ISPACS.2006.364911","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364911","url":null,"abstract":"Personal authentication is becoming increasingly important. Biometrics, that is, the use of biological information, is one of the most promising techniques for this application. This paper proposes an online signature verification system. A serious problem in online signature verification is the difficulty of collecting enough signature data to generate a reliable model. In this paper, we propose a user-generic fusion model to resolve this problem. In the model generation, we use available datasets composed of genuine and forged signatures of many signers. The model's parameters are trained using the Markov chain Monte Carlo method. We report experimental results of our proposed algorithm using two public databases","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126105478","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364901
Uchechukwu Ofoegbul, Ananth N Iyerl, Robert E Yantornol, B. Y. Smolenski
Unsupervised speaker indexing is a rapidly developing field in speech processing, which involves determining who is speaking when, without having prior knowledge about the speakers being observed. In this research, a distance-based technique for indexing telephone conversations is presented. Sub-models are formed (using data of approximately equal sizes) from the conversations, from which two references models are judiciously chosen such that they represent the two different speakers in the conversation. Models are then matched to the reference speakers based on a technique referred to as the restrained-relative minimum distance (RRMD) approach. Some models, which fail to meet the RRMD criteria, are considered "undecided" and left unmatched with either of the reference speakers. Analysis is made to determine the appropriate size (or length of data to be used) for these models, which are formed using cepstral coefficients of the speech data. The T-square statistic is used for speaker differentiation. Evaluation is performed based on the indexing accuracy as well as the amount of undecided speech obtained. The proposed system was able to yield a minimum indexing error of about 9% with a maximum undecided error of 18.5% , and an equal error rate of 11% on 245 files (with an average length of about 400 seconds each) from the SWITCHBOARD database
{"title":"A Simple Approach to Unsupervised Speaker Indexing","authors":"Uchechukwu Ofoegbul, Ananth N Iyerl, Robert E Yantornol, B. Y. Smolenski","doi":"10.1109/ISPACS.2006.364901","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364901","url":null,"abstract":"Unsupervised speaker indexing is a rapidly developing field in speech processing, which involves determining who is speaking when, without having prior knowledge about the speakers being observed. In this research, a distance-based technique for indexing telephone conversations is presented. Sub-models are formed (using data of approximately equal sizes) from the conversations, from which two references models are judiciously chosen such that they represent the two different speakers in the conversation. Models are then matched to the reference speakers based on a technique referred to as the restrained-relative minimum distance (RRMD) approach. Some models, which fail to meet the RRMD criteria, are considered \"undecided\" and left unmatched with either of the reference speakers. Analysis is made to determine the appropriate size (or length of data to be used) for these models, which are formed using cepstral coefficients of the speech data. The T-square statistic is used for speaker differentiation. Evaluation is performed based on the indexing accuracy as well as the amount of undecided speech obtained. The proposed system was able to yield a minimum indexing error of about 9% with a maximum undecided error of 18.5% , and an equal error rate of 11% on 245 files (with an average length of about 400 seconds each) from the SWITCHBOARD database","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122011017","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364886
Qiang Liu, C. Cai
In this paper, an enhanced CAMShift (continuously adaptive mean shift) object-tracking algorithm, called dual searching window based face-tracking algorithm, is proposed. Firstly, the near complexion background is removed from video frames by using a mixture Gaussian model. An accessory window is then introduced to correct the tracking error resulting from temporary occlusion by an object with similar probability distribution. Experimental results have testified the proposed face-tracking scheme can greatly alleviate the flesh-like background interference and miss tracking due to the temporary occlusion
本文提出了一种增强的CAMShift (continuous adaptive mean shift)目标跟踪算法，即基于双搜索窗口的人脸跟踪算法。首先，利用混合高斯模型从视频帧中去除近肤色背景;在此基础上，引入一个辅助窗口，对具有相似概率分布的物体临时遮挡造成的跟踪误差进行校正。实验结果表明，所提出的人脸跟踪方案能够极大地缓解背景肉样干扰和由于临时遮挡造成的跟踪缺失
{"title":"Dual Searching Window Based Face Tracking","authors":"Qiang Liu, C. Cai","doi":"10.1109/ISPACS.2006.364886","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364886","url":null,"abstract":"In this paper, an enhanced CAMShift (continuously adaptive mean shift) object-tracking algorithm, called dual searching window based face-tracking algorithm, is proposed. Firstly, the near complexion background is removed from video frames by using a mixture Gaussian model. An accessory window is then introduced to correct the tracking error resulting from temporary occlusion by an object with similar probability distribution. Experimental results have testified the proposed face-tracking scheme can greatly alleviate the flesh-like background interference and miss tracking due to the temporary occlusion","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125772304","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}
An enhancement of probability packet marking (PPM) used to trace back the denial-of-service attacker is proposed. Through sending probing packets, the proposed scheme is used to recover missing attacking paths, resulting from successive non-PPM routers, which do not support PPM scheme along the attack path. Furthermore, according to the proposed scheme, the probing packet with IP record routing or loose source routing can detect consecutive non-PPM routers and help to recover lost paths because of non-PPM routers in a row. Especially, this scheme with the loosen source routing algorithm can record all traveled routers' IP addresses into probing packet's IP header
{"title":"Using Probing Packets to Recover the Incomplete IP Traceback","authors":"Yu-Kuo Tseng, W. Hsieh, Wen-Yen Chou, Kuan-Yen Yang, Yu-Tsung Tsia, Ming-Cheng Huang","doi":"10.1109/ISPACS.2006.364764","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364764","url":null,"abstract":"An enhancement of probability packet marking (PPM) used to trace back the denial-of-service attacker is proposed. Through sending probing packets, the proposed scheme is used to recover missing attacking paths, resulting from successive non-PPM routers, which do not support PPM scheme along the attack path. Furthermore, according to the proposed scheme, the probing packet with IP record routing or loose source routing can detect consecutive non-PPM routers and help to recover lost paths because of non-PPM routers in a row. Especially, this scheme with the loosen source routing algorithm can record all traveled routers' IP addresses into probing packet's IP header","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126720141","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364857
A. Miyazaki, F. Uchiyama
In this paper, we propose a new watermarking method for images using the lifting wavelet transform. Utilizing the watermarking method, we can divide watermarked content into watermark and original content perfectly after watermark detection, and hence realize digital watermarking for multimedia contents like medical images, electric documents, computer programs, and data, etc., for which it is desired to restore original content from watermarked one
{"title":"An Image Watermarking Method using the Lifting Wavelet Transform","authors":"A. Miyazaki, F. Uchiyama","doi":"10.1109/ISPACS.2006.364857","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364857","url":null,"abstract":"In this paper, we propose a new watermarking method for images using the lifting wavelet transform. Utilizing the watermarking method, we can divide watermarked content into watermark and original content perfectly after watermark detection, and hence realize digital watermarking for multimedia contents like medical images, electric documents, computer programs, and data, etc., for which it is desired to restore original content from watermarked one","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126541094","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364715
H. Nobuhara, Chang-Wook Han
A hybrid genetic algorithm based learning method for the morphological neural networks (MNN) is proposed. The morphological neural networks are based on max-plus algebra, therefore, it is difficult to optimize the coefficients of MNN by the learning method with derivative operations. In order to solve the difficulty, a hybrid genetic algorithm based learning method to optimize the coefficients of MNN is proposed. Through the image compression/reconstruction experiment using test images extracted from standard image database (SIDBA), it is confirmed that the quality of the reconstructed images obtained by the proposed learning method is better than that obtained by the conventional method.
{"title":"Evolutionary Computation Schemes based on Max Plus Algebra and Their Application to Image Processing","authors":"H. Nobuhara, Chang-Wook Han","doi":"10.1109/ISPACS.2006.364715","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364715","url":null,"abstract":"A hybrid genetic algorithm based learning method for the morphological neural networks (MNN) is proposed. The morphological neural networks are based on max-plus algebra, therefore, it is difficult to optimize the coefficients of MNN by the learning method with derivative operations. In order to solve the difficulty, a hybrid genetic algorithm based learning method to optimize the coefficients of MNN is proposed. Through the image compression/reconstruction experiment using test images extracted from standard image database (SIDBA), it is confirmed that the quality of the reconstructed images obtained by the proposed learning method is better than that obtained by the conventional method.","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124480289","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
扫码关注我们
求助内容：
应助结果提醒方式：