Representing moving images with layers
IEEE Transactions on Image ProcessingPublished 1 January 1994
J.Y.A. Wang, Edward H. Adelson
Citations1,098
SJR quartileQ1
SJR score2.50
SNIP3.41
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A system for representing moving images with sets of overlapping layers that is more flexible than standard image transforms and can capture many important properties of natural image sequences.
Abstract
We describe a system for representing moving images with sets of overlapping layers. Each layer contains an intensity map that defines the additive values of each pixel, along with an alpha map that serves as a mask indicating the transparency. The layers are ordered in depth and they occlude each other in accord with the rules of compositing. Velocity maps define how the layers are to be warped over time. The layered representation is more flexible than standard image transforms and can capture many important properties of natural image sequences. We describe some methods for decomposing image sequences into layers using motion analysis, and we discuss how the representation may be used for image coding and other applications.
Keywords
Computer Science
IEEE Transactions on Pattern Analysis and Machine IntelligenceStochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
17,980 Citations1984Stuart Geman, Donald Geman
The analogy between images and statistical mechanics systems is made and the analogous operation under the posterior distribution yields the maximum a posteriori (MAP) estimate of the image given the degraded observations, creating a highly parallel ``relaxation'' algorithm for MAP estimation.
International Journal of Computer VisionSnakes: Active contour models
16,951 Citations1988Michael Kass, Andrew Witkin +1 more
This work uses snakes for interactive interpretation, in which user-imposed constraint forces guide the snake near features of interest, and uses scale-space continuation to enlarge the capture region surrounding a feature.
HAL (Le Centre pour la Communication Scientifique Directe)An Iterative Image Registration Technique with an Application to Stereo Vision
11,614 Citations1981Bruce D. Lucas, Takeo Kanade
This work presents a new image registration technique that makes use of the spatial intensity gradient of the images to find a good match using a type of Newton-Raphson iteration, and can be generalized to handle rotation, scaling and shearing.
NatureComputational vision and regularization theory
1,414 Citations1985Tomaso Poggio, Vincent Torre +1 more
Descriptions of physical properties of visible surfaces, such as their distance and the presence of edges, must be recovered from the primary image data and algorithms and parallel analog circuits that can solve ‘ill-posed problems’ and which are suggestive of neural equivalents in the brain are proposed.
IEEE Transactions on Pattern Analysis and Machine IntelligenceAnalysis and synthesis of facial image sequences using physical and anatomical models
538 Citations1993Demetri Terzopoulos, K. Waters
An estimation technique that uses deformable contour models (snakes) to track the nonrigid motions of facial features in video images is developed and estimates muscle actuator controls with sufficient accuracy to permit the face model to resynthesize transient expressions.
Signal Processing Image CommunicationObject-oriented analysis-synthesis coding of moving images
370 Citations1989Hans Georg Musmann, Michael Hötter +1 more
An object-oriented analysis-synthesis coder is presented which encodes objects instead of blocks of N × N picture elements, which allows to introduce geometrical distortions instead of quantization errors.
Layered representation for motion analysis
277 Citations2002J.Y.A. Wang, Edward H. Adelson
A set of techniques is devised for segmenting images into coherently moving regions using affine motion analysis and clustering techniques and it is possible to decompose an image into a set of layers along with information about occlusion and depth ordering.
Robust dynamic motion estimation over time
241 Citations2002Michael J. Black, P. Anandan
A highly parallel incremental stochastic minimization algorithm is presented which has a number of advantages over previous approaches and the incremental nature of the scheme makes it dynamic and permits the detection of occlusion and disocclusion boundaries.
Motion compensation for video compression using control grid interpolation
163 Citations1991Gary J. Sullivan, R. L. Baker
A new CGI method is presented that produces a smooth motion vector field, preserving continuity and connectivity in the prediction image, and when contrasted with block matching, the new algorithm eliminates blocking artifacts while using the same or less side information for approximately the same mean square error.
Robust estimation of a multi-layered motion representation
135 Citations2002Trevor Darrell, Alex Pentland
A layered model of scene segmentation based on explicitly representing the support of a homogeneous region is introduced, which employs parallel robust estimation techniques, and uses a minimal-covering optimization to estimate the number of objects in the scene.
Adaptive meshes and shells: irregular triangulation, discontinuities, and hierarchical subdivision
112 Citations2003M. Alex O. Vasilescu, Demetri Terzopoulos
The adaptive mesh model is extended in several ways and techniques for adaptive hierarchical subdivision of adaptive meshes and shells based on triangular and rectangular elements are developed.
Computing two motions from three frames
94 Citations2002James R. Bergen, Peter J. Burt +2 more
The authors propose an alternative formulation of optical-flow algorithms in which there may be two distinct patterns undergoing coherent motion within a given local analysis region, and present an algorithm for the analysis of two-component motion.
Unified computational theory for motion transparency and motion boundaries based on eigenenergy analysis
77 Citations2002Masahiko Shizawa, K. Maze
It is demonstrated that the margin energy can determine the transparency and discontinuities of the flow field as regions of more than one flow, and hypothesize a criterion for multiplicity.
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE<title>Iterative motion estimation method using triangular patches for motion compensation</title>
57 Citations1991Yuichiro Nakaya, Hiroshi Harashima
A new motion estimation algorithm called hexagonal matching which iteratively refines the estimated displacement vectors is presented which produces less prediction error and also proposes another algorithm with similar function but less computational complexity.
Image sequence enhancement using multiple motions analysis
55 Citations2003M. Irani, Bezalel Peleg
The tracking of detected objects using temporal integration and the algorithms for enhancement of tracked objects by filling-in occluded regions and by improving the spatial resolution of the imaged objects are described.
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE<title>Human facial motion modeling, analysis, and synthesis for video compression</title>
29 Citations1991Thomas S. Huang, Subhash C. Reddy +1 more
Algorithms are presented for extracting and tracking key feature points on the face, and for estimating the global and local motion of the head/face, in the context of teleconferencing and videophone applications.
Motion estimation with detection of occlusion areas
23 Citations1992R. Depommier, Éric Dubois
A method for estimation of motion vector fields that includes detection of motion discontinuities and occlusion areas is presented and results of motion-compensated temporal interpolation for 4:1 field subsampling are presented and compared to motion estimation without Occlusion processing.
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE<title>Applying mid-level vision techniques for video data compression and manipulation</title>
23 Citations1994John Wang, Edward H. Adelson
This work proposes to use mid-level vision concepts to achieve a decomposition that can be applied to a wider domain of image material, and describes a coding scheme based on a set of overlapping layers.
IEEE International Conference on Acoustics Speech and Signal ProcessingLayered representation for image sequence coding
21 Citations1993J.Y.A. Wang, Edward H. Adelson
A sequence is decomposed into a set of overlapping 2-D regions, each region occupying a depth-ordered layer with specified transparency, intensity, and motion, and the resulting representation is efficient and flexible.
Automatic Mesh Generation
19 Citations2019Yair Shapira
This paper considers a complicated domain in three spatial dimensions that must be discretized: approximated by a discrete mesh, ready to be used in practical algorithms.
Image Sequence Coding Using Scene Analysis and Spatio-Temporal Interpolation
8 Citations1983R. Lenz, Alexander Gerhard
The segmentation procedure as well as the interpolation procedure are presented, which will have to perform a spatio-temporal interpolation of the transmitted key-frames in order to reconstruct the missing in-between images.
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE<title>Adaptive transform image coding based on variable-shape block segmentation with smoothing filter</title>
2 Citations1992Susumu Itoh, Ichiro Matsuda +1 more
A new transform image coding scheme which transfigures square-blocks into variable-shape-blocks so that their boundaries run parallel with the principal contours in an image in order to diminish the coding noise peculiar to transform coding such as the mosquito noise and blocking-effects is described.