z-logo
Premium
Soft Stacking
Author(s) -
McCann J.,
Pollard N. S.
Publication year - 2012
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2012.03026.x
Subject(s) - stacking , pixel , stack (abstract data type) , computer science , compositing , representation (politics) , image (mathematics) , algorithm , computer vision , physics , nuclear magnetic resonance , politics , political science , law , programming language
In this paper, we present a continuous approach to ordering 2D images when compositing. Previous methods for stacking image layers require them to appear in a single (though possibly different) order at every point in the image. Our soft stacking approach removes this restriction — allowing layers to stack as if they were volumes of fog, appearing partially in front of and partially in back of other layers within the same pixel , and moving smoothly through other layers across the image. Our approach involves augmenting each pixel with stacking coefficients — a necessary and sufficient representation for sub‐pixel stacking complexity. These stacking coefficients arise naturally when considering sub‐pixel stacking complexity, much as continuous (alpha) transparency arises when considering sub‐pixel coverage complexity. While the number of stacking coefficients required to represent all possible sub‐pixel stacking arrangements is factorial in the number of layers in the stack, in many practical situations only a small subset of the stacking coefficients are nonzero. We use this sparsity as the basis of a prototype that allows artists to interactively paint stacking adjustments into composites. Additionally, we demonstrate how to generate optimally‐stacked images under a generalized notion of stacking consistency.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here