Systems and methods for transparent object segmentation using polarization cues

Information

  • Patent Grant
  • 11302012
  • Patent Number
    11,302,012
  • Date Filed
    Friday, August 28, 2020
    3 years ago
  • Date Issued
    Tuesday, April 12, 2022
    2 years ago
Abstract
A computer-implemented method for computing a prediction on images of a scene includes: receiving one or more polarization raw frames of a scene, the polarization raw frames being captured with a polarizing filter at a different linear polarization angle; extracting one or more first tensors in one or more polarization representation spaces from the polarization raw frames; and computing a prediction regarding one or more optically challenging objects in the scene based on the one or more first tensors in the one or more polarization representation spaces.
Description
FIELD

Aspects of embodiments of the present disclosure relate to the field of computer vision and the segmentation of images into distinct objects depicted in the images.


BACKGROUND

Semantic segmentation refers to a computer vision process of capturing one or more two-dimensional (2-D) images of a scene and algorithmically classifying various regions of the image (e.g., each pixel of the image) as belonging to particular of classes of objects. For example, applying semantic segmentation to an image of people in a garden may assign classes to individual pixels of the input image, where the classes may include types of real-world objects such as: person; animal; tree; ground; sky; rocks; buildings; and the like. Instance segmentation refers to further applying unique labels to each of the different instances of objects, such as by separately labeling each person and each animal in the input image with a different identifier.


One possible output of a semantic segmentation or instance segmentation process is a segmentation map or segmentation mask, which may be a 2-D image having the same dimensions as the input image, and where the value of each pixel corresponds to a label (e.g., a particular class in the case of semantic segmentation or a particular instance in the case of instance segmentation).


Segmentation of images of transparent objects is a difficult, open problem in computer vision. Transparent objects lack texture (e.g., surface color information, such as in “texture mapping” as the term is used in the field of computer graphics), adopting instead the texture or appearance of the scene behind those transparent objects (e.g., the background of the scene visible through the transparent objects). As a result, in some circumstances, transparent objects (and other optically challenging objects) in a captured scene are substantially invisible to the semantic segmentation algorithm, or may be classified based on the objects that are visible through those transparent objects.


SUMMARY

Aspects of embodiments of the present disclosure relate to transparent object segmentation of images by using light polarization (the rotation of light waves) to provide additional channels of information to the semantic segmentation or other machine vision process. Aspects of embodiments of the present disclosure also relate to detection and/or segmentation of other optically challenging objects in images by using light polarization, where optically challenging objects may exhibit one or more conditions including being: non-Lambertian; translucent; multipath inducing; or non-reflective. In some embodiments, a polarization camera is used to capture polarization raw frames to generate multi-modal imagery (e.g., multi-dimensional polarization information). Some aspects of embodiments of the present disclosure relate to neural network architecture using a deep learning backbone for processing the multi-modal polarization input data. Accordingly, embodiments of the present disclosure reliably perform instance segmentation on cluttered, transparent and otherwise optically challenging objects in various scene and background conditions, thereby demonstrating an improvement over comparative approaches based on intensity images alone.


According to one embodiment of the present disclosure a computer-implemented method for computing a prediction on images of a scene includes: receiving one or more polarization raw frames of a scene, the polarization raw frames being captured with a polarizing filter at a different linear polarization angle; extracting one or more first tensors in one or more polarization representation spaces from the polarization raw frames; and computing a prediction regarding one or more optically challenging objects in the scene based on the one or more first tensors in the one or more polarization representation spaces.


The one or more first tensors in the one or more polarization representation spaces may include: a degree of linear polarization (DOLP) image in a DOLP representation space; and an angle of linear polarization (AOLP) image in an AOLP representation space.


The one or more first tensors may further include one or more non-polarization tensors in one or more non-polarization representation spaces, and the one or more non-polarization tensors may include one or more intensity images in intensity representation space.


The one or more intensity images may include: a first color intensity image; a second color intensity image; and a third color intensity image.


The prediction may include a segmentation mask.


The computing the prediction may include supplying the one or more first tensors to one or more corresponding convolutional neural network (CNN) backbones, and each of the one or more CNN backbones may be configured to compute a plurality of mode tensors at a plurality of different scales.


The computing the prediction may further include: fusing the mode tensors computed at a same scale by the one or more CNN backbones.


The fusing the mode tensors at the same scale may include concatenating the mode tensors at the same scale; supplying the mode tensors to an attention subnetwork to compute one or more attention maps; and weighting the mode tensors based on the one or more attention maps to compute a fused tensor for the scale.


The computing the prediction may further include supplying the fused tensors computed at each scale to a prediction module configured to compute the segmentation mask.


The segmentation mask may be supplied to a controller of a robot picking arm.


The prediction may include a classification of the one or more polarization raw frames based on the one or more optically challenging objects.


The prediction may include one or more detected features of the one or more optically challenging objects depicted in the one or more polarization raw frames.


The computing the prediction may include supplying the one or more first tensors in the one or more polarization representation spaces to a statistical model, and the statistical model may be trained using training data including training first tensors in the one or more polarization representation spaces and labels.


The training data may include: source training first tensors, in the one or more polarization representation spaces, computed from data captured by a polarization camera; and additional training first tensors generated from the source training first tensors through affine transformations including a rotation.


When the additional training first tensors include an angle of linear polarization (AOLP) image, generating the additional training first tensors may include: rotating the additional training first tensors by an angle; and counter-rotating pixel values of the AOLP image by the angle.


According to one embodiment of the present disclosure, a computer vision system includes: a polarization camera including a polarizing filter; and a processing system including a processor and memory storing instructions that, when executed by the processor, cause the processor to: receive one or more polarization raw frames of a scene, the polarization raw frames being captured with a polarizing filter at a different linear polarization angle; extract one or more first tensors in one or more polarization representation spaces from the polarization raw frames; and compute a prediction regarding one or more optically challenging objects in the scene based on the one or more first tensors in the one or more polarization representation spaces.


The one or more first tensors in the one or more polarization representation spaces may include: a degree of linear polarization (DOLP) image in a DOLP representation space; and an angle of linear polarization (AOLP) image in an AOLP representation space.


The one or more first tensors may further include one or more non-polarization tensors in one or more non-polarization representation spaces, and wherein the one or more non-polarization tensors include one or more intensity images in intensity representation space.


The one or more intensity images may include: a first color intensity image; a second color intensity image; and a third color intensity image.


The prediction may include a segmentation mask.


The memory may further store instructions that, when executed by the processor, cause the processor to compute the prediction by supplying the one or more first tensors to one or more corresponding convolutional neural network (CNN) backbones, wherein each of the one or more CNN backbones is configured to compute a plurality of mode tensors at a plurality of different scales.


The memory may further store instructions that, when executed by the processor, cause the processor to: fuse the mode tensors computed at a same scale by the one or more CNN backbones.


The instructions that cause the processor to fuse the mode tensors at the same scale may include instructions that, when executed by the processor, cause the processor to: concatenate the mode tensors at the same scale; supply the mode tensors to an attention subnetwork to compute one or more attention maps; and weight the mode tensors based on the one or more attention maps to compute a fused tensor for the scale.


The instructions that cause the processor to compute the prediction may further include instructions that, when executed by the processor, cause the processor to supply the fused tensors computed at each scale to a prediction module configured to compute the segmentation mask.


The segmentation mask may be supplied to a controller of a robot picking arm.


The prediction may include a classification of the one or more polarization raw frames based on the one or more optically challenging objects.


The prediction may include one or more detected features of the one or more optically challenging objects depicted in the one or more polarization raw frames.


The instructions to compute the prediction may include instructions that, when executed by the processor, cause the processor to supply the one or more first tensors to a statistical model, and the statistical model may be trained using training data including training first tensors in the one or more polarization representation spaces and labels.


The training data may include: source training first tensors computed from data captured by a polarization camera; and additional training first tensors generated from the source training first tensors through affine transformations including a rotation.


When the additional training first tensors include an angle of linear polarization (AOLP) image, generating the additional training first tensors includes: rotating the additional training first tensors by an angle; and counter-rotating pixel values of the AOLP image by the angle.





BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, together with the specification, illustrate exemplary embodiments of the present invention, and, together with the description, serve to explain the principles of the present invention.



FIG. 1 is a schematic block diagram of a system according to one embodiment of the present invention.



FIG. 2A is an image or intensity image of a scene with one real transparent ball placed on top of a printout of photograph depicting another scene containing two transparent balls (“spoofs”) and some background clutter.



FIG. 2B depicts the intensity image of FIG. 2A with an overlaid segmentation mask as computed by a comparative Mask Region-based Convolutional Neural Network (Mask R-CNN) identifying instances of transparent balls, where the real transparent ball is correctly identified as an instance, and the two spoofs are incorrectly identified as instances.



FIG. 2C is an angle of polarization image computed from polarization raw frames captured of the scene according to one embodiment of the present invention.



FIG. 2D depicts the intensity image of FIG. 2A with an overlaid segmentation mask as computed using polarization data in accordance with an embodiment of the present invention, where the real transparent ball is correctly identified as an instance and the two spoofs are correctly excluded as instances.



FIG. 3 is a block diagram of processing circuit for computing segmentation maps based on polarization data according to one embodiment of the present invention.



FIG. 4 is a flowchart of a method for performing segmentation on input images to compute a segmentation map according to one embodiment of the present invention.



FIG. 5 is a high-level depiction of the interaction of light with transparent objects and non-transparent (e.g., diffuse and/or reflective) objects.



FIGS. 6A, 6B, and 6C depict example first feature maps computed by a feature extractor configured to extract derived feature maps in first representation spaces including an intensity feature map I in FIG. 6A in intensity representation space, a degree of linear polarization (DOLP) feature map p in FIG. 6B in DOLP representation space, and angle of linear polarization (AOLP) feature map p in FIG. 6C representation space, according to one embodiment of the present invention.



FIGS. 7A and 7B are, respectively, expanded views of the regions labeled (a) and (b) in FIGS. 6A, 6B, and 6C. FIG. 7C is a graph depicting a cross section of an edge labeled in FIG. 7B in the intensity feature map of FIG. 6A, the DOLP feature map of FIG. 6B, and the AOLP feature map of FIG. 6C.



FIG. 8A is a block diagram of a feature extractor according to one embodiment of the present invention.



FIG. 8B is a flowchart depicting a method according to one embodiment of the present invention for extracting features from polarization raw frames.



FIG. 9 is a block diagram depicting a Polarized CNN architecture according to one embodiment of the present invention as applied to a Mask-Region-based convolutional neural network (Mask R-CNN) backbone.



FIG. 10 is a block diagram of an attention module that may be used with a polarized CNN according to one embodiment of the present invention.



FIG. 11 depicts examples of attention weights computed by an attention module according to one embodiment of the present invention for different mode tensors (in first representation spaces) extracted from polarization raw frames captured by a polarization camera.



FIGS. 12A, 12B, 12C, and 12D depict segmentation maps computed by a comparative image segmentation system, segmentation maps computed by a polarized convolutional neural network according to one embodiment of the present disclosure, and ground truth segmentation maps (e.g., manually-generated segmentation maps).





DETAILED DESCRIPTION

In the following detailed description, only certain exemplary embodiments of the present invention are shown and described, by way of illustration. As those skilled in the art would recognize, the invention may be embodied in many different forms and should not be construed as being limited to the embodiments set forth herein. Like reference numerals designate like elements throughout the specification.


Transparent objects occur in many real-world applications of computer vision or machine vision systems, including automation and analysis for manufacturing, life sciences, and automotive industries. For example, in manufacturing, computer vision systems may be used to automate: sorting, selection, and placement of parts; verification of placement of components during manufacturing; and final inspection and defect detection. As additional examples, in life sciences, computer vision systems may be used to automate: measurement of reagents; preparation of samples; reading outputs of instruments; characterization of samples; and picking and placing container samples. Further examples in automotive industries include detecting transparent objects in street scenes for assisting drivers or for operating self-driving vehicles. Additional examples may include assistive technologies, such as self-navigating wheelchairs capable of detecting glass doors and other transparent barriers and devices for assisting people with vision impairment that are capable of detecting transparent drinking glasses and to distinguish between real objects and print-out spoofs.


In contrast to opaque objects, transparent objects lack texture of their own (e.g., surface color information, as the term is used in the field of computer graphics, such as in “texture mapping”). As a result, comparative systems generally fail to correctly identify instances of transparent objects that are present in scenes captured using standard imaging systems (e.g., cameras configured to capture monochrome intensity images or color intensity images such as red, green, and blue or RGB images). This may be because the transparent objects do not have a consistent texture (e.g., surface color) for the algorithms to latch on to or to learn to detect (e.g., during the training process of a machine learning algorithm). Similar issues may arise from partially transparent or translucent objects, as well as some types of reflective objects (e.g., shiny metal) and very dark objects (e.g., matte black objects).


Accordingly, aspects of embodiments of the present disclosure relate to using polarization imaging to provide information for segmentation algorithms to detect transparent objects in scenes. In addition, aspects of embodiments of the present disclosure also apply to detecting other optically challenging objects such as transparent, translucent, and reflective objects as well as dark objects.


As used herein, the term “optically challenging” refers to objects made of materials that satisfy one or more of the following four characteristics at a sufficient threshold level or degree: non-Lambertian (e.g., not matte); translucent; multipath inducing; and/or non-reflective. In some circumstances an object exhibiting only one of the four characteristics may be optically challenging to detect. In addition, objects or materials may exhibit multiple characteristics simultaneously. For example, a translucent object may have a surface reflection and background reflection, so it is challenging both because of translucency and the multipath. In some circumstances, an object may exhibit one or more of the four characteristics listed above, yet may not be optically challenging to detect because these conditions are not exhibited at a level or degree that would pose a problem to a comparative computer vision systems. For example, an object may be translucent, but still exhibit enough surface texture to be detectable and segmented from other instances of objects in a scene. As another example, a surface must be sufficiently non-Lambertian to introduce problems to other vision systems. In some embodiments, the degree or level to which an object is optically challenging is quantified using the full-width half max (FWHM) of the specular lobe of the bidirectional reflectance distribution function (BRDF) of the object. If this FWHM is below a threshold, the material is considered optically challenging.



FIG. 1 is a schematic block diagram of a system according to one embodiment of the present invention. In the arrangement shown in FIG. 1, a scene 1 includes transparent objects 2 (e.g., depicted as a ball such as a glass marble, a cylinder such as a drinking glass or tumbler, and a plane such as a pane of transparent acrylic) that are placed in front of opaque matte objects 3 (e.g., a baseball and a tennis ball). A polarization camera 10 has a lens 12 with a field of view, where the lens 12 and the camera 10 are oriented such that the field of view encompasses the scene 1. The lens 12 is configured to direct light (e.g., focus light) from the scene 1 onto a light sensitive medium such as an image sensor 14 (e.g., a complementary metal oxide semiconductor (CMOS) image sensor or charge-coupled device (CCD) image sensor).


The polarization camera 10 further includes a polarizer or polarizing filter or polarization mask 16 placed in the optical path between the scene 1 and the image sensor 14. According to various embodiments of the present disclosure, the polarizer or polarization mask 16 is configured to enable the polarization camera 10 to capture images of the scene 1 with the polarizer set at various specified angles (e.g., at 45° rotations or at 60° rotations or at non-uniformly spaced rotations).


As one example, FIG. 1 depicts an embodiment where the polarization mask 16 is a polarization mosaic aligned with the pixel grid of the image sensor 14 in a manner similar to a red-green-blue (RGB) color filter (e.g., a Bayer filter) of a color camera. In a manner similar to how a color filter mosaic filters incoming light based on wavelength such that each pixel in the image sensor 14 receives light in a particular portion of the spectrum (e.g., red, green, or blue) in accordance with the pattern of color filters of the mosaic, a polarization mask 16 using a polarization mosaic filters light based on linear polarization such that different pixels receive light at different angles of linear polarization (e.g., at 0°, 45°, 90°, and 135°, or at 0°, 60° degrees, and 120°). Accordingly, the polarization camera 10 using a polarization mask 16 such as that shown in FIG. 1 is capable of concurrently or simultaneously capturing light at four different linear polarizations. One example of a polarization camera is the Blackfly® S Polarization Camera produced by FLIR® Systems, Inc. of Wilsonville, Oreg.


While the above description relates to some possible implementations of a polarization camera using a polarization mosaic, embodiments of the present disclosure are not limited thereto and encompass other types of polarization cameras that are capable of capturing images at multiple different polarizations. For example, the polarization mask 16 may have fewer than or more than four different polarizations, or may have polarizations at different angles (e.g., at angles of polarization of: 0°, 60° degrees, and 120° or at angles of polarization of 0°, 30°, 60°, 90°, 120°, and 150°). As another example, the polarization mask 16 may be implemented using an electronically controlled polarization mask, such as an electro-optic modulator (e.g., may include a liquid crystal layer), where the polarization angles of the individual pixels of the mask may be independently controlled, such that different portions of the image sensor 14 receive light having different polarizations. As another example, the electro-optic modulator may be configured to transmit light of different linear polarizations when capturing different frames, e.g., so that the camera captures images with the entirety of the polarization mask set to, sequentially, to different linear polarizer angles (e.g., sequentially set to: 0 degrees; 45 degrees; 90 degrees; or 135 degrees). As another example, the polarization mask 16 may include a polarizing filter that rotates mechanically, such that different polarization raw frames are captured by the polarization camera 10 with the polarizing filter mechanically rotated with respect to the lens 12 to transmit light at different angles of polarization to image sensor 14.


As a result, the polarization camera captures multiple input images 18 (or polarization raw frames) of the scene 1, where each of the polarization raw frames 18 corresponds to an image taken behind a polarization filter or polarizer at a different angle of polarization ϕpol (e.g., 0 degrees, 45 degrees, 90 degrees, or 135 degrees). Each of the polarization raw frames is captured from substantially the same pose with respect to the scene 1 (e.g., the images captured with the polarization filter at 0 degrees, 45 degrees, 90 degrees, or 135 degrees are all captured by a same polarization camera located at a same location and orientation), as opposed to capturing the polarization raw frames from disparate locations and orientations with respect to the scene. The polarization camera 10 may be configured to detect light in a variety of different portions of the electromagnetic spectrum, such as the human-visible portion of the electromagnetic spectrum, red, green, and blue portions of the human-visible spectrum, as well as invisible portions of the electromagnetic spectrum such as infrared and ultraviolet.


In some embodiments of the present disclosure, such as some of the embodiments described above, the different polarization raw frames are captured by a same polarization camera 10 and therefore may be captured from substantially the same pose (e.g., position and orientation) with respect to the scene 1. However, embodiments of the present disclosure are not limited thereto. For example, a polarization camera 10 may move with respect to the scene 1 between different polarization raw frames (e.g., when different raw polarization raw frames corresponding to different angles of polarization are captured at different times, such as in the case of a mechanically rotating polarizing filter), either because the polarization camera 10 has moved or because objects in the scene 1 have moved (e.g., if the objects are located on a moving conveyor belt). Accordingly, in some embodiments of the present disclosure different polarization raw frames are captured with the polarization camera 10 at different poses with respect to the scene 1.


The polarization raw frames 18 are supplied to a processing circuit 100, described in more detail below, computes a segmentation map 20 based of the polarization raw frames 18. As shown in FIG. 1, in the segmentation map 20, the transparent objects 2 and the opaque objects 3 of the scene are all individually labeled, where the labels are depicted in FIG. 1 using different colors or patterns (e.g., vertical lines, horizontal lines, checker patterns, etc.), but where, in practice, each label may be represented by a different value (e.g., an integer value, where the different patterns shown in the figures correspond to different values) in the segmentation map.


According to various embodiments of the present disclosure, the processing circuit 100 is implemented using one or more electronic circuits configured to perform various operations as described in more detail below. Types of electronic circuits may include a central processing unit (CPU), a graphics processing unit (GPU), an artificial intelligence (AI) accelerator (e.g., a vector processor, which may include vector arithmetic logic units configured efficiently perform operations common to neural networks, such dot products and softmax), a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), a digital signal processor (DSP), or the like. For example, in some circumstances, aspects of embodiments of the present disclosure are implemented in program instructions that are stored in a non-volatile computer readable memory where, when executed by the electronic circuit (e.g., a CPU, a GPU, an AI accelerator, or combinations thereof), perform the operations described herein to compute a segmentation map 20 from input polarization raw frames 18. The operations performed by the processing circuit 100 may be performed by a single electronic circuit (e.g., a single CPU, a single GPU, or the like) or may be allocated between multiple electronic circuits (e.g., multiple GPUs or a CPU in conjunction with a GPU). The multiple electronic circuits may be local to one another (e.g., located on a same die, located within a same package, or located within a same embedded device or computer system) and/or may be remote from one other (e.g., in communication over a network such as a local personal area network such as Bluetooth®, over a local area network such as a local wired and/or wireless network, and/or over wide area network such as the internet, such a case where some operations are performed locally and other operations are performed on a server hosted by a cloud computing service). One or more electronic circuits operating to implement the processing circuit 100 may be referred to herein as a computer or a computer system, which may include memory storing instructions that, when executed by the one or more electronic circuits, implement the systems and methods described herein.



FIGS. 2A, 2B, 2C, and 2D provide background for illustrating the segmentation maps computed by a comparative approach and semantic segmentation or instance segmentation according to embodiments of the present disclosure. In more detail, FIG. 2A is an image or intensity image of a scene with one real transparent ball placed on top of a printout of photograph depicting another scene containing two transparent balls (“spoofs”) and some background clutter. FIG. 2B depicts an segmentation mask as computed by a comparative Mask Region-based Convolutional Neural Network (Mask R-CNN) identifying instances of transparent balls overlaid on the intensity image of FIG. 2A using different patterns of lines, where the real transparent ball is correctly identified as an instance, and the two spoofs are incorrectly identified as instances. In other words, the Mask R-CNN algorithm has been fooled into labeling the two spoof transparent balls as instances of actual transparent balls in the scene.



FIG. 2C is an angle of linear polarization (AOLP) image computed from polarization raw frames captured of the scene according to one embodiment of the present invention. As shown in FIG. 2C, transparent objects have a very unique texture in polarization space such as the AOLP domain, where there is a geometry-dependent signature on edges and a distinct or unique or particular pattern that arises on the surfaces of transparent objects in the angle of linear polarization. In other words, the intrinsic texture of the transparent object (e.g., as opposed to extrinsic texture adopted from the background surfaces visible through the transparent object) is more visible in the angle of polarization image of FIG. 2C than it is in the intensity image of FIG. 2A.



FIG. 2D depicts the intensity image of FIG. 2A with an overlaid segmentation mask as computed using polarization data in accordance with an embodiment of the present invention, where the real transparent ball is correctly identified as an instance using an overlaid pattern of lines and the two spoofs are correctly excluded as instances (e.g., in contrast to FIG. 2B, FIG. 2D does not include overlaid patterns of lines over the two spoofs). While FIGS. 2A, 2B, 2C, and 2D illustrate an example relating to detecting a real transparent object in the presence of spoof transparent objects, embodiments of the present disclosure are not limited thereto and may also be applied to other optically challenging objects, such as transparent, translucent, and non-matte or non-Lambertian objects, as well as non-reflective (e.g., matte black objects) and multipath inducing objects.


Accordingly, some aspects of embodiments of the present disclosure relate to extracting, from the polarization raw frames, tensors in representation space (or first tensors in first representation spaces, such as polarization feature maps) to be supplied as input to semantic segmentation algorithms or other computer vision algorithms. These first tensors in first representation space may include polarization feature maps that encode information relating to the polarization of light received from the scene such as the AOLP image shown in FIG. 2C, degree of linear polarization (DOLP) feature maps, and the like (e.g., other combinations from Stokes vectors or transformations of individual ones of the polarization raw frames). In some embodiments, these polarization feature maps are used together with non-polarization feature maps (e.g., intensity images such as the image shown in FIG. 2A) to provide additional channels of information for use by semantic segmentation algorithms.


While embodiments of the present invention are not limited to use with particular semantic segmentation algorithms, some aspects of embodiments of the present invention relate to deep learning frameworks for polarization-based segmentation of transparent or other optically challenging objects (e.g., transparent, translucent, non-Lambertian, multipath inducing objects, and non-reflective (e.g., very dark) objects), where these frameworks may be referred to as Polarized Convolutional Neural Networks (Polarized CNNs). This Polarized CNN framework includes a backbone that is suitable for processing the particular texture of polarization and can be coupled with other computer vision architectures such as Mask R-CNN (e.g., to form a Polarized Mask R-CNN architecture) to produce a solution for accurate and robust instance segmentation of transparent objects. Furthermore, this approach may be applied to scenes with a mix of transparent and non-transparent (e.g., opaque objects) and can be used to identify instances of transparent, translucent, non-Lambertian, multipath inducing, dark, and opaque objects in the scene.



FIG. 3 is a block diagram of processing circuit 100 for computing segmentation maps based on polarization data according to one embodiment of the present invention. FIG. 4 is a flowchart of a method for performing segmentation on input images to compute a segmentation map according to one embodiment of the present invention. As shown in FIG. 3, in some embodiments, a processing circuit 100 includes a feature extractor or feature extraction system 800 and a predictor 900 (e.g., a classical computer vision prediction algorithm or a trained statistical model) configured to compute a prediction output 20 (e.g., a statistical prediction) regarding one or more transparent objects in the scene based on the output of the feature extraction system 800. While some embodiments of the present disclosure are described herein in the context of training a system for detecting transparent objects, embodiments of the present disclosure are not limited thereto, and may also be applied to techniques for other optically challenging objects or objects made of materials that are optically challenging to detect such as translucent objects, multipath inducing objects, objects that are not entirely or substantially matte or Lambertian, and/or very dark objects. These optically challenging objects include objects that are difficult to resolve or detect through the use of images that are capture by camera systems that are not sensitive to the polarization of light (e.g., based on images captured by cameras without a polarizing filter in the optical path or where different images do not capture images based on different polarization angles).


