Genetic Algorithms （GA） are a search techniques based on mechanics of nature selection and have already been successfully applied in many diverse areas. However, increasing samples show that GA＇s performance is not...Genetic Algorithms （GA） are a search techniques based on mechanics of nature selection and have already been successfully applied in many diverse areas. However, increasing samples show that GA＇s performance is not as good as it was expected to be. Criticism of this algorithm includes the slow speed and premature result during convergence procedure. In order to improve the performance, the population size and individuals＇ space is emphatically described. The influence of individuals＇ space and population size on the operators is analyzed. And a novel family genetic algorithm （FGA） is put forward based on this analysis. In this novel algorithm, the optimum solution families closed to quality individuals is constructed, which is exchanged found by a search in the world space. Search will be done in this microspace. The family that can search better genes in a limited period of time would win a new life. At the same time, the best gene of this micro space with the basic population in the world space is exchanged. Finally, the FGA is applied to the function optimization and image matching through several experiments. The results show that the FGA possessed high performance.展开更多
Since there is lack of methodology to assess the performance of defogging algorithm and the existing assessment methods have some limitations,three new methods for assessing the defogging algorithm were proposed.One w...Since there is lack of methodology to assess the performance of defogging algorithm and the existing assessment methods have some limitations,three new methods for assessing the defogging algorithm were proposed.One was using synthetic foggy image simulated by image degradation model to assess the defogging algorithm in full-reference way.In this method,the absolute difference was computed between the synthetic image with and without fog.The other two were computing the fog density of gray level image or constructing assessment system of color image from human visual perception to assess the defogging algorithm in no-reference way.For these methods,an assessment function was defined to evaluate algorithm performance from the function value.Using the defogging algorithm comparison,the experimental results demonstrate the effectiveness and reliability of the proposed methods.展开更多
It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used suc...It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.展开更多
文摘Genetic Algorithms （GA） are a search techniques based on mechanics of nature selection and have already been successfully applied in many diverse areas. However, increasing samples show that GA＇s performance is not as good as it was expected to be. Criticism of this algorithm includes the slow speed and premature result during convergence procedure. In order to improve the performance, the population size and individuals＇ space is emphatically described. The influence of individuals＇ space and population size on the operators is analyzed. And a novel family genetic algorithm （FGA） is put forward based on this analysis. In this novel algorithm, the optimum solution families closed to quality individuals is constructed, which is exchanged found by a search in the world space. Search will be done in this microspace. The family that can search better genes in a limited period of time would win a new life. At the same time, the best gene of this micro space with the basic population in the world space is exchanged. Finally, the FGA is applied to the function optimization and image matching through several experiments. The results show that the FGA possessed high performance.
基金Projects(91220301,61175064,61273314)supported by the National Natural Science Foundation of ChinaProject(126648)supported by the Postdoctoral Science Foundation of Central South University,ChinaProject(2012170301)supported by the New Teacher Fund for School of Information Science and Engineering,Central South University,China
文摘Since there is lack of methodology to assess the performance of defogging algorithm and the existing assessment methods have some limitations,three new methods for assessing the defogging algorithm were proposed.One was using synthetic foggy image simulated by image degradation model to assess the defogging algorithm in full-reference way.In this method,the absolute difference was computed between the synthetic image with and without fog.The other two were computing the fog density of gray level image or constructing assessment system of color image from human visual perception to assess the defogging algorithm in no-reference way.For these methods,an assessment function was defined to evaluate algorithm performance from the function value.Using the defogging algorithm comparison,the experimental results demonstrate the effectiveness and reliability of the proposed methods.
文摘It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.
