首页 > 最新文献

2006 International Symposium on Intelligent Signal Processing and Communications最新文献

英文 中文
Automatic Moving Object Detection and Tracking with Mean Shift for Surveillance System 基于均值移位的监视系统运动目标自动检测与跟踪
Pub Date : 2006-12-01 DOI: 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}
引用次数: 1
Codestream Length-Invariant Partial Scrambler Using DCT Signs for Motion JPEG Movies 使用DCT符号的码流长度不变部分扰频器用于运动JPEG电影
Pub Date : 2006-12-01 DOI: 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
本文提出了一种运动JPEG电影的部分置乱方法,该方法对码流中特定AC系数的正负位进行反转,从而置乱码流。该方法利用运动与系数正负的关系,不需要检测运动目标。此外,该方法在不知道运动物体的位置和形状的情况下,通过简单的位反转将码流完全解码为原始码流。该方法的码流域处理时间短,编码效率不变。仿真结果表明了该方法的有效性
{"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}
引用次数: 1
Block-based Vanishing Line and Vanishing Point Detection for 3D Scene Reconstruction 基于块的消失线和消失点检测在三维场景重建中的应用
Pub Date : 2006-12-01 DOI: 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.
本文提出了一种鲁棒可靠的基于分块的消失线和消失点检测方法。该方法有助于构建三维场景所必需的深度图。此外,该方法侧重于图像基本结构元素分析,并将其分为六个连续的步骤。此外,六种基于块的估计算法取代了复杂的数学计算和近似。该方法是一种规则的算法设计,适用于未来3D应用的超大规模集成电路设计。
{"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}
引用次数: 64
A Study on Biometric Authentication based on Arm Sweep Action with Acceleration Sensor 基于加速度传感器臂扫动作的生物识别认证研究
Pub Date : 2006-12-01 DOI: 10.1109/ISPACS.2006.364871
Fuminori Okumura, Akira Kubota, Y. Hatori, Kenji Matsuot, Masayuki Hashimotot, Atsushi Koiket
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
提出了一种新的手机生物识别认证方法,该方法操作简单、自然。所提出的方法使用嵌入在移动电话中的加速度传感器在其手臂扫描动作中获得的加速度信号对所有者进行身份验证。当主人想要解锁它的安全系统时,他只需要抓住并摇晃他的手机。该方法采用一种能够适应不同握持力引起的波动的dp匹配算法来验证车主加速度信号。仿真结果表明,该方法对22台测试机均能达到5.0%的最佳等错误率
{"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}
引用次数: 69
Realization of OFDM Modulator and Demodulator for DSRC Vehicular Communication System Using FPGA Chip DSRC车载通信系统中OFDM调解调用FPGA芯片的实现
Pub Date : 2006-12-01 DOI: 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
本文根据DSRC车载通信IEEE802.11p物理层标准,给出了基带处理模块在DSP平台上所需计算时间的估计,并以此来解释选择用FPGA芯片实现64点IFFT/FFT模块的决定。在DSRC车载通信系统收发器应用中,OFDM调/调电路的IFFT/FFT处理时间必须小于8 μ m的码元间隔,才能满足DSRC通信实时性的要求。本文提出的64-IFFT/FFT处理模块采用4个蝶形电路单元并行处理结构,能够处理16位数字信号,使用24 MHz的FPGA芯片,在5.33 musec (< 8 musec)内完成64-IFFT/FFT计算。通过FPGA的IFFT/FFT模块发送DSRC系统的10个短训练符号,验证其功能和性能
{"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}
引用次数: 9
A Subpixel Image Matching Technique Using Phase-Only Correlation 一种基于相位相关的亚像素图像匹配技术
Pub Date : 2006-12-01 DOI: 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
提出了一种基于纯相位相关函数的高精度图像匹配技术。基于POC的图像匹配通过使用POC函数峰值的封闭形式表示的函数拟合技术,能够以1/10~1/100像素的精度估计图像位移。该方法对非线性函数拟合需要一个迭代过程,计算时间长。在本文中,我们提出了一个峰值评估公式(PEF),该公式直接从POC函数的实际二维数据数组中估计出相关峰的位置。实验结果表明,该方法在不牺牲图像匹配精度的前提下减少了计算时间
{"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}
引用次数: 61
A VLSI Algorithm for Integer Square-Rooting 整数平方根的VLSI算法
Pub Date : 2006-12-01 DOI: 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.
提出了一种整数平方根的VLSI算法。它是基于基数-2非恢复平方根算法。快速计算是通过使用基数2的符号数表示来实现的。尽管如此,该算法不需要对操作数进行规范化。该算法的组合(展开)实现产生一个规则结构的方根数组。它的延时与操作数的位长n成正比,而传统的延时至少与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}
引用次数: 9
A Speaker Count System for Telephone Conversations 用于电话交谈的说话人计数系统
Pub Date : 2006-12-01 DOI: 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%
在电话交谈中,只能检查每个说话者的简短连续话语,因此,在这种谈话中区分说话者是一项具有挑战性的任务,当没有关于说话者的先验信息时,这种任务变得更加具有挑战性。本文提出了一种确定电话会话中说话人数量的方法。这种方法假定不了解或不了解任何参与演讲的人。该技术的基础是比较对话中的短话语,并确定它们是否属于同一说话者。本研究的应用包括三方呼叫检测和说话人跟踪,并可扩展到说话人变化点检测和索引。所提出的方法包括一个消除过程,其中匹配一组选定的参考模型的语音片段依次从对话中删除。利用对话中浊音段线性预测倒谱系数的均值向量和协方差矩阵形成模型。利用马氏距离来确定两个模型是否属于相同或不同的说话者,基于似然比测试,进行了研究。在每次消除处理后观察残余语音的相对量,以确定是否存在额外的说话者。实验在来自HTIMIT数据库的4000个人工会话上进行。该系统的平均说话人计数准确率为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}
引用次数: 11
Decorrelation for BPSK and QPSK Coherent Arrivals BPSK和QPSK相干到达的去相关
Pub Date : 2006-12-01 DOI: 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)
波束空间MUSIC (BMUSIC)的性能随着相干到达的间隔变近而恶化。在本文中,我们使用组合信号特征向量的前向后平均来改进BMUSIC。给出了评价来说明所提出的方法的能力。推导了带天线阵列的BPSK和QPSK调制的性能分析,并比较了误码率(ber)。
{"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}
引用次数: 0
Progressive Encryption and Controlled Access Scheme for JPEG 2000 Encoded Images JPEG 2000编码图像的渐进式加密和控制访问方案
Pub Date : 2006-12-01 DOI: 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.
本文提出了一种用于JPEG 2000编码图像的渐进式加密和控制访问方案。我们的方案将SNOW 2流密码应用于JPEG 2000码流,以一种保留JPEG 2000编码图像的大部分固有灵活性的方式,并允许不受信任的中间网络转码器在不访问解密密钥的情况下下行加密的JPEG 2000图像。我们的方案还可以通过授予用户使用不同解密密钥的不同访问级别来控制对各种图像分辨率或质量层的访问。我们的方案保留了加密JPEG 2000图像的大部分固有灵活性、可伸缩性和可转码性,还保留了端到端安全性。
{"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}
引用次数: 11
期刊
2006 International Symposium on Intelligent Signal Processing and Communications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1