arrow
Return

Lookup-Table-Based Gradient Field Reconstruction

delete2011-10-01
delete15
delete
OA
AI
G
Graham D. Finlayson *
D
David Connah
M
Mark S. Drew
DOI:10.1109/TIP.2011.2134106delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In computer vision, there are many applications, where it is advantageous to process an image in the gradient domain and then reintegrate the gradient field: important examples include shadow removal, lightness calculation, and data fusion. A serious problem with this approach is that the reconstruction step often introduces artefacts-commonly, smoothed and smeared edges-to the recovered image. This is a result of the inherent ill-posedness of reintegrating a nonintegrable field. Artefacts can be diminished but not removed, by using complex to highly complex reintegration techniques. Here, we present a remarkably simple (and on the face of it naive) algorithm for reconstructing gradient fields. Suppose we start with a multichannel original, and from it derive a (possibly one of many) 1-D gradient field; for many applications, the derived gradient field will be nonintegrable. Here, we propose a lookup-table-based map relating the multichannel original to a reconstructed scalar output image, whose gradient best matches the target gradient field. The idea, at base, is that if we learn how to map the gradients of the multichannel original onto the desired output gradient, and then using the lookup table (LUT) constraint, we effectively derive the mapping from the multichannel input to the desired, reintegrated, image output. While this map could take a variety of forms, here we derive the best map from the multichannel gradient as a (nonlinear) function of the input to each of the target scalar gradients. In this framework, reconstruction is a simple equation-solving exercise of low dimensionality. One obvious application of our method is to the image-fusion problem, e. g., the problem of converting a color or higher-D image into grayscale. We will show, through extensive experiments and complementary theoretical arguments, that our straightforward method preserves the target contrast as well as do complex previous reintegration methods, but without artefacts, and with a substantially cheaper computational cost. Finally, we demonstrate the generality of the method by applying it to gradient field reconstruction in an additional area, the shading recovery problem.
Keywords:
Contrast
gradient
image fusion
lookup table
reintegration
shape from shading
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Image Processing cover
IEEE Transactions on Image Processing
IF:
13.7
Papers:
1.0W
Citations:
8.4W

Organization

S
Simon Fraser University
Scholars:
1.0W
Papers: 1.0W
Citations: 1.4W
U
University of East Anglia
Scholars:
9.6K
Papers: 1.0W
Citations: 1.8W
Cited Papers

Cited Papers

errShare
errSave
err
IF0
err
err0
PREAI
err
errShare
errSave
Color night vision: Opponent processing in the fusion of visible and IR imagery
err1997-01-01
err122
PREAI
errWaxman, AM; Gove, AN; Fay, DA; Racamato, JP; Carrick, JE; Seibert, MC; Savoye, ED
errShare
errSave
Tough and self‐recoverable hydrogels crosslinked by triblock copolymer micelles and Fe3+ coordination
err2018-03-12
err0
PREAI
errZuxiang Xu; Jinhui Li; Guorong Gao; Zongbao Wang; Yang Cong; Jing Chen; Jingbo Yin; Lei Nie; Jun Fu
errShare
errSave
Pineal—Reproductive Interactions
err1985-01-01
err0
PREAI
errRussel J. Reiter
errShare
errSave
researcher View more