In the embodiment shown in FIGS. 3 and 4, in operation 410, the feature extraction system 800 of the processing system 100 extracts one or more first feature maps 50 in one or more first representation spaces (including polarization images or polarization feature maps in various polarization representation spaces) from the input polarization raw frames 18 of a scene. The extracted derived feature maps 50 (including polarization images) are provided as input to the predictor 900 of the processing system 100, which implements one or more prediction models to compute, in operation 450, a detected output 20. In the case where the predictor is an image segmentation or instance segmentation system, the prediction may be a segmentation map such as that shown in FIG. 3, where each pixel may be associated with one or more confidences that the pixel corresponds to various possible classes (or types) of objects. In the case where the predictor is a classification system, the prediction may include a plurality of classes and corresponding confidences that the image depicts an instance of each of the classes. In the case where the predictor 900 is a classical computer vision prediction algorithm, the predictor may compute a detection result (e.g., detect edges, keypoints, basis coefficients, Haar wavelet coefficients, or other features of transparent objects and/or other optically challenging objects, such as translucent objects, multipath inducing objects, non-Lambertian objects, and non-reflective objects in the image as output features).


In the embodiment shown in FIG. 3, the predictor 900 implements an instance segmentation (or a semantic segmentation) system and computes, in operation 450, an output 20 that includes a segmentation map for the scene based on the extracted first tensors 50 in first representation spaces, extracted from the input polarization raw frames 18. As noted above the feature extraction system 800 and the predictor 900 are implemented using one or more electronic circuits that are configured to perform their operations, as described in more detail below.


Extracting First Tensors Such as Polarization Images and Derived Feature Maps in First Representation Spaces from Polarization Raw Frames


Some aspects of embodiments of the present disclosure relate to systems and methods for extracting features in operation 410, where these extracted features are used in the robust detection of transparent objects in operation 450. In contrast, comparative techniques relying on intensity images alone may fail to detect transparent objects (e.g., comparing the intensity image of FIG. 2A with the AOLP image of FIG. 2C, discussed above). The term “first tensors” in “first representation spaces” will be used herein to refer to features computed from (e.g., extracted from) polarization raw frames 18 captured by a polarization camera, where these first representation spaces include at least polarization feature spaces (e.g., feature spaces such as AOLP and DOLP that contain information about the polarization of the light detected by the image sensor) and may also include non-polarization feature spaces (e.g., feature spaces that do not require information regarding the polarization of light reaching the image sensor, such as images computed based solely on intensity images captured without any polarizing filters).


The interaction between light and transparent objects is rich and complex, but the material of an object determines its transparency under visible light. For many transparent household objects, the majority of visible light passes straight through and a small portion (˜4% to ˜8%, depending on the refractive index) is reflected. This is because light in the visible portion of the spectrum has insufficient in energy to excite atoms in the transparent object. As a result, the texture (e.g., appearance) of objects behind the transparent object (or visible through the transparent object) dominate the appearance of the transparent object. For example, when looking at a transparent glass cup or tumbler on a table, the appearance of the objects on the other side of the tumbler (e.g., the surface of the table) generally dominate what is seen through the cup. This property leads to some difficulties when attempting instance segmentation based on intensity images alone:


Clutter: Clear edges (e.g., the edges of transparent objects) are hard to see in densely cluttered scenes with transparent objects. In extreme cases, the edges are not visible at all (see, e.g., region (b) of FIG. 6A, described in more detail below), creating ambiguities in the exact shape of the transparent objects.


Novel Environments: Low reflectivity in the visible spectrum causes transparent objects to appear different, out-of-distribution, in novel environments (e.g., environments different from the training data used to train the segmentation system, such as where the backgrounds visible through the transparent objects differ from the backgrounds in the training data), thereby leading to poor generalization.


Print-Out Spoofs: algorithms using single RGB images as input are generally susceptible to print-out spoofs (e.g., printouts of photographic images) due to the perspective ambiguity. While other non-monocular algorithms (e.g., using images captured from multiple different poses around the scene, such as a stereo camera) for semantic segmentation of transparent objects exist, they are range limited and may be unable to handle instance segmentation.



FIG. 5 is a high-level depiction of the interaction of light with transparent objects and non-transparent (e.g., diffuse and/or reflective) objects. As shown in FIG. 5, a polarization camera 10 captures polarization raw frames of a scene that includes a transparent object 502 in front of an opaque background object 503. A light ray 510 hitting the image sensor 14 of the polarization camera 10 contains polarization information from both the transparent object 502 and the background object 503. The small fraction of reflected light 512 from the transparent object 502 is heavily polarized, and thus has a large impact on the polarization measurement, on contrast to the light 513 reflected off the background object 503 and passing through the transparent object 502.


A light ray 510 hitting the image sensor 16 of a polarization camera 10 has three measurable components: the intensity of light (intensity image/I), the percentage or proportion of light that is linearly polarized (degree of linear polarization/DOLP/ρ), and the direction of that linear polarization (angle of linear polarization/AOLP/ϕ). These properties encode information about the surface curvature and material of the object being imaged, which can be used by the predictor 900 to detect transparent objects, as described in more detail below. In some embodiments, the predictor 900 can detect other optically challenging objects based on similar polarization properties of light passing through translucent objects and/or light interacting with multipath inducing objects or by non-reflective objects (e.g., matte black objects).


Therefore, some aspects of embodiments of the present invention relate to using a feature extractor 800 to compute first tensors in one or more first representation spaces, which may include derived feature maps based on the intensity I, the DOLP ρ, and the AOLP ϕ. The feature extractor 800 may generally extract information into first representation spaces (or first feature spaces) which include polarization representation spaces (or polarization feature spaces) such as “polarization images,” in other words, images that are extracted based on the polarization raw frames that would not otherwise be computable from intensity images (e.g., images captured by a camera that did not include a polarizing filter or other mechanism for detecting the polarization of light reaching its image sensor), where these polarization images may include DOLP ρ images (in DOLP representation space or feature space), AOLP ϕ images (in AOLP representation space or feature space), other combinations of the polarization raw frames as computed from Stokes vectors, as well as other images (or more generally first tensors or first feature tensors) of information computed from polarization raw frames. The first representation spaces may include non-polarization representation spaces such as the intensity I representation space.


