The chromatically uniqueness of bipartite graphs K （m, n） - A（]A] = 2） was studied. With comparing the numbers of partitions into r color classes of two chromatically equivalent graphs, one general numerical condi...The chromatically uniqueness of bipartite graphs K （m, n） - A（]A] = 2） was studied. With comparing the numbers of partitions into r color classes of two chromatically equivalent graphs, one general numerical condition guaranteeing that K（ m, n） - A （ I A ] = 2） is chromatically unique were obtained. This covers and improves the former correlative results.展开更多
With its comprehensive application in network information engineering （e. g. dynamic spectrum allocation under different distance constraints ） and in network combination optimization （e. g. safe storage of deleter...With its comprehensive application in network information engineering （e. g. dynamic spectrum allocation under different distance constraints ） and in network combination optimization （e. g. safe storage of deleterious materials）, the graphs＇ cloring theory and chromatic uniqueness theory have been the forward position of graph theory research. The later concerns the equivalent classification of graphs with their color polynomials and the determination of uniqueness of some equivalent classification under isomorphism. In this paper, by introducing the concept of chromatic normality and comparing the number of partitions of two chromatically equivalent graphs, a general numerical condition guarenteeing that bipartite graphs K （ m, n） - A （A belong to E（K （m, n） ） and ｜ A ｜≥ 2） is chromatically unique was obtained and a lot of chromatic uniqueness graphs of bipartite graphs K（m, n） - A were determined. The results obtained in this paper were general. And the results cover and extend the majority of the relevant results obtained within the world.展开更多
A new matting algorithm based on color distance and differential distance is proposed to deal with the problem that many matting methods perform poorly with complex natural images.The proposed method combines local sa...A new matting algorithm based on color distance and differential distance is proposed to deal with the problem that many matting methods perform poorly with complex natural images.The proposed method combines local sampling with global sampling to select foreground and background pairs for unknown pixels and then a new cost function is constructed based on color distance and differential distance to further optimize the selected sample pairs.Finally,a quadratic objective function is used based on matte Laplacian coming from KNN matting which is added with texture feature.Through experiments on various test images,it is confirmed that the results obtained by the proposed method are more accurate than those obtained by traditional methods.The four-error-metrics comparison on benchmark dataset among several algorithms also proves the effectiveness of the proposed method.展开更多
A snake algorithm has been known that it has a strong point in extracting the exact contour of an object. But it is apt to be influenced by scattered edges around the control points. Since the shape of a moving object...A snake algorithm has been known that it has a strong point in extracting the exact contour of an object. But it is apt to be influenced by scattered edges around the control points. Since the shape of a moving object in 2D image changes a lot due to its rotation and translation in the 3D space, the conventional algorithm that takes into account slowly moving objects cannot provide an appropriate solution. To utilize the advantages of the snake algorithm while minimizing the drawbacks, this paper proposes the area variation based color snake algorithm for moving object tracking. The proposed algorithm includes a new energy term which is used for preserving the shape of an object between two consecutive images. The proposed one can also segment precisely interesting objects on complex image since it is based on color information. Experiment results show that the proposed algorithm is very effective in various environments.展开更多
A new local cost function is proposed in this paper based on the linear relationship assumption between the values of the color components and the intensity component in each local image window,then a new quadratic ob...A new local cost function is proposed in this paper based on the linear relationship assumption between the values of the color components and the intensity component in each local image window,then a new quadratic objective function is derived from it and the globally optimal chrominance values can be computed by solving a sparse linear system of equations.Through the colorization experiments on various test images,it is confirmed that the colorized images obtained by our proposed method have more vivid colors and sharper boundaries than those obtained by the traditional method.The peak signal to noise ratio(PSNR) of the colorized images and the average estimation error of the chrominance values relative to the original images also show that our proposed method gives more precise estimation than the traditional method.展开更多
An improved single image dehazing method based on dark channel prior and wavelet transform is proposed. This proposed method employs wavelet transform and guided filter instead of the soft matting procedure to estimat...An improved single image dehazing method based on dark channel prior and wavelet transform is proposed. This proposed method employs wavelet transform and guided filter instead of the soft matting procedure to estimate and refine the depth map of haze images. Moreover, a contrast enhancement method based on just noticeable difference(JND) and quadratic function is adopted to enhance the contrast for the dehazed image, since the scene radiance is usually not as bright as the atmospheric light,and the dehazed image looks dim. The experimental results show that the proposed approach can effectively enhance the haze image and is well suitable for implementing on the surveillance and obstacle detection systems.展开更多
基金Supported by the Natural Science Foundation of Jiangxi , China (No.0511006)
文摘The chromatically uniqueness of bipartite graphs K （m, n） - A（]A] = 2） was studied. With comparing the numbers of partitions into r color classes of two chromatically equivalent graphs, one general numerical condition guaranteeing that K（ m, n） - A （ I A ] = 2） is chromatically unique were obtained. This covers and improves the former correlative results.
基金Natural Science Foundation of Fujian, China (No.S0650011)
文摘With its comprehensive application in network information engineering （e. g. dynamic spectrum allocation under different distance constraints ） and in network combination optimization （e. g. safe storage of deleterious materials）, the graphs＇ cloring theory and chromatic uniqueness theory have been the forward position of graph theory research. The later concerns the equivalent classification of graphs with their color polynomials and the determination of uniqueness of some equivalent classification under isomorphism. In this paper, by introducing the concept of chromatic normality and comparing the number of partitions of two chromatically equivalent graphs, a general numerical condition guarenteeing that bipartite graphs K （ m, n） - A （A belong to E（K （m, n） ） and ｜ A ｜≥ 2） is chromatically unique was obtained and a lot of chromatic uniqueness graphs of bipartite graphs K（m, n） - A were determined. The results obtained in this paper were general. And the results cover and extend the majority of the relevant results obtained within the world.
基金Supported by the National Natural Science Foundation of China(No.61133009,U1304616)
文摘A new matting algorithm based on color distance and differential distance is proposed to deal with the problem that many matting methods perform poorly with complex natural images.The proposed method combines local sampling with global sampling to select foreground and background pairs for unknown pixels and then a new cost function is constructed based on color distance and differential distance to further optimize the selected sample pairs.Finally,a quadratic objective function is used based on matte Laplacian coming from KNN matting which is added with texture feature.Through experiments on various test images,it is confirmed that the results obtained by the proposed method are more accurate than those obtained by traditional methods.The four-error-metrics comparison on benchmark dataset among several algorithms also proves the effectiveness of the proposed method.
文摘A snake algorithm has been known that it has a strong point in extracting the exact contour of an object. But it is apt to be influenced by scattered edges around the control points. Since the shape of a moving object in 2D image changes a lot due to its rotation and translation in the 3D space, the conventional algorithm that takes into account slowly moving objects cannot provide an appropriate solution. To utilize the advantages of the snake algorithm while minimizing the drawbacks, this paper proposes the area variation based color snake algorithm for moving object tracking. The proposed algorithm includes a new energy term which is used for preserving the shape of an object between two consecutive images. The proposed one can also segment precisely interesting objects on complex image since it is based on color information. Experiment results show that the proposed algorithm is very effective in various environments.
基金Supported by the National Natural Science Foundation of China(No.61073089)the Joint Funds of the National Natural Science,Foundation of China(No.U1304616)the Qinhuangdao Research&Development Program of Science&Technology(No.2012021A044)
文摘A new local cost function is proposed in this paper based on the linear relationship assumption between the values of the color components and the intensity component in each local image window,then a new quadratic objective function is derived from it and the globally optimal chrominance values can be computed by solving a sparse linear system of equations.Through the colorization experiments on various test images,it is confirmed that the colorized images obtained by our proposed method have more vivid colors and sharper boundaries than those obtained by the traditional method.The peak signal to noise ratio(PSNR) of the colorized images and the average estimation error of the chrominance values relative to the original images also show that our proposed method gives more precise estimation than the traditional method.
基金supported by the National Natural Science Foundation of China(61075013)the Joint Funds of the Civil Aviation(61139003)
文摘An improved single image dehazing method based on dark channel prior and wavelet transform is proposed. This proposed method employs wavelet transform and guided filter instead of the soft matting procedure to estimate and refine the depth map of haze images. Moreover, a contrast enhancement method based on just noticeable difference(JND) and quadratic function is adopted to enhance the contrast for the dehazed image, since the scene radiance is usually not as bright as the atmospheric light,and the dehazed image looks dim. The experimental results show that the proposed approach can effectively enhance the haze image and is well suitable for implementing on the surveillance and obstacle detection systems.
