Levin, Anat, Freeman, William, Durand, Fredo
Computer vision has traditionally focused on extracting structure,such as depth, from images acquired using thin-lens or pinholeoptics. The development of computational imaging is broadening...
Levin, Anat, Freeman, William, Durand, Fredo
Computer vision has traditionally focused on extracting structure,such as depth, from images acquired using thin-lens or pinholeoptics. The development of computational imaging is broadening...
Understanding camera trade-offs through a Bayesian analysis of light field projections (2008)
Levin, Anat, Freeman, William T., Durand, Fredo
Computer vision has traditionally focused on extracting structure,such as depth, from images acquired using thin-lens or pinhole optics. The development of computational imaging is broadening this...
Understanding camera trade-offs through a Bayesian analysis of light field projections (2008)
Levin, Anat, Freeman, William T., Durand, Fredo
Computer vision has traditionally focused on extracting structure,such as depth, from images acquired using thin-lens or pinhole optics. The development of computational imaging is broadening this...
A closed form solution to natural image matting (2006)
Interactive digital matting, the process of extracting a foreground object from an image based on limited user input, is an important task in image and video editing. From a computer vision...
Learning to Combine Top-Down and Bottom-Up Segmentation (2006)
Bottom-up segmentation based only on low-level cues is a notoriously difficult problem. This difficulty has lead to recent top-down segmentation algorithms that are based on class-specific image...
Seamless Image Stitching by Minimizing False Edges (2005)
Zomet, Assaf, Levin, Anat, Peleg, Shmuel, Weiss, Yair
Abstract—Various applications such as mosaicing and object insertion require stitching of image parts. The stitching quality is measured visually by the similarity of the stitched image to each of...
Colorization using Optimization (2004)
Anat Levin, Dani Lischinski, Yair Weiss
Colorization is a computer-assisted process of adding color to a monochrome image or movie. The process typically involves segmenting images into regions and tracking these regions across image...
Separating Reflections From a Single Image Using Local Features (2004)
Anat Levin, Assaf Zomet, Yair Weiss
When we take a picture through a window the image we obtain is often a linear superposition of two images: the image of the scene beyond the window plus the image of the scene reflected by the...
Seamless Image Stitching in the Gradient Domain (2004)
Anat Levin, Assaf Zomet, Shmuel Peleg, Yair Weiss
Image stitching is used to combine several individual images having some overlap into a composite image. The quality of image stitching is measured by the similarity of the stitched image to each of...
User Assisted Separation of Reflections from a Single Image Using a Sparsity Prior (2004)
When we take a picture through transparent glass the image we obtain is often a linear superposition of two images: the image of the scene beyond the glass plus the image of the scene reflected by...
Seamless Image Stitching in the Gradient Domain (2003)
Anat Levin, Assaf Zomet, Shmuel Peleg, Yair Weiss
The quality of image stitching is measured by the similarity of the stitched image to each of the input images, and by the visibility of the seam between the stitched images.
Learning How to Inpaint from Global Image Statistics (2003)
Anat Levin, Assaf Zomet, Yair Weiss
Inpainting is the problem of filling-in holes in images. Considerable progress has been made by techniques that use the immediate boundary of the hole and some prior information on images to solve...
Learning How to Inpaint from Global Image Statistics (2003)
Anat Levin, Assaf Zomet, Yair Weiss
Inpainting is the problem of filling-in holes in images. Considerable progress has been made by techniques that use the immediate boundary of the hole and some prior information on images to solve...
Unsupervised Improvement of Visual Detectors using Co-Training (2003)
Anat Levin, Paul Viola, Yoav Freund
One significant challenge in the construction of visual detection systems is the acquisition of sufficient labeled data. This paper describes a new technique for training visual detectors which...
Learning to Perceive Transparency from (2003)
Anat Levin, Assaf Zomet, Yair Weiss
Certain simple images are known to trigger a percept of transparency: the input image I is perceived as the sum of two images I(x, y) = I 1 (x, y) + I 2 (x, y). This percept is puzzling. First, why...
Ranking with Large Margin Principle: Two Approaches (2003)
We discuss the problem of ranking k instances with the use of a "large margin" principle. We introduce two main approaches: the first is the "fixed margin" policy in which the margin of the closest...
Ranking with Large Margin Principle: Two Approaches (2003)
We discuss the problem of ranking k instances with the use of a "large margin" principle. We introduce two main approaches: the first is the "fixed margin" policy in which the margin of the closest...
Learning to Perceive Transparency From the Statistics of Natural Scenes (2003)
Anat Levin, Assaf Zomet, Yair Weiss
Certain simple images are known to trigger a percept of transparency: the input image I is perceived as the sum of two images I(x,y) = Ii(x,y) + I2(x,y). This percept is puzzling. First, why do we...
Learning to Perceive Transparency From (2003)
Anat Levin, Assaf Zomet, Yair Weiss
Certain simple images are known to trigger a percept of transparency: the input image I is perceived as the sum of two images I(x; y) = I 1 (x; y) + I 2 (x; y). This percept is puzzling. First, why...
Ranking with Large Margin Principle: Two (2003)
We discuss the problem of ranking k instances with the use of a "large margin" principle. We introduce two main approaches: the first is the "fixed margin" policy in which the margin of the closest...
On Representation Theory in Computer Vision Problems (2002)
Amnon Shashua, Roy Meshulam, Lior Wolf, Anat Levin, Gil Kalai
We introduce the following general question: Let V be a complex n-dimensional space and for m k consider the GL(V )-module V (n# m# k)=f v 1 Omega DeltaDeltaDelta Omega vm 2 V We would like to...
On Representation Theory in Computer Vision (2002)
Amnon Shashua, Roy Meshulam, Lior Wolf, Anat Levin, Gil Kalai
We introduce the following general question: Let V be a complex n-dimensional space and for m k consider the GL(V )-module V (n# m# k)=f v 1 Omega DeltaDeltaDelta Omega vm 2 V We would like to...
Taxonomy of Large Margin Principle Algorithms for Ordinal Regression Problems (2002)
We discuss the problem of ranking instances where an instance is associated with an integer from 1 to k. In other words, the specialization of the general multi-class learning problem when there...
Manifold Pursuit: A New Approach to Appearance Based Recognition (2002)
Amnon Shashua, Anat Levin, Shai Avidan
Manifold Pursuit (MP) extends Principal Component Analysis to be invariant to a desired group of image-plane transformations of an ensemble of un-aligned images.
Revisiting Single-view Shape Tensors: Theory (2002)
Given the projection of asuffi tnumber of points it is possible to algebraically eliminate the camera parameters and obtain viewinvariant functions of image coordinates and space coordinates. These...
Principal Component Analysis Over Continuous (2002)
Principal Component Analysis (PCA) is one of the most popular techniques for dimensionality reduction of multivariate data points with application areas covering many branches of science. However,...
Manifold Pursuit: A New Approach to Appearance Based Recognition (2002)
Amnon Shashua, Anat Levin, Shai Avidan
Manifold Pursuit (MP) extends Principal Component Analysis to be invariant to a desired group of image-plane transformations of an ensemble of un-aligned images.
Revisiting Single-view Shape Tensors: Theory and Applications (2002)
Given the projection of a sufficient number of points it is possible to algebraically eliminate the camera parameters and obtain viewinvariant functions of image coordinates and space coordinates....
Revisiting Single-view Shape Tensors: Theory and Applications (2002)
Given the projection of a sucient number of points it is possible to algebraically eliminate the camera parameters and obtain viewinvariant functions of image coordinates and space coordinates. These...
Multi-frame Infinitesimal Motion Model for the Reconstruction of (Dynamic) (2001)
We introduce new small-motion multi-frame equations applicable to the reconstruction of dynamic scenes in which points are allowed to move along straight-line paths with constant velocity. The motion...
Linear Image Coding for Regression and Classication using the (2001)
Given a collection of images (matrices) representing a class of objects we present a method for extracting the commonalities of the image space directly from the matrix representations (rather than...
We introduce new small-motion multi-frame equations applicable to the reconstruction of dynamic scenes in which points are allowed to move along straight-line paths with constant velocity. The motion...