Mitsubishi Electric Research Laboratories, Inc.

Mitsubishi Electric Research Labs.

Other

Mitsubishi Electric Research Lab, Inc.

Fatih M Porikli

Oncel C Tuzel

Xue Mei

Jinyun Zhang

Huifang Sun

Zafer Sahinoglu

Jay E Thornton

Tim Marks

Raymond Yim

Dirk Brinkman

Jie Ni

Jie Shao

Mohamed E Hussein

Hien Nguyen

Ajay Joshi

Joseph M Katz

Yao Rong Wang

Ajay Divakaran

Christopher Richard Wren

Yuri A Ivanov

Fernando Masami Matsubara

Cuneyt Oncel Tuzel

Teng-Yok Lee

Johnas I Cukier

Masashi Saito

Rajagopalan Sundaresan

Chinmay Hegde

Mehmet Kocamaz

Akshay Soni

Nikhil Rao

Zefer Sahinoglu

Yi Wang

Xianbiao Shu

Toufiq Parag

Ashish Shrivastava

Andrzej Ruta

Quan Yuan

Huseyin Ozkan

Rui Li

Pan Pan

Samuel David Perli

A method generates a high-resolution (HR) image from a low-resolution (LR) image using regression functions. During a training stage, training HR images are downsampled to LR images. A signature is determined for each LR-HR patch pair based on a local ternary pattern (LTP). The signature is a low dimensional descriptor used as an abstraction of the patch pair features. Then, patch pairs with the same signature are clustered, and a regression function which maps the LR patches to the HR patches is determined. In some cases patch pairs of similar signatures can be combined for learning and a single regression function determined, thus decreasing the number of required regression functions. During actual upscaling, LR patches of an input image are similarly processed to obtain the signatures and from the regression functions. The LR patches can then be upscaled using the training regression functions.

Method for generating high-resolution images using regression patterns

A method detects an object in a scene by first determining an active set of window positions from depth data. Specifically, the object can be a person. The depth data are acquired by a depth sensor. For each, window position perform the following steps. Assign a window size based on the depth data. Select a current window from the active set of window positions. Extract a joint feature from the depth data and texture data for the current window, wherein the texture data are acquired by a camera. Classify the joint feature to detect the object. The classifier is trained with joint training features extracted from training data including training depth data and training texture data acquired by the sensor and camera respectively. Finally, the active set of window positions is updated before processing the next current window.

Method for detecting persons using 1D depths and 2D texture

Three-dimensional (3D) geometric boundaries are detected in images of a scene that undergoes varying lighting conditions caused by light sources in different positions, from a set of input images of the scene illuminated by at least two different lighting conditions. The images are aligned, e.g., acquired by a stationary camera, so that pixels at the same location in all of the input images correspond to the same point in the scene. For each location, a patch of corresponding pixels centered at the location is extracted from each input image. For each location, a confidence value that there is a 3D geometric boundary at the location is determined.

Method for detecting 3D geometric boundaries in images of scenes subject to varying lighting

A set of nonnegative lighting basis images representing a scene illuminated by a set of stationary light sources is recovered from a set of input images of the scene that were acquired by a stationary camera. Each image is illuminated by a combination of the light sources, and at least two images in the set are illuminated by different combinations. The set of input images is factorized into the nonnegative lighting basis images and a set of indicator coefficients, wherein each lighting basis image corresponds to an appearance of the scene illuminated by one of the light sources, and wherein each indicator coefficient indicates a contribution of one of the light sources to one of the input images.

Method for factorizing images of a scene into basis images

An input image is denoised by first constructing a pixel-wise noise variance map from the input image. The noise has spatially varying variances. The input image is partitioned into patches using the noise variance map. An intermediate image is determined from the patches. Collaborative filtering is applied to each patch in the intermediate image using the noise variance map to produce filtered patches. Then, the filtered patches are projected to an output image.

Denoising of images with nonstationary noise