Measuring intensity I, DOLP ρ, and AOLP ϕ at each pixel requires 3 or more polarization raw frames of a scene taken behind polarizing filters (or polarizers) at different angles, ϕpol (e.g., because there are three unknown values to be determined: intensity I, DOLP ρ, and AOLP ϕ. For example, the FLIR® Blackfly® S Polarization Camera described above captures polarization raw frames with polarization angles ϕpol at 0 degrees, 45 degrees, 90 degrees, or 135 degrees, thereby producing four polarization raw frames Iϕpol, denoted herein as I0, I45, I90, and I135.


The relationship between Iϕpol and intensity I, DOLP ρ, and AOLP ϕ at each pixel can be expressed as:

Iϕpol=I(1+ρ cos(2(ϕ−ϕpol)))  (1)


Accordingly, with four different polarization raw frames Iϕpol (I0, I45, I90, and I135), a system of four equations can be used to solve for the intensity I, DOLP ρ, and AOLP ϕ.


Shape from Polarization (SfP) theory (see, e.g., Gary A Atkinson and Edwin R Hancock. Recovery of surface orientation from diffuse polarization. IEEE transactions on image processing, 15(6):1653-1664, 2006.) states that the relationship between the refractive index (n), azimuth angle (θa) and zenith angle (θz) of the surface normal of an object and the ϕ and ρ components of the light ray coming from that object.


When diffuse reflection is dominant:









ρ
=




(

n
-

1
n


)

2




sin
2



(

θ
z

)




2
+

2


n
2


-



(

n
+

1
n


)

2



sin
2



θ
z


+

4

cos






θ
z





n
2

-


sin
2



θ
z











(
2
)






ϕ
=

θ
a





(
3
)








and when the specular reflection is dominant:









ρ
=


2


sin
2



θ
z


cos






θ
z





n
2

-


sin
2



θ
z







n
2

-


sin
2



θ
z


-


n
2



sin
2



θ
z


+

2


sin
4



θ
z








(
4
)






ϕ
=


θ
a

-

π
2






(
5
)








Note that in both cases p increases exponentially as θz increases and if the refractive index is the same, specular reflection is much more polarized than diffuse reflection.


Some aspects of embodiments of the present disclosure relate to supplying first tensors in the first representation spaces (e.g., derived feature maps) extracted from polarization raw frames as inputs to a predictor for computing computer vision predictions on transparent objects and/or other optically challenging objects (e.g., translucent objects, non-Lambertian objects, multipath inducing objects, and/or non-reflective objects) of the scene, such as a semantic segmentation system for computing segmentation maps including the detection of instances of transparent objects and other optically challenging objects in the scene. These first tensors may include derived feature maps which may include an intensity feature map I, a degree of linear polarization (DOLP) ρ feature map, and an angle of linear polarization (AOLP) (p feature map, and where the DOLP ρ feature map and the AOLP ϕ feature map are examples of polarization feature maps or tensors in polarization representation spaces, in reference to feature maps that encode information regarding the polarization of light detected by a polarization camera. Benefits of polarization feature maps (or polarization images) are illustrated in more detail with respect to FIGS. 6A, 6B, 6C, 7A, 7B, and 7C.



FIGS. 6A, 6B, and 6C depict example first tensors that are feature maps computed by a feature extractor configured to extract first tensors in first representation spaces including an intensity feature map I in FIG. 6A in intensity representation space, a degree of linear polarization (DOLP) feature map ρ in FIG. 6B in DOLP representation space, and angle of linear polarization (AOLP) feature map ϕ in FIG. 6C in AOLP representation space, according to one embodiment of the present invention. Two regions of interest—region (a) containing two transparent balls and region (b) containing the edge of a drinking glass—are discussed in more detail below.



FIGS. 7A and 7B are, respectively, expanded views of the regions labeled (a) and (b) in FIGS. 6A, 6B, and 6C. FIG. 7C is a graph depicting a cross section of an edge labeled in FIG. 7B in the intensity feature map I of FIG. 6A, the DOLP feature map ρ of FIG. 6B, and the AOLP feature map ϕ of FIG. 6C.


Referring to region (a), as seen in FIG. 6A and the left side of FIG. 7A, the texture of the two transparent balls is inconsistent in the intensity image due to the change in background (e.g., the plastic box with a grid of holes versus the patterned cloth that the transparent balls are resting on), highlighting problems caused by novel environments (e.g., various backgrounds visible through the transparent objects). This inconsistency may make it difficult for a semantic segmentation or instance segmentation system to recognize that these very different-looking parts of the image correspond to the same type or class of object (e.g., a transparent ball).


On the other hand, in the DOLP image shown in FIG. 6B and the right side of FIG. 7A, the shape of the transparent objects is readily apparent and the background texture (e.g., the pattern of the cloth) does not appear in the DOLP image ρ. FIG. 7A is an enlarged view of region (a) of the intensity image I shown in FIG. 6A and the DOLP image p shown in FIG. 6B, showing that two different portions of the transparent balls have inconsistent (e.g., different-looking) textures in the intensity image I but have consistent (e.g., similar looking) textures in the DOLP image ρ, thereby making it more likely for a semantic segmentation or instance segmentation system to recognize that these two similar looking textures both correspond to the same class of object, based on the DOLP image ρ.


Referring region (b), as seen in FIG. 6A and the left side of FIG. 7B, the edge of the drinking glass is practically invisible in the intensity image I (e.g., indistinguishable from the patterned cloth), but is much brighter in the AOLP image ϕ as seen in FIG. 6C and the right side of FIG. 7B. FIG. 7C is a cross-section of the edge in the region identified boxes in the intensity image I and the AOLP image ϕ in FIG. 7B shows that the edge has much higher contrast in the AOLP ϕ and DOLP ρ than in the intensity image I, thereby making it more likely for a semantic segmentation or instance segmentation system to detect the edge of the transparent image, based on the AOLP ϕ and DOLP ρ images.


More formally, aspects of embodiments of the present disclosure relate to computing first tensors 50 in first representation spaces, including extracting first tensors in polarization representation spaces such as forming polarization images (or extracting derived polarization feature maps) in operation 410 based on polarization raw frames captured by a polarization camera 10.


Light rays coming from a transparent objects have two components: a reflected portion including reflected intensity Ir, reflected DOLP ρr, and reflected AOLP ϕr and the refracted portion including refracted intensity It, refracted DOLP ρt, and refracted AOLP ϕt. The intensity of a single pixel in the resulting image can be written as:

I=Ir+It  (6)


When a polarizing filter having a linear polarization angle of ϕpol is placed in front of the camera, the value at a given pixel is:

Iϕpol=Ir(1+ρr cos(2(ϕr−ϕpol)))+It(1+ρt cos(2(ϕt−ϕpol)))  (7)


Solving the above expression for the values of a pixel in a DOLP ρ image and a pixel in an AOLP ϕ image in terms of Ir, ρr, ϕr, Ir, ρt, and ϕt:









ρ
=





(


I
r



ρ
r


)

2

+


(


I
t



ρ
t


)

2

+

2


I
t



ρ
t



I
r



ρ
r



cos


(

2


(


ϕ
r

-

ϕ
t


)


)







I
r

+

I
t







(
8
)






ϕ
=


arc






tan
(



I
r



ρ
r



sin


(

2


(


ϕ
r

-

ϕ
t


)


)






I
t



ρ
t


+


I
r



ρ
r



cos


(

2


(


ϕ
r

-

ϕ
t


)


)





)


+

ϕ
r






(
9
)







Accordingly, equations (7), (8), and (9), above provide a model for forming first tensors 50 in first representation spaces that include an intensity image I, a DOLP image ρ, and an AOLP image ϕ according to one embodiment of the present disclosure, where the use of polarization images or tensor in polarization representation spaces (including DOLP image ρ and an AOLP image ϕ based on equations (8) and (9)) enables the reliable detection of transparent objects and other optically challenging objects that are generally not detectable by comparative systems such as a Mask R-CNN system, which uses only intensity I images as input.


In more detail, first tensors in polarization representation spaces (among the derived feature maps 50) such as the polarization images DOLP ρ and AOLP ϕ can reveal surface texture of objects that might otherwise appear textureless in an intensity I domain. A transparent object may have a texture that is invisible in the intensity domain I because this intensity is strictly dependent on the ratio of Ir/It(see equation (6)). Unlike opaque objects where It=0, transparent objects transmit most of the incident light and only reflect a small portion of this incident light.


On the other hand, in the domain or realm of polarization, the strength of the surface texture of a transparent object depends on ϕr−ϕt and the ratio of Irρr/Itρt (see equations (8) and (9)). Assuming that ϕr≠ϕt and θzr≠θzt for the majority of pixels (e.g., assuming that the geometries of the background and transparent object are different) and based on showings that ρr follows the specular reflection curve (see, e.g., Daisuke Miyazaki, Masataka Kagesawa, and Katsushi Ikeuchi. Transparent surface modeling from a pair of polarization images. IEEE Transactions on Pattern Analysis & Machine Intelligence, (1):73-82, 2004.), meaning it is highly polarized, and at Brewster's angle (approx. 60°) ρr is 1.0 (see equation (4)), then, at appropriate zenith angles, ρr≥ρt, and, if the background is diffuse or has a low zenith angle, ρr>>ρt. This effect can be seen in FIG. 2C, where the texture of the real transparent sphere dominates when θz≈60°. Accordingly, in many cases, the following assumption holds:











I
r


I
t






I
r



ρ
r




I
t



ρ
t







(
10
)







Thus, even if the texture of the transparent object appears invisible in the intensity domain I, the texture of the transparent object may be more visible in the polarization domain, such as in the AOLP ϕ and in the DOLP ρ.


Returning to the three examples of circumstances that lead to difficulties when attempting semantic segmentation or instance segmentation on intensity images alone:


Clutter: One problem in clutter is in detecting the edges of a transparent object that may be substantially texture-less (see, e.g., the edge of the drinking glass in region (b) of FIG. 6A. On the other hand, the texture of the glass and its edges appear more visible in the DOLP ρ shown in FIG. 6B and even more visible in the AOLP ϕ shown in FIG. 6C.


Novel environments: In addition to increasing the strength of the transparent object texture, the DOLP ρ image shown, for example, in FIG. 6B, also reduces the impact of diffuse backgrounds like textured or patterned cloth (e.g., the background cloth is rendered almost entirely black). This allows transparent objects to appear similar in different scenes, even when the environment changes from scene-to-scene. See, e.g., region (a) in FIG. 6B and FIG. 7A.


Print-out spoofs: Paper is flat, leading to a mostly uniform AOLP ϕ and DOLP ρ. Transparent objects have some amount of surface variation, which will appear very non-uniform in AOLP ϕ and DOLP ρ (see, e.g. FIG. 2C). As such, print-out spoofs of transparent objects can be distinguished from real transparent objects.



FIG. 8A is a block diagram of a feature extractor 800 according to one embodiment of the present invention. FIG. 8B is a flowchart depicting a method according to one embodiment of the present invention for extracting features from polarization raw frames. In the embodiment shown in FIG. 8A, the feature extractor 800 includes an intensity extractor 820 configured to extract an intensity image I 52 in an intensity representation space (e.g., in accordance with equation (7), as one example of a non-polarization representation space) and polarization feature extractors 830 configured to extract features in one or more polarization representation spaces. As shown in FIG. 8B, the extraction of polarization images in operation 410 may include extracting, in operation 411, a first tensor in a first polarization representation space from the polarization raw frames from a first Stokes vector In operation 412, the feature extractor 800 further extracts a second tensor in a second polarization representation space from the polarization raw frames. For example, the polarization feature extractors 830 may include a DOLP extractor 840 configured to extract a DOLP ρ image 54 (e.g., a first polarization image or a first tensor in accordance with equation (8) with DOLP as the first polarization representation space) and an AOLP extractor 860 configured to extract an AOLP ϕ image 56 (e.g., a second polarization image or a second tensor in accordance with equation (9), with AOLP as the second polarization representation space) from the supplied polarization raw frames 18. As another example, the polarization representation spaces may include combinations of polarization raw frames in accordance with Stokes vectors. As further examples, the polarization representations may include modifications or transformations of polarization raw frames in accordance with one or more image processing filters (e.g., a filter to increase image contrast or a denoising filter). The derived feature maps 52, 54, and 56 may then be supplied to a predictor 900 for further processing, such as performing inferences (e.g., generating instance segmentation maps, classifying the images, and generating textual descriptions of the images).


While FIG. 8B illustrates a case where two different tensors are extracted from the polarization raw frames 18 in two different representation spaces, embodiments of the present disclosure are not limited thereto. For example, in some embodiments of the present disclosure, exactly one tensor in a polarization representation space is extracted from the polarization raw frames 18. For example, one polarization representation space of raw frames is AOLP and another is DOLP (e.g., in some applications, AOLP may be sufficient for detecting transparent objects or other optically challenging objects such as translucent, non-Lambertian, multipath inducing, and/or non-reflective objects). In some embodiments of the present disclosure, more than two different tensors are extracted from the polarization raw frames 18 based on corresponding Stokes vectors. For example, as shown in FIG. 8B, n different tensors in n different representation spaces may be extracted by the feature extractor 800, where the n-th tensor is extracted in operation 414.


Accordingly, extracting features such as polarization feature maps or polarization images from polarization raw frames 18 produces first tensors 50 from which transparent objects or other optically challenging objects such as translucent objects, multipath inducing objects, non-Lambertian objects, and non-reflective objects are more easily detected or separated from other objects in a scene. In some embodiments, the first tensors extracted by the feature extractor 800 may be explicitly derived features (e.g., hand crafted by a human designer) that relate to underlying physical phenomena that may be exhibited in the polarization raw frames (e.g., the calculation of AOLP and DOLP images, as discussed above). In some additional embodiments of the present disclosure, the feature extractor 800 extracts other non-polarization feature maps or non-polarization images, such as intensity maps for different colors of light (e.g., red, green, and blue light) and transformations of the intensity maps (e.g., applying image processing filters to the intensity maps). In some embodiments of the present disclosure the feature extractor 800 may be configured to extract one or more features that are automatically learned (e.g., features that are not manually specified by a human) through an end-to-end supervised training process based on labeled training data.


Computing Predictions Such as Segmentation Maps Based on Polarization Features Computed from Polarization Raw Frames


As noted above, some aspects of embodiments of the present disclosure relate to providing first tensors in polarization representation space such as polarization images or polarization feature maps, such as the DOLP ρ and AOLP ϕ images extracted by the feature extractor 800, to a predictor such as a semantic segmentation algorithm to perform multi-modal fusion of the polarization images to generate learned features (or second tensors) and to compute predictions such as segmentation maps based on the learned features or second tensors. Specific embodiments relating to semantic segmentation or instance segmentation will be described in more detail below.


Generally, there are many approaches to semantic segmentation, including deep instance techniques. The various the deep instance techniques bay be classified as semantic segmentation-based techniques (such as those described in: Min Bai and Raquel Urtasun. Deep watershed transform for instance segmentation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 5221-5229, 2017; Alexander Kirillov, Evgeny Levinkov, Bjoern Andres, Bogdan Savchynskyy, and Carsten Rother. Instancecut: from edges to instances with multicut. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 5008-5017, 2017; and Anurag Arnab and Philip H S Torr. Pixelwise instance segmentation with a dynamically instantiated network. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 441-450, 2017.), proposal-based techniques (such as those described in: Kaiming He, Georgia Gkioxari, Piotr Doll'ar, and Ross Girshick. Mask r-cnn. In Proceedings of the IEEE International Conference on Computer Vision, pages 2961-2969, 2017.) and recurrent neural network (RNN) based techniques (such as those described in: Bernardino Romera-Paredes and Philip Hilaire Sean Torr. Recurrent instance segmentation. In European Conference on Computer Vision, pages 312-329. Springer, 2016 and Mengye Ren and Richard S Zemel. End-to-end instance segmentation with recurrent attention. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 6656-6664, 2017.). Embodiments of the present disclosure may be applied to any of these semantic segmentation techniques.


While some comparative approaches supply concatenated polarization raw frames (e.g., images I0, I45, I90, and I135 as described above) directly into a deep network without extracting first tensors such as polarization images or polarization feature maps therefrom, models trained directly on these polarization raw frames as inputs generally struggle to learn the physical priors, which leads to poor performance, such as failing to detect instances of transparent objects or other optically challenging objects. Accordingly, aspects of embodiments of the present disclosure relate to the use of polarization images or polarization feature maps (in some embodiments in combination with other feature maps such as intensity feature maps) to perform instance segmentation on images of transparent objects in a scene.


One embodiment of the present disclosure using deep instance segmentation is based on a modification of a Mask Region-based Convolutional Neural Network (Mask R-CNN) architecture to form a Polarized Mask R-CNN architecture. Mask R-CNN works by taking an input image x, which is an H×W×3 tensor of image intensity values (e.g., height by width by color intensity in red, green, and blue channels), and running it through a backbone network: C=B(x). The backbone network B(x) is responsible for extracting useful learned features from the input image and can be any standard CNN architecture such as AlexNet (see, e.g., Krizhevsky, Alex, Ilya Sutskever, and Geoffrey E. Hinton. “ImageNet classification with deep convolutional neural networks.” Advances in neural information processing systems. 2012.), VGG (see, e.g., Simonyan, Karen, and Andrew Zisserman. “Very deep convolutional networks for large-scale image recognition.” arXiv preprint arXiv:1409.1556 (2014).), ResNet-101 (see, e.g., Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 770-778, 2016.), MobileNet (see, e.g., Howard, Andrew G., et al. “Mobilenets: Efficient convolutional neural networks for mobile vision applications.” arXiv preprint arXiv:1704.04861 (2017).), MobileNetV2 (see, e.g., Sandler, Mark, et al. “MobileNetV2: Inverted residuals and linear bottlenecks.” Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2018.), and MobileNetV3 (see, e.g., Howard, Andrew, et al. “Searching for MobileNetV3.” Proceedings of the IEEE International Conference on Computer Vision. 2019.)


The backbone network B(x) outputs a set of tensors, e.g., C={C1, C2, C3, C4, C5}, where each tensor CL represents a different resolution feature map. These feature maps are then combined in a feature pyramid network (FPN) (see, e.g., Tsung-Yi Lin, Piotr Doll'ar, Ross Girshick, Kaiming He, Bharath Hariharan, and Serge Belongie. Feature pyramid networks for object detection. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 2117-2125, 2017.), processed with a region proposal network (RPN) (see, e.g., Shaoqing Ren, Kaiming He, Ross Girshick, and Jian Sun. Faster r-cnn: Towards real-time object detection with region proposal networks. In Advances in Neural Information Processing Systems, pages 91-99, 2015.), and finally passed through an output subnetwork (see, e.g., Ren et al. and He et al., above) to produce classes, bounding boxes, and pixel-wise segmentations. These are merged with non-maximum suppression for instance segmentation.


Aspects of embodiments of the present invention relate to a framework for leveraging the additional information contained in polarized images using deep learning, where this additional information is not present in input images captured by comparative cameras (e.g., information not captured standard color or monochrome cameras without the use of polarizers or polarizing filters). Neural network architectures constructed in accordance with frameworks of embodiments of the present disclosure will be referred to herein as Polarized Convolutional Neural Networks (CNNs).


Applying this framework according to some embodiments of the present disclosure involves three changes to a CNN architecture:


(1) Input Image: Applying the physical equations of polarization to create the input polarization images to the CNN, such as by using a feature extractor 800 according to some embodiments of the present disclosure.


(2) Attention-fusion Polar Backbone: Treating the problem as a multi-modal fusion problem by fusing the learned features computed from the polarization images by a trained CNN backbone.


(3) Geometric Data Augmentations: augmenting the training data to represent the physics of polarization.


However, embodiments of the present disclosure are not limited thereto. Instead, any subset of the above three changes and/or changes other than the above three changes may be made to an existing CNN architecture to create a Polarized CNN architecture within embodiments of the present disclosure.


A Polarized CNN according to some embodiments of the present disclosure may be implemented using one or more electronic circuits configured to perform the operations described in more detail below. In the embodiment shown in FIG. 3, a Polarized CNN is used as a component of the predictor 900 for computing a segmentation map 20, as shown in FIG. 3.



FIG. 9 is a block diagram depicting a Polarized CNN architecture according to one embodiment of the present invention as applied to a Mask-Region-based convolutional neural network (Mask R-CNN) backbone, where second tensors C (or output tensors such as learned feature maps) are used to compute an output prediction such as segmentation mask 20.


While some embodiments of the present disclosure relate to a semantic segmentation or instance segmentation using a Polarized CNN architecture as applied to a Mask R-CNN backbone, embodiments of the present disclosure are not limited thereto, and other backbones such as AlexNet, VGG, MobileNet, MobileNetV2, MobileNetV3, and the like may be modified in a similar manner.


In the embodiment shown in FIG. 9, derived feature maps 50 (e.g., including input polarization images such as AOLP ϕ and DOLP ρ images) are supplied as inputs to a Polarized CNN backbone 910. In the embodiment shown in FIG. 9, the input feature maps 50 include three input images: the intensity image (I) 52, the AOLP (ϕ) 56, the DOLP (ρ) 54 from equation (1) as the input for detecting a transparent object and/or other optically challenging object. These images are computed from polarization raw frames 18 (e.g., images I0, I45, I90, and I135 as described above), normalized to be in a range (e.g., 8-bit values in the range [0-255]) and transformed into three-channel gray scale images to allow for easy transfer learning based on networks pre-trained on the MSCoCo dataset (see, e.g., Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Doll'ar, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In European Conference on Computer Vision, pages 740-755. Springer, 2014.).


In the embodiment shown in FIG. 9, each of the input derived feature maps 50 is supplied to a separate backbone: intensity BI(I) 912, AOLP backbone Bϕ(ϕ) 914, and DOLP backbone Bρ(ρ) 916. The CNN backbones 912, 914, and 916 compute tensors for each mode, or “mode tensors” (e.g., feature maps computed based on parameters learned during training or transfer learning of the CNN backbone, discussed in more detail below) Ci,I, Ci,ρ, Ci,ϕ at different scales or resolutions i. While FIG. 9 illustrates an embodiment with five different scales i, embodiments of the present disclosure are not limited thereto and may also be applied to CNN backbones with different numbers of scales.


Some aspects of embodiments of the present disclosure relate to a spatially-aware attention-fusion mechanism to perform multi-modal fusion (e.g., fusion of the feature maps computed from each of the different modes or different types of input feature maps, such as the intensity feature map I, the AOLP feature map ϕ, and the DOLP feature map ρ).


For example, in the embodiment shown in FIG. 9, the mode tensors Ci,I, Ci,ρ, Ci,ϕ (tensors for each mode) computed from corresponding backbones BI, Bρ, Bϕ at each scale i are fused using fusion layers 922, 923, 924, 925 (collectively, fusion layers 920) for corresponding scales. For example, fusion layer 922 is configured to fuse mode tensors C2,I, C2,ρ, C2,ϕ computed at scale i=2 to compute a fused tensor C2. Likewise, fusion layer 923 is configured to fuse mode tensors C3,I, C3,ρ, C3,ϕ computed at scale i=3 to compute a fused tensor C3, and similar computations may be performed by fusion layers 924 and 925 to compute fused feature maps C4 and C5, respectively, based on respective mode tensors for their scales. The fused tensors Ci (e.g., C2, C3, C4, C5), or second tensors, such as fused feature maps, computed by the fusion layers 920 are then supplied as input to a prediction module 950, which is configured to compute a prediction from the fused tensors, where the prediction may be an output such as a segmentation map 20, a classification, a textual description, or the like.



FIG. 10 is a block diagram of an i-th fusion layer among the fusion layers 920 that may be used with a Polarized CNN according to one embodiment of the present invention. As shown in FIG. 10, in some embodiments of the present disclosure, a fusion layer (e.g., each of the fusion layer 920) is implemented using an attention module, in which the predictor 900 concatenates the supplied input tensors or input feature maps Ci,I, Ci,ρ, Ci,ϕ computed by the CNN backbones for the i-th scale and to generate concatenated tensor 1010, where the concatenated tensor 1010 is processed through a set of trained convolutional layers or attention subnetwork Ωi for the i-thscale. The attention subnetwork Ωi outputs a 3-channel image with the same height and width as the input tensors, and, in some embodiments, a softmax function is applied to each pixel of the 3-channel image to compute pixel-wise attention weights α for the i-th scale:

i,ϕi,ρi,I]=softmax(Ωi([Ci,ϕ,Ci,ρ,Ci,I]))  (11)


These attention weights are used to perform a weighted average 1020 per channel:

Cii,ϕCi,ϕi,ρCi,ρi,ICi,I  (12)


Accordingly, using an attention module allows a Polarized CNN according to some embodiments of the present disclosure to weight the different inputs at the scale i (e.g., the intensity I tensor or learned feature map Ci,I, the DOLP tensor or learned feature map Ci,ρ, and the AOLP tensor or learned feature map Ci,ϕ, at scale i) based on how relevant they are to a given portion of the scene, where the relevance is determined by the trained attention subnetwork Ωi in accordance with the labeled training data used to train the Polarized CNN backbone.



FIG. 11 depicts examples of attention weights computed by an attention module according to one embodiment of the present invention for different mode tensors (in different first representation spaces) extracted from polarization raw frames captured by a polarization camera. As shown in FIG. 11 (see, e.g., intensity image 1152), the scene imaged by the polarization camera includes a transparent glass placed on top of a print-out photograph, where the printed photograph depicts a transparent drinking glass (a print-out spoof of a drinking glass) and some background clutter.


As seen in FIG. 11, the learned attention weights 1110 are brightest on the DOLP 1114 and AOLP 1116 in the region around the real drinking glass and avoid the ambiguous print-out spoof in the intensity image 1152. Accordingly, the prediction module 950 can compute, for example, a segmentation mask 1120 that closely matches the ground truth 1130 (e.g., the prediction 1120 shows a shape that closely matches the shape of the transparent object in the scene).


In the embodiment shown in FIG. 9, the prediction module 950 is substantially similar to that used in a Mask R-CNN architecture and computes a segmentation map by combining the fused feature maps C using a feature pyramid network (FPN) and a region proposal network (RPN) as inputs to an output subnetwork for computing a Class, a Mask, and a bounding box (Bbox) for each instance of objects detected in the input images. the computed class, mask, and bounding boxes are then merged with non-maximum suppression to compute the instance segmentation map (or instance segmentation mask) 20.


As noted above, a Polarization CNN architecture can be trained using transfer learning based on an existing deep neural network that was trained using, for example, the MSCoCo dataset and a neural network training algorithm, such as backpropagation and gradient descent. In more detail, the Polarization CNN architecture is further trained based on additional training data representative of the inputs (e.g., using training polarization raw frames to compute training derived feature maps 50 and ground truth labels associated with the training derived feature maps) to the Polarization CNN as extracted by the feature extractor 800 from the polarization raw frames 18. These additional training data may include, for example, polarization raw frames captured, by a polarization camera, of a variety of scenes containing transparent objects or other optically challenging objects in a variety of different environments, along with ground truth segmentation maps (e.g., manually generated segmentation maps) labeling the pixels with the instance and class of the objects depicted in the images captured by the polarization camera.


In the case of small training datasets, affine transformations provide a technique for augmenting training data (e.g., generating additional training data from existing training data) to achieve good generalization performance. However, naively applying affine transformations to some of the source training derived feature maps such as the AOLP ϕ image does not provide significant improvements to the performance of the trained neural network and, in some instances, hurts performance. This is because the AOLP is an angle in the range of 0° to 360° (or 0 to 2π) that represents the direction of the electromagnetic wave with respect to the camera coordinate frame. If a rotation operator is applied to the source training image (or source training derived feature map), then this is equivalent to rotating the camera around its Z-axis (e.g., along the optical axis of the lens 12). This rotation will, in turn, change the orientation of the X-Y plane of the camera, and thus will change the relative direction of the electromagnetic wave (e.g., the angle of linear polarization). To account for this change, when augmenting the data by performing rotational affine transformations by an angle of rotation, the pixel values of the AOLP are rotated in the opposite direction (or counter-rotated or a counter-rotation is applied to the generated additional data) by the same angle. This same principle is also applied to other affine transformations of the training feature maps or training first tensors, where the particular transformations applied to the training feature maps or training first tensors may differ in accordance with the underlying physics of what the training feature maps represent. For example, while a DOLP image may be unaffected by a rotation transformation, a translation transformation would require corresponding changes to the DOLP due to the underlying physical behavior of the interactions of light with transparent objects or other optically challenging objects (e.g., translucent objects, non-Lambertian objects, multipath inducing objects, and non-reflective objects).


In addition, while some embodiments of the present disclosure relate to the use of CNN and deep semantic segmentation, embodiments of the present disclosure are not limited there to. In some embodiments of the present disclosure the derived feature maps 50 are supplied (in some embodiments with other feature maps) as inputs to other types of classification algorithms (e.g., classifying an image without localizing the detected objects), other types of semantic segmentation algorithms, or image description algorithms trained to generate natural language descriptions of scenes. Examples of such algorithms include support vector machines (SVM), a Markov random field, a probabilistic graphical model, etc. In some embodiments of the present disclosure, the derived feature maps are supplied as input to classical machine vision algorithms such as feature detectors (e.g., scale-invariant feature transform (SIFT), speeded up robust features (SURF), gradient location and orientation histogram (GLOH), histogram of oriented gradients (HOG), basis coefficients, Haar wavelet coefficients, etc.) to output detected classical computer vision features of detected transparent objects and/or other optically challenging objects in a scene.



FIGS. 12A, 12B, 12C, and 12D depict segmentation maps computed by a comparative image segmentation system, segmentation maps computed by a polarized convolutional neural network according to one embodiment of the present disclosure, and ground truth segmentation maps (e.g., manually-generated segmentation maps). FIGS. 12A, 12B, 12C, and 12D depict examples of experiments run on four different test sets to compare the performance of a trained Polarized Mask R-CNN model according to one embodiment of the present disclosure against a comparative Mask R-CNN model (referred to herein as an “Intensity” Mask R-CNN model to indicate that it operates on intensity images and not polarized images).


The Polarized Mask R-CNN model used to perform the experiments was trained on a training set containing 1,000 images with over 20,000 instances of transparent objects in fifteen different environments from six possible classes of transparent objects: plastic cups, plastic trays, glasses, ornaments, and other. Data augmentation techniques, such as those described above with regard to affine transformations of the input images and adjustment of the AOLP based on the rotation of the images are applied to the training set before training.


The four test sets include:


(a) A Clutter test set contains 200 images of cluttered transparent objects in environments similar to the training set with no print-outs.


(b) A Novel Environments (Env) test set contains 50 images taken of ˜6 objects per image with environments not available in the training set. The backgrounds contain harsh lighting, textured cloths, shiny metals, and more.


(c) A Print-Out Spoofs (POS) test set contains 50 images, each containing a 1 to 6 printed objects and 1 or 2 real objects.


(d) A Robotic Bin Picking (RBP) test set contains 300 images taken from a live demo of our robotic arm picking up ornaments (e.g., decorative glass ornaments, suitable for hanging on a tree). This set is used to test the instance segmentation performance in a real-world application.


For each data set, two metrics were used to measure the accuracy: mean average precision (mAP) in range of Intersection over Unions (IoUs) 0.5-0.7 (mAP0.5:07), and mean average precision in the range of IoUs 0.75-0.9 (mAP0.75:0.9). These two metrics measure coarse segmentation and fine-grained segmentation respectively. To further test generalization, all models were also tested object detection as well using the Faster R-CNN component of Mask R-CNN.


The Polarized Mask R-CNN according to embodiments of the present disclosure and the Intensity Mask R-CNN were tested on the four test sets discussed above. The average improvement is 14.3% mAP in coarse segmentation and 17.2% mAP in fine-grained segmentation. The performance improvement in the Clutter problem is more visible when doing fine-grained segmentation where the gap in performance goes from ˜1.1% mAP to 4.5% mAP. Therefore, the polarization data appears to provide useful edge information allowing the model to more accurately segment objects. As seen in FIG. 12A, polarization helps accurately segment clutter where it is ambiguous in the intensity image. As a result, in the example from the Clutter test set shown in FIG. 12A, the Polarized Mask R-CNN according to one embodiment of the present disclosure correctly detects all six instances of transparent objects, matching the ground truth, whereas the comparative Intensity Mask R-CNN identifies only four of the six instances of transparent objects.


For generalization to new environments there are much larger gains for both fine-grained and coarse segmentation, and therefore it appears that the intrinsic texture of a transparent object is more visible to the CNN in the polarized images. As shown in FIG. 12B, the Intensity Mask R-CNN completely fails to adapt to the novel environment while the Polarized Mask R-CNN model succeeds. While the Polarized Mask R-CNN is able to correctly detect all of the instances of trans parent objects, the Instance Mask R-CNN fails to detect some of the instances (see, e.g., the instances in the top right corner of the box).


Embodiments of the present disclosure also show a similarly large improvement in robustness against print-out spoofs, achieving almost 90% mAP. As such, embodiments of the present disclosure provide a monocular solution that is robust to perspective projection issues such as print-out spoofs. As shown in FIG. 12C, the Intensity Mask R-CNN is fooled by the printed paper spoofs. In the example shown in FIG. 12C, one real transparent ball is placed on printout depicting three spoof transparent objects. The Intensity Mask R-CNN incorrectly identifies two of the print-out spoofs as instances. On the other hand, the Polarized Mask R-CNN is robust, and detects only the real transparent ball as an instance.


All of these results help explain the dramatic improvement in performance shown for an uncontrolled and cluttered environment like Robotic Bin Picking (RBP). As shown in FIG. 12D, in the case of robotic picking of ornaments in low light conditions, the Intensity Mask R-CNN model is only able to detect five of the eleven instances of transparent objects. On the other hand, the Polarized R-CNN model is able to adapt to this environment with poor lighting and correctly identifies all eleven instances.


In more detail, and as an example of a potential application in industrial environments, a computer vision system was configured to control a robotic arm to perform bin picking by supplying a segmentation mask to the controller of the robotic arm. Bin picking of transparent and translucent (non-Lambertian) objects is a hard and open problem in robotics. To show the benefit of high quality, robust segmentation, the performance of a comparative, Intensity Mask R-CNN in providing segmentation maps for controlling the robotic arm to bin pick different sized cluttered transparent ornaments is compared with the performance of a Polarized Mask R-CNN according to one embodiment of the present disclosure.


A bin picking solution includes three components: a segmentation component to isolate each object; a depth estimation component; and a pose estimation component. To understand the effect of segmentation, a simple depth estimation and pose where the robot arm moves to the center of the segmentation and stops when it hits a surface. This works in this example because the objects are perfect spheres. A slightly inaccurate segmentation can cause an incorrect estimate and therefore a false pick. This application enables a comparison between the Polarized Mask R-CNN and Intensity Mask R-CNN. The system was tested in five environments outside the training set (e.g., under conditions that were different from the environments under which the training images were acquired). For each environment, fifteen balls were stacked, and the number of correct/incorrect (missed) picks the robot arm made to pick up all 15 balls (using a suction cup gripper) was counted, capped at 15 incorrect picks. The Intensity Mask R-CNN based model was unable to empty the bin regularly because the robotic arm consistently missed certain picks due to poor segmentation quality. On the other hand, the Polarized Mask R-CNN model according to one embodiment of the present disclosure, picked all 90 balls successfully, with approximately 1 incorrect pick for every 6 correct picks. These results validate the effect of an improvement of ˜20 mAP.


As noted above, embodiments of the present disclosure may be used as components of a computer vision or machine vision system that is capable of detecting both transparent objects and opaque objects.


In some embodiments of the present disclosure, a same predictor or statistical model 900 is trained to detect both transparent objects and opaque objects (or to generate second tensors C in second representation space) based on training data containing labeled examples of both transparent objects and opaque objects. For example, in some such embodiments, a Polarized CNN architecture is used, such as the Polarized Mask R-CNN architecture shown in FIG. 9. In some embodiments, the Polarized Mask R-CNN architecture shown in FIG. 9 is further modified by adding one or more additional CNN backbones that compute one or more additional mode tensors. The additional CNN backbones may be trained based on additional first tensors. In some embodiments these additional first tensors include image maps computed based on color intensity images (e.g., intensity of light in different wavelengths, such as a red intensity image or color channel, a green intensity image or color channel, and a blue intensity image or color channel). In some embodiments, these additional first tensors include image maps computed based on combinations of color intensity images. In some embodiments, the fusion modules 920 fuse all of the mode tensors at each scale from each of the CNN backbones (e.g., including the additional CNN backbones).


In some embodiments of the present disclosure, the predictor 900 includes one or more separate statistical models for detecting opaque objects as opposed to transparent objects. For example, an ensemble of predictors (e.g., a first predictor trained to compute a first segmentation mask for transparent objects and a second predictor trained to compute a second segmentation mask for opaque objects) may compute multiple predictions, where the separate predictions are merged (e.g., the first segmentation mask is merged with the second segmentation mask based, for example, on confidence scores associated with each pixel of the segmentation mask).


As noted in the background, above, enabling machine vision or computer vision systems to detect transparent objects robustly has applications in a variety of circumstances, including manufacturing, life sciences, self-driving vehicles, and


Accordingly, aspects of embodiments of the present disclosure relate to systems and methods for detecting instances of transparent objects using computer vision by using features extracted from the polarization domain. Transparent objects have more prominent textures in the polarization domain than in the intensity domain. This texture in the polarization texture can exploited with feature extractors and Polarized CNN models in accordance with embodiments of the present disclosure. Examples of the improvement in the performance of transparent object detection by embodiments of the present disclosure are demonstrated through comparisons against instance segmentation using Mask R-CNN (e.g., comparisons against Mask R-CNN using intensity images without using polarization data). Therefore, embodiments of the present disclosure


While the present invention has been described in connection with certain exemplary embodiments, it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims, and equivalents thereof.

Claims
  • 1. A computer-implemented method for computing a prediction on images of a scene, the method comprising: receiving one or more polarization raw frames of a scene, the polarization raw frames being captured with a polarizing filter at a different linear polarization angle;extracting one or more first tensors in one or more polarization representation spaces from the polarization raw frames; andcomputing a prediction regarding one or more optically challenging objects in the scene based on the one or more first tensors in the one or more polarization representation spaces,wherein the one or more first tensors in the one or more polarization representation spaces comprise: a degree of linear polarization (DOLP) image in a DOLP representation space; andan angle of linear polarization (AOLP) image in an AOLP representation space, andwherein the computing the prediction comprises supplying the one or more first tensors in the one or more polarization representation spaces, including the AOLP image in the AOLP representation space, to a statistical model.
  • 2. The computer-implemented method of claim 1, wherein the one or more first tensors further comprise one or more non-polarization tensors in one or more non-polarization representation spaces, and wherein the one or more non-polarization tensors comprise one or more intensity images in intensity representation space.
  • 3. The computer-implemented method of claim 2, wherein the one or more intensity images comprise: a first color intensity image;a second color intensity image; anda third color intensity image.
  • 4. The computer-implemented method of claim 1, wherein the prediction comprises a segmentation mask.
  • 5. The computer-implemented method of claim 1, wherein the computing the prediction comprises supplying the one or more first tensors to one or more corresponding convolutional neural network (CNN) backbones, and wherein each of the one or more CNN backbones is configured to compute a plurality of mode tensors at a plurality of different scales.
  • 6. The computer-implemented method of claim 5, wherein the computing the prediction further comprises: fusing the mode tensors computed at a same scale by the one or more CNN backbones.
  • 7. The computer-implemented method of claim 6, wherein the fusing the mode tensors at the same scale comprises: concatenating the mode tensors at the same scale;supplying the mode tensors to an attention subnetwork to compute one or more attention maps; andweighting the mode tensors based on the one or more attention maps to compute a fused tensor for the scale.
  • 8. The computer-implemented method of claim 7, wherein the computing the prediction further comprises supplying the fused tensors computed at each scale to a prediction module configured to compute the segmentation mask.
  • 9. The computer-implemented method of claim 4, wherein the segmentation mask is supplied to a controller of a robot picking arm.
  • 10. The computer-implemented method of claim 1, wherein the prediction comprises a classification of the one or more polarization raw frames based on the one or more optically challenging objects.
  • 11. The computer-implemented method of claim 1, wherein the prediction comprises one or more detected features of the one or more optically challenging objects depicted in the one or more polarization raw frames.
  • 12. The computer-implemented method of claim 1, wherein the statistical model is trained using training data comprising training first tensors in the one or more polarization representation spaces and labels.
  • 13. The computer-implemented method of claim 12, wherein the training data comprises: source training first tensors, in the one or more polarization representation spaces, computed from data captured by a polarization camera; andadditional training first tensors generated from the source training first tensors through affine transformations comprising a rotation.
  • 14. The computer-implemented method of claim 13, wherein, when the additional training first tensors comprise an angle of linear polarization (AOLP) image, generating the additional training first tensors comprises: rotating the additional training first tensors by an angle; andcounter-rotating pixel values of the AOLP image by the angle.
  • 15. A computer vision system comprising: a polarization camera comprising a polarizing filter; anda processing system comprising a processor and memory storing instructions that, when executed by the processor, cause the processor to: receive one or more polarization raw frames of a scene, the polarization raw frames being captured with a polarizing filter at a different linear polarization angle;extract one or more first tensors in one or more polarization representation spaces from the polarization raw frames; andcompute a prediction regarding one or more optically challenging objects in the scene based on the one or more first tensors in the one or more polarization representation spaces,wherein the one or more first tensors in the one or more polarization representation spaces comprise: a degree of linear polarization (DOLP) image in a DOLP representation space; andan angle of linear polarization (AOLP) image in an AOLP representation space, andwherein the instructions to compute the prediction comprise instructions that, when executed by the processor, cause the processor to supply the one or more first tensors, including the AOLP image in the AOLP representation space, to a statistical model.
  • 16. The computer vision system of claim 15, wherein the one or more first tensors further comprise one or more non-polarization tensors in one or more non-polarization representation spaces, and wherein the one or more non-polarization tensors comprise one or more intensity images in intensity representation space.
  • 17. The computer vision system of claim 16, wherein the one or more intensity images comprise: a first color intensity image;a second color intensity image; anda third color intensity image.
  • 18. The computer vision system of claim 15, wherein the prediction comprises a segmentation mask.
  • 19. The computer vision system of claim 18, wherein the memory further stores instructions that, when executed by the processor, cause the processor to compute the prediction by supplying the one or more first tensors to one or more corresponding convolutional neural network (CNN) backbones, and wherein each of the one or more CNN backbones is configured to compute a plurality of mode tensors at a plurality of different scales.
  • 20. The computer vision system of claim 19, wherein the memory further stores instructions that, when executed by the processor, cause the processor to: fuse the mode tensors computed at a same scale by the one or more CNN backbones.
  • 21. The computer vision system of claim 18, wherein the segmentation mask is supplied to a controller of a robot picking arm.
  • 22. The computer vision system of claim 15, wherein the prediction comprises a classification of the one or more polarization raw frames based on the one or more optically challenging objects.
  • 23. The computer vision system of claim 15, wherein the prediction comprises one or more detected features of the one or more optically challenging objects depicted in the one or more polarization raw frames.
  • 24. The computer vision system of claim 15, wherein the statistical model is trained using training data comprising training first tensors in the one or more polarization representation spaces and labels.
  • 25. The computer vision system of claim 24, wherein the training data comprises: source training first tensors computed from data captured by a polarization camera; andadditional training first tensors generated from the source training first tensors through affine transformations comprising a rotation.
  • 26. The computer vision system of claim 25, wherein, when the additional training first tensors comprise an angle of linear polarization (AOLP) image, generating the additional training first tensors comprises: rotating the additional training first tensors by an angle; andcounter-rotating pixel values of the AOLP image by the angle.
  • 27. A computer vision system comprising: a polarization camera comprising a polarizing filter; anda processing system comprising a processor and memory storing instructions that, when executed by the processor, cause the processor to: receive one or more polarization raw frames of a scene, the polarization raw frames being captured with a polarizing filter at a different linear polarization angle;extract one or more first tensors in one or more polarization representation spaces from the polarization raw frames; andcompute a prediction regarding one or more optically challenging objects in the scene based on the one or more first tensors in the one or more polarization representation spaces,wherein the prediction comprises a segmentation mask,wherein the memory further stores instructions that, when executed by the processor, cause the processor to compute the prediction by supplying the one or more first tensors to one or more corresponding convolutional neural network (CNN) backbones,wherein each of the one or more CNN backbones is configured to compute a plurality of mode tensors at a plurality of different scales,wherein the memory further stores instructions that, when executed by the processor, cause the processor to: fuse the mode tensors computed at a same scale by the one or more CNN backbones, andwherein the instructions that cause the processor to fuse the mode tensors at the same scale comprise instructions that, when executed by the processor, cause the processor to: concatenate the mode tensors at the same scale;supply the mode tensors to an attention subnetwork to compute one or more attention maps; andweight the mode tensors based on the one or more attention maps to compute a fused tensor for the scale.
  • 28. The computer vision system of claim 27, wherein the instructions that cause the processor to compute the prediction further comprise instructions that, when executed by the processor, cause the processor to supply the fused tensors computed at each scale to a prediction module configured to compute the segmentation mask.
CROSS-REFERENCE TO RELATED APPLICATION(S)

This application is a U.S. National Phase Patent Application of International Application Number PCT/US2020/048604, filed on Aug. 28, 2020, which claims priority to and the benefit of U.S. Provisional Patent Application No. 62/942,113, filed in the United States Patent and Trademark Office on Nov. 30, 2019 and which claims priority to and the benefit of U.S. Provisional Patent Application No. 63/001,445, filed in the United States Patent and Trademark Office on Mar. 29, 2020, the entire disclosure of each of which is incorporated by reference herein.

PCT Information
Filing Document Filing Date Country Kind
PCT/US2020/048604 8/28/2020 WO 00
Publishing Document Publishing Date Country Kind
WO2021/108002 6/3/2021 WO A
US Referenced Citations (1308)
Number Name Date Kind
4124798 Thompson Nov 1978 A
4198646 Alexander et al. Apr 1980 A
4323925 Abell et al. Apr 1982 A
4460449 Montalbano Jul 1984 A
4467365 Murayama et al. Aug 1984 A
4652909 Glenn Mar 1987 A
4888645 Mitchell et al. Dec 1989 A
4899060 Lischke Feb 1990 A
4962425 Rea Oct 1990 A
5005083 Grage et al. Apr 1991 A
5070414 Tsutsumi Dec 1991 A
5144448 Hornbaker et al. Sep 1992 A
5157499 Oguma et al. Oct 1992 A
5325449 Burt et al. Jun 1994 A
5327125 Iwase et al. Jul 1994 A
5463464 Ladewski Oct 1995 A
5475422 Suzuki et al. Dec 1995 A
5488674 Burt et al. Jan 1996 A
5517236 Sergeant et al. May 1996 A
5629524 Stettner et al. May 1997 A
5638461 Fridge Jun 1997 A
5675377 Gibas et al. Oct 1997 A
5703961 Rogina et al. Dec 1997 A
5710875 Hsu et al. Jan 1998 A
5757425 Barton et al. May 1998 A
5793900 Nourbakhsh et al. Aug 1998 A
5801919 Griencewic Sep 1998 A
5808350 Jack et al. Sep 1998 A
5832312 Rieger et al. Nov 1998 A
5833507 Woodgate et al. Nov 1998 A
5867584 Hu Feb 1999 A
5880691 Fossum et al. Mar 1999 A
5911008 Niikura et al. Jun 1999 A
5933190 Dierickx et al. Aug 1999 A
5963664 Kumar et al. Oct 1999 A
5973844 Burger Oct 1999 A
6002743 Telymonde Dec 1999 A
6005607 Uomori et al. Dec 1999 A
6034690 Gallery et al. Mar 2000 A
6069351 Mack May 2000 A
6069365 Chow et al. May 2000 A
6084979 Kanade et al. Jul 2000 A
6095989 Hay et al. Aug 2000 A
6097394 Levoy et al. Aug 2000 A
6124974 Burger Sep 2000 A
6130786 Osawa et al. Oct 2000 A
6137100 Fossum et al. Oct 2000 A
6137535 Meyers Oct 2000 A
6141048 Meyers Oct 2000 A
6160909 Melen Dec 2000 A
6163414 Kikuchi et al. Dec 2000 A
6172352 Liu Jan 2001 B1
6175379 Uomori et al. Jan 2001 B1
6185529 Chen et al. Feb 2001 B1
6198852 Anandan et al. Mar 2001 B1
6205241 Melen Mar 2001 B1
6239909 Hayashi et al. May 2001 B1
6292713 Jouppi et al. Sep 2001 B1
6340994 Margulis et al. Jan 2002 B1
6358862 Ireland et al. Mar 2002 B1
6373518 Sogawa Apr 2002 B1
6419638 Hay et al. Jul 2002 B1
6443579 Myers Sep 2002 B1
6445815 Sato Sep 2002 B1
6476805 Shum et al. Nov 2002 B1
6477260 Shimomura Nov 2002 B1
6502097 Chan et al. Dec 2002 B1
6525302 Dowski, Jr. et al. Feb 2003 B2
6546153 Hoydal Apr 2003 B1
6552742 Seta Apr 2003 B1
6563537 Kawamura et al. May 2003 B1
6571466 Glenn et al. Jun 2003 B1
6603513 Berezin Aug 2003 B1
6611289 Yu et al. Aug 2003 B1
6627896 Hashimoto et al. Sep 2003 B1
6628330 Lin Sep 2003 B1
6628845 Stone et al. Sep 2003 B1
6635941 Suda Oct 2003 B2
6639596 Shum et al. Oct 2003 B1
6647142 Beardsley Nov 2003 B1
6657218 Noda Dec 2003 B2
6671399 Berestov Dec 2003 B1
6674892 Melen Jan 2004 B1
6750488 Driescher et al. Jun 2004 B1
6750904 Lambert Jun 2004 B1
6765617 Tangen et al. Jul 2004 B1
6771833 Edgar Aug 2004 B1
6774941 Boisvert et al. Aug 2004 B1
6788338 Dinev et al. Sep 2004 B1
6795253 Shinohara Sep 2004 B2
6801653 Wu et al. Oct 2004 B1
6819328 Moriwaki et al. Nov 2004 B1
6819358 Kagle et al. Nov 2004 B1
6833863 Clemens Dec 2004 B1
6879735 Portniaguine et al. Apr 2005 B1
6897454 Sasaki et al. May 2005 B2
6903770 Kobayashi et al. Jun 2005 B1
6909121 Nishikawa Jun 2005 B2
6917702 Beardsley Jul 2005 B2
6927922 George et al. Aug 2005 B2
6958862 Joseph Oct 2005 B1
6985175 Iwai et al. Jan 2006 B2
7013318 Rosengard et al. Mar 2006 B2
7015954 Foote et al. Mar 2006 B1
7085409 Sawhney et al. Aug 2006 B2
7161614 Yamashita et al. Jan 2007 B1
7199348 Olsen et al. Apr 2007 B2
7206449 Raskar et al. Apr 2007 B2
7215364 Wachtel et al. May 2007 B2
7235785 Hornback et al. Jun 2007 B2
7245761 Swaminathan et al. Jul 2007 B2
7262799 Suda Aug 2007 B2
7292735 Blake et al. Nov 2007 B2
7295697 Satoh Nov 2007 B1
7333651 Kim et al. Feb 2008 B1
7369165 Bosco et al. May 2008 B2
7391572 Jacobowitz et al. Jun 2008 B2
7408725 Sato Aug 2008 B2
7425984 Chen et al. Sep 2008 B2
7430312 Gu Sep 2008 B2
7471765 Jaffray et al. Dec 2008 B2
7496293 Shamir et al. Feb 2009 B2
7564019 Olsen et al. Jul 2009 B2
7599547 Sun et al. Oct 2009 B2
7606484 Richards et al. Oct 2009 B1
7620265 Wolff et al. Nov 2009 B1
7633511 Shum et al. Dec 2009 B2
7639435 Chiang Dec 2009 B2
7639838 Nims Dec 2009 B2
7646549 Zalevsky et al. Jan 2010 B2
7657090 Omatsu et al. Feb 2010 B2
7667824 Moran Feb 2010 B1
7675080 Boettiger Mar 2010 B2
7675681 Tomikawa et al. Mar 2010 B2
7706634 Schmitt et al. Apr 2010 B2
7723662 Levoy et al. May 2010 B2
7738013 Galambos et al. Jun 2010 B2
7741620 Doering et al. Jun 2010 B2
7782364 Smith Aug 2010 B2
7826153 Hong Nov 2010 B2
7840067 Shen et al. Nov 2010 B2
7912673 Hébert et al. Mar 2011 B2
7924321 Nayar et al. Apr 2011 B2
7956871 Fainstain et al. Jun 2011 B2
7965314 Miller et al. Jun 2011 B1
7973834 Yang Jul 2011 B2
7986018 Rennie Jul 2011 B2
7990447 Honda et al. Aug 2011 B2
8000498 Shih et al. Aug 2011 B2
8013904 Tan et al. Sep 2011 B2
8027531 Wilburn et al. Sep 2011 B2
8044994 Vetro et al. Oct 2011 B2
8055466 Bryll Nov 2011 B2
8077245 Adamo et al. Dec 2011 B2
8089515 Chebil et al. Jan 2012 B2
8098297 Crisan et al. Jan 2012 B2
8098304 Pinto et al. Jan 2012 B2
8106949 Tan et al. Jan 2012 B2
8111910 Tanaka Feb 2012 B2
8126279 Marcellin et al. Feb 2012 B2
8130120 Kawabata et al. Mar 2012 B2
8131097 Lelescu et al. Mar 2012 B2
8149323 Li et al. Apr 2012 B2
8164629 Zhang Apr 2012 B1
8169486 Corcoran et al. May 2012 B2
8180145 Wu et al. May 2012 B2
8189065 Georgiev et al. May 2012 B2
8189089 Georgiev et al. May 2012 B1
8194296 Compton et al. Jun 2012 B2
8212914 Chiu Jul 2012 B2
8213711 Tam Jul 2012 B2
8231814 Duparre Jul 2012 B2
8242426 Ward et al. Aug 2012 B2
8244027 Takahashi Aug 2012 B2
8244058 Intwala et al. Aug 2012 B1
8254668 Mashitani et al. Aug 2012 B2
8279325 Pitts et al. Oct 2012 B2
8280194 Wong et al. Oct 2012 B2
8284240 Saint-Pierre et al. Oct 2012 B2
8289409 Chang Oct 2012 B2
8289440 Pitts et al. Oct 2012 B2
8290358 Georgiev Oct 2012 B1
8294099 Blackwell, Jr. Oct 2012 B2
8294754 Jung et al. Oct 2012 B2
8300085 Yang et al. Oct 2012 B2
8305456 McMahon Nov 2012 B1
8315476 Georgiev et al. Nov 2012 B1
8345144 Georgiev et al. Jan 2013 B1
8350957 Schechner et al. Jan 2013 B2
8360574 Ishak et al. Jan 2013 B2
8400555 Georgiev et al. Mar 2013 B1
8406562 Bassi et al. Mar 2013 B2
8411146 Twede Apr 2013 B2
8416282 Lablans Apr 2013 B2
8446492 Nakano et al. May 2013 B2
8456517 Spektor et al. Jun 2013 B2
8471895 Banks Jun 2013 B2
8493496 Freedman et al. Jul 2013 B2
8514291 Chang Aug 2013 B2
8514491 Duparre Aug 2013 B2
8541730 Inuiya Sep 2013 B2
8542933 Venkataraman et al. Sep 2013 B2
8553093 Wong et al. Oct 2013 B2
8558929 Tredwell Oct 2013 B2
8559705 Ng Oct 2013 B2
8559756 Georgiev et al. Oct 2013 B2
8565547 Strandemar Oct 2013 B2
8576302 Yoshikawa Nov 2013 B2
8577183 Robinson Nov 2013 B2
8581995 Lin et al. Nov 2013 B2
8619082 Ciurea et al. Dec 2013 B1
8648918 Kauker et al. Feb 2014 B2
8648919 Mantzel et al. Feb 2014 B2
8655052 Spooner et al. Feb 2014 B2
8682107 Yoon et al. Mar 2014 B2
8687087 Pertsel et al. Apr 2014 B2
8692893 McMahon Apr 2014 B2
8754941 Sarwari et al. Jun 2014 B1
8773536 Zhang Jul 2014 B1
8780113 Ciurea et al. Jul 2014 B1
8787691 Takahashi et al. Jul 2014 B2
8792710 Keselman Jul 2014 B2
8804255 Duparre Aug 2014 B2
8823813 Mantzel et al. Sep 2014 B2
8830375 Ludwig Sep 2014 B2
8831367 Venkataraman et al. Sep 2014 B2
8831377 Pitts et al. Sep 2014 B2
8836793 Kriesel et al. Sep 2014 B1
8842201 Tajiri Sep 2014 B2
8854433 Rafii Oct 2014 B1
8854462 Herbin et al. Oct 2014 B2
8861089 Duparre Oct 2014 B2
8866912 Mullis Oct 2014 B2
8866920 Venkataraman et al. Oct 2014 B2
8866951 Keelan Oct 2014 B2
8878950 Lelescu et al. Nov 2014 B2
8885059 Venkataraman et al. Nov 2014 B1
8885922 Ito et al. Nov 2014 B2
8896594 Xiong et al. Nov 2014 B2
8896719 Venkataraman et al. Nov 2014 B1
8902321 Venkataraman et al. Dec 2014 B2
8928793 McMahon Jan 2015 B2
8977038 Tian et al. Mar 2015 B2
9001226 Ng et al. Apr 2015 B1
9019426 Han et al. Apr 2015 B2
9025894 Venkataraman et al. May 2015 B2
9025895 Venkataraman et al. May 2015 B2
9030528 Pesach et al. May 2015 B2
9031335 Venkataraman et al. May 2015 B2
9031342 Venkataraman May 2015 B2
9031343 Venkataraman May 2015 B2
9036928 Venkataraman May 2015 B2
9036931 Venkataraman et al. May 2015 B2
9041823 Venkataraman et al. May 2015 B2
9041824 Lelescu et al. May 2015 B2
9041829 Venkataraman et al. May 2015 B2
9042667 Venkataraman et al. May 2015 B2
9047684 Lelescu et al. Jun 2015 B2
9049367 Venkataraman et al. Jun 2015 B2
9055233 Venkataraman et al. Jun 2015 B2
9060120 Venkataraman et al. Jun 2015 B2
9060124 Venkataraman et al. Jun 2015 B2
9077893 Venkataraman et al. Jul 2015 B2
9094661 Venkataraman et al. Jul 2015 B2
9100586 McMahon et al. Aug 2015 B2
9100635 Duparre et al. Aug 2015 B2
9123117 Ciurea et al. Sep 2015 B2
9123118 Ciurea et al. Sep 2015 B2
9124815 Venkataraman et al. Sep 2015 B2
9124831 Mullis Sep 2015 B2
9124864 Mullis Sep 2015 B2
9128228 Duparre Sep 2015 B2
9129183 Venkataraman et al. Sep 2015 B2
9129377 Ciurea et al. Sep 2015 B2
9143711 McMahon Sep 2015 B2
9147254 Florian et al. Sep 2015 B2
9185276 Rodda et al. Nov 2015 B2
9188765 Venkataraman et al. Nov 2015 B2
9191580 Venkataraman et al. Nov 2015 B2
9197821 McMahon Nov 2015 B2
9210392 Nisenzon et al. Dec 2015 B2
9214013 Venkataraman et al. Dec 2015 B2
9235898 Venkataraman et al. Jan 2016 B2
9235900 Ciurea et al. Jan 2016 B2
9240049 Ciurea et al. Jan 2016 B2
9247117 Jacques Jan 2016 B2
9253380 Venkataraman et al. Feb 2016 B2
9253397 Lee et al. Feb 2016 B2
9256974 Hines Feb 2016 B1
9264592 Rodda et al. Feb 2016 B2
9264610 Duparre Feb 2016 B2
9361662 Lelescu et al. Jun 2016 B2
9374512 Venkataraman et al. Jun 2016 B2
9412206 McMahon et al. Aug 2016 B2
9413953 Maeda Aug 2016 B2
9426343 Rodda et al. Aug 2016 B2
9426361 Venkataraman et al. Aug 2016 B2
9438888 Venkataraman et al. Sep 2016 B2
9445003 Lelescu et al. Sep 2016 B1
9456134 Venkataraman et al. Sep 2016 B2
9456196 Kim et al. Sep 2016 B2
9462164 Venkataraman et al. Oct 2016 B2
9485496 Venkataraman et al. Nov 2016 B2
9497370 Venkataraman et al. Nov 2016 B2
9497429 Mullis et al. Nov 2016 B2
9516222 Duparre et al. Dec 2016 B2
9519972 Venkataraman et al. Dec 2016 B2
9521319 Rodda et al. Dec 2016 B2
9521416 McMahon et al. Dec 2016 B1
9536166 Venkataraman et al. Jan 2017 B2
9576369 Venkataraman et al. Feb 2017 B2
9578237 Duparre et al. Feb 2017 B2
9578259 Molina Feb 2017 B2
9602805 Venkataraman et al. Mar 2017 B2
9633442 Venkataraman et al. Apr 2017 B2
9635274 Lin et al. Apr 2017 B2
9638883 Duparre May 2017 B1
9661310 Deng et al. May 2017 B2
9706132 Nisenzon et al. Jul 2017 B2
9712759 Venkataraman et al. Jul 2017 B2
9729865 Kuo et al. Aug 2017 B1
9733486 Lelescu et al. Aug 2017 B2
9741118 Mullis Aug 2017 B2
9743051 Venkataraman et al. Aug 2017 B2
9749547 Venkataraman et al. Aug 2017 B2
9749568 McMahon Aug 2017 B2
9754422 McMahon et al. Sep 2017 B2
9766380 Duparre et al. Sep 2017 B2
9769365 Jannard Sep 2017 B1
9774789 Ciurea et al. Sep 2017 B2
9774831 Venkataraman et al. Sep 2017 B2
9787911 McMahon et al. Oct 2017 B2
9794476 Nayar et al. Oct 2017 B2
9800856 Venkataraman et al. Oct 2017 B2
9800859 Venkataraman et al. Oct 2017 B2
9807382 Duparre et al. Oct 2017 B2
9811753 Venkataraman et al. Nov 2017 B2
9813616 Lelescu et al. Nov 2017 B2
9813617 Venkataraman et al. Nov 2017 B2
9826212 Newton et al. Nov 2017 B2
9858673 Ciurea et al. Jan 2018 B2
9864921 Venkataraman et al. Jan 2018 B2
9866739 McMahon Jan 2018 B2
9888194 Duparre Feb 2018 B2
9892522 Smirnov et al. Feb 2018 B2
9898856 Yang et al. Feb 2018 B2
9917998 Venkataraman et al. Mar 2018 B2
9924092 Rodda et al. Mar 2018 B2
9936148 McMahon Apr 2018 B2
9942474 Venkataraman et al. Apr 2018 B2
9955070 Lelescu et al. Apr 2018 B2
9986224 Mullis May 2018 B2
10009538 Venkataraman et al. Jun 2018 B2
10019816 Venkataraman et al. Jul 2018 B2
10027901 Venkataraman et al. Jul 2018 B2
10089740 Srikanth et al. Oct 2018 B2
10091405 Molina Oct 2018 B2
10119808 Venkataraman et al. Nov 2018 B2
10122993 Venkataraman et al. Nov 2018 B2
10127682 Mullis Nov 2018 B2
10142560 Venkataraman et al. Nov 2018 B2
10182216 Mullis et al. Jan 2019 B2
10218889 McMahan Feb 2019 B2
10225543 Mullis Mar 2019 B2
10250871 Ciurea et al. Apr 2019 B2
10261219 Duparre et al. Apr 2019 B2
10275676 Venkataraman et al. Apr 2019 B2
10306120 Duparre May 2019 B2
10311649 McMohan et al. Jun 2019 B2
10334241 Duparre et al. Jun 2019 B2
10366472 Lelescu et al. Jul 2019 B2
10375302 Nayar et al. Aug 2019 B2
10375319 Venkataraman et al. Aug 2019 B2
10380752 Ciurea et al. Aug 2019 B2
10390005 Nisenzon et al. Aug 2019 B2
10412314 McMahon et al. Sep 2019 B2
10430682 Venkataraman et al. Oct 2019 B2
10455168 McMahon Oct 2019 B2
10455218 Venkataraman et al. Oct 2019 B2
10462362 Lelescu et al. Oct 2019 B2
10482618 Jain et al. Nov 2019 B2
10540806 Yang et al. Jan 2020 B2
10542208 Lelescu et al. Jan 2020 B2
10547772 Molina Jan 2020 B2
10560684 Mullis Feb 2020 B2
10574905 Srikanth et al. Feb 2020 B2
10638099 Mullis et al. Apr 2020 B2
10643383 Venkataraman May 2020 B2
10659751 Briggs et al. May 2020 B1
10674138 Venkataraman et al. Jun 2020 B2
10694114 Venkataraman et al. Jun 2020 B2
10708492 Venkataraman et al. Jul 2020 B2
10735635 Duparre Aug 2020 B2
10742861 McMahon Aug 2020 B2
10767981 Venkataraman et al. Sep 2020 B2
10805589 Venkataraman et al. Oct 2020 B2
10818026 Jain et al. Oct 2020 B2
10839485 Lelescu et al. Nov 2020 B2
10909707 Ciurea et al. Feb 2021 B2
10944961 Ciurea et al. Mar 2021 B2
10958892 Mullis Mar 2021 B2
10976239 Hart Apr 2021 B1
10984276 Venkataraman et al. Apr 2021 B2
11022725 Duparre et al. Jun 2021 B2
11024046 Venkataraman Jun 2021 B2
20010005225 Clark et al. Jun 2001 A1
20010019621 Hanna et al. Sep 2001 A1
20010028038 Hamaguchi et al. Oct 2001 A1
20010038387 Tomooka et al. Nov 2001 A1
20020003669 Kedar et al. Jan 2002 A1
20020012056 Trevino et al. Jan 2002 A1
20020015536 Warren et al. Feb 2002 A1
20020027608 Johnson et al. Mar 2002 A1
20020028014 Ono Mar 2002 A1
20020039438 Mori et al. Apr 2002 A1
20020057845 Fossum et al. May 2002 A1
20020061131 Sawhney et al. May 2002 A1
20020063807 Margulis May 2002 A1
20020075450 Aratani et al. Jun 2002 A1
20020087403 Meyers et al. Jul 2002 A1
20020089596 Yasuo Jul 2002 A1
20020094027 Sato et al. Jul 2002 A1
20020101528 Lee et al. Aug 2002 A1
20020113867 Takigawa et al. Aug 2002 A1
20020113888 Sonoda et al. Aug 2002 A1
20020118113 Oku et al. Aug 2002 A1
20020120634 Min et al. Aug 2002 A1
20020122113 Foote Sep 2002 A1
20020163054 Suda Nov 2002 A1
20020167537 Trajkovic Nov 2002 A1
20020171666 Endo et al. Nov 2002 A1
20020177054 Saitoh et al. Nov 2002 A1
20020190991 Efran et al. Dec 2002 A1
20020195548 Dowski, Jr. et al. Dec 2002 A1
20030025227 Daniell Feb 2003 A1
20030026474 Yano Feb 2003 A1
20030086079 Barth et al. May 2003 A1
20030124763 Fan et al. Jul 2003 A1
20030140347 Varsa Jul 2003 A1
20030156189 Utsumi et al. Aug 2003 A1
20030179418 Wengender et al. Sep 2003 A1
20030188659 Merry et al. Oct 2003 A1
20030190072 Adkins et al. Oct 2003 A1
20030198377 Ng Oct 2003 A1
20030211405 Venkataraman Nov 2003 A1
20030231179 Suzuki Dec 2003 A1
20040003409 Berstis Jan 2004 A1
20040008271 Hagimori et al. Jan 2004 A1
20040012689 Tinnerino et al. Jan 2004 A1
20040027358 Nakao Feb 2004 A1
20040047274 Amanai Mar 2004 A1
20040050104 Ghosh et al. Mar 2004 A1
20040056966 Schechner et al. Mar 2004 A1
20040061787 Liu et al. Apr 2004 A1
20040066454 Otani et al. Apr 2004 A1
20040071367 Irani et al. Apr 2004 A1
20040075654 Hsiao et al. Apr 2004 A1
20040096119 Williams et al. May 2004 A1
20040100570 Shizukuishi May 2004 A1
20040105021 Hu Jun 2004 A1
20040114807 Lelescu et al. Jun 2004 A1
20040141659 Zhang Jul 2004 A1
20040151401 Sawhney et al. Aug 2004 A1
20040165090 Ning Aug 2004 A1
20040169617 Yelton et al. Sep 2004 A1
20040170340 Tipping et al. Sep 2004 A1
20040174439 Upton Sep 2004 A1
20040179008 Gordon et al. Sep 2004 A1
20040179834 Szajewski et al. Sep 2004 A1
20040196379 Chen et al. Oct 2004 A1
20040207600 Zhang et al. Oct 2004 A1
20040207836 Chhibber et al. Oct 2004 A1
20040212734 Macinnis et al. Oct 2004 A1
20040213449 Safaee-Rad et al. Oct 2004 A1
20040218809 Blake et al. Nov 2004 A1
20040234873 Venkataraman Nov 2004 A1
20040239782 Equitz et al. Dec 2004 A1
20040239885 Jaynes et al. Dec 2004 A1
20040240052 Minefuji et al. Dec 2004 A1
20040251509 Choi Dec 2004 A1
20040264806 Herley Dec 2004 A1
20050006477 Patel Jan 2005 A1
20050007461 Chou et al. Jan 2005 A1
20050009313 Suzuki et al. Jan 2005 A1
20050010621 Pinto et al. Jan 2005 A1
20050012035 Miller Jan 2005 A1
20050036135 Earthman et al. Feb 2005 A1
20050036778 DeMonte Feb 2005 A1
20050047678 Jones et al. Mar 2005 A1
20050048690 Yamamoto Mar 2005 A1
20050068436 Fraenkel et al. Mar 2005 A1
20050083531 Millerd et al. Apr 2005 A1
20050084179 Hanna et al. Apr 2005 A1
20050111705 Waupotitsch et al. May 2005 A1
20050117015 Cutler Jun 2005 A1
20050128509 Tokkonen et al. Jun 2005 A1
20050128595 Shimizu Jun 2005 A1
20050132098 Sonoda et al. Jun 2005 A1
20050134698 Schroeder et al. Jun 2005 A1
20050134699 Nagashima Jun 2005 A1
20050134712 Gruhlke et al. Jun 2005 A1
20050147277 Higaki et al. Jul 2005 A1
20050151759 Gonzalez-Banos et al. Jul 2005 A1
20050168924 Wu et al. Aug 2005 A1
20050175257 Kuroki Aug 2005 A1
20050185711 Pfister et al. Aug 2005 A1
20050203380 Sauer et al. Sep 2005 A1
20050205785 Hornback et al. Sep 2005 A1
20050219264 Shum et al. Oct 2005 A1
20050219363 Kohler et al. Oct 2005 A1
20050224843 Boemler Oct 2005 A1
20050225654 Feldman et al. Oct 2005 A1
20050265633 Piacentino et al. Dec 2005 A1
20050275946 Choo et al. Dec 2005 A1
20050286612 Takanashi Dec 2005 A1
20050286756 Hong et al. Dec 2005 A1
20060002635 Nestares et al. Jan 2006 A1
20060007331 Izumi et al. Jan 2006 A1
20060013318 Webb et al. Jan 2006 A1
20060018509 Miyoshi Jan 2006 A1
20060023197 Joel Feb 2006 A1
20060023314 Boettiger et al. Feb 2006 A1
20060028476 Sobel et al. Feb 2006 A1
20060029270 Berestov et al. Feb 2006 A1
20060029271 Miyoshi et al. Feb 2006 A1
20060033005 Jerdev et al. Feb 2006 A1
20060034003 Zalevsky Feb 2006 A1
20060034531 Poon et al. Feb 2006 A1
20060035415 Wood Feb 2006 A1
20060038891 Okutomi et al. Feb 2006 A1
20060039611 Rother et al. Feb 2006 A1
20060046204 Ono et al. Mar 2006 A1
20060049930 Zruya et al. Mar 2006 A1
20060050980 Kohashi et al. Mar 2006 A1
20060054780 Garrood et al. Mar 2006 A1
20060054782 Olsen et al. Mar 2006 A1
20060055811 Frtiz et al. Mar 2006 A1
20060069478 Iwama Mar 2006 A1
20060072029 Miyatake et al. Apr 2006 A1
20060087747 Ohzawa et al. Apr 2006 A1
20060098888 Morishita May 2006 A1
20060103754 Wenstrand et al. May 2006 A1
20060119597 Oshino Jun 2006 A1
20060125936 Gruhike et al. Jun 2006 A1
20060138322 Costello et al. Jun 2006 A1
20060139475 Esch et al. Jun 2006 A1
20060152803 Provitola Jul 2006 A1
20060153290 Watabe et al. Jul 2006 A1
20060157640 Perlman et al. Jul 2006 A1
20060159369 Young Jul 2006 A1
20060176566 Boettiger et al. Aug 2006 A1
20060187322 Janson, Jr. et al. Aug 2006 A1
20060187338 May et al. Aug 2006 A1
20060197937 Bamji et al. Sep 2006 A1
20060203100 Ajito et al. Sep 2006 A1
20060203113 Wada et al. Sep 2006 A1
20060210146 Gu Sep 2006 A1
20060210186 Berkner Sep 2006 A1
20060214085 Olsen et al. Sep 2006 A1
20060215879 Whitaker Sep 2006 A1
20060215924 Steinberg et al. Sep 2006 A1
20060221250 Rossbach et al. Oct 2006 A1
20060239549 Kelly et al. Oct 2006 A1
20060243889 Farnworth et al. Nov 2006 A1
20060251410 Trutna Nov 2006 A1
20060274174 Tewinkle Dec 2006 A1
20060278948 Yamaguchi et al. Dec 2006 A1
20060279648 Senba et al. Dec 2006 A1
20060289772 Johnson et al. Dec 2006 A1
20070002159 Olsen et al. Jan 2007 A1
20070008575 Yu et al. Jan 2007 A1
20070009150 Suwa Jan 2007 A1
20070024614 Tam et al. Feb 2007 A1
20070030356 Yea et al. Feb 2007 A1
20070035707 Margulis Feb 2007 A1
20070036427 Nakamura et al. Feb 2007 A1
20070040828 Zalevsky et al. Feb 2007 A1
20070040922 McKee et al. Feb 2007 A1
20070041391 Lin et al. Feb 2007 A1
20070052825 Cho Mar 2007 A1
20070083114 Yang et al. Apr 2007 A1
20070085917 Kobayashi Apr 2007 A1
20070092245 Bazakos et al. Apr 2007 A1
20070102622 Olsen et al. May 2007 A1
20070116447 Ye May 2007 A1
20070126898 Feldman et al. Jun 2007 A1
20070127831 Venkataraman Jun 2007 A1
20070139333 Sato et al. Jun 2007 A1
20070140685 Wu Jun 2007 A1
20070146503 Shiraki Jun 2007 A1
20070146511 Kinoshita et al. Jun 2007 A1
20070153335 Hosaka Jul 2007 A1
20070158427 Zhu et al. Jul 2007 A1
20070159541 Sparks et al. Jul 2007 A1
20070160310 Tanida et al. Jul 2007 A1
20070165931 Higaki Jul 2007 A1
20070166447 Ur-Rehman et al. Jul 2007 A1
20070171290 Kroger Jul 2007 A1
20070177004 Kolehmainen et al. Aug 2007 A1
20070182843 Shimamura et al. Aug 2007 A1
20070201859 Sarrat Aug 2007 A1
20070206241 Smith et al. Sep 2007 A1
20070211164 Olsen et al. Sep 2007 A1
20070216765 Wong et al. Sep 2007 A1
20070225600 Weibrecht et al. Sep 2007 A1
20070228256 Mentzer et al. Oct 2007 A1
20070236595 Pan et al. Oct 2007 A1
20070242141 Ciurea Oct 2007 A1
20070247517 Zhang et al. Oct 2007 A1
20070257184 Olsen et al. Nov 2007 A1
20070258006 Olsen et al. Nov 2007 A1
20070258706 Raskar et al. Nov 2007 A1
20070263113 Baek et al. Nov 2007 A1
20070263114 Gurevich et al. Nov 2007 A1
20070268374 Robinson Nov 2007 A1
20070291995 Rivera Dec 2007 A1
20070296721 Chang et al. Dec 2007 A1
20070296832 Ota et al. Dec 2007 A1
20070296835 Olsen et al. Dec 2007 A1
20070296846 Barman et al. Dec 2007 A1
20070296847 Chang et al. Dec 2007 A1
20070297696 Hamza et al. Dec 2007 A1
20080006859 Mionetto Jan 2008 A1
20080019611 Larkin et al. Jan 2008 A1
20080024683 Damera-Venkata et al. Jan 2008 A1
20080025649 Liu et al. Jan 2008 A1
20080030592 Border et al. Feb 2008 A1
20080030597 Olsen et al. Feb 2008 A1
20080043095 Vetro et al. Feb 2008 A1
20080043096 Vetro et al. Feb 2008 A1
20080044170 Yap et al. Feb 2008 A1
20080054518 Ra et al. Mar 2008 A1
20080056302 Erdal et al. Mar 2008 A1
20080062164 Bassi et al. Mar 2008 A1
20080079805 Takagi et al. Apr 2008 A1
20080080028 Bakin et al. Apr 2008 A1
20080084486 Enge et al. Apr 2008 A1
20080088793 Sverdrup et al. Apr 2008 A1
20080095523 Schilling-Benz et al. Apr 2008 A1
20080099804 Venezia et al. May 2008 A1
20080106620 Sawachi May 2008 A1
20080112059 Choi et al. May 2008 A1
20080112635 Kondo et al. May 2008 A1
20080117289 Schowengerdt et al. May 2008 A1
20080118241 TeKolste et al. May 2008 A1
20080131019 Ng Jun 2008 A1
20080131107 Ueno Jun 2008 A1
20080151097 Chen et al. Jun 2008 A1
20080152213 Medioni et al. Jun 2008 A1
20080152215 Horie et al. Jun 2008 A1
20080152296 Oh et al. Jun 2008 A1
20080156991 Hu et al. Jul 2008 A1
20080158259 Kempf et al. Jul 2008 A1
20080158375 Kakkori et al. Jul 2008 A1
20080158698 Chang et al. Jul 2008 A1
20080165257 Boettiger Jul 2008 A1
20080174670 Olsen et al. Jul 2008 A1
20080187305 Raskar et al. Aug 2008 A1
20080193026 Horie et al. Aug 2008 A1
20080208506 Kuwata Aug 2008 A1
20080211737 Kim et al. Sep 2008 A1
20080218610 Chapman et al. Sep 2008 A1
20080218611 Parulski et al. Sep 2008 A1
20080218612 Border et al. Sep 2008 A1
20080218613 Janson et al. Sep 2008 A1
20080219654 Border et al. Sep 2008 A1
20080239116 Smith Oct 2008 A1
20080240598 Hasegawa Oct 2008 A1
20080246866 Kinoshita et al. Oct 2008 A1
20080247638 Tanida et al. Oct 2008 A1
20080247653 Moussavi et al. Oct 2008 A1
20080272416 Yun Nov 2008 A1
20080273751 Yuan et al. Nov 2008 A1
20080278591 Barna et al. Nov 2008 A1
20080278610 Boettiger Nov 2008 A1
20080284880 Numata Nov 2008 A1
20080291295 Kato et al. Nov 2008 A1
20080298674 Baker et al. Dec 2008 A1
20080310501 Ward et al. Dec 2008 A1
20090027543 Kanehiro Jan 2009 A1
20090050946 Duparre et al. Feb 2009 A1
20090052743 Techmer Feb 2009 A1
20090060281 Tanida et al. Mar 2009 A1
20090066693 Carson Mar 2009 A1
20090079862 Subbotin Mar 2009 A1
20090086074 Li et al. Apr 2009 A1
20090091645 Trimeche et al. Apr 2009 A1
20090091806 Inuiya Apr 2009 A1
20090092363 Daum et al. Apr 2009 A1
20090096050 Park Apr 2009 A1
20090102956 Georgiev Apr 2009 A1
20090103792 Rahn et al. Apr 2009 A1
20090109306 Shan et al. Apr 2009 A1
20090127430 Hirasawa et al. May 2009 A1
20090128644 Camp, Jr. et al. May 2009 A1
20090128833 Yahav May 2009 A1
20090129667 Ho et al. May 2009 A1
20090140131 Utagawa Jun 2009 A1
20090141933 Wagg Jun 2009 A1
20090147919 Goto et al. Jun 2009 A1
20090152664 Klem et al. Jun 2009 A1
20090167922 Perlman et al. Jul 2009 A1
20090167923 Safaee-Rad et al. Jul 2009 A1
20090167934 Gupta Jul 2009 A1
20090175349 Ye et al. Jul 2009 A1
20090179142 Duparre et al. Jul 2009 A1
20090180021 Kikuchi et al. Jul 2009 A1
20090200622 Tai et al. Aug 2009 A1
20090201371 Matsuda et al. Aug 2009 A1
20090207235 Francini et al. Aug 2009 A1
20090219435 Yuan Sep 2009 A1
20090225203 Tanida et al. Sep 2009 A1
20090237520 Kaneko et al. Sep 2009 A1
20090237662 Chang Sep 2009 A1
20090245573 Saptharishi et al. Oct 2009 A1
20090245637 Barman et al. Oct 2009 A1
20090256947 Ciurea et al. Oct 2009 A1
20090263017 Tanbakuchi Oct 2009 A1
20090268192 Koenck et al. Oct 2009 A1
20090268970 Babacan et al. Oct 2009 A1
20090268983 Stone et al. Oct 2009 A1
20090273663 Yoshida Nov 2009 A1
20090274387 Jin Nov 2009 A1
20090279800 Uetani et al. Nov 2009 A1
20090284651 Srinivasan Nov 2009 A1
20090290811 Imai Nov 2009 A1
20090295933 Schechner Dec 2009 A1
20090297056 Lelescu et al. Dec 2009 A1
20090302205 Olsen et al. Dec 2009 A9
20090317061 Jung et al. Dec 2009 A1
20090322876 Lee et al. Dec 2009 A1
20090323195 Hembree et al. Dec 2009 A1
20090323206 Oliver et al. Dec 2009 A1
20090324118 Maslov et al. Dec 2009 A1
20100002126 Wenstrand et al. Jan 2010 A1
20100002313 Duparre et al. Jan 2010 A1
20100002314 Duparre Jan 2010 A1
20100007714 Kim et al. Jan 2010 A1
20100013927 Nixon Jan 2010 A1
20100044815 Chang Feb 2010 A1
20100045809 Packard Feb 2010 A1
20100053342 Hwang et al. Mar 2010 A1
20100053347 Agarwala et al. Mar 2010 A1
20100053415 Yun Mar 2010 A1
20100053600 Tanida et al. Mar 2010 A1
20100060746 Olsen et al. Mar 2010 A9
20100073463 Momonoi et al. Mar 2010 A1
20100074532 Gordon et al. Mar 2010 A1
20100085351 Deb et al. Apr 2010 A1
20100085425 Tan Apr 2010 A1
20100086227 Sun et al. Apr 2010 A1
20100091389 Henriksen et al. Apr 2010 A1
20100097444 Lablans Apr 2010 A1
20100097491 Farina et al. Apr 2010 A1
20100103175 Okutomi et al. Apr 2010 A1
20100103259 Tanida et al. Apr 2010 A1
20100103308 Butterfield et al. Apr 2010 A1
20100111444 Coffman May 2010 A1
20100118127 Nam et al. May 2010 A1
20100128145 Pitts et al. May 2010 A1
20100129048 Pitts et al. May 2010 A1
20100133230 Henriksen et al. Jun 2010 A1
20100133418 Sargent et al. Jun 2010 A1
20100141802 Knight et al. Jun 2010 A1
20100142828 Chang et al. Jun 2010 A1
20100142839 Lakus-Becker Jun 2010 A1
20100157073 Kondo et al. Jun 2010 A1
20100165152 Lim Jul 2010 A1
20100166410 Chang Jul 2010 A1
20100171866 Brady et al. Jul 2010 A1
20100177411 Hegde et al. Jul 2010 A1
20100182406 Benitez Jul 2010 A1
20100194860 Mentz et al. Aug 2010 A1
20100194901 van Hoorebeke et al. Aug 2010 A1
20100195716 Klein Gunnewiek et al. Aug 2010 A1
20100201809 Oyama et al. Aug 2010 A1
20100201834 Maruyama et al. Aug 2010 A1
20100202054 Niederer Aug 2010 A1
20100202683 Robinson Aug 2010 A1
20100208100 Olsen et al. Aug 2010 A9
20100214423 Ogawa Aug 2010 A1
20100220212 Perlman et al. Sep 2010 A1
20100223237 Mishra et al. Sep 2010 A1
20100225740 Jung et al. Sep 2010 A1
20100231285 Boomer et al. Sep 2010 A1
20100238327 Griffith et al. Sep 2010 A1
20100244165 Lake et al. Sep 2010 A1
20100245684 Xiao et al. Sep 2010 A1
20100254627 Panahpour Tehrani et al. Oct 2010 A1
20100259610 Petersen Oct 2010 A1
20100265346 Iizuka Oct 2010 A1
20100265381 Yamamoto et al. Oct 2010 A1
20100265385 Knight et al. Oct 2010 A1
20100277629 Tanaka Nov 2010 A1
20100281070 Chan et al. Nov 2010 A1
20100289941 Ito et al. Nov 2010 A1
20100290483 Park et al. Nov 2010 A1
20100296724 Chang et al. Nov 2010 A1
20100302423 Adams, Jr. et al. Dec 2010 A1
20100309292 Ho et al. Dec 2010 A1
20100309368 Choi et al. Dec 2010 A1
20100321595 Chiu Dec 2010 A1
20100321640 Yeh et al. Dec 2010 A1
20100329528 Hajnal et al. Dec 2010 A1
20100329556 Mitarai et al. Dec 2010 A1
20100329582 Albu et al. Dec 2010 A1
20110001037 Tewinkle Jan 2011 A1
20110013006 Uzenbajakava et al. Jan 2011 A1
20110018973 Takayama Jan 2011 A1
20110019048 Raynor et al. Jan 2011 A1
20110019243 Constant, Jr. et al. Jan 2011 A1
20110031381 Tay et al. Feb 2011 A1
20110032341 Ignatov et al. Feb 2011 A1
20110032370 Ludwig Feb 2011 A1
20110033129 Robinson Feb 2011 A1
20110038536 Gong Feb 2011 A1
20110043604 Peleg et al. Feb 2011 A1
20110043613 Rohaly et al. Feb 2011 A1
20110043661 Podoleanu Feb 2011 A1
20110043665 Ogasahara Feb 2011 A1
20110043668 McKinnon et al. Feb 2011 A1
20110044502 Liu et al. Feb 2011 A1
20110051255 Lee et al. Mar 2011 A1
20110055729 Mason et al. Mar 2011 A1
20110064327 Dagher et al. Mar 2011 A1
20110069189 Venkataraman et al. Mar 2011 A1
20110080487 Venkataraman et al. Apr 2011 A1
20110084893 Lee et al. Apr 2011 A1
20110085028 Samadani et al. Apr 2011 A1
20110090217 Mashitani et al. Apr 2011 A1
20110102553 Corcoran et al. May 2011 A1
20110108708 Olsen et al. May 2011 A1
20110115886 Nguyen et al. May 2011 A1
20110121421 Charbon et al. May 2011 A1
20110122308 Duparre May 2011 A1
20110128393 Tavi et al. Jun 2011 A1
20110128412 Milnes et al. Jun 2011 A1
20110129165 Lim et al. Jun 2011 A1
20110141309 Nagashima et al. Jun 2011 A1
20110142138 Tian et al. Jun 2011 A1
20110149408 Hahgholt et al. Jun 2011 A1
20110149409 Haugholt et al. Jun 2011 A1
20110150321 Cheong et al. Jun 2011 A1
20110153248 Gu et al. Jun 2011 A1
20110157321 Nakajima et al. Jun 2011 A1
20110157451 Chang Jun 2011 A1
20110169994 DiFrancesco et al. Jul 2011 A1
20110176020 Chang Jul 2011 A1
20110181797 Galstian et al. Jul 2011 A1
20110193944 Lian et al. Aug 2011 A1
20110199458 Hayasaka et al. Aug 2011 A1
20110200319 Kravitz et al. Aug 2011 A1
20110206291 Kashani et al. Aug 2011 A1
20110207074 Hall-Holt et al. Aug 2011 A1
20110211068 Yokota Sep 2011 A1
20110211077 Nayar et al. Sep 2011 A1
20110211824 Georgiev et al. Sep 2011 A1
20110221599 Högasten Sep 2011 A1
20110221658 Haddick et al. Sep 2011 A1
20110221939 Jerdev Sep 2011 A1
20110221950 Oostra et al. Sep 2011 A1
20110222757 Yeatman, Jr. et al. Sep 2011 A1
20110228142 Brueckner et al. Sep 2011 A1
20110228144 Tian et al. Sep 2011 A1
20110234825 Liu et al. Sep 2011 A1
20110234841 Akeley et al. Sep 2011 A1
20110241234 Duparre Oct 2011 A1
20110242342 Goma et al. Oct 2011 A1
20110242355 Goma et al. Oct 2011 A1
20110242356 Aleksic et al. Oct 2011 A1
20110243428 Das Gupta et al. Oct 2011 A1
20110255592 Sung et al. Oct 2011 A1
20110255745 Hodder et al. Oct 2011 A1
20110255786 Hunter et al. Oct 2011 A1
20110261993 Weiming et al. Oct 2011 A1
20110267264 Mccarthy et al. Nov 2011 A1
20110267348 Lin et al. Nov 2011 A1
20110273531 Ito et al. Nov 2011 A1
20110274175 Sumitomo Nov 2011 A1
20110274366 Tardif Nov 2011 A1
20110279705 Kuang et al. Nov 2011 A1
20110279721 McMahon Nov 2011 A1
20110285701 Chen et al. Nov 2011 A1
20110285866 Bhrugumalla et al. Nov 2011 A1
20110285910 Bamji et al. Nov 2011 A1
20110292216 Fergus et al. Dec 2011 A1
20110298898 Jung et al. Dec 2011 A1
20110298917 Yanagita Dec 2011 A1
20110300929 Tardif et al. Dec 2011 A1
20110310980 Mathew Dec 2011 A1
20110316968 Taguchi et al. Dec 2011 A1
20110317766 Lim et al. Dec 2011 A1
20120012748 Pain Jan 2012 A1
20120013748 Stanwood et al. Jan 2012 A1
20120014456 Martinez Bauza et al. Jan 2012 A1
20120019530 Baker Jan 2012 A1
20120019700 Gaber Jan 2012 A1
20120023456 Sun et al. Jan 2012 A1
20120026297 Sato Feb 2012 A1
20120026342 Yu et al. Feb 2012 A1
20120026366 Golan et al. Feb 2012 A1
20120026451 Nystrom Feb 2012 A1
20120026478 Chen et al. Feb 2012 A1
20120038745 Yu et al. Feb 2012 A1
20120039525 Tian et al. Feb 2012 A1
20120044249 Mashitani et al. Feb 2012 A1
20120044372 Côté et al. Feb 2012 A1
20120051624 Ando Mar 2012 A1
20120056982 Katz et al. Mar 2012 A1
20120057040 Park et al. Mar 2012 A1
20120062697 Treado et al. Mar 2012 A1
20120062702 Jiang et al. Mar 2012 A1
20120062756 Tian et al. Mar 2012 A1
20120069235 Imai Mar 2012 A1
20120081519 Goma et al. Apr 2012 A1
20120086803 Malzbender et al. Apr 2012 A1
20120105590 Fukumoto et al. May 2012 A1
20120105654 Kwatra et al. May 2012 A1
20120105691 Wagas et al. May 2012 A1
20120113232 Joblove May 2012 A1
20120113318 Galstian et al. May 2012 A1
20120113413 Miahczylowicz-Wolski et al. May 2012 A1
20120114224 Xu et al. May 2012 A1
20120114260 Takahashi et al. May 2012 A1
20120120264 Lee et al. May 2012 A1
20120127275 Von Zitzewitz et al. May 2012 A1
20120127284 Bar-Zeev et al. May 2012 A1
20120147139 Li et al. Jun 2012 A1
20120147205 Lelescu et al. Jun 2012 A1
20120153153 Chang et al. Jun 2012 A1
20120154551 Inoue Jun 2012 A1
20120155830 Sasaki et al. Jun 2012 A1
20120162374 Markas et al. Jun 2012 A1
20120163672 McKinnon Jun 2012 A1
20120163725 Fukuhara Jun 2012 A1
20120169433 Mullins et al. Jul 2012 A1
20120170134 Bolis et al. Jul 2012 A1
20120176479 Mayhew et al. Jul 2012 A1
20120176481 Lukk et al. Jul 2012 A1
20120188235 Wu et al. Jul 2012 A1
20120188341 Klein Gunnewiek et al. Jul 2012 A1
20120188389 Lin et al. Jul 2012 A1
20120188420 Black et al. Jul 2012 A1
20120188634 Kubala et al. Jul 2012 A1
20120198677 Duparre Aug 2012 A1
20120200669 Lai et al. Aug 2012 A1
20120200726 Bugnariu Aug 2012 A1
20120200734 Tang Aug 2012 A1
20120206582 DiCarlo et al. Aug 2012 A1
20120218455 Imai et al. Aug 2012 A1
20120219236 Ali et al. Aug 2012 A1
20120224083 Jovanovski et al. Sep 2012 A1
20120229602 Chen et al. Sep 2012 A1
20120229628 Ishiyama et al. Sep 2012 A1
20120237114 Park et al. Sep 2012 A1
20120249550 Akeley et al. Oct 2012 A1
20120249750 Izzat et al. Oct 2012 A1
20120249836 Ali et al. Oct 2012 A1
20120249853 Krolczyk et al. Oct 2012 A1
20120250990 Bocirnea Oct 2012 A1
20120262601 Choi et al. Oct 2012 A1
20120262607 Shimura et al. Oct 2012 A1
20120268574 Gidon et al. Oct 2012 A1
20120274626 Hsieh Nov 2012 A1
20120287291 McMahon Nov 2012 A1
20120290257 Hodge et al. Nov 2012 A1
20120293489 Chen et al. Nov 2012 A1
20120293624 Chen et al. Nov 2012 A1
20120293695 Tanaka Nov 2012 A1
20120307084 Mantzel Dec 2012 A1
20120307093 Miyoshi Dec 2012 A1
20120307099 Yahata Dec 2012 A1
20120314033 Lee et al. Dec 2012 A1
20120314937 Kim et al. Dec 2012 A1
20120327222 Ng et al. Dec 2012 A1
20130002828 Ding et al. Jan 2013 A1
20130002953 Noguchi et al. Jan 2013 A1
20130003184 Duparre Jan 2013 A1
20130010073 Do et al. Jan 2013 A1
20130016245 Yuba Jan 2013 A1
20130016885 Tsujimoto Jan 2013 A1
20130022111 Chen et al. Jan 2013 A1
20130027580 Olsen et al. Jan 2013 A1
20130033579 Wajs Feb 2013 A1
20130033585 Li et al. Feb 2013 A1
20130038696 Ding et al. Feb 2013 A1
20130047396 Au et al. Feb 2013 A1
20130050504 Safaee-Rad et al. Feb 2013 A1
20130050526 Keelan Feb 2013 A1
20130057710 McMahon Mar 2013 A1
20130070060 Chatterjee et al. Mar 2013 A1
20130076967 Brunner et al. Mar 2013 A1
20130077859 Stauder et al. Mar 2013 A1
20130077880 Venkataraman et al. Mar 2013 A1
20130077882 Venkataraman et al. Mar 2013 A1
20130083172 Baba Apr 2013 A1
20130088489 Schmeitz et al. Apr 2013 A1
20130088637 Duparre Apr 2013 A1
20130093842 Yahata Apr 2013 A1
20130100254 Morioka et al. Apr 2013 A1
20130107061 Kumar et al. May 2013 A1
20130113888 Koguchi May 2013 A1
20130113899 Morohoshi et al. May 2013 A1
20130113939 Strandemar May 2013 A1
20130120536 Song et al. May 2013 A1
20130120605 Georgiev et al. May 2013 A1
20130121559 Hu et al. May 2013 A1
20130123985 Hirai May 2013 A1
20130127988 Wang et al. May 2013 A1
20130128049 Schofield et al. May 2013 A1
20130128068 Georgiev et al. May 2013 A1
20130128069 Georgiev et al. May 2013 A1
20130128087 Georgiev et al. May 2013 A1
20130128121 Agarwala et al. May 2013 A1
20130135315 Bares et al. May 2013 A1
20130135448 Nagumo et al. May 2013 A1
20130147979 McMahon et al. Jun 2013 A1
20130155050 Rastogi et al. Jun 2013 A1
20130162641 Zhang et al. Jun 2013 A1
20130169754 Aronsson et al. Jul 2013 A1
20130176394 Tian et al. Jul 2013 A1
20130208138 Li et al. Aug 2013 A1
20130215108 McMahon et al. Aug 2013 A1
20130215231 Hiramoto et al. Aug 2013 A1
20130216144 Robinson et al. Aug 2013 A1
20130222556 Shimada Aug 2013 A1
20130222656 Kaneko Aug 2013 A1
20130223759 Nishiyama Aug 2013 A1
20130229540 Farina et al. Sep 2013 A1
20130230237 Schlosser et al. Sep 2013 A1
20130250123 Zhang et al. Sep 2013 A1
20130250150 Malone et al. Sep 2013 A1
20130258067 Zhang et al. Oct 2013 A1
20130259317 Gaddy Oct 2013 A1
20130265459 Duparre et al. Oct 2013 A1
20130274596 Azizian et al. Oct 2013 A1
20130274923 By Oct 2013 A1
20130278631 Border et al. Oct 2013 A1
20130286236 Mankowski Oct 2013 A1
20130293760 Nisenzon et al. Nov 2013 A1
20130308197 Duparre Nov 2013 A1
20130321581 El-ghoroury et al. Dec 2013 A1
20130321589 Kirk et al. Dec 2013 A1
20130335598 Gustavsson et al. Dec 2013 A1
20130342641 Morioka et al. Dec 2013 A1
20140002674 Duparre et al. Jan 2014 A1
20140002675 Duparre et al. Jan 2014 A1
20140009586 McNamer et al. Jan 2014 A1
20140013273 Ng Jan 2014 A1
20140037137 Broaddus et al. Feb 2014 A1
20140037140 Benhimane et al. Feb 2014 A1
20140043507 Wang et al. Feb 2014 A1
20140059462 Wernersson Feb 2014 A1
20140076336 Clayton et al. Mar 2014 A1
20140078333 Miao Mar 2014 A1
20140079336 Venkataraman et al. Mar 2014 A1
20140081454 Nuyujukian et al. Mar 2014 A1
20140085502 Lin et al. Mar 2014 A1
20140092281 Nisenzon et al. Apr 2014 A1
20140098266 Nayar et al. Apr 2014 A1
20140098267 Tian et al. Apr 2014 A1
20140104490 Hsieh et al. Apr 2014 A1
20140118493 Sali et al. May 2014 A1
20140118584 Lee et al. May 2014 A1
20140125760 Au et al. May 2014 A1
20140125771 Grossmann et al. May 2014 A1
20140132810 McMahon May 2014 A1
20140139642 Ni et al. May 2014 A1
20140139643 Hogasten et al. May 2014 A1
20140140626 Cho et al. May 2014 A1
20140146132 Bagnato et al. May 2014 A1
20140146201 Knight et al. May 2014 A1
20140176592 Wilburn et al. Jun 2014 A1
20140183258 DiMuro Jul 2014 A1
20140183334 Wang et al. Jul 2014 A1
20140186045 Poddar et al. Jul 2014 A1
20140192154 Jeong et al. Jul 2014 A1
20140192253 Laroia Jul 2014 A1
20140198188 Izawa Jul 2014 A1
20140204183 Lee et al. Jul 2014 A1
20140218546 McMahon Aug 2014 A1
20140232822 Venkataraman et al. Aug 2014 A1
20140240528 Venkataraman et al. Aug 2014 A1
20140240529 Venkataraman et al. Aug 2014 A1
20140253738 Mullis Sep 2014 A1
20140267243 Venkataraman et al. Sep 2014 A1
20140267286 Duparre Sep 2014 A1
20140267633 Venkataraman et al. Sep 2014 A1
20140267762 Mullis et al. Sep 2014 A1
20140267829 McMahon et al. Sep 2014 A1
20140267890 Lelescu et al. Sep 2014 A1
20140285675 Mullis Sep 2014 A1
20140300706 Song Oct 2014 A1
20140303463 Robinson Oct 2014 A1
20140307058 Kirk et al. Oct 2014 A1
20140307063 Lee Oct 2014 A1
20140313315 Shoham et al. Oct 2014 A1
20140321712 Ciurea et al. Oct 2014 A1
20140333731 Venkataraman et al. Nov 2014 A1
20140333764 Venkataraman et al. Nov 2014 A1
20140333787 Venkataraman et al. Nov 2014 A1
20140340539 Venkataraman et al. Nov 2014 A1
20140347509 Venkataraman et al. Nov 2014 A1
20140347748 Duparre Nov 2014 A1
20140354773 Venkataraman et al. Dec 2014 A1
20140354843 Venkataraman et al. Dec 2014 A1
20140354844 Venkataraman et al. Dec 2014 A1
20140354853 Venkataraman et al. Dec 2014 A1
20140354854 Venkataraman et al. Dec 2014 A1
20140354855 Venkataraman et al. Dec 2014 A1
20140355870 Venkataraman et al. Dec 2014 A1
20140368662 Venkataraman et al. Dec 2014 A1
20140368683 Venkataraman et al. Dec 2014 A1
20140368684 Venkataraman et al. Dec 2014 A1
20140368685 Venkataraman et al. Dec 2014 A1
20140368686 Duparre Dec 2014 A1
20140369612 Venkataraman et al. Dec 2014 A1
20140369615 Venkataraman et al. Dec 2014 A1
20140376825 Venkataraman et al. Dec 2014 A1
20140376826 Venkataraman et al. Dec 2014 A1
20150002734 Lee Jan 2015 A1
20150003752 Venkataraman et al. Jan 2015 A1
20150003753 Venkataraman et al. Jan 2015 A1
20150009353 Venkataraman et al. Jan 2015 A1
20150009354 Venkataraman et al. Jan 2015 A1
20150009362 Venkataraman et al. Jan 2015 A1
20150015669 Venkataraman et al. Jan 2015 A1
20150035992 Mullis Feb 2015 A1
20150036014 Lelescu et al. Feb 2015 A1
20150036015 Lelescu et al. Feb 2015 A1
20150042766 Ciurea et al. Feb 2015 A1
20150042767 Ciurea et al. Feb 2015 A1
20150042814 Vaziri Feb 2015 A1
20150042833 Lelescu et al. Feb 2015 A1
20150049915 Ciurea et al. Feb 2015 A1
20150049916 Ciurea et al. Feb 2015 A1
20150049917 Ciurea et al. Feb 2015 A1
20150055884 Venkataraman et al. Feb 2015 A1
20150085073 Bruls et al. Mar 2015 A1
20150085174 Shabtay et al. Mar 2015 A1
20150091900 Yang et al. Apr 2015 A1
20150093015 Liang et al. Apr 2015 A1
20150095235 Dua Apr 2015 A1
20150098079 Montgomery et al. Apr 2015 A1
20150104076 Hayasaka Apr 2015 A1
20150104101 Bryant et al. Apr 2015 A1
20150122411 Rodda et al. May 2015 A1
20150124059 Georgiev et al. May 2015 A1
20150124113 Rodda et al. May 2015 A1
20150124151 Rodda et al. May 2015 A1
20150138346 Venkataraman et al. May 2015 A1
20150146029 Venkataraman et al. May 2015 A1
20150146030 Venkataraman et al. May 2015 A1
20150161798 Venkataraman et al. Jun 2015 A1
20150199793 Venkataraman et al. Jul 2015 A1
20150199841 Venkataraman et al. Jul 2015 A1
20150206912 Kanamori Jul 2015 A1
20150207990 Ford et al. Jul 2015 A1
20150228081 Kim et al. Aug 2015 A1
20150235476 McMahon et al. Aug 2015 A1
20150237329 Venkataraman et al. Aug 2015 A1
20150243480 Yamada Aug 2015 A1
20150244927 Laroia et al. Aug 2015 A1
20150245013 Venkataraman et al. Aug 2015 A1
20150248744 Hayasaka et al. Sep 2015 A1
20150254868 Srikanth et al. Sep 2015 A1
20150256733 Kanamori Sep 2015 A1
20150264337 Venkataraman et al. Sep 2015 A1
20150288861 Duparre Oct 2015 A1
20150296137 Duparre et al. Oct 2015 A1
20150312455 Venkataraman et al. Oct 2015 A1
20150317638 Donaldson Nov 2015 A1
20150326852 Duparre et al. Nov 2015 A1
20150332468 Hayasaka et al. Nov 2015 A1
20150373261 Rodda et al. Dec 2015 A1
20160037097 Duparre Feb 2016 A1
20160042548 Du et al. Feb 2016 A1
20160044252 Molina Feb 2016 A1
20160044257 Venkataraman et al. Feb 2016 A1
20160057332 Ciurea et al. Feb 2016 A1
20160065934 Kaza et al. Mar 2016 A1
20160070030 Fujisawa et al. Mar 2016 A1
20160163051 Mullis Jun 2016 A1
20160165106 Duparre Jun 2016 A1
20160165134 Lelescu et al. Jun 2016 A1
20160165147 Nisenzon et al. Jun 2016 A1
20160165212 Mullis Jun 2016 A1
20160182786 Anderson et al. Jun 2016 A1
20160191768 Shin et al. Jun 2016 A1
20160195733 Lelescu et al. Jul 2016 A1
20160198096 McMahon et al. Jul 2016 A1
20160209654 Riccomini et al. Jul 2016 A1
20160210785 Balachandreswaran et al. Jul 2016 A1
20160216198 Sun Jul 2016 A1
20160227195 Venkataraman et al. Aug 2016 A1
20160249001 McMahon Aug 2016 A1
20160255333 Nisenzon et al. Sep 2016 A1
20160261844 Kadambi et al. Sep 2016 A1
20160266284 Duparre et al. Sep 2016 A1
20160267486 Mitra et al. Sep 2016 A1
20160267665 Venkataraman et al. Sep 2016 A1
20160267672 Ciurea et al. Sep 2016 A1
20160269626 McMahon Sep 2016 A1
20160269627 McMahon Sep 2016 A1
20160269650 Venkataraman et al. Sep 2016 A1
20160269651 Venkataraman et al. Sep 2016 A1
20160269664 Duparre Sep 2016 A1
20160309084 Venkataraman et al. Oct 2016 A1
20160309134 Venkataraman et al. Oct 2016 A1
20160316140 Nayar et al. Oct 2016 A1
20160323578 Kaneko et al. Nov 2016 A1
20170004791 Aubineau et al. Jan 2017 A1
20170006233 Venkataraman et al. Jan 2017 A1
20170011405 Pandey Jan 2017 A1
20170048468 Pain et al. Feb 2017 A1
20170053382 Lelescu et al. Feb 2017 A1
20170054901 Venkataraman et al. Feb 2017 A1
20170070672 Rodda et al. Mar 2017 A1
20170070673 Lelescu et al. Mar 2017 A1
20170070753 Kaneko Mar 2017 A1
20170078568 Venkataraman et al. Mar 2017 A1
20170085845 Venkataraman et al. Mar 2017 A1
20170094243 Venkataraman et al. Mar 2017 A1
20170099465 Mullis et al. Apr 2017 A1
20170109742 Varadarajan Apr 2017 A1
20170142405 Shors et al. May 2017 A1
20170163862 Molina Jun 2017 A1
20170178363 Venkataraman et al. Jun 2017 A1
20170178399 Fest Jun 2017 A1
20170187933 Duparre Jun 2017 A1
20170188011 Panescu et al. Jun 2017 A1
20170244960 Ciurea et al. Aug 2017 A1
20170257562 Venkataraman et al. Sep 2017 A1
20170268990 Martinello Sep 2017 A1
20170337682 Liao Nov 2017 A1
20170365104 McMahon et al. Dec 2017 A1
20180005012 Aycock Jan 2018 A1
20180005244 Govindarajan et al. Jan 2018 A1
20180007284 Venkataraman et al. Jan 2018 A1
20180013945 Ciurea et al. Jan 2018 A1
20180024330 Laroia Jan 2018 A1
20180035057 McMahon et al. Feb 2018 A1
20180040135 Mullis Feb 2018 A1
20180048830 Venkataraman et al. Feb 2018 A1
20180048879 Venkataraman et al. Feb 2018 A1
20180081090 Duparre et al. Mar 2018 A1
20180097993 Nayar et al. Apr 2018 A1
20180100731 Pau Apr 2018 A1
20180109782 Duparre et al. Apr 2018 A1
20180124311 Lelescu et al. May 2018 A1
20180131852 McMahon May 2018 A1
20180139382 Venkataraman et al. May 2018 A1
20180177461 Bell Jun 2018 A1
20180189767 Bigioi Jul 2018 A1
20180197035 Venkataraman et al. Jul 2018 A1
20180211402 Ciurea et al. Jul 2018 A1
20180227511 McMahon Aug 2018 A1
20180240265 Yang et al. Aug 2018 A1
20180270473 Mullis Sep 2018 A1
20180286120 Fleishman et al. Oct 2018 A1
20180302554 Lelescu et al. Oct 2018 A1
20180330182 Venkataraman et al. Nov 2018 A1
20180376122 Park et al. Dec 2018 A1
20190012768 Tafazoli Bilandi et al. Jan 2019 A1
20190037116 Molina Jan 2019 A1
20190037150 Srikanth et al. Jan 2019 A1
20190043253 Lucas et al. Feb 2019 A1
20190052792 Baba Feb 2019 A1
20190057513 Jain et al. Feb 2019 A1
20190063905 Venkataraman et al. Feb 2019 A1
20190089947 Venkataraman et al. Mar 2019 A1
20190098209 Venkataraman et al. Mar 2019 A1
20190109998 Venkataraman et al. Apr 2019 A1
20190164341 Venkataraman May 2019 A1
20190174040 Mcmahon Jun 2019 A1
20190174077 Mitani et al. Jun 2019 A1
20190197735 Xiong et al. Jun 2019 A1
20190215496 Mullis et al. Jul 2019 A1
20190230348 Ciurea et al. Jul 2019 A1
20190235138 Duparre et al. Aug 2019 A1
20190243086 Rodda et al. Aug 2019 A1
20190244379 Venkataraman Aug 2019 A1
20190268586 Mullis Aug 2019 A1
20190289176 Duparre Sep 2019 A1
20190347768 Lelescu et al. Nov 2019 A1
20190356863 Venkataraman et al. Nov 2019 A1
20190362515 Ciurea et al. Nov 2019 A1
20190364263 Jannard et al. Nov 2019 A1
20190392189 Kumar Dec 2019 A1
20200012119 Pezzaniti Jan 2020 A1
20200026948 Venkataraman et al. Jan 2020 A1
20200034998 Schlemper Jan 2020 A1
20200151894 Jain et al. May 2020 A1
20200162680 Mitani May 2020 A1
20200195862 Briggs Jun 2020 A1
20200204729 Kurita Jun 2020 A1
20200252597 Mullis Aug 2020 A1
20200311418 Mahadeswaraswamy Oct 2020 A1
20200334905 Venkataraman Oct 2020 A1
20200389604 Venkataraman et al. Dec 2020 A1
20210042952 Jain et al. Feb 2021 A1
20210044790 Venkataraman et al. Feb 2021 A1
20210063141 Venkataraman et al. Mar 2021 A1
20210081698 Lindeman et al. Mar 2021 A1
20210084206 McEldowney Mar 2021 A1
20210089807 Liu Mar 2021 A1
20210133927 Lelescu et al. May 2021 A1
20210150748 Ciurea et al. May 2021 A1
Foreign Referenced Citations (277)
Number Date Country
2488005 Apr 2002 CN
1619358 May 2005 CN
1669332 Sep 2005 CN
1727991 Feb 2006 CN
1839394 Sep 2006 CN
1985524 Jun 2007 CN
1992499 Jul 2007 CN
101010619 Aug 2007 CN
101046882 Oct 2007 CN
101064780 Oct 2007 CN
101102388 Jan 2008 CN
101147392 Mar 2008 CN
201043890 Apr 2008 CN
101212566 Jul 2008 CN
101312540 Nov 2008 CN
101427372 May 2009 CN
101551586 Oct 2009 CN
101593350 Dec 2009 CN
101606086 Dec 2009 CN
101785025 Jul 2010 CN
101883291 Nov 2010 CN
102037717 Apr 2011 CN
102164298 Aug 2011 CN
102184720 Sep 2011 CN
102375199 Mar 2012 CN
103004180 Mar 2013 CN
103765864 Apr 2014 CN
104081414 Oct 2014 CN
104508681 Apr 2015 CN
104662589 May 2015 CN
104685513 Jun 2015 CN
104685860 Jun 2015 CN
105409212 Mar 2016 CN
103765864 Jul 2017 CN
104081414 Aug 2017 CN
104662589 Aug 2017 CN
107077743 Aug 2017 CN
107230236 Oct 2017 CN
107346061 Nov 2017 CN
107404609 Nov 2017 CN
104685513 Apr 2018 CN
107924572 Apr 2018 CN
108307675 Jul 2018 CN
104335246 Sep 2018 CN
107404609 Feb 2020 CN
107346061 Apr 2020 CN
107230236 Dec 2020 CN
108307675 Dec 2020 CN
107077743 Mar 2021 CN
602011041799.1 Sep 2017 DE
0677821 Oct 1995 EP
0840502 May 1998 EP
1201407 May 2002 EP
1355274 Oct 2003 EP
1734766 Dec 2006 EP
1991145 Nov 2008 EP
1243945 Jan 2009 EP
2026563 Feb 2009 EP
2031592 Mar 2009 EP
2041454 Apr 2009 EP
2072785 Jun 2009 EP
2104334 Sep 2009 EP
2136345 Dec 2009 EP
2156244 Feb 2010 EP
2244484 Oct 2010 EP
0957642 Apr 2011 EP
2336816 Jun 2011 EP
2339532 Jun 2011 EP
2381418 Oct 2011 EP
2386554 Nov 2011 EP
2462477 Jun 2012 EP
2502115 Sep 2012 EP
2569935 Mar 2013 EP
2652678 Oct 2013 EP
2677066 Dec 2013 EP
2708019 Mar 2014 EP
2761534 Aug 2014 EP
2777245 Sep 2014 EP
2867718 May 2015 EP
2873028 May 2015 EP
2888698 Jul 2015 EP
2888720 Jul 2015 EP
2901671 Aug 2015 EP
2973476 Jan 2016 EP
3066690 Sep 2016 EP
2569935 Dec 2016 EP
3201877 Aug 2017 EP
2652678 Sep 2017 EP
3284061 Feb 2018 EP
3286914 Feb 2018 EP
3201877 Mar 2018 EP
2817955 Apr 2018 EP
3328048 May 2018 EP
3075140 Jun 2018 EP
3201877 Dec 2018 EP
3467776 Apr 2019 EP
2708019 Oct 2019 EP
3286914 Dec 2019 EP
2761534 Nov 2020 EP
2888720 Mar 2021 EP
3328048 Apr 2021 EP
2482022 Jan 2012 GB
2708CHENP2014 Aug 2015 IN
361194 Mar 2021 IN
59-025483 Feb 1984 JP
64-037177 Feb 1989 JP
02-285772 Nov 1990 JP
06129851 May 1994 JP
07-015457 Jan 1995 JP
H0756112 Mar 1995 JP
09171075 Jun 1997 JP
09181913 Jul 1997 JP
10253351 Sep 1998 JP
11142609 May 1999 JP
11223708 Aug 1999 JP
11325889 Nov 1999 JP
2000209503 Jul 2000 JP
2001008235 Jan 2001 JP
2001194114 Jul 2001 JP
2001264033 Sep 2001 JP
2001277260 Oct 2001 JP
2001337263 Dec 2001 JP
2002195910 Jul 2002 JP
2002205310 Jul 2002 JP
2002209226 Jul 2002 JP
2002250607 Sep 2002 JP
2002252338 Sep 2002 JP
2003094445 Apr 2003 JP
2003139910 May 2003 JP
2003163938 Jun 2003 JP
2003298920 Oct 2003 JP
2004221585 Aug 2004 JP
2005116022 Apr 2005 JP
2005181460 Jul 2005 JP
2005295381 Oct 2005 JP
2005303694 Oct 2005 JP
2005341569 Dec 2005 JP
2005354124 Dec 2005 JP
2006033228 Feb 2006 JP
2006033493 Feb 2006 JP
2006047944 Feb 2006 JP
2006258930 Sep 2006 JP
2007520107 Jul 2007 JP
2007259136 Oct 2007 JP
2008039852 Feb 2008 JP
2008055908 Mar 2008 JP
2008507874 Mar 2008 JP
2008172735 Jul 2008 JP
2008258885 Oct 2008 JP
2009064421 Mar 2009 JP
2009132010 Jun 2009 JP
2009300268 Dec 2009 JP
2010139288 Jun 2010 JP
2011017764 Jan 2011 JP
2011030184 Feb 2011 JP
2011109484 Jun 2011 JP
2011523538 Aug 2011 JP
2011203238 Oct 2011 JP
2012504805 Feb 2012 JP
2011052064 Mar 2013 JP
2013509022 Mar 2013 JP
2013526801 Jun 2013 JP
2014519741 Aug 2014 JP
2014521117 Aug 2014 JP
2014535191 Dec 2014 JP
2015022510 Feb 2015 JP
2015522178 Aug 2015 JP
2015534734 Dec 2015 JP
5848754 Jan 2016 JP
2016524125 Aug 2016 JP
6140709 May 2017 JP
2017163550 Sep 2017 JP
2017163587 Sep 2017 JP
2017531976 Oct 2017 JP
6546613 Jul 2019 JP
2019-220957 Dec 2019 JP
6630891 Dec 2019 JP
2020017999 Jan 2020 JP
6767543 Sep 2020 JP
6767558 Sep 2020 JP
1020050004239 Jan 2005 KR
100496875 Jun 2005 KR
1020110097647 Aug 2011 KR
20140045373 Apr 2014 KR
20170063827 Jun 2017 KR
101824672 Feb 2018 KR
101843994 Mar 2018 KR
101973822 Apr 2019 KR
10-2002165 Jul 2019 KR
10-2111181 May 2020 KR
191151 Jul 2013 SG
11201500910 Oct 2015 SG
200828994 Jul 2008 TW
200939739 Sep 2009 TW
201228382 Jul 2012 TW
1535292 May 2016 TW
1994020875 Sep 1994 WO
2005057922 Jun 2005 WO
2006039906 Apr 2006 WO
2006039906 Apr 2006 WO
2007013250 Feb 2007 WO
2007083579 Jul 2007 WO
2007134137 Nov 2007 WO
2008045198 Apr 2008 WO
2008050904 May 2008 WO
2008108271 Sep 2008 WO
2008108926 Sep 2008 WO
2008150817 Dec 2008 WO
2009073950 Jun 2009 WO
2009151903 Dec 2009 WO
2009157273 Dec 2009 WO
2010037512 Apr 2010 WO
2011008443 Jan 2011 WO
2011026527 Mar 2011 WO
2011046607 Apr 2011 WO
2011055655 May 2011 WO
2011063347 May 2011 WO
2011105814 Sep 2011 WO
2011116203 Sep 2011 WO
2011063347 Oct 2011 WO
2011121117 Oct 2011 WO
2011143501 Nov 2011 WO
2012057619 May 2012 WO
2012057620 May 2012 WO
2012057621 May 2012 WO
2012057622 May 2012 WO
2012057623 May 2012 WO
2012057620 Jun 2012 WO
2012074361 Jun 2012 WO
2012078126 Jun 2012 WO
2012082904 Jun 2012 WO
2012155119 Nov 2012 WO
2013003276 Jan 2013 WO
2013043751 Mar 2013 WO
2013043761 Mar 2013 WO
2013049699 Apr 2013 WO
2013055960 Apr 2013 WO
2013119706 Aug 2013 WO
2013126578 Aug 2013 WO
2013166215 Nov 2013 WO
2014004134 Jan 2014 WO
2014005123 Jan 2014 WO
2014031795 Feb 2014 WO
2014052974 Apr 2014 WO
2014032020 May 2014 WO
2014078443 May 2014 WO
2014130849 Aug 2014 WO
2014131038 Aug 2014 WO
2014133974 Sep 2014 WO
2014138695 Sep 2014 WO
2014138697 Sep 2014 WO
2014144157 Sep 2014 WO
2014145856 Sep 2014 WO
2014149403 Sep 2014 WO
2014149902 Sep 2014 WO
2014150856 Sep 2014 WO
2014153098 Sep 2014 WO
2014159721 Oct 2014 WO
2014159779 Oct 2014 WO
2014160142 Oct 2014 WO
2014164550 Oct 2014 WO
2014164909 Oct 2014 WO
2014165244 Oct 2014 WO
2014133974 Apr 2015 WO
2015048694 Apr 2015 WO
2015048906 Apr 2015 WO
2015070105 May 2015 WO
2015074078 May 2015 WO
2015081279 Jun 2015 WO
2015134996 Sep 2015 WO
2015183824 Dec 2015 WO
2016054089 Apr 2016 WO
2016172125 Oct 2016 WO
2016167814 Oct 2016 WO
2016172125 Apr 2017 WO
2018053181 Mar 2018 WO
2019038193 Feb 2019 WO
Non-Patent Literature Citations (279)
Entry
US 8,957,977 B2, 02/2015, Venkataraman et al. (withdrawn)
Atkinson et al. “High-sensitivity analysis of polarization by surface reflection” In: Machine Vision and Applications, Aug. 3, 2018, Retrieved on Oct. 26, 2020 from https://link.springer.com/content/pdf/10.1007/s00138-018-0962-7.pdf, 19 pages.
Sajjan, “Learning to See Transparent Objects,” In: Google, Feb. 12, 2020, Retrieved on Oct. 26, 2020 from https://ai.ggogleblog.com/2020/02/learning-to-see-transparent.objects.html, 6 pages.
Arnab et al. “Pixelwise instance segmentation with a dynamically instantiated network,” In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Apr. 7, 2017, Retrieved on Oct. 26, 2020 from https://openaccess.thecvf.com/content_cvpr_2017/papers/Arnab_Pixelwise_Instance_Seqmentation_CFPR_2017_paper.pdf, 11 pages.
Bai et al. “Deep watershed transform for instance segmentation,” In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Nov. 24, 2016, Retrieved on Oct. 26, 2020 from https://openaccess.thecvf.com/content_cvpr_2017/papers/Bai_Deep_Watershed_Transform_CVPR_2017_paper.pdf, 10 pages.
Kirillov et al., “Instancecut: from edges to instances with multicut,” In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Nov. 24, 2016, Retrieved on Oct. 26, 2020 from https://openaccess.thecvf.com/content_cvpr_2017/papers/Kiriliov_InstanceCut_From_Edges_CVPR_2017_paper.pdf, 11 pages.
Miyazaki et al. Transparent surface modeling from a pair of polarization images. IEEE Transactions on Pattern Analysis & Machine Intelligenc, vol. 26, (1):73-82, Jan. 2004.
He et al. Mask r-cnn. In Proceedings of the IEEE International Conference on Computer Vision, pp. 2961-2969, 2017.
Romera-Paredes et al. Recurrent instance segmentation. In European Conference on Computer Vision, pp. 312-329. Springer, 2016.
Ren et al. End-to-end instance segmentation with recurrent attention. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 6656-6664, 2017.
Written Opinion for International Application No. PCT/US2020/048604, dated Nov. 13, 2020, 8 pages.
Ansari et al., “3-D Face Modeling Using Two Views and a Generic Face Model with Application to 3-D Face Recognition”, Proceedings of the IEEE Conference on Advanced Video and Signal Based Surveillance, Jul. 22, 2003, 9 pgs.
Aufderheide et al., “A MEMS-based Smart Sensor System for Estimation of Camera Pose for Computer Vision Applications”, Research and Innovation Conference 2011, Jul. 29, 2011, pp. 1-10.
Baker et al., “Limits on Super-Resolution and How to Break Them”, IEEE Transactions on Pattern Analysis and Machine Intelligence, Sep. 2002, vol. 24, No. 9, pp. 1167-1183.
Banz et al., “Real-Time Semi-Global Matching Disparity Estimation on the GPU”, IEEE Transactions on Pattern Analysis and Machine Intelligence, Sep. 2002, vol. 24, No. 9, pp. 1167-1183.
Barron et al., “Intrinsic Scene Properties from a Single RGB-D Image”, 2013 IEEE Conference on Computer Vision and Pattern Recognition, Jun. 23-28, 2013, Portland, OR, USA, pp. 17-24.
Bennett et al., “Multispectral Bilateral Video Fusion”, Computer Graphics (ACM SIGGRAPH Proceedings), Jul. 25, 2006, published Jul. 30, 2006, 1 pg.
Bennett et al., “Multispectral Video Fusion”, Computer Graphics (ACM SIGGRAPH Proceedings), Jul. 25, 2006, published Jul. 30, 2006, 1 pg.
Berretti et al., “Face Recognition by Super-Resolved 3D Models from Consumer Depth Cameras”, IEEE Transactions on Information Forensics and Security, vol. 9, No. 9, Sep. 2014, pp. 1436-1448.
Bertalmio et al., “Image Inpainting”, Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, 2000, ACM Pres/Addison-Wesley Publishing Co., pp. 417-424.
Bertero et al., “Super-resolution in computational imaging”, Micron, Jan. 1, 2003, vol. 34, Issues 6-7, 17 pgs.
Bishop et al., “Full-Resolution Depth Map Estimation from an Aliased Plenoptic Light Field”, ACCV Nov. 8, 2010, Part II, LNCS 6493, pp. 186-200.
Bishop et al., “Light Field Superresolution”, Computational Photography (ICCP), 2009 IEEE International Conference, Conference Date Apr. 16-17, published Jan. 26, 2009, 9 pgs.
Bishop et al., “The Light Field Camera: Extended Depth of Field, Aliasing, and Superresolution”, IEEE Transactions on Pattern Analysis and Machine Intelligence, May 2012, vol. 34, No. 5, published Aug. 18, 2011, pp. 972-986.
Blanz et al., “A Morphable Model for the Synthesis of 3D Faces”, In Proceedings of ACM SIGGRAPH 1999, Jul. 1, 1999, pp. 187-194.
Borman, “Topics in Multiframe Superresolution Restoration”, Thesis of Sean Borman, Apr. 2004, 282 pgs.
Borman et al., “Image Sequence Processing”, Dekker Encyclopedia of Optical Engineering, Oct. 14, 2002, 81 pgs.
Borman et al., “Linear models for multi-frame super-resolution restoration under non-affine registration and spatially varying PSF”, Proc. SPIE, May 21, 2004, vol. 5299, 12 pgs.
Borman et al., “Simultaneous Multi-Frame MAP Super-Resolution Video Enhancement Using Spatio-Temporal Priors”, Image Processing, 1999, ICIP 99 Proceedings, vol. 3, pp. 469-473.
Borman et al., “Super-Resolution from Image Sequences - A Review”, Circuits & Systems, 1998, pp. 374-378.
Borman et al., “Nonlinear Prediction Methods for Estimation of Clique Weighting Parameters in NonGaussian Image Models”, Proc. SPIE, Sep. 22, 1998, vol. 3459, 9 pgs.
Borman et al., “Block-Matching Sub-Pixel Motion Estimation from Noisy, Under-Sampled Frames - An Empirical Performance Evaluation”, Proc SPIE, Dec. 28, 1998, vol. 3653, 10 pgs.
Borman et al., “Image Resampling and Constraint Formulation for Multi-Frame Super-Resolution Restoration”, Proc SPIE, Dec. 28, 1998, vol. 3653, 10 pgs.
Bose et al., “Superresolution and Noise Filtering Using Moving Least Squares”, IEEE Transactions on Image Processing, Aug. 2006, vol. 15, Issue 8, published Jul. 17, 2006, pp. 2239-2248.
Boye et al., “Comparison of Subpixel Image Registration Algorithms”, Proc, of SPIE - IS&T Electronic Imaging, Feb. 3, 2009, vol. 7246, p. 72460X-1 -72460X-9; doi: 10.1117/12.810369.
Bruckner et al., “Thin wafer-level camera lenses inspired by insect compound eyes”, Optics Express, Nov. 22, 2010, vol. 18, No. 24, p. 24379-24394.
Bruckner et al., “Artificial compound eye applying hyperacuity”, Optics Express, Dec. 11, 2006, vol. 14, No. 25, pp. 12076-12084.
Bruckner et al., “Driving microoptical imaging systems towards miniature camera applications”, Proc. SPIE, Micro-Optics, May 13, 2010, 11 pgs.
Bryan et al., “Perspective Distortion from Interpersonal Distance Is an Implicit Visual Cue for Social Judgments of Faces”, PLOS One, vol. 7, Issue 9, Sep. 26, 2012, e45301, doi:10.1371/journal.pone.0045301, 9 pgs.
Bulat et al., “How far are we from solving the 2D & 3D Face Alignment problem? (and a dataset of 230,000 3D facial landmarks)”, arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Mar. 21, 2017.
Cai et al., “3D Deformable Face Tracking with a Commodity Depth Camera”, Proceedings of the European Conference on Computer Vision: Part III, Sep. 5-11, 2010, 14pgs.
Capel, “Image Mosaicing and Super-resolution”, Retrieved on Nov. 10, 2012, Retrieved from the Internet at URL:<http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.226.2643&rep=rep1 &type=pdf>, 2001, 269 pgs.
Caron et al., “Multiple camera types simultaneous stereo calibration, Robotics and Automation (ICRA)”, 2011 IEEE International Conference on, May 1, 2011 (May 1, 2011), pp. 2933-2938.
Carroll et al., “Image Warps for Artistic Perspective Manipulation”, ACM Transactions on Graphics (TOG), vol. 29, No. 4, Jul. 26, 2010, Article No. 127, 9 pgs.
Chan et al., “Investigation of Computational Compound-Eye Imaging System with Super-Resolution Reconstruction”, IEEE, ISASSP, Jun. 19, 2006, pp. 1177-1180.
Chan et al., “Extending the Depth of Field in a Compound-Eye Imaging System with Super-Resolution Reconstruction”, Proceedings—International Conference on Pattern Recognition, Jan. 1, 2006, vol. 3, pp. 623-626.
Chan et al., “Super-resolution reconstruction in a computational compound-eye imaging system”, Multidim. Syst. Sign. Process, published online Feb. 23, 2007, vol. 18, pp. 83-101.
Chen et al., “Interactive deformation of light fields”, Symposium on Interactive 3D Graphics, 2005, pp. 139-146.
Chen et al., “KNN Matting”, IEEE Transactions on Pattern Analysis and Machine Intelligence, Sep. 2013, vol. 35, No. 9, pp. 2175-2188.
Chen et al., “KNN matting”, 2012 IEEE Conference on Computer Vision and Pattern Recognition, Jun. 16-21, 2012, Providence, RI, USA, pp. 869-876.
Chen et al., “Image Matting with Local and Nonlocal Smooth Priors”, CVPR '13 Proceedings of the 2013 IEEE Conference on Computer Vision and Pattern Recognition, Jun. 23, 2013, pp. 1902-1907.
Chen et al., “Human Face Modeling and Recognition Through Multi-View High Resolution Stereopsis”, IEEE Conference on Computer Vision and Pattern Recognition Workshop, Jun. 17-22, 2006, 6 pgs.
Collins et al., “An Active Camera System for Acquiring Multi-View Video”, IEEE 2002 International Conference on Image Processing, Date of Conference: Sep. 22-25, 2002, Rochester, NY, 4 pgs.
Cooper et al., “The perceptual basis of common photographic practice”, Journal of Vision, vol. 12, No. 5, Article 8, May 25, 2012, pp. 1-14.
Crabb et al., “Real-time foreground segmentation via range and color imaging”, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, Anchorage, AK, USA, Jun. 23-28, 2008, pp. 1-5.
Dainese et al., “Accurate Depth-Map Estimation for 3D Face Modeling”, IEEE European Signal Processing Conference, Sep. 4-8, 2005, 4 pgs.
Debevec et al., “Recovering High Dynamic Range Radiance Maps from Photographs”, Computer Graphics (ACM SIGGRAPH Proceedings), Aug. 16, 1997, 10 pgs.
Do, Minh N. “Immersive Visual Communication with Depth”, Presented at Microsoft Research, Jun. 15, 2011, Retrieved from: http://minhdo.ece.illinois.edu/talks/ImmersiveComm.pdf, 42 pgs.
Do et al., Immersive Visual Communication, IEEE Signal Processing Magazine, vol. 28, Issue 1, Jan. 2011, DOI: 10.1109/MSP.2010.939075, Retrieved from http://minhdo.ece.illinois.edu/publications/ImmerComm_SPM.pdf, pp. 58-66.
Dou et al., “End-to-end 3D face reconstruction with deep neural networks”, arXiv:1704.05020v1, Apr. 17, 2017, 10 pgs.
Drouin et al., “Improving Border Localization of Multi-Baseline Stereo Using Border-Cut”, International Journal of Computer Vision, Jul. 5, 2006, vol. 83, Issue 3, 8 pgs.
Drouin et al., “Fast Multiple-Baseline Stereo with Occlusion”, Fifth International Conference on 3-D Digital Imaging and Modeling (3DIM'05), Ottawa, Ontario, Canada, Jun. 13-16, 2005, pp. 540-547.
Drouin et al., “Geo-Consistency for Wide Multi-Camera Stereo”, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), vol. 1, Jun. 20-25, 2005, pp. 351-358.
Drulea et al., “Motion Estimation Using the Correlation Transform”, IEEE Transactions on Image Processing, August 2013, vol. 22, No. 8, pp. 3260-3270, first published May 14, 2013.
Duparre et al., “Microoptical artificial compound eyes—from design to experimental verification of two different concepts”, Proc. of SPIE, Optical Design and Engineering II, vol. 5962, Oct. 17, 2005, pp. 59622A-1-59622A-12.
Duparre et al., Novel Optics/Micro-Optics for Miniature Imaging Systems, Proc. of SPIE, Apr. 21, 2006, vol. 6196, pp. 619607-1-619607-15.
Duparre et al., “Micro-optical artificial compound eyes”, Bioinspiration & Biomimetics, Apr. 6, 2006, vol. 1, pp. R1-R16.
Duparre et al., “Artificial compound eye zoom camera”, Bioinspiration & Biomimetics, Nov. 21, 2008, vol. 3, pp. 1-6.
Duparre et al., “Artificial apposition compound eye fabricated by micro-optics technology”, Applied Optics, Aug. 1, 2004, vol. 43, No. 22, pp. 4303-4310.
Duparre et al., “Micro-optically fabricated artificial apposition compound eye”, Electronic Imaging—Science and Technology, Prod. SPIE 5301, Jan. 2004, pp. 25-33.
Duparre et al., “Chirped arrays of refractive ellipsoidal microlenses for aberration correction under oblique incidence”, Optics Express, Dec. 26, 2005, vol. 13, No. 26, pp. 10539-10551.
Duparre et al., “Artificial compound eyes—different concepts and their application to ultra flat image acquisition sensors”, MOEMS and Miniaturized Systems IV, Proc. SPIE 5346, Jan. 24, 2004, pp. 89-100.
Duparre et al., “Ultra-Thin Camera Based on Artificial Apposition Compound Eyes”, 10th Microoptics Conference, Sep. 1-3, 2004, 2 pgs.
Duparre et al., “Microoptical telescope compound eye”, Optics Express, Feb. 7, 2005, vol. 13, No. 3, pp. 889-903.
Duparre et al., “Theoretical analysis of an artificial superposition compound eye for application in ultra flat digital image acquisition devices”, Optical Systems Design, Proc. SPIE 5249, Sep. 2003, pp. 408-418.
Duparre et al., “Thin compound-eye camera”, Applied Optics, May 20, 2005, vol. 44, No. 15, pp. 2949-2956.
Duparre et al., “Microoptical Artificial Compound Eyes—Two Different Concepts for Compact Imaging Systems”, 11th Microoptics Conference, Oct. 30-Nov. 2, 2005, 2 pgs.
Eng et al., “Gaze correction for 3D tele-immersive communication system”, IVMSP Workshop, 2013 IEEE 11th. IEEE, Jun. 10, 2013.
Fanaswala, “Regularized Super-Resolution of Multi-View Images”, Retrieved on Nov. 10, 2012 (Nov. 10, 2012). Retrieved from the Internet at URL:<http://www.site.uottawa.ca/-edubois/theses/Fanaswala_thesis.pdf>, 2009, 163 pgs.
Fang et al., “Volume Morphing Methods for Landmark Based 3D Image Deformation”, SPIE vol. 2710, Proc. 1996 SPIE Intl Symposium on Medical Imaging, Newport Beach, CA, Feb. 10, 1996, pp. 404-415.
Fangmin et al., “3D Face Reconstruction Based on Convolutional Neural Network”, 2017 10th International Conference on Intelligent Computation Technology and Automation, Oct. 9-10, 2017, Changsha, China.
Farrell et al., “Resolution and Light Sensitivity Tradeoff with Pixel Size”, Proceedings of the SPIE Electronic Imaging 2006 Conference, Feb. 2, 2006, vol. 6069, 8 pgs.
Farsiu et al., “Advances and Challenges in Super-Resolution”, International Journal of Imaging Systems and Technology, Aug. 12, 2004, vol. 14, pp. 47-57.
Farsiu et al., “Fast and Robust Multiframe Super Resolution”, IEEE Transactions on Image Processing, Oct. 2004, published Sep. 3, 2004, vol. 13, No. 10, pp. 1327-1344.
Farsiu et al., “Multiframe Demosaicing and Super-Resolution of Color Images”, IEEE Transactions on Image Processing, Jan. 2006, vol. 15, No. 1, date of publication Dec. 12, 2005, pp. 141-159.
Fechteler et al., Fast and High Resolution 3D Face Scanning, IEEE International Conference on Image Processing, Sep. 16-Oct. 19, 2007, 4 pgs.
Fecker et al., “Depth Map Compression for Unstructured Lumigraph Rendering”, Proc. SPIE 6077, Proceedings Visual Communications and Image Processing 2006, Jan. 18, 2006, pp. 60770B-1-60770B-8.
Feris et al., “Multi-Flash Stereopsis: Depth Edge Preserving Stereo with Small Baseline Illumination”, IEEE Trans on PAMI, 2006, 31 pgs.
Fife et al., “A 3D Multi-Aperture Image Sensor Architecture”, Custom Integrated Circuits Conference, 2006, CICC '06, IEEE, pp. 281-284.
Fife et al., “A 3MPixel Multi-Aperture Image Sensor with 0.7Mu Pixels in 0.11 Mu CMOS”, ISSCC 2008, Session 2, Image Sensors & Technology, 2008, pp. 48-50.
Fischer et al., “Optical System Design”, 2nd Edition, SPIE Press, Feb. 14, 2008, pp. 49-58.
Fischer et al., “Optical System Design”, 2nd Edition, SPIE Press, Feb. 14, 2008, pp. 191-198.
Garg et al., “Unsupervised CNN for Single View Depth Estimation Geometry to the Rescue”, In European Conference on Computer Vision, Springer, Cham, Jul. 2016, 16 pgs.
Gastal et al., “Shared Sampling for Real-Time Alpha Matting”, Computer Graphics Forum, EUROGRAPHICS 2010, vol. 29, Issue 2, May 2010, pp. 575-584.
Georgeiv et al., “Light Field Camera Design for Integral View Photography”, Adobe Systems Incorporated, Adobe Technical Report, 2003, 13 pgs.
Georgiev et al., “Light-Field Capture by Multiplexing in the Frequency Domain”, Adobe Systems Incorporated, Adobe Technical Report, 2003, 13 pgs.
Godard et al., “Unsupervised Monocular Depth Estimation with Left-Right Consistency”, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2017, 14 pgs.
Goldman et al., “Video Object Annotation, Navigation, and Composition”, In Proceedings of UIST 2008, Oct. 19-22, 2008, Monterey CA, USA, pp. 3-12.
Goodfellow et al., “Generative Adversarial Nets, 2014. Generative adversarial nets”, In Advances in Neural Information Processing Systems (pp. 2672-2680).
Gortler et al., “The Lumigraph”, In Proceedings of SIGGRAPH 1996, published Aug. 1, 1996, pp. 43-54.
Gupta et al., “Perceptual Organization and Recognition of Indoor Scenes from RGB-D Images”, 2013 IEEE Conference on Computer Vision and Pattern Recognition, Jun. 23-28, 2013, Portland, OR, USA, pp. 564-571.
Hacohen et al., “Non-Rigid Dense Correspondence with Applications for Image Enhancement”, ACM Transactions on Graphics, vol. 30, No. 4, Aug. 7, 2011, 9 pgs.
Hamilton, “JPEG File Interchange Format, Version 1.02”, Sep. 1, 1992, 9 pgs.
Hardie, “A Fast Image Super-Algorithm Using an Adaptive Wiener Filter”, IEEE Transactions on Image Processing, Dec. 2007, published Nov. 19, 2007, vol. 16, No. 12, pp. 2953-2964.
Hasinoff et al., “Search-and-Replace Editing for Personal Photo Collections”, 2010 International Conference: Computational Photography (ICCP) Mar. 2010, pp. 1-8.
Hernandez et al., “Laser Scan Quality 3-D Face Modeling Using a Low-Cost Depth Camera”, 20th European Signal Processing Conference, Aug. 27-31, 2012, Bucharest, Romania, pp. 1995-1999.
Hernandez-Lopez et al., “Detecting objects using color and depth segmentation with Kinect sensor”, Procedia Technology, vol. 3, Jan. 1, 2012, pp. 196-204, XP055307680, ISSN: 2212-0173, DOI: 10.1016/j.protcy.2012.03.021.
Higo et al., “A Hand-held Photometric Stereo Camera for 3-D Modeling”, IEEE International Conference on Computer Vision, 2009, pp. 1234-1241.
Hirschmuller, “Accurate and Efficient Stereo Processing by Semi-Global Matching and Mutual Information”, IEEE Conference on Computer Vision and Pattern Recognition (CVPR), San Diego, CA, USA, Jun. 20-26, 2005, 8 pgs.
Hirschmuller et al., “Memory Efficient Semi-Global Matching, ISPRS Annals of the Photogrammetry”, Remote Sensing and Spatial Information Sciences, vol. I-3, 2012, XXII ISPRS Congress, Aug. 25-Sep. 1, 2012, Melbourne, Australia, 6 pgs.
Holoeye Photonics AG, “Spatial Light Modulators”, Oct. 2, 2013, Brochure retrieved from https://web.archive.org/web/20131002061028/http://holoeye.com/wp-content/uploads/Spatial_Light_Modulators.pdf on Oct. 13, 2017, 4 pgs.
Holoeye Photonics AG, “Spatial Light Modulators”, Sep. 18, 2013, retrieved from https://web.archive.org/web/20130918113140/http://holoeye.com/spatial-light-modulators/ on Oct. 13, 2017, 4 pgs.
Holoeye Photonics AG, “LC 2012 Spatial Light Modulator (transmissive)”, Sep. 18, 2013, retrieved from https://web.archive.org/web/20130918151716/http://holoeye.com/spatial-light-modulators/lc-2012-spatial-light-modulator/ on Oct. 20, 2017, 3 pgs.
Horisaki et al., “Superposition Imaging for Three-Dimensionally Space-Invariant Point Spread Functions”, Applied Physics Express, Oct. 13, 2011, vol. 4, pp. 112501-1-112501-3.
Horisaki et al., “Irregular Lens Arrangement Design to Improve Imaging Performance of Compound-Eye Imaging Systems”, Applied Physics Express, Jan. 29, 2010, vol. 3, pp. 022501-1-022501-3.
Horn et al., “LightShop: Interactive Light Field Manipulation and Rendering”, In Proceedings of I3D, Jan. 1, 2007, pp. 121-128.
Hossain et al., “Inexpensive Construction of a 3D Face Model from Stereo Images”, IEEE International Conference on Computerand Information Technology, Dec. 27-29, 2007, 6 pgs.
Hu et al., “A Quantitative Evaluation of Confidence Measures for Stereo Vision”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, Issue 11, Nov. 2012, pp. 2121-2133.
Humenberger et al., “A Census-Based Stereo Vision Algorithm Using Modified Semi-Global Matching and Plane Fitting to Improve Matching Quality”, IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), IEEE, Jun. 13-18, 2010, San Francisco, CA, 8 pgs.
Isaksen et al., “Dynamically Reparameterized Light Fields”, In Proceedings of SIGGRAPH 2000, 2000, pp. 297-306.
Izadi et al., “KinectFusion: Real-time 3D Reconstruction and Interaction Using a Moving Depth Camera”, UIST'11, Oct. 16-19, 2011, Santa Barbara, CA, pp. 559-568.
Jackson et al., “Large Post 3D Face Reconstruction from a Single Image via Direct Volumetric CNN Regression”, arXiv: 1703.07834v2, Sep. 8, 2017, 9 pgs.
Janoch et al., “A category-level 3-D object dataset: Putting the Kinect to work”, 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops), Nov. 6-13, 2011, Barcelona, Spain, pp. 1168-1174.
Jarabo et al., “Efficient Propagation of Light Field Edits”, In Proceedings of SIACG 2011, 2011, pp. 75-80.
Jiang et al., “Panoramic 3D Reconstruction Using Rotational Stereo Camera with Simple Epipolar Constraints”, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06), vol. 1, Jun. 17-22, 2006, New York, NY, USA, pp. 371-378.
Joshi, Color Calibration for Arrays of Inexpensive Image Sensors, Mitsubishi Electric Research Laboratories, Inc., TR2004-137, Dec. 2004, 6 pgs.
Joshi et al., “Synthetic Aperture Tracking: Tracking Through Occlusions”, ICCV IEEE 11th International Conference on Computer Vision; Publication [online], Oct. 2007 [retrieved Jul. 28, 2014], Retrieved from the Internet <URL: http:l/ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4409032&isnumber=4408819>, pp. 1-8.
Jourabloo, “Large-Pose Face Alignment via CNN-Based Dense 3D Model Fitting”, ICCV IEEE 11th International Conference on Computer Vision; Publication [online], Oct. 2007 [retrieved Jul. 28, 2014], Retrieved from the Internet: <URL: http:l/ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4409032&isnumber=4408819>; pp. 1-8.
Kang et al., “Handling Occlusions in Dense Multi-view Stereo”, Computer Vision and Pattern Recognition, 2001, vol. 1, pp. 1-103-1-110.
Keeton, “Memory-Driven Computing”, Hewlett Packard Enterprise Company, Oct. 20, 2016, 45 pgs.
Kim, “Scene Reconstruction from a Light Field”, Master Thesis, Sep. 1, 2010 (Sep. 1, 2010), pp. 1-72.
Kim et al., “Scene reconstruction from high spatio-angular resolution light fields”, ACM Transactions on Graphics (TOG)—SIGGRAPH 2013 Conference Proceedings, vol. 32 Issue 4, Article 73, Jul. 21, 2013, 11 pages.
Kitamura et al., “Reconstruction of a high-resolution image on a compound-eye image-capturing system”, Applied Optics, Mar. 10, 2004, vol. 43, No. 8, pp. 1719-1727.
Kittler et al., “3D Assisted Face Recognition: A Survey of 3D Imaging, Modelling, and Recognition Approaches”, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Jul. 2005, 7 pgs.
Konolige, Kurt “Projected Texture Stereo”, 2010 IEEE International Conference on Robotics and Automation, May 3-7, 2010, pp. 148-155.
Kotsia et al., “Facial Expression Recognition in Image Sequences Using Geometric Deformation Features and Support Vector Machines”, IEEE Transactions on Image Processing, Jan. 2007, vol. 16, No. 1, pp. 172-187.
Krishnamurthy et al., “Compression and Transmission of Depth Maps for Image-Based Rendering”, Image Processing, 2001, pp. 828-831.
Kubota et al., “Reconstructing Dense Light Field From Array of Multifocus Images for Novel View Synthesis”, IEEE Transactions on Image Processing, vol. 16, No. 1, Jan. 2007, pp. 269-279.
Kutulakos et al., “Occluding Contour Detection Using Affine Invariants and Purposive Viewpoint Control”, Computer Vision and Pattern Recognition, Proceedings CVPR 94, Seattle, Washington, Jun. 21-23, 1994, 8 pgs.
Lai et al., “A Large-Scale Hierarchical Multi-View RGB-D Object Dataset”, Proceedings—IEEE International Conference on Robotics and Automation, Conference Date May 9-13, 2011, 8 pgs., DOI:10.1109/ICRA.201135980382.
Lane et al., “A Survey of Mobile Phone Sensing”, IEEE Communications Magazine, vol. 48, Issue 9, Sep. 2010, pp. 140-150.
Lao et al., “3D template matching for pose invariant face recognition using 3D facial model built with isoluminance line based stereo vision”, Proceedings 15th International Conference on Pattern Recognition, Sep. 3-7, 2000, Barcelona, Spain, pp. 911-916.
Lee, “NFC Hacking: The Easy Way”, Defcon Hacking Conference, 2012, 24 pgs.
Lee et al., “Electroactive Polymer Actuator for Lens-Drive Unit in Auto-Focus Compact Camera Module”, ETRI Journal, vol. 31, No. 6, Dec. 2009, pp. 695-702.
Lee et al., “Nonlocal matting”, CVPR 2011, Jun. 20-25, 2011, pp. 2193-2200.
Lee et al., “Automatic Upright Adjustment of Photographs”, IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2012, pp. 877-884.
Lensvector, “How LensVector Autofocus Works”, 2010, printed Nov. 2, 2012 from http://www.lensvector.com/overview.html, 1 pg.
Levin et al., “A Closed Form Solution to Natural Image Matting”, IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2006, vol. 1, pp. 61-68.
Levin et al., “Spectral Matting”, 2007 IEEE Conference on Computer Vision and Pattern Recognition, Jun. 17-22, 2007, Minneapolis, MN, USA, pp. 1-8.
Levoy, “Light Fields and Computational Imaging”, IEEE Computer Society, Sep. 1, 2006, vol. 39, Issue No. 8, pp. 46-55.
Levoy et al., “Light Field Rendering”, Proc. ADM SIGGRAPH '96, 1996, pp. 1-12.
Li et al., “A Hybrid Camera for Motion Deblurring and Depth Map Super-Resolution”, Jun. 23-28, 2008, IEEE Conference on Computer Vision and Pattern Recognition, 8 pgs. Retrieved from www.eecis.udel.edu/˜jye/lab_research/08/deblur-feng.pdf on Feb. 5, 2014.
Li et al., “Fusing Images with Different Focuses Using Support Vector Machines”, IEEE Transactions on Neural Networks, vol. 15, No. 6, Nov. 8, 2004, pp. 1555-1561.
Lim, “Optimized Projection Pattern Supplementing Stereo Systems”, 2009 IEEE International Conference on Robotics and Automation, May 12-17, 2009, pp. 2823-2829.
Liu et al., “Virtual View Reconstruction Using Temporal Information”, 2012 IEEE International Conference on Multimedia and Expo, 2012, pp. 115-120.
Lo et al., “Stereoscopic 3D Copy & Paste”, ACM Transactions on Graphics, vol. 29, No. 6, Article 147, Dec. 2010, pp. 147:1-147:10.
Ma et al., “Constant Time Weighted Median Filtering for Stereo Matching and Beyond”, ICCV'13 Proceedings of the 2013 IEEE International Conference on Computer Vision, IEEE Computer Society, Washington DC, USA, Dec. 1-8, 2013, 8 pgs.
Martinez et al., “Simple Telemedicine for Developing Regions: Camera Phones and Paper-Based Microfluidic Devices for Real-Time, Off-Site Diagnosis”, Analytical Chemistry (American Chemical Society), vol. 80, No. 10, May 15, 2008, pp. 3699-3707.
McGuire et al., “Defocus video matting”, ACM Transactions on Graphics (TOG)—Proceedings of ACM SIGGRAPH 2005, vol. 24, Issue 3, Jul. 2005, pp. 567-576.
Medioni et al., “Face Modeling and Recognition in 3-D”, Proceedings of the IEEE International Workshop on Analysis and Modeling of Faces and Gestures, 2013, 2 pgs.
Merkle et al., “Adaptation and optimization of coding algorithms for mobile 3DTV”, Mobile3DTV Project No. 216503, Nov. 2008, 55 pgs.
Michael et al., “Real-time Stereo Vision: Optimizing Semi-Global Matching”, 2013 IEEE Intelligent Vehicles Symposium (IV), IEEE, Jun. 23-26, 2013, Australia, 6 pgs.
Milella et al., “3D reconstruction and classification of natural environments by an autonomous vehicle using multi-baseline stereo”, Intelligent Service Robotics, vol. 7, No. 2, Mar. 2, 2014, pp. 79-92.
Min et al., “Real-Time 3D Face Identification from a Depth Camera”, Proceedings of the IEEE International Conference on Pattern Recognition, Nov. 11-15, 2012, 4 pgs.
Mitra et al., “Light Field Denoising, Light Field Superresolution and Stereo Camera Based Refocussing using a GMM Light Field Patch Prior”, Computer Vision and Pattern Recognition Workshops (CVPRW), 2012 IEEE Computer Society Conference on Jun. 16-21, 2012, pp. 22-28.
Moreno-Noguer et al., “Active Refocusing of Images and Videos”, ACM Transactions on Graphics (TOG)—Proceedings of ACM SIGGRAPH 2007, vol. 26, Issue 3, Jul. 2007, 10 pgs.
Muehlebach, “Camera Auto Exposure Control for VSLAM Applications”, Studies on Mechatronics, Swiss Federal Institute of Technology Zurich, Autumn Term 2010 course, 67 pgs.
Nayar, “Computational Cameras: Redefining the Image”, IEEE Computer Society, Aug. 14, 2006, pp. 30-38.
Ng, “Digital Light Field Photography”, Thesis, Jul. 2006, 203 pgs.
Ng et al., “Super-Resolution Image Restoration from Blurred Low-Resolution Images”, Journal of Mathematical Imaging and Vision, 2005, vol. 23, pp. 367-378.
Ng et al., “Light Field Photography with a Hand-held Plenoptic Camera”, Stanford Tech Report CTSR Feb. 2005, Apr. 20, 2005, pp. 1-11.
Nguyen et al., “Image-Based Rendering with Depth Information Using the Propagation Algorithm”, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005, vol. 5, Mar. 23-23, 2005, pp. II-589-II-592.
Nguyen et al., “Error Analysis for Image-Based Rendering with Depth Information”, IEEE Transactions on Image Processing, vol. 18, Issue 4, Apr. 2009, pp. 703-716.
Nishihara, H.K. “PRISM: A Practical Real-Time Imaging Stereo Matcher”, Massachusetts Institute of Technology, A.I. Memo 780, May 1984, 32 pgs.
Nitta et al., “Image reconstruction for thin observation module by bound optics by using the iterative backprojection method”, Applied Optics, May 1, 2006, vol. 45, No. 13, pp. 2893-2900.
Nomura et al., “Scene Collages and Flexible Camera Arrays”, Proceedings of Eurographics Symposium on Rendering, Jun. 2007, 12 pgs.
Park et al., “Super-Resolution Image Reconstruction”, IEEE Signal Processing Magazine, May 2003, pp. 21-36.
Park et al., “Multispectral Imaging Using Multiplexed Illumination”, 2007 IEEE 11th International Conference on Computer Vision, Oct. 14-21, 2007, Rio de Janeiro, Brazil, pp. 1-8.
Park et al., “3D Face Reconstruction from Stereo Video”, First International Workshop on Video Processing for Security, Jun. 7-9, 2006, Quebec City, Canada, 2006, 8 pgs.
Parkkinen et al., “Characteristic Spectra of Munsell Colors”, Journal of the Optical Society of America A, vol. 6, Issue 2, Feb. 1989, pp. 318-322.
Perwass et al., “Single Lens 3D-Camera with Extended Depth-of-Field”, printed from www.raytrix.de, Jan. 22, 2012, 15 pgs.
Pham et al., “Robust Super-Resolution without Regularization”, Journal of Physics: Conference Series 124, Jul. 2008, pp. 1-19.
Philips 3D Solutions, “3D Interface Specifications, White Paper”, Feb. 15, 2008, 2005-2008 Philips Electronics Nederland B.V., Philips 3D Solutions retrieved from www.philips.com/3dsolutions, 29 pgs.
Polight, “Designing Imaging Products Using Reflowable Autofocus Lenses”, printed Nov. 2, 2012 from http://www.polight.no/tunable-polymer-autofocus-lens-html-11.html, 1 pg.
Pouydebasque et al., “Varifocal liquid lenses with integrated actuator, high focusing power and low operating voltage fabricated on 200 mm wafers”, Sensors and Actuators A: Physical, vol. 172, Issue 1, Dec. 2011, pp. 280-286.
Protter et al., “Generalizing the Nonlocal-Means to Super-Resolution Reconstruction”, IEEE Transactions on Image Processing, Dec. 2, 2008, vol. 18, No. 1, pp. 36-51.
Radtke et al., “Laser lithographic fabrication and characterization of a spherical artificial compound eye”, Optics Express, Mar. 19, 2007, vol. 15, No. 6, pp. 3067-3077.
Rajan et al., “Simultaneous Estimation of Super Resolved Scene and Depth Map from Low Resolution Defocused Observations”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, No. 9, Sep. 8, 2003, pp. 1-16.
Rander et al., “Virtualized Reality: Constructing Time-Varying Virtual Worlds from Real World Events”, Proc. of IEEE Visualization '97, Phoenix, Arizona, Oct. 19-24, 1997, pp. 277-283, 552.
Ranjan et al., “HyperFace: A Deep Multi-Task Learning Framework for Face Detection, Landmark Localization, Pose Estimation, and Gender Recognition”, May 11, 2016 (May 11, 2016), pp. 1-16.
Rhemann et al., “Fast Cost-Volume Filtering for Visual Correspondence and Beyond”, IEEE Trans. Pattern Anal. Mach. Intell, 2013, vol. 35, No. 2, pp. 504-511.
Rhemann et al., “A perceptually motivated online benchmark for image matting”, 2009 IEEE Conference on Computer Vision and Pattern Recognition, Jun. 20-25, 2009, Miami, FL, USA, pp. 1826-1833.
Robert et al., “Dense Depth Map Reconstruction: A Minimization and Regularization Approach which Preserves Discontinuities”, European Conference on Computer Vision (ECCV), pp. 439-451, (1996).
Robertson et al., “Dynamic Range Improvement Through Multiple Exposures”, In Proc. of the Int. Conf. on Image Processing, 1999, 5 pgs.
Robertson et al., “Estimation-theoretic approach to dynamic range enhancement using multiple exposures”, Journal of Electronic Imaging, Apr. 2003, vol. 12, No. 2, pp. 219-228.
Roy et al., “Non-Uniform Hierarchical Pyramid Stereo for Large Images”, Computer and Robot Vision, 2002, pp. 208-215.
Rusinkiewicz et al., “Real-Time 3D Model Acquisition”, ACM Transactions on Graphics (TOG), vol. 21, No. 3, Jul. 2002, pp. 438-446.
Saatci et al., “Cascaded Classification of Gender and Facial Expression using Active Appearance Models”, IEEE, FGR'06, 2006, 6 pgs.
Sauer et al., “Parallel Computation of Sequential Pixel Updates in Statistical Tomographic Reconstruction”, ICIP 1995 Proceedings of the 1995 International Conference on Image Processing, Date of Conference: Oct. 23-26, 1995, pp. 93-96.
Scharstein et al., “High-Accuracy Stereo Depth Maps Using Structured Light”, IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2003), Jun. 2003, vol. 1, pp. 195-202.
Seitz et al., “Plenoptic Image Editing”, International Journal of Computer Vision 48, Conference Date Jan. 7, 1998, 29 pgs., DOI: 10.1109/ICCV.1998.710696 ⋅ Source: DBLP Conference: Computer Vision, Sixth International Conference.
Shechtman et al., “Increasing Space-Time Resolution in Video”, European Conference on Computer Vision, LNCS 2350, May 28-31, 2002, pp. 753-768.
Shotton et al., “Real-time human pose recognition in parts from single depth images”, CVPR 2011, Jun. 20-25, 2011, Colorado Springs, CO, USA, pp. 1297-1304.
Shum et al., “Pop-Up Light Field: An Interactive Image-Based Modeling and Rendering System”, Apr. 2004, ACM Transactions on Graphics, vol. 23, No. 2, pp. 143-162, Retrieved from http://131.107.65.14/en-us/um/people/jiansun/papers/PopupLightField_TOG.pdf on Feb. 5, 2014.
Shum et al., “A Review of Image-based Rendering Techniques”, Visual Communications and Image Processing 2000, May 2000, 12 pgs.
Sibbing et al., “Markerless reconstruction of dynamic facial expressions”, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshop: Kyoto, Japan, Sep. 27-Oct. 4, 2009, Institute of Electrical and Electronics Engineers, Piscataway, NJ, Sep. 27, 2009 (Sep. 27, 2009), pp. 1778-1785.
Silberman et al., “Indoor segmentation and support inference from RGBD images”, ECCV'12 Proceedings of the 12th European conference on Computer Vision, vol. Part V, Oct. 7-13, 2012, Florence, Italy, pp. 746-760.
Stober, “Stanford researchers developing 3-D camera with 12,616 lenses”, Stanford Report, Mar. 19, 2008, Retrieved from: http://news.stanford.edu/news/2008/march19/camera-031908.html, 5 pgs.
Stollberg et al., “The Gabor superlens as an alternative wafer-level camera approach inspired by superposition compound eyes of nocturnal insects”, Optics Express, Aug. 31, 2009, vol. 17, No. 18, pp. 15747-15759.
Sun et al., “Image Super-Resolution Using Gradient Profile Prior”, 2008 IEEE Conference on Computer Vision and Pattern Recognition, Jun. 23-28, 2008, 8 pgs.; DOI: 10.1109/CVPR.2008.4587659.
Taguchi et al., “Rendering-Oriented Decoding for a Distributed Multiview Coding System Using a Coset Code”, Hindawi Publishing Corporation, EURASIP Journal on Image and Video Processing, vol. 2009, Article ID 251081, Online: Apr. 22, 2009, 12 pgs.
Takeda et al., “Super-resolution Without Explicit Subpixel Motion Estimation”, IEEE Transaction on Image Processing, Sep. 2009, vol. 18, No. 9, pp. 1958-1975.
Tallon et al., “Upsampling and Denoising of Depth Maps via Joint-Segmentation”, 20th European Signal Processing Conference, Aug. 27-31, 2012, 5 pgs.
Tanida et al., “Thin observation module by bound optics (TOMBO): concept and experimental verification”, Applied Optics, Apr. 10, 2001, vol. 40, No. 11, pp. 1806-1813.
Tanida et al., “Color imaging with an integrated compound imaging system”, Optics Express, Sep. 8, 2003, vol. 11, No. 18, pp. 2109-2117.
Tao et al., “Depth from Combining Defocus and Correspondence Using Light-Field Cameras”, ICCV '13 Proceedings of the 2013 IEEE International Conference on Computer Vision, Dec. 1, 2013, pp. 673-680.
Taylor, “Virtual camera movement: The way of the future?”, American Cinematographer, vol. 77, No. 9, Sep. 1996, pp. 93-100.
Tseng et al., “Automatic 3-D depth recovery from a single urban-scene image”, 2012 Visual Communications and Image Processing, Nov. 27-30, 2012, San Diego, CA, USA, pp. 1-6.
Uchida et al., 3D Face Recognition Using Passive Stereo Vision, IEEE International Conference on Image Processing 2005, Sep. 14, 2005, 4 pgs.
Vaish et al., “Reconstructing Occluded Surfaces Using Synthetic Apertures: Stereo, Focus and Robust Measures”, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06), vol. 2, Jun. 17-22, 2006, pp. 2331-2338.
Vaish et al., “Using Plane + Parallax for Calibrating Dense Camera Arrays”, IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2004, 8 pgs.
Vaish et al., “Synthetic Aperture Focusing Using a Shear-Warp Factorization of the Viewing Transform”, IEEE Workshop on A3DISS, CVPR, 2005, 8 pgs.
Van Der Wal et al., “The Acadia Vision Processor”, Proceedings Fifth IEEE International Workshop on Computer Architectures for Machine Perception, Sep. 13, 2000, Padova, Italy, pp. 31-40.
Veilleux, “CCD Gain Lab: The Theory”, University of Maryland, College Park-Observational Astronomy (ASTR 310), Oct. 19, 2006, pp. 1-5 (online], [retrieved on May 13, 2014], Retrieved from the Internet <URL: http://www.astro.umd.edu/˜veilleux/ASTR310/fall06/ccd_theory.pdf, 5 pgs.
Venkataraman et al., “PiCam: An Ultra-Thin High Performance Monolithic Camera Array”, ACM Transactions on Graphics (TOG), ACM, US, vol. 32, No. 6, 1 Nov. 1, 2013, pp. 1-13.
Vetro et al., “Coding Approaches for End-To-End 3D TV Systems”, Mitsubishi Electric Research Laboratories, Inc., TR2004-137, Dec. 2004, 6 pgs.
Viola et al., “Robust Real-time Object Detection”, Cambridge Research Laboratory, Technical Report Series, Compaq, CRL 2001/01, Feb. 2001, Printed from: http://www.hpl.hp.com/techreports/Compaq-DEC/CRL-2001-1.pdf, 30 pgs.
Vuong et al., “A New Auto Exposure and Auto White-Balance Algorithm to Detect High Dynamic Range Conditions Using CMOS Technology”, Proceedings of the World Congress on Engineering and Computer Science 2008, WCECS 2008, Oct. 22-24, 2008, 5 pgs.
Wang, “Calculation of Image Position, Size and Orientation Using First Order Properties”, Dec. 29, 2010, OPTI521 Tutorial, 10 pgs.
Wang et al., “Soft scissors: an interactive tool for realtime high quality matting”, ACM Transactions on Graphics (TOG)—Proceedings of ACM SIGGRAPH 2007, vol. 26, Issue 3, Article 9, Jul. 2007, 6 pg., published Aug. 5, 2007.
Wang et al., “Automatic Natural Video Matting with Depth”, 15th Pacific Conference on Computer Graphics and Applications, PG '07, Oct. 29 -Nov. 2, 2007, Maui, HI, USA, pp. 469-472.
Wang et al., “Image and Video Matting: A Survey”, Foundations and Trends, Computer Graphics and Vision, vol. 3, No. 2, 2007, pp. 91-175.
Wang et al., “Facial Feature Point Detection: A Comprehensive Survey”, arXiv: 1410.1037v1, Oct. 4, 2014, 32 pgs.
Wetzstein et al., “Computational Plenoptic Imaging”, Computer Graphics Forum, 2011, vol. 30, No. 8, pp. 2397-2426.
Wheeler et al., “Super-Resolution Image Synthesis Using Projections Onto Convex Sets in the Frequency Domain”, Proc. SPIE, Mar. 11, 2005, vol. 5674, 12 pgs.
Widanagamaachchi et al., “3D Face Recognition from 2D Images: A Survey”, Proceedings of the International Conference on Digital Image Computing: Techniques and Applications, Dec. 1-3, 2008, 7 pgs.
Wieringa et al., “Remote Non-invasive Stereoscopic Imaging of Blood Vessels: First In-vivo Results of a New Multispectral Contrast Enhancement Technology”, Annals of Biomedical Engineering, vol. 34, No. 12, Dec. 2006, pp. 1870-1878, Published online Oct. 12, 2006.
Wikipedia, “Polarizing Filter (Photography)”, retrieved from http://en.wikipedia.org/wiki/Polarizing_filter_(photography) on Dec. 12, 2012, last modified on Sep. 26, 2012, 5 pgs.
Wilburn, “High Performance Imaging Using Arrays of Inexpensive Cameras”, Thesis of Bennett Wilburn, Dec. 2004, 128 pgs.
Wilburn et al., “High Performance Imaging Using Large Camera Arrays”, ACM Transactions on Graphics, Jul. 2005, vol. 24, No. 3, pp. 1-12.
Wilburn et al., “High-Speed Videography Using a Dense Camera Array”, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004., vol. 2, Jun. 27-Jul. 2, 2004, pp. 294-301.
Wilburn et al., “The Light Field Video Camera”, Proceedings of Media Processors 2002, SPIE Electronic Imaging, 2002, 8 pgs.
Wippermann et al., “Design and fabrication of a chirped array of refractive ellipsoidal micro-lenses for an apposition eye camera objective”, Proceedings of SPIE, Optical Design and Engineering II, Oct. 15, 2005, pp. 59622C-1-59622C-11.
Wu et al., “A virtual view synthesis algorithm based on image inpainting”, 2012 Third International Conference on Networking and Distributed Computing, Hangzhou, China, Oct. 21-24, 2012, pp. 153-156.
Xu, “Real-Time Realistic Rendering and High Dynamic Range Image Display and Compression”, Dissertation, School of Computer Science in the College of Engineering and Computer Science at the University of Central Florida, Orlando, Florida, Fall Term 2005, 192 pgs.
Yang et al., “Superresolution Using Preconditioned Conjugate Gradient Method”, Proceedings of SPIE—The International Society for Optical Engineering, Jul. 2002, 8 pgs.
Yang et al., “A Real-Time Distributed Light Field Camera”, Eurographics Workshop on Rendering (2002), published Jul. 26, 2002, pp. 1-10.
Yang et al., Model-based Head Pose Tracking with Stereovision, Microsoft Research, Technical Report, MSR-TR-2001-102, Oct. 2001, 12 pgs.
Yokochi et al., “Extrinsic Camera Parameter Estimation Based-on Feature Tracking and GPS Data”, 2006, Nara Institute of Science and Technology, Graduate School of Information Science, LNCS 3851, pp. 369-378.
Zbontar et al., Computing the Stereo Matching Cost with a Convolutional Neural Network, CVPR, 2015, pp. 1592-1599.
Zhang et al., “A Self-Reconfigurable Camera Array”, Eurographics Symposium on Rendering, published Aug. 8, 2004, 12 pgs.
Zhang et al., “Depth estimation, spatially variant image registration, and super-resolution using a multi-lenslet camera”, proceedings of SPIE, vol. 7705, Apr. 23, 2010, pp. 770505-770505-8, XP055113797 ISSN: 0277-786X, DOI: 10.1117/12.852171.
Zhang et al., “Spacetime Faces: High Resolution Capture for Modeling and Animation”, ACM Transactions on Graphics, 2004, 11pgs.
Zheng et al., “Balloon Motion Estimation Using Two Frames”, Proceedings of the Asilomar Conference on Signals, Systems and Computers, IEEE, Comp. Soc. Press, US, vol. 2 of 2, Nov. 4, 1991, pp. 1057-1061.
Zhu et al., “Fusion of Time-of-Flight Depth and Stereo for High Accuracy Depth Maps”, 2008 IEEE Conference on Computer Vision and Pattern Recognition, Jun. 23-28, 2008, Anchorage, AK, USA, pp. 1-8.
Zomet et al., “Robust Super-Resolution”, IEEE, 2001, pp. 1-6.
“File Formats Version 6”, Alias Systems, 2004, 40 pgs.
“Light fields and computational photography”, Stanford Computer Graphics Laboratory, Retrieved from: http://graphics.stanford.edu/projects/lightfield/, Earliest publication online: Feb. 10, 1997, 3 pgs.
“Exchangeable image file format for digital still cameras: Exif Version 2.2”_, Japan Electronics and Information Technology Industries Association, Prepared by Technical Standardization Committee on AV & IT Storage Systems and Equipment, JEITA CP-3451, Apr. 2002, Retrieved from http://www.exif.org/Exif2-2.PDF, 154 pgs.
Azorin-Lopez, Jorge, et al. “A Novel Active Imaging Model to Design Visual Systems: A Case of Inspection System for Specular Surfaces.” Sensors 17.7 (2017): 1466, 30 pages.
Bajard, Alban, et al. “Non conventional Imaging Systems for 3D Digitization of transparent and/or specular manufactured objects.” QCAV2013, 11th Interntional Conference on Quality Control by Artificial Vision. 2013, 9 pages.
Barnes, Bryan M., et al. “Enhancing 9 nm Node Dense Patterned Defect Optical Inspection using Polarization, Angle, and Focus.” Metrology, Inspection, and Process Control for Microlithography XXVII. vol. 8681. International Society for Optics and Photonics, 2013, 8 pages.
Brugés Martelo, Javier, et al. “Paperboard Coating Detection Based on Full-Stokes Imaging Polarimetry.” Sensors 21.1 (2021): 208, 14 pages.
Chen, Hua, et al. “Polarization Phase-Based Method for Material Classification in Computer Vision,” International Journal of Computer Vision 28(1), 1996, pp. 73-83.
Cui, Zhaopeng, et al. “Polarimetric multi-view stereo,” Proceedings of the IEEE conference on computer vision and pattern recognition. 2017, pp. 1558-1567.
Kadambi, Achuta et al., “Polarized 3d: High-quality depth sensing with polarization cues,” Proceedings of the IEEE International Conference on Computer Vision. 2015, pp. 3370-3378.
Meriaudeau, Fabrice, et al. “Polarization imaging for industrial inspection.” Image Processing: Machine Vision Applications. vol. 6813. International Society for Optics and Photonics, 2008, 11 pages.
Miyazaki, Daisuke, et al. “Surface normal estimation of black specular objects from multiview polarization images.” Optical Engineering 56.4 (2016): 041303, 18 pages.
Miyazaki, Daisuke, et al. “Polarization-based surface normal estimation of black specular objects from multiple viewpoints.” 2012 Second International Conference on 3D Imaging, Modeling, Processing, Visualization & Transmission. IEEE, 2012, 8 pages.
Morel, Olivier, et al. “Three-Dimensional Inspection of Highly-Reflective Metallic Objects by Polarization Imaging.” Electronic Imaging Newsletter 15.2 (2005): 4.
Morel, Olivier, et al. “Visual Behaviour Based Bio-Inspired Polarization Techniques in Computer Vision and Robotics.” Developing and Applying Biologically-Inspired Vision Systems: Interdisciplinary Concepts. IGI Global, 2013. 243-272.
Morel, O., et al. “Polarization Imaging for 3D Inspection of Highly Reflective Metallic Objects” Optics and Spectroscopy, vol. 101, No. 1, pp. 11-17, (2006).
Rahmann, Stefan. “Polarization images: a geometric interpretation for shape analysis.” Proceedings 15th International Conference on Pattern Recognition. ICPR-2000. vol. 3. IEEE, 2000, 5 pages.
Stolz, Christophe, et al. “Short review of polarimetric imaging based method for 3D measurements” Optics, Photonics and Digital Technologies for Imaging Applications IV. vol. 9896. International Society for Optics and Photonics, 2016, 9 pages.
Stolz, Christophe, et al. “Real time polarization imaging of weld pool surface.” Twelfth International Conference on Quality Control by Artificial Vision 2015. vol. 9534. International Society for Optics and Photonics, 2015, 7 pages.
Xu, L. M., et al. “Light source optimization for automatic visual inspection of piston surface defects” The International Journal of Advanced Manufacturing Technology 91.5 (2017): 2245-2256.
Yvain Quéau, Jean-Denis Durou, Jean-François Aujol. Normal Integration: A Survey. 2016. Hal-01334349v4, 19 pages.
International Search Report and Written Opinion for International Application No. PCT/US20/54641, dated Feb. 17, 2021, 13 pages.
Written Opinion for International Application No. PCT/US2020/051243, dated Dec. 9, 2020, 9 pages.
Related Publications (1)
Number Date Country
20210264607 A1 Aug 2021 US
Provisional Applications (2)
Number Date Country
62942113 Nov 2019 US
63001445 Mar 2020 US