Pub Date : 2006-12-01DOI: 10.1109/ISPACS.2006.364724
N. Oshima, T. Saitoh, R. Konishi
This paper describes an automatic detection and tracking method for unknown object from unclear background. Our method consists of two processes, the detection process and the tracking process. The former process is the background subtraction method and the block-based clustering. The latter process is with mean shift method. To detect an accurate size of the target region, we set a correction period. Demonstration was carried out with a scene which three men are appeared and walked. It is found that two regions could be tracked even when two men was walked toward different direction which they walking together. We confirmed that the proposed method could process on real time.
{"title":"Automatic Moving Object Detection and Tracking with Mean Shift for Surveillance System","authors":"N. Oshima, T. Saitoh, R. Konishi","doi":"10.1109/ISPACS.2006.364724","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364724","url":null,"abstract":"This paper describes an automatic detection and tracking method for unknown object from unclear background. Our method consists of two processes, the detection process and the tracking process. The former process is the background subtraction method and the block-based clustering. The latter process is with mean shift method. To detect an accurate size of the target region, we set a correction period. Demonstration was carried out with a scene which three men are appeared and walked. It is found that two regions could be tracked even when two men was walked toward different direction which they walking together. We confirmed that the proposed method could process on real time.","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"14 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":"130323480","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.364771
K. Kuroiwa, M. Fujiyoshi, H. Kiya
This paper proposes a partial scrambling method for motion JPEG movies that inverts bits representing the positive and negative sign of particular AC coefficients in a codestream to scramble the codestream. Utilizing the relation between motion and the positive and negative sign of coefficients, moving object detection is not required in this method. Moreover, the proposed method completely descrambles codestreams to the original by simple inversion of bits without any knowledge on the position and shape of moving objects. The codestream domain processing in this method serves low processing time and invariant coding efficiency. Simulation results show the effectiveness of the proposed method
{"title":"Codestream Length-Invariant Partial Scrambler Using DCT Signs for Motion JPEG Movies","authors":"K. Kuroiwa, M. Fujiyoshi, H. Kiya","doi":"10.1109/ISPACS.2006.364771","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364771","url":null,"abstract":"This paper proposes a partial scrambling method for motion JPEG movies that inverts bits representing the positive and negative sign of particular AC coefficients in a codestream to scramble the codestream. Utilizing the relation between motion and the positive and negative sign of coefficients, moving object detection is not required in this method. Moreover, the proposed method completely descrambles codestreams to the original by simple inversion of bits without any knowledge on the position and shape of moving objects. The codestream domain processing in this method serves low processing time and invariant coding efficiency. Simulation results show the effectiveness of the proposed method","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"1 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":"130761650","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.364726
Yi-Min Tsai, Yu-Lin Chang, Liang-Gee Chen
This paper presents a robust and reliable block-based method for vanishing line and vanishing point detection. The proposed method provides assistance in construction of a depth map, which is a necessity of 3D scenes. Moreover, the method focuses on the fundamental image structural element analysis, and divides them into six successive steps. Furthermore, complicated mathematic calculation and approximation are replaced by six block-based estimation algorithms. Also, the method is a regular algorithm design which is suitable for VLSI design on future 3D applications.
{"title":"Block-based Vanishing Line and Vanishing Point Detection for 3D Scene Reconstruction","authors":"Yi-Min Tsai, Yu-Lin Chang, Liang-Gee Chen","doi":"10.1109/ISPACS.2006.364726","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364726","url":null,"abstract":"This paper presents a robust and reliable block-based method for vanishing line and vanishing point detection. The proposed method provides assistance in construction of a depth map, which is a necessity of 3D scenes. Moreover, the method focuses on the fundamental image structural element analysis, and divides them into six successive steps. Furthermore, complicated mathematic calculation and approximation are replaced by six block-based estimation algorithms. Also, the method is a regular algorithm design which is suitable for VLSI design on future 3D applications.","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"50 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":"131024625","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 new biometrics authentication method for cellular phones which has an advantage of simple and natural operation is proposed. The proposed method authenticates owner using acceleration signals obtained by an acceleration sensor embedded in the cellular phones during his arm sweep action. When the owner wants to unlock its security, he just needs to grasp and shake his cellular phone. The proposed method verifies owner's acceleration signals by using a DP-matching algorithm which can adapt fluctuations caused by different grip. Simulation results show that the proposed method can achieve the best equal error rate 5.0% for 22 testers
{"title":"A Study on Biometric Authentication based on Arm Sweep Action with Acceleration Sensor","authors":"Fuminori Okumura, Akira Kubota, Y. Hatori, Kenji Matsuot, Masayuki Hashimotot, Atsushi Koiket","doi":"10.1109/ISPACS.2006.364871","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364871","url":null,"abstract":"A new biometrics authentication method for cellular phones which has an advantage of simple and natural operation is proposed. The proposed method authenticates owner using acceleration signals obtained by an acceleration sensor embedded in the cellular phones during his arm sweep action. When the owner wants to unlock its security, he just needs to grasp and shake his cellular phone. The proposed method verifies owner's acceleration signals by using a DP-matching algorithm which can adapt fluctuations caused by different grip. Simulation results show that the proposed method can achieve the best equal error rate 5.0% for 22 testers","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"63 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":"134163283","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.364701
J. Mar, You-Rong Lin, Ti-Han Lung, Ting han Wei
Following the DSRC vehicular communications IEEE802.11p physical layer standards, this paper presents the required computing time estimations of baseband processing modules on the DSP platform and uses this estimation to explain the decision of choosing to implement the 64 point IFFT/FFT module with the FPGA chip. The IFFT/FFT processing time of OFDM modulator/demodulator circuits in applications of DSRC vehicular communication system transceivers must be less than the symbol interval of 8 musec in order to satisfy the requirement of real-time DSRC communications. The 64-IFFT/FFT processing module presented in this paper uses a parallel processing structure of four butterfly circuit units, is capable of processing 16-bit digital signals, and completes 64-IFFT/FFT calculations in 5.33 musec (< 8 musec) with a 24 MHz FPGA chip. Ten short training symbols of the DSRC system are sent through the FPGA IFFT/FFT module to verify its functionality and performance
{"title":"Realization of OFDM Modulator and Demodulator for DSRC Vehicular Communication System Using FPGA Chip","authors":"J. Mar, You-Rong Lin, Ti-Han Lung, Ting han Wei","doi":"10.1109/ISPACS.2006.364701","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364701","url":null,"abstract":"Following the DSRC vehicular communications IEEE802.11p physical layer standards, this paper presents the required computing time estimations of baseband processing modules on the DSP platform and uses this estimation to explain the decision of choosing to implement the 64 point IFFT/FFT module with the FPGA chip. The IFFT/FFT processing time of OFDM modulator/demodulator circuits in applications of DSRC vehicular communication system transceivers must be less than the symbol interval of 8 musec in order to satisfy the requirement of real-time DSRC communications. The 64-IFFT/FFT processing module presented in this paper uses a parallel processing structure of four butterfly circuit units, is capable of processing 16-bit digital signals, and completes 64-IFFT/FFT calculations in 5.33 musec (< 8 musec) with a 24 MHz FPGA chip. Ten short training symbols of the DSRC system are sent through the FPGA IFFT/FFT module to verify its functionality and performance","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":"131831230","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.364751
S. Nagashima, T. Aoki, T. Higuchi, K. Kobayashi
This paper presents a high-accuracy image matching technique using a phase-only correlation (POC) function. The POC-based image matching enables estimation of image displacements with 1/10~1/100-pixel accuracy by a function fitting technique using the closed-form representation of the POC function's peak. This method requires an iterative process for the nonlinear function fitting, resulting in long computation times. In this paper, we propose a peak evaluation formula (PEF) that directly estimates the correlation peak location from actual 2-D data array of the POC function. Experimental evaluation shows that the proposed method reduces computation time without sacrificing image matching accuracy
{"title":"A Subpixel Image Matching Technique Using Phase-Only Correlation","authors":"S. Nagashima, T. Aoki, T. Higuchi, K. Kobayashi","doi":"10.1109/ISPACS.2006.364751","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364751","url":null,"abstract":"This paper presents a high-accuracy image matching technique using a phase-only correlation (POC) function. The POC-based image matching enables estimation of image displacements with 1/10~1/100-pixel accuracy by a function fitting technique using the closed-form representation of the POC function's peak. This method requires an iterative process for the nonlinear function fitting, resulting in long computation times. In this paper, we propose a peak evaluation formula (PEF) that directly estimates the correlation peak location from actual 2-D data array of the POC function. Experimental evaluation shows that the proposed method reduces computation time without sacrificing image matching accuracy","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"8 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113970702","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.364734
N. Takagi, K. Takagi
A VLSI algorithm for integer square-rooting is proposed. It is based on the radix-2 non-restoring square-rooting algorithm. Fast computation is achieved by the use of the radix-2 signed-digit representation. Nonetheless, the algorithm does not require normalization of the operand. Combinational (unfolded) implementation of the algorithm yields a regularly structured array square-rooter. Its delay is proportional to n, the bit length of the operand, while that of conventional ones is at least proportional to n log n.
{"title":"A VLSI Algorithm for Integer Square-Rooting","authors":"N. Takagi, K. Takagi","doi":"10.1109/ISPACS.2006.364734","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364734","url":null,"abstract":"A VLSI algorithm for integer square-rooting is proposed. It is based on the radix-2 non-restoring square-rooting algorithm. Fast computation is achieved by the use of the radix-2 signed-digit representation. Nonetheless, the algorithm does not require normalization of the operand. Combinational (unfolded) implementation of the algorithm yields a regularly structured array square-rooter. Its delay is proportional to n, the bit length of the operand, while that of conventional ones is at least proportional to n log n.","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"1 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":"128972515","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.364899
Psj319l Maz, Uchechukwu Ofoegbul, Ananth N Iyerl, Robert E Yantornol, B. Y. Smolenski
In telephone conversations, only short consecutive utterances can be examined for each speaker, therefore, discriminating between speakers in such conversations is a challenging task which becomes even more challenging when no information about the speakers is known a priori. In this paper, a technique for determining the number of speakers participating in a telephone conversation is presented. This approach assumes no knowledge or information about any of the participating speakers. The technique is based on comparing short utterances within the conversation and deciding whether or not they belong to the same speaker. The applications of this research include three-way call detection and speaker tracking, and could be extended to speaker change-point detection and indexing. The proposed method involves an elimination process in which speech segments matching a chosen set of reference models are sequentially removed from the conversation. Models are formed using the mean vectors and covariance matrices of linear predictive cepstral coefficients of voiced segments in the conversation. The use of the Mahalanobis distance to determine if two models belong to the same or to different speakers, based on likelihood ratio testing, is investigated. The relative amount of residual speech is observed after each elimination process to determine if an additional speaker is present. Experimentation was performed on 4000 artificial conversations from the HTIMIT database. The proposed system was able to yield an average speaker count accuracy of 78%
{"title":"A Speaker Count System for Telephone Conversations","authors":"Psj319l Maz, Uchechukwu Ofoegbul, Ananth N Iyerl, Robert E Yantornol, B. Y. Smolenski","doi":"10.1109/ISPACS.2006.364899","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364899","url":null,"abstract":"In telephone conversations, only short consecutive utterances can be examined for each speaker, therefore, discriminating between speakers in such conversations is a challenging task which becomes even more challenging when no information about the speakers is known a priori. In this paper, a technique for determining the number of speakers participating in a telephone conversation is presented. This approach assumes no knowledge or information about any of the participating speakers. The technique is based on comparing short utterances within the conversation and deciding whether or not they belong to the same speaker. The applications of this research include three-way call detection and speaker tracking, and could be extended to speaker change-point detection and indexing. The proposed method involves an elimination process in which speech segments matching a chosen set of reference models are sequentially removed from the conversation. Models are formed using the mean vectors and covariance matrices of linear predictive cepstral coefficients of voiced segments in the conversation. The use of the Mahalanobis distance to determine if two models belong to the same or to different speakers, based on likelihood ratio testing, is investigated. The relative amount of residual speech is observed after each elimination process to determine if an additional speaker is present. Experimentation was performed on 4000 artificial conversations from the HTIMIT database. The proposed system was able to yield an average speaker count accuracy of 78%","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"1 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":"129010968","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.364779
R. Suleesathira, N. Phaisal-atsawasenee
Performance of beamspace MUSIC (BMUSIC) deteriorates as the coherent arrivals become closely spaced. In this paper, we improve the BMUSIC by using the forward-backward averaging of a combined signal eigenvectors. Evaluations are given to illustrate the proposed method capability. Performance analysis of the BPSK and QPSK modulation with antenna arrays are derived and compared to bit error rates (BERs)
{"title":"Decorrelation for BPSK and QPSK Coherent Arrivals","authors":"R. Suleesathira, N. Phaisal-atsawasenee","doi":"10.1109/ISPACS.2006.364779","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364779","url":null,"abstract":"Performance of beamspace MUSIC (BMUSIC) deteriorates as the coherent arrivals become closely spaced. In this paper, we improve the BMUSIC by using the forward-backward averaging of a combined signal eigenvectors. Evaluations are given to illustrate the proposed method capability. Performance analysis of the BPSK and QPSK modulation with antenna arrays are derived and compared to bit error rates (BERs)","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"69 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":"128598150","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.364785
A. Haggag, M. Ghoneim, Jianming Lu, T. Yahagi
In this paper we propose a progressive encryption and controlled access scheme for JPEG 2000 encoded images. Our scheme applies SNOW 2 stream cipher to JPEG 2000 codestreams in a way that preserves most of the inherent flexibility of JPEG 2000 encoded images and enables untrusted intermediate network transcoders to downstream an encrypted JPEG 2000 image without access to decryption keys. Our scheme can also control access to various image resolutions or quality layers, by granting users different levels of access, using different decryption keys. Our scheme preservers most of the inherent flexibility, scalability, and transcodability of encrypted JPEG 2000 images and also preserves end-to-end security.
{"title":"Progressive Encryption and Controlled Access Scheme for JPEG 2000 Encoded Images","authors":"A. Haggag, M. Ghoneim, Jianming Lu, T. Yahagi","doi":"10.1109/ISPACS.2006.364785","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364785","url":null,"abstract":"In this paper we propose a progressive encryption and controlled access scheme for JPEG 2000 encoded images. Our scheme applies SNOW 2 stream cipher to JPEG 2000 codestreams in a way that preserves most of the inherent flexibility of JPEG 2000 encoded images and enables untrusted intermediate network transcoders to downstream an encrypted JPEG 2000 image without access to decryption keys. Our scheme can also control access to various image resolutions or quality layers, by granting users different levels of access, using different decryption keys. Our scheme preservers most of the inherent flexibility, scalability, and transcodability of encrypted JPEG 2000 images and also preserves end-to-end security.","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"25 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":"116048630","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}