A tumor is tracked in multiple sequences of images acquired concurrently from different viewpoints. Features are extracted in each set of current images using a window. A regression function, subject to motion constraints, is applied to the features to obtain 3D motion parameters, which are applied to the tumor as observed in the images to obtain a 3D location of the object. Then, the shape of the 3D object at the 3D location is projected onto each image to update the location of the window for the next set of images to be processed.

3D object tracking in multiple 2D sequences

Four-dimensional (4D) computed tomography (CT) is simulated by first generating a surface mesh from a single thoracic CT scan. Tetrahedralization is applied to the surface mesh to obtain a first volume mesh. Finite element analysis, using boundary constraints and load definitions, is applied to the first volume mesh to obtain a lung deformation according to an Ogden model. Constrained tetrahedralization, using control points, is applied to the lung deformation to obtain a second volume mesh, which is then deformed using mass-spring-damper simulation to produces the 4DCT.

Method for simulating thoracic 4DCT

A dictionary of atoms for coding data is learned by first selecting samples from a set of samples. Similar atoms in the dictionary are clustered, and if a cluster has multiple atoms, the atoms in that cluster are merged into a single atom. The samples can be acquired online.

Learning dictionaries with clustered atoms

Blocking artifacts are reduced by projecting each patch obtained from an input image onto a set of bases vectors to determine multiple representations for each patch. The set of bases vectors are learned from a training image, and the bases vectors include a full basis vector, and one or two subspace bases vectors. An optimal basis vector is determined in the set of bases vectors for each patch according to the projection. A threshold is applied to coefficients of the optimal basis vector to determine a filtered representation for each patch, and a reconstructed patch is generated using the filtered representation. Then, the aggregating the reconstructed patches are aggregated to produce an output image.

Method for reducing blocking artifacts in images

A method recovers an uncorrupted low-rank matrix, noise in corrupted data and a subspace from the data in a form of a high-dimensional matrix. An objective function minimizes the noise to solve for the low-rank matrix and the subspace without estimating the rank of the low-rank matrix. The method uses group sparsity and the subspace is orthogonal. Random subsampling of the data can recover subspace bases and their coefficients from a much smaller matrix to improve performance. Convergence efficiency can also be improved by applying an augmented Lagrange multiplier, and an alternating stepwise coordinate descent. The Lagrange function is solved by an alternating direction method.

Method for recovering low-rank matrices and subspaces from data in high-dimensional matrices

A method estimates a pattern of change of a patient, specifically a change in the respiration pattern. An ultrasound video is segmented into groups of pictures (GOPs). Pixels from the first GOP are used to initialize a change model. Based on the change model, a change pattern for a next GOP is estimated, and the change model is changed to fit the change pattern. The estimating and the updating are repeated until a termination condition is reached.

Enhanced visualizations for ultrasound videos

A shape of an object is represented by a set of points inside and outside the shape. A decision function is learned from the set of points an object. Feature points in the set of points are selected using the decision function, or a gradient of the decision function, and then a local descriptor is determined for each feature point.

Representing object shapes using radial basis function support vector machine classification

A natural input image is upscaled, first by interpolation. Second, edges in the interpolated image are sharpened by a lion-parametric patch transform. The result is decomposed into an edge layer and a detail layer. Only pixels in the detail layer enhanced, and the enhanced detail layer is merged with the edge layer to produce a high resolution version of the input image.

Upscaling natural images

A method reduces multiplicative and additive noise in image pixels by clustering similar patches of the pixels into clusters. The clusters form nodes in an affinity net of nodes and vertices. From each cluster, a dictionary is learned by a sparse combination of corresponding atoms in the dictionaries. The patches are aggregated collaboratively using the dictionaries to construct a denoised image.

Image filtering by sparse reconstruction on affinity net

A method compresses an image partitioned into blocks of pixels, for each block the method converts the block to a 2D matrix. The matrix is decomposing into a column matrix and a row matrix, wherein a width of the column matrix is substantially smaller than a height of the column matrix and the height of the row matrix is substantially smaller than the width of the row matrix. The column matrix and the row matrix are compressed, and the compressed matrices are then combined to form a compressed image.

Method for compressing textured images

Growing community of inventors

North Plainfield, NJ, United States of America

Fatih M Porikli