Pub Date : 2009-11-17DOI: 10.1109/IIH-MSP.2009.257
Chuan-Yu Chang, Ru-Hao Jian, Hung-Jen Wang
O-glycosylation of the mammalian protein is studied. It is serine or threonine specific, though any consensus sequence is still unknown. We have been applied support vector machines (SVM) for the prediction of O-glycosylation sites from various kinds of protein information, aiming to investigate a glycosylation condition and elucidate the mechanisms. In the present study, we focus on the distribution of the glycosylation sites. Many O-glycosylated sites are observed in clusters of closely spaced glycosylated sites, whereas the other sites are found sparsely or isolated. These two types of crowded and isolated sites may have different glycosylation mechanisms. We divide the whole O-glycosylation sites into the crowded and the isolated groups. For each group, SVM is trained to predict the O-glycosylation sites separately. The prediction results of two groups have different input information dependency. The results indicate that some motifs are expected for the isolated group, while the interaction between the glycosylated sites and the relative proportion of the surrounding amino acids affect the glycosylation for the crowded group. Then, we also compare the statistics of amino acid sequences around the glycosylation sites of both groups. As the results, some amino acids (proline, valine, alanine etc.) have high existence probabilities at each specific positions relative to a glycosylation site, especially for the isolated glycosylation. Moreover, independent component analysis (ICA) for the amino acid sequences elucidates position specific existences of the above amino acids, including well known proline at -1 and +3, which are found as different independent components.
{"title":"Two-phase Fuzzy-ART with Independent Component Analysis for Semantic Image Classification","authors":"Chuan-Yu Chang, Ru-Hao Jian, Hung-Jen Wang","doi":"10.1109/IIH-MSP.2009.257","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2009.257","url":null,"abstract":"O-glycosylation of the mammalian protein is studied. It is serine or threonine specific, though any consensus sequence is still unknown. We have been applied support vector machines (SVM) for the prediction of O-glycosylation sites from various kinds of protein information, aiming to investigate a glycosylation condition and elucidate the mechanisms. In the present study, we focus on the distribution of the glycosylation sites. Many O-glycosylated sites are observed in clusters of closely spaced glycosylated sites, whereas the other sites are found sparsely or isolated. These two types of crowded and isolated sites may have different glycosylation mechanisms. We divide the whole O-glycosylation sites into the crowded and the isolated groups. For each group, SVM is trained to predict the O-glycosylation sites separately. The prediction results of two groups have different input information dependency. The results indicate that some motifs are expected for the isolated group, while the interaction between the glycosylated sites and the relative proportion of the surrounding amino acids affect the glycosylation for the crowded group. Then, we also compare the statistics of amino acid sequences around the glycosylation sites of both groups. As the results, some amino acids (proline, valine, alanine etc.) have high existence probabilities at each specific positions relative to a glycosylation site, especially for the isolated glycosylation. Moreover, independent component analysis (ICA) for the amino acid sequences elucidates position specific existences of the above amino acids, including well known proline at -1 and +3, which are found as different independent components.","PeriodicalId":248382,"journal":{"name":"2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133466896","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 : 2009-09-12DOI: 10.1109/IIH-MSP.2009.146
Xiu-ying Ma, Jia-jun Lin
The imperceptibility of steganography is one of the most important measures that evaluate the performance of the steganography algorithm. The global evaluation model PSNR which is widely used by most researchers can’t evaluate the performance of steganography algorithm effectively. Lacking of researches on imperceptibility for color stego image is even serious. Based on HVS model and detailed analyzing of color space, color masking weight is computed and then imperceptibility metric CYIQ for color stego image is proposed in the paper. Experimental results show that CYIQ outperforms global PSNR, which reflects the color masking, luminance masking and texture masking of HVS, and CYIQ can be used to measure the imperceptibility of steganography methods.
{"title":"Imperceptibility Evaluation for Color Stego Image","authors":"Xiu-ying Ma, Jia-jun Lin","doi":"10.1109/IIH-MSP.2009.146","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2009.146","url":null,"abstract":"The imperceptibility of steganography is one of the most important measures that evaluate the performance of the steganography algorithm. The global evaluation model PSNR which is widely used by most researchers can’t evaluate the performance of steganography algorithm effectively. Lacking of researches on imperceptibility for color stego image is even serious. Based on HVS model and detailed analyzing of color space, color masking weight is computed and then imperceptibility metric CYIQ for color stego image is proposed in the paper. Experimental results show that CYIQ outperforms global PSNR, which reflects the color masking, luminance masking and texture masking of HVS, and CYIQ can be used to measure the imperceptibility of steganography methods.","PeriodicalId":248382,"journal":{"name":"2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127311339","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 : 2009-09-12DOI: 10.1109/IIH-MSP.2009.216
Ryoji Kadota, H. Sugano, Masayuki Hiromoto, H. Ochi, R. Miyamoto, Yukihiro Nakamura
Pedestrian recognition on embedded systems is a challenging problem since accurate recognition requires extensive computation. To achieve real-time pedestrian recognition on embedded systems, we propose hardware architecture suitable for HOG feature extraction, which is a popular method for high-accuracy pedestrian recognition. To reduce computational complexity toward efficient hardware architecture, this paper proposes several methods to simplify the computation of HOG feature extraction, such as conversion of the division, square root, arctangent to more simple operations. To show that such simplifications do not spoil the recognition accuracy, the detection performance is also evaluated using a support vector machine. Moreover, we implement the proposed architecture on an ALTERA Stratix II FPGA using Verilog HDL to evaluate the circuit size and the processing performance of the proposed architecture. Implementation results show that real-time processing for 30 fps VGA video can be achieved if 10 instances of the proposed hardware are used in parallel.
嵌入式系统的行人识别是一个具有挑战性的问题，因为准确的识别需要大量的计算。为了在嵌入式系统上实现实时行人识别，我们提出了一种适合HOG特征提取的硬件架构，HOG特征提取是一种常用的高精度行人识别方法。为了降低计算复杂度，实现高效的硬件架构，本文提出了几种简化HOG特征提取计算的方法，如将除法、平方根、反正切转换为更简单的运算。为了证明这种简化不会影响识别的准确性，还使用支持向量机评估了检测性能。此外，我们使用Verilog HDL在ALTERA Stratix II FPGA上实现了所提出的架构，以评估所提出架构的电路尺寸和处理性能。实现结果表明，如果并行使用10个硬件实例，可以实现对30fps VGA视频的实时处理。
{"title":"Hardware Architecture for HOG Feature Extraction","authors":"Ryoji Kadota, H. Sugano, Masayuki Hiromoto, H. Ochi, R. Miyamoto, Yukihiro Nakamura","doi":"10.1109/IIH-MSP.2009.216","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2009.216","url":null,"abstract":"Pedestrian recognition on embedded systems is a challenging problem since accurate recognition requires extensive computation. To achieve real-time pedestrian recognition on embedded systems, we propose hardware architecture suitable for HOG feature extraction, which is a popular method for high-accuracy pedestrian recognition. To reduce computational complexity toward efficient hardware architecture, this paper proposes several methods to simplify the computation of HOG feature extraction, such as conversion of the division, square root, arctangent to more simple operations. To show that such simplifications do not spoil the recognition accuracy, the detection performance is also evaluated using a support vector machine. Moreover, we implement the proposed architecture on an ALTERA Stratix II FPGA using Verilog HDL to evaluate the circuit size and the processing performance of the proposed architecture. Implementation results show that real-time processing for 30 fps VGA video can be achieved if 10 instances of the proposed hardware are used in parallel.","PeriodicalId":248382,"journal":{"name":"2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125358935","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 : 2009-09-12DOI: 10.1109/IIH-MSP.2009.212
Yea-Shuan Huang, Wei-Cheng Liu
This paper presents a robust face recognition method which two highly discriminating algorithms (CMSM and GDA) to recognize human faces. CMSM (Constraint Mutual Subspace Method) constructs a class subspace for each person and makes the relation between class subspaces by projecting them onto a generalized difference subspace so that the canonical angles between subspaces are enlarged to approach to the orthogonal relation. GDA (Generalized Discriminant Analysis) adopts kernel function operator to make it easy to extend and generalize the classical Linear Discriminant Analysis to a non linear one. Both CMSM and GDA are effective to recognize human faces, however, CMSM constructs a subspace from several face images and GDA needs only one face image to perform recognition. Obviously, these two methods inherently have different properties and abilities of recognition so that we combine them together. Experimental results show that the proposed method can achieve good recognition accuracy.
{"title":"Face Recognition Based on Complementary Matching of Single Image and Sequential Images","authors":"Yea-Shuan Huang, Wei-Cheng Liu","doi":"10.1109/IIH-MSP.2009.212","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2009.212","url":null,"abstract":"This paper presents a robust face recognition method which two highly discriminating algorithms (CMSM and GDA) to recognize human faces. CMSM (Constraint Mutual Subspace Method) constructs a class subspace for each person and makes the relation between class subspaces by projecting them onto a generalized difference subspace so that the canonical angles between subspaces are enlarged to approach to the orthogonal relation. GDA (Generalized Discriminant Analysis) adopts kernel function operator to make it easy to extend and generalize the classical Linear Discriminant Analysis to a non linear one. Both CMSM and GDA are effective to recognize human faces, however, CMSM constructs a subspace from several face images and GDA needs only one face image to perform recognition. Obviously, these two methods inherently have different properties and abilities of recognition so that we combine them together. Experimental results show that the proposed method can achieve good recognition accuracy.","PeriodicalId":248382,"journal":{"name":"2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115342692","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}
Super resolution reconstruction of images has become a very important research topic nowadays. The accuracy of the image registration plays a crucial role in super resolution. In this paper we present a new sub-pixel registration method which makes use of the combination of mutual information measure criteria and the NEDI interpolation algorithm. Experimental results show that our proposed method can yield accurate registration results. When applying this registration results in SR image reconstruction, PSNR of the image estimated by our proposed method is 1−2 dB higher than those of the images reconstructed by other registration methods.
{"title":"A Mutual Information Based Sub-Pixel Registration Method for Image Super Resolution","authors":"Boyang Zhang, Ju Liu, Jinyu Chu, Jianping Qiao","doi":"10.1109/IIH-MSP.2009.80","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2009.80","url":null,"abstract":"Super resolution reconstruction of images has become a very important research topic nowadays. The accuracy of the image registration plays a crucial role in super resolution. In this paper we present a new sub-pixel registration method which makes use of the combination of mutual information measure criteria and the NEDI interpolation algorithm. Experimental results show that our proposed method can yield accurate registration results. When applying this registration results in SR image reconstruction, PSNR of the image estimated by our proposed method is 1−2 dB higher than those of the images reconstructed by other registration methods.","PeriodicalId":248382,"journal":{"name":"2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115993141","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 : 2009-09-12DOI: 10.1109/IIH-MSP.2009.214
Jiasheng Hao, Yi Shen, Hongbing Xu, Jianxiao Zou
Computer aided fusion of multi modality medical images provides a very promising diagnostic tool with numerous clinical applications. The objective of this paper is to present a novel scheme of medical imaging fusion. We define “local to be fused” of the process of image fusion as a generalized local, which extends airspace locals to generalized locals, and promotes the airspace local priority to generalized local priority. Based on this priority, the volume-weighted of token coefficient of images is introduced and weighted so that multi-modal medical image fusion is achieved with high quality. This scheme is applied to CT/MRI datasets and results show the effectiveness of the method.
{"title":"Generalized Local Priority Based Medical Image Fusion Scheme","authors":"Jiasheng Hao, Yi Shen, Hongbing Xu, Jianxiao Zou","doi":"10.1109/IIH-MSP.2009.214","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2009.214","url":null,"abstract":"Computer aided fusion of multi modality medical images provides a very promising diagnostic tool with numerous clinical applications. The objective of this paper is to present a novel scheme of medical imaging fusion. We define “local to be fused” of the process of image fusion as a generalized local, which extends airspace locals to generalized locals, and promotes the airspace local priority to generalized local priority. Based on this priority, the volume-weighted of token coefficient of images is introduced and weighted so that multi-modal medical image fusion is achieved with high quality. This scheme is applied to CT/MRI datasets and results show the effectiveness of the method.","PeriodicalId":248382,"journal":{"name":"2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114146443","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}
Super-resolution is an important method to reconstruct high-resolution images from low-resolution images. In this paper, a manifold learning algorithm based on two-dimensional locality preserving projection (2D-LPP) is proposed for face image super-resolution. The 2D-LPP detects the intrinsic manifold structure of high space and preserves the structure in low space by projection. The projection approach in the 2D-LPP resolves the out-of-sample problem in embedding-based manifold learning methods, and improves the speed in reducing the dimension of a new sample data. Moreover, the 2D-LPP preserves more accurate manifold structure by directly operating on 2D images rather than flattened 1D vector as PCA and LPP does. Extensive experiments are conducted on the AR and FERET databases. Experimental results show that the proposed method performs better than PCA based super-resolution in both PSNR and time efficiency.
{"title":"Face Image Super-Resolution Using Two-dimensional Locality Preserving Projection","authors":"Yuan-Kai Wang, Caiyun Huang","doi":"10.1109/IIH-MSP.2009.17","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2009.17","url":null,"abstract":"Super-resolution is an important method to reconstruct high-resolution images from low-resolution images. In this paper, a manifold learning algorithm based on two-dimensional locality preserving projection (2D-LPP) is proposed for face image super-resolution. The 2D-LPP detects the intrinsic manifold structure of high space and preserves the structure in low space by projection. The projection approach in the 2D-LPP resolves the out-of-sample problem in embedding-based manifold learning methods, and improves the speed in reducing the dimension of a new sample data. Moreover, the 2D-LPP preserves more accurate manifold structure by directly operating on 2D images rather than flattened 1D vector as PCA and LPP does. Extensive experiments are conducted on the AR and FERET databases. Experimental results show that the proposed method performs better than PCA based super-resolution in both PSNR and time efficiency.","PeriodicalId":248382,"journal":{"name":"2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121875874","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 : 2009-09-12DOI: 10.1109/IIH-MSP.2009.129
P. V. Rao, C. Raj, S. Ravi
Low power multipliers with high clock frequencies play an important role in today’s digital signal processing. In this work, the performance analysis of Wallace-tree, Array and Baugh-Wooley multiplier architectures is carried out. Physical verification of all the sub-blocks is performed using HSpice to check their functionality and to optimize for low power by using transistor sizing. The Layouts of the sub-blocks are drawn using Cadence Virtuoso to form the multipliers macros. DRC and LVS checks are performed using HerculesI and fed to RC-XT for parasitic extraction and to carry out post layout simulation and the power analysis using Astro rail. Delay and Power dissipation of Wallace Tree multiplier is least whereas Array multiplier is a best for reduced area applications but not speed. In this work, the area of 5x5 Array multiplier is 67.73x7µm2 is the least compared to others. Each multiplier has to be selected depending on performance measures and nature of applications.
{"title":"VLSI Design and Analysis of Multipliers for Low Power","authors":"P. V. Rao, C. Raj, S. Ravi","doi":"10.1109/IIH-MSP.2009.129","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2009.129","url":null,"abstract":"Low power multipliers with high clock frequencies play an important role in today’s digital signal processing. In this work, the performance analysis of Wallace-tree, Array and Baugh-Wooley multiplier architectures is carried out. Physical verification of all the sub-blocks is performed using HSpice to check their functionality and to optimize for low power by using transistor sizing. The Layouts of the sub-blocks are drawn using Cadence Virtuoso to form the multipliers macros. DRC and LVS checks are performed using HerculesI and fed to RC-XT for parasitic extraction and to carry out post layout simulation and the power analysis using Astro rail. Delay and Power dissipation of Wallace Tree multiplier is least whereas Array multiplier is a best for reduced area applications but not speed. In this work, the area of 5x5 Array multiplier is 67.73x7µm2 is the least compared to others. Each multiplier has to be selected depending on performance measures and nature of applications.","PeriodicalId":248382,"journal":{"name":"2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122235291","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 : 2009-09-12DOI: 10.1109/IIH-MSP.2009.309
Kuo-Kai Hsu, Dwen-Ren Tsai
Penumbral imaging is a power imaging technique for radiations with long mean-free path. Since the reconstruction is based on deconvolution, the technique is sensitive to noise contained in penumbral images. The reconstruction of penumbral images can be viewed as an optimization problem by optimizing its cost function. Though conventional local optimization techniques, such as the gradient decent method, can be used for penumbral image reconstructions, these methods need good initial values for estimation in order to avoid the local minimum. In this paper, we propose a new approach using particle swarm optimization (PSO) for penumbral image reconstructions. Particle swarm optimization is a newly proposed stochastic, population-based evolutionary global optimization algorithm. The effectiveness of PSO has been demonstrated.
{"title":"Build a Home Security Surveillance System Using LEGO MINDSTORMS NXT","authors":"Kuo-Kai Hsu, Dwen-Ren Tsai","doi":"10.1109/IIH-MSP.2009.309","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2009.309","url":null,"abstract":"Penumbral imaging is a power imaging technique for radiations with long mean-free path. Since the reconstruction is based on deconvolution, the technique is sensitive to noise contained in penumbral images. The reconstruction of penumbral images can be viewed as an optimization problem by optimizing its cost function. Though conventional local optimization techniques, such as the gradient decent method, can be used for penumbral image reconstructions, these methods need good initial values for estimation in order to avoid the local minimum. In this paper, we propose a new approach using particle swarm optimization (PSO) for penumbral image reconstructions. Particle swarm optimization is a newly proposed stochastic, population-based evolutionary global optimization algorithm. The effectiveness of PSO has been demonstrated.","PeriodicalId":248382,"journal":{"name":"2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117024191","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 : 2009-09-12DOI: 10.1109/IIH-MSP.2009.175
W. Yen, Yen-Yu Chen, Ying-Wen Chang
The enlargement method is a partial technology in many application including medical imaging, satellite imaging, and video applications. Due to the wavelet representation has characteristics of the efficient time-frequency localization and the multi-resolution analysis, the wavelet transforms are suitable for processing the image resolution enhancement. Therefore, this method focuses on wavelet-based image resolution enhancement and proposes a framework of enlargement method. This proposed method is based on the estimation of detail wavelet coefficients at high resolution scales. The method exploits shape function according to wavelet coefficient correlation in a local neighborhood and employs undecimated discrete wavelet transform to estimate the unknown detail coefficients. The simulation results objectivity show that the proposed method is considerably superior to conventional image interpolation techniques.
{"title":"An Enlargement Method Using Undecimated Wavelet Transform and Shape Function","authors":"W. Yen, Yen-Yu Chen, Ying-Wen Chang","doi":"10.1109/IIH-MSP.2009.175","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2009.175","url":null,"abstract":"The enlargement method is a partial technology in many application including medical imaging, satellite imaging, and video applications. Due to the wavelet representation has characteristics of the efficient time-frequency localization and the multi-resolution analysis, the wavelet transforms are suitable for processing the image resolution enhancement. Therefore, this method focuses on wavelet-based image resolution enhancement and proposes a framework of enlargement method. This proposed method is based on the estimation of detail wavelet coefficients at high resolution scales. The method exploits shape function according to wavelet coefficient correlation in a local neighborhood and employs undecimated discrete wavelet transform to estimate the unknown detail coefficients. The simulation results objectivity show that the proposed method is considerably superior to conventional image interpolation techniques.","PeriodicalId":248382,"journal":{"name":"2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117302885","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
扫码关注我们
求助内容：
应助结果提醒方式：