Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687986
Zhengming Li, Xiaogang Yang, Fei Tan
In order to improve the velocity and accuracy of pointing algorithm used for antenna, a novel algorithm based on the quadratic curve theory is presented in this paper. According to theoretical value of pointing algorithm and antenna's states, the antenna is located by action of servo system. Compared with the step searching algorithm, the new proposed algorithm has several advantages, such as: little time in searching, fast speed, and high precision. Experiment results show the validation and speediness.
{"title":"A novel pointing algorithm for vehicle satellites' antenna","authors":"Zhengming Li, Xiaogang Yang, Fei Tan","doi":"10.1109/PIC.2010.5687986","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687986","url":null,"abstract":"In order to improve the velocity and accuracy of pointing algorithm used for antenna, a novel algorithm based on the quadratic curve theory is presented in this paper. According to theoretical value of pointing algorithm and antenna's states, the antenna is located by action of servo system. Compared with the step searching algorithm, the new proposed algorithm has several advantages, such as: little time in searching, fast speed, and high precision. Experiment results show the validation and speediness.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125130997","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687924
J. Woodward, Amin Farjudian
One of the basic features of life is replication. Indeed one of the three components of evolution is inheritance, which implies some similarity (both phenotypic and genotypic) between parents and offspring. Life is a process and not a substance (e.g. being carbon-based does not capture what life is), and this therefore justifies an algorithmic definition. Artificial life is concerned with the study of synthetic life, and is implemented on a digital computer. Tierra is a particularly prominent instance, where rudimentary life forms compete for space and time. In this system interesting eco-systems emerge, for example demonstrating parasitic behavior.
{"title":"Artificial life, the second law of thermodynamics, and Kolmogorov Complexity","authors":"J. Woodward, Amin Farjudian","doi":"10.1109/PIC.2010.5687924","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687924","url":null,"abstract":"One of the basic features of life is replication. Indeed one of the three components of evolution is inheritance, which implies some similarity (both phenotypic and genotypic) between parents and offspring. Life is a process and not a substance (e.g. being carbon-based does not capture what life is), and this therefore justifies an algorithmic definition. Artificial life is concerned with the study of synthetic life, and is implemented on a digital computer. Tierra is a particularly prominent instance, where rudimentary life forms compete for space and time. In this system interesting eco-systems emerge, for example demonstrating parasitic behavior.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121946175","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687939
Zhengming Li, Li Xue, Fei Tan
Face detection is a very hot topic in research application of pattern recognition and computer vision. It is widely applied in artificial intelligence, video surveillance, identity authentication, human-machine interaction and so on. However, skin color detection has high false positive rate in complex background and AdaBoost algorithm was not satisfactory for detection of multi-pose and multi-face image. So a novel face detection method combined with skin color detection and an improved AdaBoost algorithm is proposed in this paper. First, it applies skin model segmentation and morphological operators to detect skin regions in the image. And according to the geometrical characteristics of the face, it screens the candidate face regions. Then by the improved classifiers in a cascade structure based on AdaBoost, it achieves more accurate promising regions of face. The experiment results show that this face detection algorithm improves the detection speed in both the quality of detection, and it can effectively reduce the error detection rate of single test method. This method has a good performance on image with complex background. Above all, this method has a certain theory value and practical value.
{"title":"Face detection in complex background based on skin color features and improved AdaBoost algorithms","authors":"Zhengming Li, Li Xue, Fei Tan","doi":"10.1109/PIC.2010.5687939","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687939","url":null,"abstract":"Face detection is a very hot topic in research application of pattern recognition and computer vision. It is widely applied in artificial intelligence, video surveillance, identity authentication, human-machine interaction and so on. However, skin color detection has high false positive rate in complex background and AdaBoost algorithm was not satisfactory for detection of multi-pose and multi-face image. So a novel face detection method combined with skin color detection and an improved AdaBoost algorithm is proposed in this paper. First, it applies skin model segmentation and morphological operators to detect skin regions in the image. And according to the geometrical characteristics of the face, it screens the candidate face regions. Then by the improved classifiers in a cascade structure based on AdaBoost, it achieves more accurate promising regions of face. The experiment results show that this face detection algorithm improves the detection speed in both the quality of detection, and it can effectively reduce the error detection rate of single test method. This method has a good performance on image with complex background. Above all, this method has a certain theory value and practical value.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122041102","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687914
You-Sai Zhang, Bin Wang
A new method of optimal viewpoint selection for volume rendering based on shuffled frog leaping algorithm is presented. Utilizing the opacity, luminance and structure features of the projected views of three-dimensional volume datasets, a viewpoint evaluation function is constructed to identify the importance of voxels and the structural information within the volume data. Combined with this function, shuffled frog leaping algorithm is used to optimize the computation process, so as to acquire an optimal viewpoint or a series of optimizational viewpoints. The experimental results show this method can not only focus the important structure and the region of interest within the volume data more effectively, but also improve the convergence rate and accuracy, while having a standout performance to select a global optimal viewpoint, thus can be used to guide the direct volume rendering for large scale volume datasets.
{"title":"Optimal viewpoint selection for volume rendering based on shuffled frog leaping algorithm","authors":"You-Sai Zhang, Bin Wang","doi":"10.1109/PIC.2010.5687914","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687914","url":null,"abstract":"A new method of optimal viewpoint selection for volume rendering based on shuffled frog leaping algorithm is presented. Utilizing the opacity, luminance and structure features of the projected views of three-dimensional volume datasets, a viewpoint evaluation function is constructed to identify the importance of voxels and the structural information within the volume data. Combined with this function, shuffled frog leaping algorithm is used to optimize the computation process, so as to acquire an optimal viewpoint or a series of optimizational viewpoints. The experimental results show this method can not only focus the important structure and the region of interest within the volume data more effectively, but also improve the convergence rate and accuracy, while having a standout performance to select a global optimal viewpoint, thus can be used to guide the direct volume rendering for large scale volume datasets.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123558096","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687995
Changli Zhang, Jinjin Zhang, M. Yan
As the social tagging systems becoming prevalent, it remains a critical question that how to make explicit the semantics for tags to fully facilitate Web2.0 applications. This paper establishes a cluster tree based semantic similarity measure for social tagging systems, combines it with traditional statistics based measures into a hybrid one, tailors the hybrid measure according to the effectiveness requirement of intelligent search application, and presents a case study using the empirical data retrieved from delicious website. Comparing to the traditional statistics based measures, our hybrid measure is capable of evaluating similarities between random tags even not co-occurred, can better reflect the structural influence of the network of tag co-occurrence, and is feasible for applications like intelligent search in user-centric Web2.0 environment.
{"title":"Cluster tree based hybrid semantic similarity measure for social tagging systems","authors":"Changli Zhang, Jinjin Zhang, M. Yan","doi":"10.1109/PIC.2010.5687995","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687995","url":null,"abstract":"As the social tagging systems becoming prevalent, it remains a critical question that how to make explicit the semantics for tags to fully facilitate Web2.0 applications. This paper establishes a cluster tree based semantic similarity measure for social tagging systems, combines it with traditional statistics based measures into a hybrid one, tailors the hybrid measure according to the effectiveness requirement of intelligent search application, and presents a case study using the empirical data retrieved from delicious website. Comparing to the traditional statistics based measures, our hybrid measure is capable of evaluating similarities between random tags even not co-occurred, can better reflect the structural influence of the network of tag co-occurrence, and is feasible for applications like intelligent search in user-centric Web2.0 environment.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128334543","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687475
Jin Ma, Xiuzhen Chen, Jian-hua Li
Data holders need to share the alerts data that they detected for correlation and analysis purpose. In such cases, privacy issues turn out to be a major concern. This paper proposes a model to correlate and analyze intrusion alerts with privacy-preserving capability. The raw intrusion alerts are protected by improved k-anonymity method, which preserves the alert regulation inside disturbed data records. Combining this privacy preserving method with typical FP-tree frequent pattern mining approach and WINEPI sequence pattern mining algorithm, an alert correlation model is set up to well balance the alert correlation and the privacy protection. Experimental results show that this model reaches close similarity of correlation and analysis result comparing with original FP-tree and WINEPI algorithm, while sensitive attributes are well preserved.
{"title":"A privacy-preserving alert correlation model","authors":"Jin Ma, Xiuzhen Chen, Jian-hua Li","doi":"10.1109/PIC.2010.5687475","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687475","url":null,"abstract":"Data holders need to share the alerts data that they detected for correlation and analysis purpose. In such cases, privacy issues turn out to be a major concern. This paper proposes a model to correlate and analyze intrusion alerts with privacy-preserving capability. The raw intrusion alerts are protected by improved k-anonymity method, which preserves the alert regulation inside disturbed data records. Combining this privacy preserving method with typical FP-tree frequent pattern mining approach and WINEPI sequence pattern mining algorithm, an alert correlation model is set up to well balance the alert correlation and the privacy protection. Experimental results show that this model reaches close similarity of correlation and analysis result comparing with original FP-tree and WINEPI algorithm, while sensitive attributes are well preserved.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130402052","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 : 2010-12-01DOI: 10.1109/PIC.2010.5688012
Zhiqi Su, Kang-ling Fang, Zhengtao Peng, Zhifan Feng
In order to realize the automation of rebar counting on the production line, this paper analyzes the advantages and the disadvantages of existing solutions. Combining their dominances, this paper presents a new solution. This solution captures the radius of normal rebar according to maximal internal tangent circle algorithm. With the radius, modified gradient Hough circle transform and a series of corresponding operators are used so as to locate rebar. In the end, this paper proposes a set of tracing and counting algorithm which is simple and effective. Hundreds of experiments proved that the failure rate of this solution is extremely low. With elaborate parameters, the failure rate of this system can be reduced to 0.01 percent while producing small diameter rebar in quick pace.
{"title":"Rebar automatically counting on the product line","authors":"Zhiqi Su, Kang-ling Fang, Zhengtao Peng, Zhifan Feng","doi":"10.1109/PIC.2010.5688012","DOIUrl":"https://doi.org/10.1109/PIC.2010.5688012","url":null,"abstract":"In order to realize the automation of rebar counting on the production line, this paper analyzes the advantages and the disadvantages of existing solutions. Combining their dominances, this paper presents a new solution. This solution captures the radius of normal rebar according to maximal internal tangent circle algorithm. With the radius, modified gradient Hough circle transform and a series of corresponding operators are used so as to locate rebar. In the end, this paper proposes a set of tracing and counting algorithm which is simple and effective. Hundreds of experiments proved that the failure rate of this solution is extremely low. With elaborate parameters, the failure rate of this system can be reduced to 0.01 percent while producing small diameter rebar in quick pace.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"66 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130622724","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687409
Lu Wang, Yongquan Liang, Jie Yang
Some Particle Swarm Optimization (PSO) algorithm have been used to solve Multi-Objective Optimization Problems (MOP) and have achieved good results. But finding a good convergence and distribution of solutions near the Pareto-optimal front in little computational time is still a hard work especially for some complex functions. This paper introduces an improved multi-objective PSO algorithm. It is called Strength Pareto Particle Swarm Optimization algorithm(SPPSO) which uses the ranking and sharing strategies of Strength Pareto Evolutionary Algorithm II (SPEA2). The hyper-volume metric (Zitzler 1999) is introduced to evaluate overall performance of the obtained solutions. Simulation results on five difficult test problems show that the proposed algorithm is able to find much better spread of solutions and better convergence near the true Pareto-optimal front compared to CMOPSO.
{"title":"Improved Multi-Objective PSO algorithm for Optimization Problems","authors":"Lu Wang, Yongquan Liang, Jie Yang","doi":"10.1109/PIC.2010.5687409","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687409","url":null,"abstract":"Some Particle Swarm Optimization (PSO) algorithm have been used to solve Multi-Objective Optimization Problems (MOP) and have achieved good results. But finding a good convergence and distribution of solutions near the Pareto-optimal front in little computational time is still a hard work especially for some complex functions. This paper introduces an improved multi-objective PSO algorithm. It is called Strength Pareto Particle Swarm Optimization algorithm(SPPSO) which uses the ranking and sharing strategies of Strength Pareto Evolutionary Algorithm II (SPEA2). The hyper-volume metric (Zitzler 1999) is introduced to evaluate overall performance of the obtained solutions. Simulation results on five difficult test problems show that the proposed algorithm is able to find much better spread of solutions and better convergence near the true Pareto-optimal front compared to CMOPSO.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130696437","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687414
Xiaohong Zhang
Pseudo-BCI filters and subalgebras of pseudo-BCI algebras are investigated. An infinite example of pseudo-BCI algebra is given, in which there exits a pseudo-BCI filter but not a subalgebra. A special class of pseudo-BCI algebra is discussed, in which every subalgebra is a pseudo-BCI filter.
{"title":"Pseudo-BCI filters and subalgebras in pseudo-BCI algebras","authors":"Xiaohong Zhang","doi":"10.1109/PIC.2010.5687414","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687414","url":null,"abstract":"Pseudo-BCI filters and subalgebras of pseudo-BCI algebras are investigated. An infinite example of pseudo-BCI algebra is given, in which there exits a pseudo-BCI filter but not a subalgebra. A special class of pseudo-BCI algebra is discussed, in which every subalgebra is a pseudo-BCI filter.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130907102","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687880
Hongbo Wu, Y. Xing
Image fusion means merging two or more images in such a way as to preserving the most desirable characteristics of each image. Because of standard image fusion methods are often successful at adding spatial detail into the multispectral imagery but distort the colour information in the fusion process. So, the paper presents an approach for multi-resolution image fusion of a high-resolution SPOT (Satellite Pour l'Observation de la Terre, SPOT) panchromatic image and a low-resolution Landsat 7 ETM+ multispectral image based on wavelet transform (WT) combined with filtering in the Fourier domain. Firstly, the images were decomposed to some wavelet coefficients by Mallat algorithm; Secondly, the wavelet transform methods add the wavelet coefficients of the SPOT PAN image to ETM+ image. Finally, the fused image is reconstructed by performing the inverse wavelet transform for obtaining multispectral images of higher spatial resolution. In order to evaluate the quality of the fused images, three quantitive indicators such as Gradients, RMSE, Correlation Coefficients were defined in the paper. In the mean time, the results from a number of wavelet-based image fusion schemes which are the intensity-hue-saturation (IHS) and high-pass filter method (HPF) are compared and these fusion methods were used to synthesize the Landsat ETM+ data and SPOT-5 PAN data were. The evaluation results showed that the WT fusion methods perform the fusion of SPOT PAN image and ETM+ image better than IHS and HPF, specially in preserving both spectral and spatial information. Experiment results showed that the proposed WT fusion algorithm works well in multi-resolution fusion and also preserve the original color or spectral characteristics of the input image data.
图像融合是指以保留每个图像的最理想特征的方式合并两个或多个图像。由于标准的图像融合方法通常能够成功地在多光谱图像中添加空间细节，但在融合过程中会扭曲颜色信息。为此，提出了一种基于小波变换和傅立叶域滤波相结合的高分辨率SPOT (Satellite Pour l’observation de la Terre, SPOT)全色图像与低分辨率Landsat 7 ETM+多光谱图像的多分辨率图像融合方法。首先，用Mallat算法将图像分解成小波系数;其次，小波变换方法将SPOT PAN图像的小波系数加到ETM+图像中。最后，对融合后的图像进行小波反变换，得到空间分辨率更高的多光谱图像。为了评价融合图像的质量，本文定义了梯度、均方根误差、相关系数三个定量指标。同时，比较了强度-色调-饱和度(IHS)和高通滤波(HPF)两种基于小波的图像融合方法的融合结果，并将其应用于Landsat ETM+数据和SPOT-5 PAN数据的合成。评估结果表明，WT融合方法对SPOT PAN图像和ETM+图像的融合效果优于IHS和HPF，特别是在保留光谱和空间信息方面。实验结果表明，所提出的小波变换融合算法在保持输入图像数据原有颜色或光谱特征的同时，具有较好的多分辨率融合效果。
{"title":"Pixel-based image fusion using wavelet transform for SPOT and ETM+ image","authors":"Hongbo Wu, Y. Xing","doi":"10.1109/PIC.2010.5687880","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687880","url":null,"abstract":"Image fusion means merging two or more images in such a way as to preserving the most desirable characteristics of each image. Because of standard image fusion methods are often successful at adding spatial detail into the multispectral imagery but distort the colour information in the fusion process. So, the paper presents an approach for multi-resolution image fusion of a high-resolution SPOT (Satellite Pour l'Observation de la Terre, SPOT) panchromatic image and a low-resolution Landsat 7 ETM+ multispectral image based on wavelet transform (WT) combined with filtering in the Fourier domain. Firstly, the images were decomposed to some wavelet coefficients by Mallat algorithm; Secondly, the wavelet transform methods add the wavelet coefficients of the SPOT PAN image to ETM+ image. Finally, the fused image is reconstructed by performing the inverse wavelet transform for obtaining multispectral images of higher spatial resolution. In order to evaluate the quality of the fused images, three quantitive indicators such as Gradients, RMSE, Correlation Coefficients were defined in the paper. In the mean time, the results from a number of wavelet-based image fusion schemes which are the intensity-hue-saturation (IHS) and high-pass filter method (HPF) are compared and these fusion methods were used to synthesize the Landsat ETM+ data and SPOT-5 PAN data were. The evaluation results showed that the WT fusion methods perform the fusion of SPOT PAN image and ETM+ image better than IHS and HPF, specially in preserving both spectral and spatial information. Experiment results showed that the proposed WT fusion algorithm works well in multi-resolution fusion and also preserve the original color or spectral characteristics of the input image data.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132685220","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
扫码关注我们
求助内容：
应助结果提醒方式：