Microsoft Technology Licensing, LLC

Carsten Curt Eckard Rother

Andrew Blake

Toby Leonard Sharp

Vladimir Kolmogorov

Shahram Izadi

David Kim

Otmar Hilliges

Reinhard Sebastian Bernhard Nowozin

Pushmeet Kohli

Malte Hanno Weiss

Antonio Criminisi

Geoffrey Cross

Jeremy Jancsary

Jian Qiao Sun

Jamie Daniel Joseph Shotton

David G Molyneaux

Sebastian Nowozin

Kaiming He

Padmanabhan Anandan

Jeremy Martin Jancsary

Xiao-Ou Tang

Sanjiv Kumar

Bangpeng Yao

Stefan Johannes Josef Holzer

Kevin Schelten

Detecting material properties such reflectivity, true color and other properties of surfaces in a real world environment is described in various examples using a single hand-held device. For example, the detected material properties are calculated using a photometric stereo system which exploits known relationships between lighting conditions, surface normals, true color and image intensity. In examples, a user moves around in an environment capturing color images of surfaces in the scene from different orientations under known lighting conditions. In various examples, surfaces normals of patches of surfaces are calculated using the captured data to enable fine detail such as human hair, netting, textured surfaces to be modeled. In examples, the modeled data is used to render images depicting the scene with realism or to superimpose virtual graphics on the real world in a realistic manner.

Using photometric stereo for 3D environment modeling

Blind image deblurring with a cascade architecture is described, for example, where photographs taken on a camera phone are deblurred in a process which revises blur estimates and estimates a blur function as a combined process. In various examples the estimates of the blur function are computed using first trained machine learning predictors arranged in a cascade architecture. In various examples a revised blur estimate is calculated at each level of the cascade using a latest deblurred version of a blurred image. In some examples the revised blur estimates are calculated using second trained machine learning predictors interleaved with the first trained machine learning predictors.

Blind image deblurring with cascade architecture

Image restoration cascades are described, for example, where digital photographs containing noise are restored using a cascade formed from a plurality of layers of trained machine learning predictors connected in series. For example, noise may be from sensor noise, motion blur, dust, optical low pass filtering, chromatic aberration, compression and quantization artifacts, down sampling or other sources. For example, given a noisy image, each trained machine learning predictor produces an output image which is a restored version of the noisy input image; each trained machine learning predictor in a given internal layer of the cascade also takes input from the previous layer in the cascade. In various examples, a loss function expressing dissimilarity between input and output images of each trained machine learning predictor is directly minimized during training. In various examples, data partitioning is used to partition a training data set to facilitate generalization.

Image restoration cascade

A tractable model solves certain labeling problems by providing potential functions having arbitrary dependencies upon an observed dataset (e.g., image data). The model uses decision trees corresponding to various factors to map dataset content to a set of parameters used to define the potential functions in the model. Some factors define relationships among multiple variable nodes. When making label predictions on a new dataset, the leaf nodes of the decision tree determine the effective weightings for such potential functions. In this manner, decision trees define non-parametric dependencies and can represent rich, arbitrary functional relationships if sufficient training data is available. Decision trees training is scalable, both in the training set size and by parallelization. Maximum pseudolikelihood learning can provide for joint training of aspects of the model, including feature test selection and ordering, factor weights, and the scope of the interacting variable nodes used in the graph.

Decision tree fields to map dataset content to a set of parameters

Learning image processing tasks from scene reconstructions is described where the tasks may include but are not limited to: image de-noising, image in-painting, optical flow detection, interest point detection. In various embodiments training data is generated from a 2 or higher dimensional reconstruction of a scene and from empirical images of the same scene. In an example a machine learning system learns at least one parameter of a function for performing the image processing task by using the training data. In an example, the machine learning system comprises a random decision forest. In an example, the scene reconstruction is obtained by moving an image capture apparatus in an environment where the image capture apparatus has an associated dense reconstruction and camera tracking system.

Learning image processing tasks from scene reconstructions

A new tractable model solves labeling problems using regression tree fields, which represent non-parametric Gaussian conditional random fields. Regression tree fields are parameterized by non-parametric regression trees, allowing universal specification of interactions between image observations and variables. The new model uses regression trees corresponding to various factors to map dataset content (e.g., image content) to a set of parameters used to define the potential functions in the model. Some factors define relationships among multiple variable nodes. Further, the training of regression trees is scalable, both in the training set size and in the fact that the training can be parallelized. In one implementation, maximum pseudolikelihood learning provides for joint training of various aspects of the model, including feature test selection and ordering (i.e., the structure of the regression trees), parameters of each factor in the graph, and the scope of the interacting variable nodes used in the graph.

Regression tree fields

A computing device is described herein that is configured to select a pixel pair including a foreground pixel of an image and a background pixel of the image from a global set of pixels based at least on spatial distances from an unknown pixel and color distances from the unknown pixel. The computing device is further configured to determine an opacity measure for the unknown pixel based at least on the selected pixel pair.

Opacity measurement using a global pixel set

Methods of image segmentation using reduced foreground training data are described. In an embodiment, the foreground and background training data for use in segmentation of an image is determined by optimization of a modified energy function. The modified energy function is the energy function used in image segmentation with an additional term comprising a scalar value. The optimization is performed for different values of the scalar to produce multiple initial segmentations and one of these segmentations is selected based on pre-defined criteria. The training data is then used in segmenting the image. In other embodiments further methods are described: one places an ellipse inside the user-defined bounding box to define the background training data and another uses a comparison of properties of neighboring image elements, where one is outside the user-defined bounding box, to reduce the foreground training data.

Image segmentation using reduced foreground training data

Methods of updating image segmentation following user input are described. In an embodiment, the properties used in computing the different portions of the image are updated as a result of one or more user inputs. Image elements which have been identified by a user input are given more weight when updating the properties than other image elements which have already been assigned to a particular portion of the image. In another embodiment, an updated segmentation is post-processed such that only regions which are connected to an appropriate user input are updated.

Updating image segmentation following user input

A method of up-sampling binary images for segmentation is described. In an embodiment, digital images are down-sampled before segmentation. The resulting initial binary segmentation, which has a lower resolution than the original image, is then up-sampled and smoothed to generate an interim non-binary solution which has a higher resolution than the initial binary segmentation. The final binary segmentation for the image is then computed from the interim non-binary solution based on a threshold. This method does not use the original image data in inferring the final binary segmentation solution from the initial binary segmentation. In an embodiment, the method may be applied to all images and in another embodiment, the method may be used for images which comprise a large number of pixels in total or in single dimension and smaller images may not be down-sampled before segmentation.

Up-sampling binary images for segmentation

Image completion using scene geometry is described, for example, to remove marks from digital photographs or complete regions which are blank due to editing. In an embodiment an image depicting, from a viewpoint, a scene of textured objects has regions to be completed. In an example, geometry of the scene is estimated from a depth map and the geometry used to warp the image so that at least some surfaces depicted in the image are fronto-parallel to the viewpoint. An image completion process is guided using distortion applied during the warping. For example, patches used to fill the regions are selected on the basis of distortion introduced by the warping. In examples where the scene comprises regions having only planar surfaces the warping process comprises rotating the image. Where the scene comprises non-planar surfaces, geodesic distances between image elements may be scaled to flatten the non-planar surfaces.

Growing community of inventors

Cambridge, United Kingdom

Carsten Curt Eckard Rother