In this paper, we propose a systematic approach to design Gabor filter banks for iris feature extraction. The spectra of normalized iris images were analyzed and the most informative band (MIB) was located. When tuning the filter parameters, the pass bands of the filter banks are confined to be within the MIB. It turns out that with the MIB constraint the number of orientation parameters of the Gabor filters can be reduced to one. Furthermore, we show that the spatial locations of the Gabor filters can be arbitrarily and uniformly selected provided that the conditions of the Nyquist sampling theorem are satisfied. The main difficulty of designing filter banks for iris feature extraction is that there are too many free parameters to be determined, e.g., there will be 6N parameters to be designed for N filters. However, after analyzing the possible factors influencing the iris feature extraction process, we found that the free parameters of the Gabor filter banks can be reduced from 6N to three. By using the genetic algorithm to tune the filter parameters, the performance of our recognition system has been gradually improved. The experimental results show that the best equal error rate of our system is about 0.05% computed with the CASIA database.
{"title":"Design of Gabor Filter Banks for Iris Recognition","authors":"Chia-Te Chou, S. Shih, Duan-Yu Chen","doi":"10.1109/IIH-MSP.2006.83","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.83","url":null,"abstract":"In this paper, we propose a systematic approach to design Gabor filter banks for iris feature extraction. The spectra of normalized iris images were analyzed and the most informative band (MIB) was located. When tuning the filter parameters, the pass bands of the filter banks are confined to be within the MIB. It turns out that with the MIB constraint the number of orientation parameters of the Gabor filters can be reduced to one. Furthermore, we show that the spatial locations of the Gabor filters can be arbitrarily and uniformly selected provided that the conditions of the Nyquist sampling theorem are satisfied. The main difficulty of designing filter banks for iris feature extraction is that there are too many free parameters to be determined, e.g., there will be 6N parameters to be designed for N filters. However, after analyzing the possible factors influencing the iris feature extraction process, we found that the free parameters of the Gabor filter banks can be reduced from 6N to three. By using the genetic algorithm to tune the filter parameters, the performance of our recognition system has been gradually improved. The experimental results show that the best equal error rate of our system is about 0.05% computed with the CASIA database.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"283 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120895947","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}
Through-wall imaging is one of the applications of Ultra Wideband communication that attracts recent interests for its ability to penetrate the wall. However, the available references fail to provide a clear feasible imaging method. This paper proposes a novel virtual elliptic curve imaging method based on the UWB pulse system, which presents the detail imaging process and imaging results. The key factor of this method is to correctly obtain the propagation delay by the correlator, and it is achieved by the spread gain of the pseudo-noise sequences. The imaging results show the proposed method has very high imaging resolution. And the error analysis is investigated on account of misestimating wall parameters. Simulations illustrate the effects of the errors under different scenarios.
{"title":"A Novel Through-Wall Imaging Method Using Ultra WideBand Pulse System","authors":"Lin Ma, Zhongzhao Zhang, Xuezhi Tan","doi":"10.1109/IIH-MSP.2006.33","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.33","url":null,"abstract":"Through-wall imaging is one of the applications of Ultra Wideband communication that attracts recent interests for its ability to penetrate the wall. However, the available references fail to provide a clear feasible imaging method. This paper proposes a novel virtual elliptic curve imaging method based on the UWB pulse system, which presents the detail imaging process and imaging results. The key factor of this method is to correctly obtain the propagation delay by the correlator, and it is achieved by the spread gain of the pseudo-noise sequences. The imaging results show the proposed method has very high imaging resolution. And the error analysis is investigated on account of misestimating wall parameters. Simulations illustrate the effects of the errors under different scenarios.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122965572","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-18DOI: 10.1109/IIH-MSP.2006.126
M. Shirali-Shahreza
Following the expansion of Internet, many software were produced that could launch through Internet without prior installation on computers. This included game software and software that deal with financial affairs. These softwares are mainly in Java language and can be found on web pages as Java Applets. Some software owners want that their products only able to execute through their own web pages so that no one could put them on other web pages. In this paper, a new method has been presented to protect Java Applets from copying by using "Steganography in HTML web pages" method. In this method, a special 8-character string is hidden in the HTML page by a secret key. The string and the secret key are put within the Java Applet. After execution, the Java Applet extracts data from the HTML page by using the secret key. If the extracted data is the same as the 8-letter string, we can be sure that the Java Applet lies in its original web page and no copying is taken place. This project is implemented by Java programming language.
{"title":"Java Applets Copy Protection by Steganography","authors":"M. Shirali-Shahreza","doi":"10.1109/IIH-MSP.2006.126","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.126","url":null,"abstract":"Following the expansion of Internet, many software were produced that could launch through Internet without prior installation on computers. This included game software and software that deal with financial affairs. These softwares are mainly in Java language and can be found on web pages as Java Applets. Some software owners want that their products only able to execute through their own web pages so that no one could put them on other web pages. In this paper, a new method has been presented to protect Java Applets from copying by using \"Steganography in HTML web pages\" method. In this method, a special 8-character string is hidden in the HTML page by a secret key. The string and the secret key are put within the Java Applet. After execution, the Java Applet extracts data from the HTML page by using the secret key. If the extracted data is the same as the 8-letter string, we can be sure that the Java Applet lies in its original web page and no copying is taken place. This project is implemented by Java programming language.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124164843","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 novel method of pitch detection, combining LPCbased Cepstrum and Harmonic Product Spectrum (HPS), has been proposed. The interaction between the vocal tract and the glottal excitation disturb the detection from glottal excitation, so we use Linear Prediction Residual to eliminate the vocal tract information and the high frequency noise which can improve the accurate to some extent. In real world, when the speech signal has been transmitted through the telephone system, low frequency including pitch information have been cut off which can significantly attenuate the detection of fundamental pitch frequency. In this paper, we use the novel method combining LPC-based Cepstrum and HPS to deal with this problem and pitch errors. Experiment studied indicates that this novel method is effective and valuable for application in pitch detection, since it robustly handles different frequency domain noise and pitch errors.
{"title":"A Method Combining LPC-Based Cepstrum and Harmonic Product Spectrum for Pitch Detection","authors":"Hui Ding, Bo Qian, Yanping Li, Zhenmin Tang","doi":"10.1109/IIH-MSP.2006.14","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.14","url":null,"abstract":"A novel method of pitch detection, combining LPCbased Cepstrum and Harmonic Product Spectrum (HPS), has been proposed. The interaction between the vocal tract and the glottal excitation disturb the detection from glottal excitation, so we use Linear Prediction Residual to eliminate the vocal tract information and the high frequency noise which can improve the accurate to some extent. In real world, when the speech signal has been transmitted through the telephone system, low frequency including pitch information have been cut off which can significantly attenuate the detection of fundamental pitch frequency. In this paper, we use the novel method combining LPC-based Cepstrum and HPS to deal with this problem and pitch errors. Experiment studied indicates that this novel method is effective and valuable for application in pitch detection, since it robustly handles different frequency domain noise and pitch errors.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125908400","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}
Data hiding in audio signals can be used for transmitting auxiliary information related to the content of the audio signal. Such an application requires a greater data payload than music copyright management systems. Also, it is difficult to extract the embedded data from sounds played through a loudspeaker and detected by a microphone because of additive background noise, reflections and reverberations and the band-limited characteristics of loudspeakers and microphones. In this study, a watermarking technique using subband amplitude modulation was evaluated by computer simulation in terms of robustness against background noises and reverberations. The effects of amplitude modulation on the articulation scores of 125 vowel-consonant-vowel (VCV) syllables were also investigated. The results showed that reverberant speech signals with various background noises having a SNR of 10 dB can transmit more than 90% of embedded data at 48 bps, with only a small deterioration in the syllable identification scores.
{"title":"Data Hiding in Speech Sounds Using Subband Amplitude Modulation Robust against Reverberations and Background Noise","authors":"Akira Nishimura","doi":"10.1109/IIH-MSP.2006.77","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.77","url":null,"abstract":"Data hiding in audio signals can be used for transmitting auxiliary information related to the content of the audio signal. Such an application requires a greater data payload than music copyright management systems. Also, it is difficult to extract the embedded data from sounds played through a loudspeaker and detected by a microphone because of additive background noise, reflections and reverberations and the band-limited characteristics of loudspeakers and microphones. In this study, a watermarking technique using subband amplitude modulation was evaluated by computer simulation in terms of robustness against background noises and reverberations. The effects of amplitude modulation on the articulation scores of 125 vowel-consonant-vowel (VCV) syllables were also investigated. The results showed that reverberant speech signals with various background noises having a SNR of 10 dB can transmit more than 90% of embedded data at 48 bps, with only a small deterioration in the syllable identification scores.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126575329","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}
For an entropy-coded video sequence, a transmission error in a codeword will not only affect the underlying codeword but may also affect subsequent codewords, resulting in a great degradation of received video frames. In this study, a motion-compensated error concealment scheme is proposed for H.264 video transmission. For H.264 inter-coded P frames, the predicted motion vector (PMV) for each corrupted block is first determined by the spatially neighboring motion vectors (MVs) around the corrupted block and the temporally motion-projected overlapping MVs in the previous frame. With the PMV being the central search point, three rood search patterns are developed for motioncompensated error concealment of small-, medium-, and large-motion corrupted blocks. Then error concealment refinement using Lagrange interpolation is performed on all the initially concealed blocks. Finally, the improved ELA (edge based line average) algorithm [11] is employed to refine each concealed block in P frames.
对于熵编码的视频序列，码字中的传输错误不仅会影响底层码字，还可能影响后续码字，导致接收到的视频帧的严重降级。在本研究中，提出了一种H.264视频传输的运动补偿错误隐藏方案。对于H.264互编码的P帧，每个损坏块的预测运动向量(PMV)首先由损坏块周围的空间相邻运动向量(mv)和前一帧中时间运动投影的重叠mv确定。以PMV为中心搜索点，针对小、中、大运动损坏块的运动补偿误差隐藏，提出了三种路径搜索模式。然后利用拉格朗日插值对所有初始隐藏块进行错误隐藏细化。最后，采用改进的ELA (edge based line average)算法[11]对P帧中的每个隐藏块进行细化。
{"title":"A Motion-Compensated Error Concealment Scheme for H.264 Video Transmission","authors":"Chun-Ting Hung, Jin-Jang Leou","doi":"10.1109/IIH-MSP.2006.18","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.18","url":null,"abstract":"For an entropy-coded video sequence, a transmission error in a codeword will not only affect the underlying codeword but may also affect subsequent codewords, resulting in a great degradation of received video frames. In this study, a motion-compensated error concealment scheme is proposed for H.264 video transmission. For H.264 inter-coded P frames, the predicted motion vector (PMV) for each corrupted block is first determined by the spatially neighboring motion vectors (MVs) around the corrupted block and the temporally motion-projected overlapping MVs in the previous frame. With the PMV being the central search point, three rood search patterns are developed for motioncompensated error concealment of small-, medium-, and large-motion corrupted blocks. Then error concealment refinement using Lagrange interpolation is performed on all the initially concealed blocks. Finally, the improved ELA (edge based line average) algorithm [11] is employed to refine each concealed block in P frames.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127201196","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}
The anonymity is the most important property of group signature schemes. Traditional schemes suppose that a signer is reluctant to leak his identity to a verifier. In some real scenarios, this supposition does not hold. A signer may want to cooperate with a verifier secretly to achieve special interests. So the verifier needs to identify the signer¿s signature among all the signatures he received. Among all the building blocks of group signature schemes, the Camenisch¿s signatures of knowledge are most widely used and their security is critical to group signature schemes. Unfortunately, the Simmons¿s type I subliminal channel is found in all the signatures of knowledge introduced by Camenisch in [1]. To evaluate the real security of group signature, the concept of strong anonymity is proposed and all the Camenisch¿s signature of knowledge are found unsatisfied with the requirement of strong anonymity.
{"title":"Analysis of Anonymity on the Signatures of Knowledge","authors":"Xin-guang Zou, Shenghe Sun","doi":"10.1109/IIH-MSP.2006.57","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.57","url":null,"abstract":"The anonymity is the most important property of group signature schemes. Traditional schemes suppose that a signer is reluctant to leak his identity to a verifier. In some real scenarios, this supposition does not hold. A signer may want to cooperate with a verifier secretly to achieve special interests. So the verifier needs to identify the signer¿s signature among all the signatures he received. Among all the building blocks of group signature schemes, the Camenisch¿s signatures of knowledge are most widely used and their security is critical to group signature schemes. Unfortunately, the Simmons¿s type I subliminal channel is found in all the signatures of knowledge introduced by Camenisch in [1]. To evaluate the real security of group signature, the concept of strong anonymity is proposed and all the Camenisch¿s signature of knowledge are found unsatisfied with the requirement of strong anonymity.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133907031","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-18DOI: 10.1109/IIH-MSP.2006.115
Jie Liu, X. Niu, Wenhai Kong
In this paper, a new blind image watermarking algorithm is proposed based on the Singular Value Decomposition. The watermarks can be detected without the original image or any other information of the original singular values. Experiments show that the algorithm has good robustness on JPEG compression, median filtering, rescaling, and Gaussian low-pass filtering, etc.
{"title":"Image Watermarking Based on Singular Value Decomposition","authors":"Jie Liu, X. Niu, Wenhai Kong","doi":"10.1109/IIH-MSP.2006.115","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.115","url":null,"abstract":"In this paper, a new blind image watermarking algorithm is proposed based on the Singular Value Decomposition. The watermarks can be detected without the original image or any other information of the original singular values. Experiments show that the algorithm has good robustness on JPEG compression, median filtering, rescaling, and Gaussian low-pass filtering, etc.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133229473","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-18DOI: 10.1109/IIH-MSP.2006.109
D. Kundur, U. N. Okorafor, William Luh
This paper introduces a novel "HoLiSTiC" framework for visual sensor networks (VisSNs) and studies security issues within this context. The HoLiSTiC paradigm, which encompasses many existing VisSN proposals, effectively exploits heterogeneous wireless sensing and communications for more flexible, practical and scalable visual surveillance. Security aspects of HoLiSTiC are considered by highlighting open research problems. Secure routing issues in unidirectional optical free-space sensor networks that form the foundation of the HoLiSTiC transport network are discussed. In addition, a novel distributed security paradigm based on independent media sharing is presented to demonstrate how the interaction of signal processing, networking, and cryptography can benefit VisSNs.
{"title":"HoLiSTiC: Heterogeneous Lightweight Sensornets for Trusted Visual Computing","authors":"D. Kundur, U. N. Okorafor, William Luh","doi":"10.1109/IIH-MSP.2006.109","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.109","url":null,"abstract":"This paper introduces a novel \"HoLiSTiC\" framework for visual sensor networks (VisSNs) and studies security issues within this context. The HoLiSTiC paradigm, which encompasses many existing VisSN proposals, effectively exploits heterogeneous wireless sensing and communications for more flexible, practical and scalable visual surveillance. Security aspects of HoLiSTiC are considered by highlighting open research problems. Secure routing issues in unidirectional optical free-space sensor networks that form the foundation of the HoLiSTiC transport network are discussed. In addition, a novel distributed security paradigm based on independent media sharing is presented to demonstrate how the interaction of signal processing, networking, and cryptography can benefit VisSNs.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130928265","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}
Yong Zhang, Yibin Hou, Zhangqin Huang, Hui Li, R. Chen
Ambient Intelligence (AmI) is an internationally emerging research field of IT domain. The conception of AmI and its features are discussed in this paper firstly, and we discuss an intelligent context-aware application in order to study the framework of AmI application more deeply. The fundamental model of this context-aware AmI application system based on Multi-Agent architecture is expounded particularly. Furthermore, the skeleton structure of these system agents and their collaboration mechanism would be also expounded clearly.
{"title":"A Context-Aware AmI System Based on MAS Model","authors":"Yong Zhang, Yibin Hou, Zhangqin Huang, Hui Li, R. Chen","doi":"10.1109/IIH-MSP.2006.5","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.5","url":null,"abstract":"Ambient Intelligence (AmI) is an internationally emerging research field of IT domain. The conception of AmI and its features are discussed in this paper firstly, and we discuss an intelligent context-aware application in order to study the framework of AmI application more deeply. The fundamental model of this context-aware AmI application system based on Multi-Agent architecture is expounded particularly. Furthermore, the skeleton structure of these system agents and their collaboration mechanism would be also expounded clearly.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130995217","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
扫码关注我们
求助内容：
应助结果提醒方式：