Fast Re-integration of Shadow Free Images. Fredembach, C. & Finlayson, G. D. In Twelfth Color Imaging Conference: Color Science and Engineering Systems, Technologies, and Applications, pages 117–122, Scottsdale, Arizona, November, 2004.
Fast Re-integration of Shadow Free Images [link]Paper  abstract   bibtex   
In imaging applications, computation is often carried out in a derivative (gradient) domain. For example, we can at-tenuate small image differences by thresholding the gradi-ent and then reintegrate. Unfortunately, the reintegration is an expensive task. Reintegration is often carried out in 2D (usually using 2D Fourier transform) or through multiple 1D paths as in Retinex. In this paper, we show that using a small number of non-random paths, each of which is a tour the size of the image, is an effective and fast method for reintegration. We apply our method to the problem of reintegrating a shadow free gradient derivative image. Results are com-petitive with those obtained using 2D methods. Yet, the reintegration presented here is an order of magnitude quicker.
@inproceedings{uea22140,
           month = {November},
          author = {C. Fredembach and G. D. Finlayson},
       booktitle = {Twelfth Color Imaging Conference: Color Science and Engineering Systems, Technologies, and Applications},
         address = {Scottsdale, Arizona},
           title = {Fast Re-integration of Shadow Free Images},
         journal = {Twelfth Color Imaging Conference: Color Science and Engineering Systems, Technologies, and Applications},
           pages = {117--122},
            year = {2004},
             url = {https://ueaeprints.uea.ac.uk/id/eprint/22140/},
        abstract = {In imaging applications, computation is often carried out in a derivative (gradient) domain. For example, we can at-tenuate small image differences by thresholding the gradi-ent and then reintegrate. Unfortunately, the reintegration is an expensive task. Reintegration is often carried out in 2D (usually using 2D Fourier transform) or through multiple 1D paths as in Retinex. In this paper, we show that using a small number of non-random paths, each of which is a tour the size of the image, is an effective and fast method for reintegration. We apply our method to the problem of reintegrating a shadow free gradient derivative image. Results are com-petitive with those obtained using 2D methods. Yet, the reintegration presented here is an order of magnitude quicker.}
}

Downloads: 0