Due to the different lighting environments or other reasons, the pixel colors may be quite different in one image which causes distinct visual discontinuities. It makes the analysis and processing of such an image mor...Due to the different lighting environments or other reasons, the pixel colors may be quite different in one image which causes distinct visual discontinuities. It makes the analysis and processing of such an image more difficult and sometime impossible. In this paper, a unified multi-toning image adjustment method is proposed to solve this problem. First, a novel unsupervised clustering method was proposed to partition the source and the target image into a certain number of subsets with similar color statistics. By matching the texture characteristics and luminance distribution between the blocks, it can create optimized correspondence. Then, the color information was transferred from the matched pixels in the source blocks to the target ones. Graph cut method was used to optimize the seams between different subsets in the final step. This method can automatically perform color adjustment of a multi-toning image. It is simple and efficient. Various results show the validity of this method.展开更多
A new faster block-matching algorithm （BMA） by using both search candidate and pixd sulzsamplings is proposed. Firstly a pixd-subsampling approach used in adjustable partial distortion search （APDS） is adjusted to...A new faster block-matching algorithm （BMA） by using both search candidate and pixd sulzsamplings is proposed. Firstly a pixd-subsampling approach used in adjustable partial distortion search （APDS） is adjusted to visit about half points of all search candidates by subsampling them, using a spiral-scanning path with one skip. Two sdected candidates that have minimal and second minimal block distortion measures are obtained. Then a fine-tune step is taken around them to find the best one. Some analyses are given to approve the rationality of the approach of this paper. Experimental results show that, as compared to APDS, the proposed algorithm can enhance the block-matching speed by about 30% while maintaining its MSE performance very close to that of it. And it performs much better than many other BMAs such as TSS, NTSS, UCDBS and NPDS.展开更多
基金Supported by Natural Science Foundation of China （61170118 and 60803047）, the Specialized Research Fund for the Doctoral Program of Higher Education of China （200800561045）
文摘Due to the different lighting environments or other reasons, the pixel colors may be quite different in one image which causes distinct visual discontinuities. It makes the analysis and processing of such an image more difficult and sometime impossible. In this paper, a unified multi-toning image adjustment method is proposed to solve this problem. First, a novel unsupervised clustering method was proposed to partition the source and the target image into a certain number of subsets with similar color statistics. By matching the texture characteristics and luminance distribution between the blocks, it can create optimized correspondence. Then, the color information was transferred from the matched pixels in the source blocks to the target ones. Graph cut method was used to optimize the seams between different subsets in the final step. This method can automatically perform color adjustment of a multi-toning image. It is simple and efficient. Various results show the validity of this method.
基金This project was supported by the National Natural Science Foundation of China (60272099) .
文摘A new faster block-matching algorithm （BMA） by using both search candidate and pixd sulzsamplings is proposed. Firstly a pixd-subsampling approach used in adjustable partial distortion search （APDS） is adjusted to visit about half points of all search candidates by subsampling them, using a spiral-scanning path with one skip. Two sdected candidates that have minimal and second minimal block distortion measures are obtained. Then a fine-tune step is taken around them to find the best one. Some analyses are given to approve the rationality of the approach of this paper. Experimental results show that, as compared to APDS, the proposed algorithm can enhance the block-matching speed by about 30% while maintaining its MSE performance very close to that of it. And it performs much better than many other BMAs such as TSS, NTSS, UCDBS and NPDS.
