A grid computing environment enables sharing of loosely coupled resources and services required by various applications in a large-scale. In such an environment, one of the key challenges is to develop a flexible, scalable, and self-adaptive resource management system which would allow users to carry out their jobs by transparently accessing autonomous, distributed, and heterogeneous resources. A Domain-based dynamic resource self maintain mechanism (DDRM) supporting large-scale distributed application is proposed. Grid distributed applications can be ensured to run regularly and stably by maintaining dynamic resource information, detecting abnormality and adjusting system timely. Conceptions of Monitoring Domain and domain agent are defined. Global resource view is acquired through resource pool and the corresponding triggering update algori-thm. Dynamic resource maintenance mechanism are adopted to handle resource abnormality. DDRM can scale to any large distributed application system with strong real-time and reliability. Finally, complexity and convergence time of DDRM are analyzed.
{"title":"Domain-Based Dynamic Resource Management Mechanism Supporting Large-Scale Grid Application","authors":"Guomin Zhang, Yong Zhang, Ming Chen, Huan Xiong","doi":"10.1109/IIH-MSP.2006.89","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.89","url":null,"abstract":"A grid computing environment enables sharing of loosely coupled resources and services required by various applications in a large-scale. In such an environment, one of the key challenges is to develop a flexible, scalable, and self-adaptive resource management system which would allow users to carry out their jobs by transparently accessing autonomous, distributed, and heterogeneous resources. A Domain-based dynamic resource self maintain mechanism (DDRM) supporting large-scale distributed application is proposed. Grid distributed applications can be ensured to run regularly and stably by maintaining dynamic resource information, detecting abnormality and adjusting system timely. Conceptions of Monitoring Domain and domain agent are defined. Global resource view is acquired through resource pool and the corresponding triggering update algori-thm. Dynamic resource maintenance mechanism are adopted to handle resource abnormality. DDRM can scale to any large distributed application system with strong real-time and reliability. Finally, complexity and convergence time of DDRM are analyzed.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"25 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":"132797098","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 algorithm, named Quantum-behaved particle swarm optimization (QPSO) proposed by us previously is introduced in the design of twodimensional (2-D) recursive digital filters. The design of the 2-D filters is reduced to a constrained minimization problem that is solved by QPSO, which is a global stochastic searching technique and be able to find out the global optima of the problem more efficiently than original particle swarm optimization (PSO). Experiment results show the superiority of the proposed method by comparing it with those of some previous designs.
{"title":"Design of Two-Dimensional Recursive Filters by Using Quantum-Behaved Particle Swarm Optimization","authors":"Wei Fang, Jun Sun, Wenbo Xu","doi":"10.1109/IIH-MSP.2006.84","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.84","url":null,"abstract":"A novel algorithm, named Quantum-behaved particle swarm optimization (QPSO) proposed by us previously is introduced in the design of twodimensional (2-D) recursive digital filters. The design of the 2-D filters is reduced to a constrained minimization problem that is solved by QPSO, which is a global stochastic searching technique and be able to find out the global optima of the problem more efficiently than original particle swarm optimization (PSO). Experiment results show the superiority of the proposed method by comparing it with those of some previous designs.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"143 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":"133514086","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.171
W. Fang, Jaw-Chyng L. Lue
A VLSI bio-inspired microsystem for real-time, on-site, robust image analysis and recognition has been developed. A corresponding novel artificial neural network (ANN) learning algorithm using new sigmoid-logarithmic transfer function is invented. Our results show the trained new ANN can recognize low fluorescence patterns better than the conventional sigmoidal ANN does. A differential logarithmic imaging chip is designed for calculating logarithm of relative intensities of fluorescence signals. The single-rail logarithmic circuit and a prototype ANN chip are designed, fabricated and characterized.
{"title":"VLSI Bio-Inspired Microsystem for Robust Microarrray Image Analysis and Recognition","authors":"W. Fang, Jaw-Chyng L. Lue","doi":"10.1109/IIH-MSP.2006.171","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.171","url":null,"abstract":"A VLSI bio-inspired microsystem for real-time, on-site, robust image analysis and recognition has been developed. A corresponding novel artificial neural network (ANN) learning algorithm using new sigmoid-logarithmic transfer function is invented. Our results show the trained new ANN can recognize low fluorescence patterns better than the conventional sigmoidal ANN does. A differential logarithmic imaging chip is designed for calculating logarithm of relative intensities of fluorescence signals. The single-rail logarithmic circuit and a prototype ANN chip are designed, fabricated and characterized.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"35 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":"121687184","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 recognition of digital audio data manipulation is a challenge addressed by various fragile and contentfragile watermarking algorithms. But so far none of the approaches provides satisfying results with respect to manipulation detection. Especially distinguishing malicious attacks from allowed post production operations is still an open issue. We introduce a novel watermarkingbased approach for audio data falsification recognition. We embed multiple watermarks with various characteristics into the audio data to be protected. By analyzing the quality of the retrieved watermarks we obtain information about the nature of the manipulation of the audio data. In comparison to known feature-embedding algorithms, this is rather a forensic approach using watermarking as a hint. Our method is verified using several audio data sets.
{"title":"Audio Integrity Protection and Falsification Estimation by Embedding Multiple Watermarks","authors":"Michael Gulbis, E. Müller, M. Steinebach","doi":"10.1109/IIH-MSP.2006.60","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.60","url":null,"abstract":"The recognition of digital audio data manipulation is a challenge addressed by various fragile and contentfragile watermarking algorithms. But so far none of the approaches provides satisfying results with respect to manipulation detection. Especially distinguishing malicious attacks from allowed post production operations is still an open issue. We introduce a novel watermarkingbased approach for audio data falsification recognition. We embed multiple watermarks with various characteristics into the audio data to be protected. By analyzing the quality of the retrieved watermarks we obtain information about the nature of the manipulation of the audio data. In comparison to known feature-embedding algorithms, this is rather a forensic approach using watermarking as a hint. Our method is verified using several audio data sets.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"38 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":"130098912","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 technology of information hiding has developed rapidly in recent years. The number of steganography software has reached more than 200 at present. This paper focuses on the steganography tools¿ algorithms. Based on the analyses of these algorithms, we partition these tools into five categories: (1). Spatial domain based steganography tools; (2). Transform domain based steganography tools; (3). Document based steganography tools; (4) File structure based steganography tools; (5). Other categories, e.g. video compress encoding and spread spectrum technique based. Moreover, we give an in-depth analysis of the feature of each category.
{"title":"Analysis of Current Steganography Tools: Classifications & Features","authors":"Ming Chen, Ru Zhang, Xinxin Niu, Yixian Yang","doi":"10.1109/IIH-MSP.2006.58","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.58","url":null,"abstract":"The technology of information hiding has developed rapidly in recent years. The number of steganography software has reached more than 200 at present. This paper focuses on the steganography tools¿ algorithms. Based on the analyses of these algorithms, we partition these tools into five categories: (1). Spatial domain based steganography tools; (2). Transform domain based steganography tools; (3). Document based steganography tools; (4) File structure based steganography tools; (5). Other categories, e.g. video compress encoding and spread spectrum technique based. Moreover, we give an in-depth analysis of the feature of each category.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"42 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":"127731307","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.161
Pei-wei Tsai, S. Chu, Ching-Sung Lu, Jui-Fang Chang, Hsing-Yuan Liao
In this paper we present two methods to remove the watermark from the carrier image, which is embedded in dc components of the discrete cosine transform based image using the method presented by Huang et al. [1] The first method, which we present, removes the watermark via varying the energies in frequency domain and redeeming the luminance in spatial domain; the second method we present removes the watermark through diversifying the intensity of dc components in transform domain. Both the two methods can remove the watermark and avoid to be detected that the image was hidden a watermark by the detection criterion. In addition, though we cleaned the watermark from the watermarked image, the PSNR of the cleaned image (compared with the original carrier image) is still high.
{"title":"The Attacking Method for DC Components Watermarking","authors":"Pei-wei Tsai, S. Chu, Ching-Sung Lu, Jui-Fang Chang, Hsing-Yuan Liao","doi":"10.1109/IIH-MSP.2006.161","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.161","url":null,"abstract":"In this paper we present two methods to remove the watermark from the carrier image, which is embedded in dc components of the discrete cosine transform based image using the method presented by Huang et al. [1] The first method, which we present, removes the watermark via varying the energies in frequency domain and redeeming the luminance in spatial domain; the second method we present removes the watermark through diversifying the intensity of dc components in transform domain. Both the two methods can remove the watermark and avoid to be detected that the image was hidden a watermark by the detection criterion. In addition, though we cleaned the watermark from the watermarked image, the PSNR of the cleaned image (compared with the original carrier image) is still high.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"62 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":"126208283","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.173
Zheng Shen, Hu He, Yanjun Zhang, Yihe Sun
This paper describes a novel video specific instruction set architecture for ASIP design. With SIMD (Single Instruction Multiple Data) instructions, and video specific instructions, an instruction set architecture is introduced to enhance the performance for video applications. Furthermore, we quantify the improvement on H.263 encoding. In this paper, we evaluate and compare the performance of VS ISA (Video Specific Instruction Set Architecture), other DSPs (digital signal processors) and conventional SIMD media extensions in the context of video coding. Our evaluation results show that VS ISA improves the processor¿s performance by approximate 5x on H.263 encoding, and VS ISA outperforms other architectures by 1.6x to 8.57x in computing IDCT.
{"title":"VS-ISA: A Video Specific Instruction Set Architecture for ASIP Design","authors":"Zheng Shen, Hu He, Yanjun Zhang, Yihe Sun","doi":"10.1109/IIH-MSP.2006.173","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.173","url":null,"abstract":"This paper describes a novel video specific instruction set architecture for ASIP design. With SIMD (Single Instruction Multiple Data) instructions, and video specific instructions, an instruction set architecture is introduced to enhance the performance for video applications. Furthermore, we quantify the improvement on H.263 encoding. In this paper, we evaluate and compare the performance of VS ISA (Video Specific Instruction Set Architecture), other DSPs (digital signal processors) and conventional SIMD media extensions in the context of video coding. Our evaluation results show that VS ISA improves the processor¿s performance by approximate 5x on H.263 encoding, and VS ISA outperforms other architectures by 1.6x to 8.57x in computing IDCT.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"217 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":"122462116","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}
To get the best effect of art, the music should be added different artificial reverberation. A new watermarking method based on reverberation theory is proposed in this paper. The embed process same as the process that adds reverberation to recordings in music studio to make it sound quite natural like in a real concert hall. The watermark are embedded by convoluting the original audio signal and a room impulse response that obtained by image method[4]. The parameters for calculating the room impulse response are used as secret key that must be used in the decoding process to ensure security. When decoding, homomorphic deconvolution method is used to separate the kernel function from the cepstrum of the watermarked audio signal, and then take cross-correlation with the delay sequence of room impulse response to get watermark by searching the peak.
{"title":"Audio Watermarking Based on Reverberation","authors":"Gui-jun Nian, Zhiyuan Xie, Shuxun Wang","doi":"10.1109/IIH-MSP.2006.62","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.62","url":null,"abstract":"To get the best effect of art, the music should be added different artificial reverberation. A new watermarking method based on reverberation theory is proposed in this paper. The embed process same as the process that adds reverberation to recordings in music studio to make it sound quite natural like in a real concert hall. The watermark are embedded by convoluting the original audio signal and a room impulse response that obtained by image method[4]. The parameters for calculating the room impulse response are used as secret key that must be used in the decoding process to ensure security. When decoding, homomorphic deconvolution method is used to separate the kernel function from the cepstrum of the watermarked audio signal, and then take cross-correlation with the delay sequence of room impulse response to get watermark by searching the peak.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"54 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":"123004233","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.128
Yung-Li Chang, Hsiang-Kai Liao, C. Shieh, Yu-Ben Miao
Typical NAT traversable applications solve the peer-to-peer communication problems by means of STUN-like NAT traversal approach. For example, Skype is a well-known NAT traversable application. The Skype developer claims that peer-to-peer voice over IP (VoIP) service can work across NATs/firewalls. Two Skype clients which reside in different NATs can connect directly with each other. Nonetheless, Skype clients can not traverse through the NAT daemon on FreeBSD system without "Deny Incoming" option being set. The default of this option is disabled and Skype clients must depend on third parties to relay voice instead of contacting with correspondent directly. The situation result in voice quality degradation and scalability problems. This paper proposes a novel approach "KaiKai" for applications to solve this problem. KaiKai can make two clients contact directly even these two clients reside in different NATs. By using protocol behavior analysis, KaiKai can cooperate with NATs with or without "Deny Incoming" option being set. We implemented KaiKai on Windows system and chose Skype as our demonstration application. Our experiments show that KaiKai can make two Skype clients connect directly behind different NATs. Consequently, the better quality of service and scalability can be achieved.
{"title":"KaiKai: A NAT Traversal Approach by Using Protocol Behavior Analysis","authors":"Yung-Li Chang, Hsiang-Kai Liao, C. Shieh, Yu-Ben Miao","doi":"10.1109/IIH-MSP.2006.128","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.128","url":null,"abstract":"Typical NAT traversable applications solve the peer-to-peer communication problems by means of STUN-like NAT traversal approach. For example, Skype is a well-known NAT traversable application. The Skype developer claims that peer-to-peer voice over IP (VoIP) service can work across NATs/firewalls. Two Skype clients which reside in different NATs can connect directly with each other. Nonetheless, Skype clients can not traverse through the NAT daemon on FreeBSD system without \"Deny Incoming\" option being set. The default of this option is disabled and Skype clients must depend on third parties to relay voice instead of contacting with correspondent directly. The situation result in voice quality degradation and scalability problems. This paper proposes a novel approach \"KaiKai\" for applications to solve this problem. KaiKai can make two clients contact directly even these two clients reside in different NATs. By using protocol behavior analysis, KaiKai can cooperate with NATs with or without \"Deny Incoming\" option being set. We implemented KaiKai on Windows system and chose Skype as our demonstration application. Our experiments show that KaiKai can make two Skype clients connect directly behind different NATs. Consequently, the better quality of service and scalability can be achieved.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"29 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":"126928535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose a novel image denoising algorithm in Contourlet domain. The Contourlet transform is adopted by virtual of its advantages over the Wavelet transform in order to obtain a flexible multiresolution, local, and directional image expansion using contour segments, it is good at isolating the smoothness along the contours. We present a weighing factor which submits to the negative exponential distribution, it can combine the hard thresholding function with the soft thresholding, the new thresholding function is continuous[4]. We adapt different thresholdings on different scales and different directions to get better denoising results. Experimental results demonstrate that the proposed algorithm improves the SNR on a certain extent.
{"title":"A Multiscale and Multidirectional Image Denoising Algorithm Based on Contourlet Transform","authors":"Bei Li, Xin Li, Shuxun Wang, Haifeng Li","doi":"10.1109/IIH-MSP.2006.19","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.19","url":null,"abstract":"In this paper, we propose a novel image denoising algorithm in Contourlet domain. The Contourlet transform is adopted by virtual of its advantages over the Wavelet transform in order to obtain a flexible multiresolution, local, and directional image expansion using contour segments, it is good at isolating the smoothness along the contours. We present a weighing factor which submits to the negative exponential distribution, it can combine the hard thresholding function with the soft thresholding, the new thresholding function is continuous[4]. We adapt different thresholdings on different scales and different directions to get better denoising results. Experimental results demonstrate that the proposed algorithm improves the SNR on a certain extent.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"9 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":"126786802","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
扫码关注我们
求助内容：
应助结果提醒方式：