FULLY PARALLEL, LOW COMPLEXITY APPROACH TO SOLVING COMPUTER VISION PROBLEMS

Values of pixels in an image are mapped to a binary space using a first function that preserves characteristics of values of the pixels. Labels are iteratively assigned to the pixels in the image in parallel based on a second function. The label assigned to each pixel is determined based on values o...

Full description

Saved in:
Bibliographic Details
Main Authors IZADI, Shahram, RHEMANN, Christoph, TANKOVICH, Vladimir, DAVIDSON, Philip L, VALENTIN, Julien Pascal Christophe, KOWDLE, Adarsh Prakash Murthy, FANELLO, Sean Ryan
Format Patent
LanguageEnglish
Published 18.10.2018
Subjects
CALCULATING
COMPUTING
COUNTING
HANDLING RECORD CARRIERS
PHYSICS
PRESENTATION OF DATA
RECOGNITION OF DATA
RECORD CARRIERS
Online AccessGet full text

Cover

More Information
Summary:Values of pixels in an image are mapped to a binary space using a first function that preserves characteristics of values of the pixels. Labels are iteratively assigned to the pixels in the image in parallel based on a second function. The label assigned to each pixel is determined based on values of a set of nearest-neighbor pixels. The first function is trained to map values of pixels in a set of training images to the binary space and the second function is trained to assign labels to the pixels in the set of training images. Considering only the nearest neighbors in the inference scheme results in a computational complexity that is independent of the size of the solution space and produces sufficient approximations of the true distribution when the solution for each pixel is most likely found in a small subset of the set of potential solutions.
Bibliography:Application Number: US201815925141