SYSTEM AND METHOD FOR END-TO-END DIFFERENTIABLE JOINT IMAGE REFINEMENT AND PERCEPTION

Information

  • Patent Application
  • 20240420031
  • Publication Number
    20240420031
  • Date Filed
    August 30, 2024
    3 months ago
  • Date Published
    December 19, 2024
    3 days ago
Abstract
System and method for end-to-end differentiable joint image refinement and perception are provided. A learning machine employs an image acquisition device for acquiring a set of training raw images. A processor determines a representation of a raw image, initializes a set of image representation parameters, defines a set of analysis parameters of an image analysis network configured to process the image's representation, and jointly trains the set of representation parameters and the set of analysis parameters to optimize a combined objective function. A module for transforming pixel-values of the raw image to produce a transformed image comprising pixels of variance-stabilized values, a module for successively performing processes of soft camera projection and image projection, and a module for inverse transforming the transformed pixels are disclosed. The image projection performs multi-level spatial convolution, pooling, subsampling, and interpolation.
Description
TECHNICAL FIELD

The field of the disclosure relates generally to image signal processing and image perception and, more specifically, methods of enhancing machine perception.


BACKGROUND OF THE INVENTION

In an image formation process, image sensor measurements are subject to degradations. Raw sensor readings suffer from photon shot noise, optical aberration, read-out noise, spatial subsampling in the color filter array (CFA), spectral cross-talk on the CFA, motion blur, and other imperfections. An image signal processor (ISP), which may be a hardware entity, addresses such degradations by processing the raw measurement in a sequential pipeline of steps, each targeting a degradation type in isolation, before displaying or saving the resulting output image. The ISP performs an extensive set of operations, such as demosaicing, denoising, and deblurring. Current image processing algorithms are designed to minimize an explicit or implicit image reconstruction loss relevant to human perceptions of image quality.


Progress in imaging and graphics has enabled many applications, including autonomous driving, automated design tools, robotics, and surveillance, where images are consumed directly by a higher-level analysis module without ever being viewed by humans. This gives rise to the question of whether signal processing is necessary, i.e., whether a learning machine is better trained directly on raw sensor data. ISPs map data from diverse camera systems into relatively clean images. However, recovering a latent image is difficult in low-light captures that are heavily degraded by photon shot noise. Low light is, in effect, a failure mode for conventional computer vision systems, which combine existing ISPs with existing classification networks.


The performance of conventional imaging and perception networks degrades under noise, optical aberrations, and other imperfections present in raw sensor data. An image-processing pipeline may interpose an image source and an image renderer to reconstruct an image that has been deteriorated. An image pipeline may be implemented using a general-purpose computer, a Field-Programmable Gate Array (FPGA), or an Application-Specific Integrated Circuit (ASIC). Conventional image-processing pipelines (ISPs) are optimized for human viewing, not for machine vision.


A demosaicing process, which is also called color-filter-array interpolation (CFA interpolation), reconstructs a full color image from incomplete color samples output from an image sensor overlaid with a CFA.


An image denoising process estimates the original image by suppressing noise from a noise-contaminated image. Several algorithms for image denoising are known in the art.


An image deblurring process attempts to remove blurring artifacts from images, such as blur caused by defocus aberration or motion blur.


It is observed that conventional perception networks, which use state-of-the-art ISPs and classifiers trained on a standard JPEG dataset, perform poorly in low light.


There is a need, therefore, to explore improved perception networks that perform well under adverse illumination conditions.


This section is intended to introduce the reader to various aspects of art that may be related to various aspects of the present disclosure described or claimed below. This description is believed to be helpful in providing the reader with background information to facilitate a better understanding of the various aspects of the present disclosure. Accordingly, it should be understood that these statements are to be read in this light and not as admissions of prior art.


SUMMARY OF THE INVENTION

The disclosure provides a novel apparatus, a learning-machine, configured for joint determination of optimal parameters of image denoising, demosaicing, and analysis. Configuration of the apparatus is based on formulating an end-to-end differentiable objective function. The apparatus accepts raw color filter array data and is flexible to handle different sensor configurations and capture settings without retraining or capturing of new training datasets.


Jointly tuning an image-reconstruction module and an image classification module outperforms training a classification module directly on raw images or the refined images produced using software and hardware Image Signal Processors (ISPs).


In accordance with an aspect, the disclosure provides a method of machine learning. The method is based on acquiring a plurality of raw images and employing at least one hardware processor to execute processes of determining a representation of a raw image of the plurality of raw images, initializing a plurality of representation parameters of the representation, defining a plurality of analysis parameters of an image analysis network configured to process the image representation, and jointly training the plurality of representation parameters and the plurality of analysis parameters to optimize a combined objective function.


The process of determining a representation of a raw image starts with transforming pixel-value of the raw image to produce a variance-stabilized transformed image. The transformed image is processed in a sequence of image representation stages, each stage comprising a soft camera projection module and an image projection module, resulting in a multi-channel representation. An inverse pixel-value transformation is applied to the multi-channel representation.


The combined objective function may be formulated as a nested bilevel objective function comprising an outer objective function relevant to the image analysis network and an inner objective function relevant to the representation.


The pixel-value transformation may be based on an Anscombe transformation in which case the inverse pixel-value transformation would be an unbiased inverse Anscombe transformation. The process of pixel-value transformation also generates an added channel.


The process of image projection comprises performing steps of multi-level spatial convolution, pooling, subsampling, and interpolation. The plurality of representation parameters comprises values of the number of levels, pooling, a stride of subsampling, and a step of interpolation.


The method further comprises evaluating the learned machine using a plurality of test images and revising the number of levels, pooling parameter, a stride of the subsampling, and a step of the interpolation according to a result of the evaluation.


The method further comprises evaluating the learned machine using a plurality of test images and adding selected test images to the plurality of raw images. The processes of determining, initializing, defining, and jointly training are then repeated, thus, enabling continually updating the plurality of representation parameters and the plurality of analysis parameters.


The method further comprises cyclically operating the learned machine in alternate modes. During a first mode the plurality of raw images are updated; and the processes of determining, initializing, defining, and jointly training are executed. During a second mode, new images are analysed according to latest values of the plurality of representation parameters and the plurality of analysis parameters.


In accordance with another aspect, the disclosure provides a learning machine. The learning machine employs an image acquisition device for acquiring a plurality of raw images and comprises a memory device, and a hardware processor. The memory device comprises a plurality of storage units, storing processor executable instructions. The hardware processor comprises a plurality of processing units.


The instructions cause the hardware processor to determine a representation of a raw image of the plurality of raw images, initialize a plurality of representation parameters defining the representation, define a plurality of analysis parameters of an image analysis network configured to process the representation, and jointly train the plurality of representation parameters and the plurality of analysis parameters to optimize a combined objective function.


The processor executable instructions comprise modules which cause the hardware processor to:

    • (1) transform pixel-values of the raw image to produce a transformed image comprising pixels of variance-stabilized values;
    • (2) successively perform processes of soft camera projection; and image projection; and
    • (3) perform inverse transformation.


The processor executable instructions further comprise a module causing the hardware processor to execute an algorithm for joint optimization of nested bilevel objective functions, thereby enabling formulation of the combined objective function as an outer objective function relevant to the image analysis network and an inner objective function relevant to the representation.


The processor executable instructions further comprise a module causing the processor to implement an Anscombe transformation and a module causing the processor to implement an unbiased inverse Anscombe transformation.


The processor executable instructions further comprise a module causing the hardware processor to generate an additional channel to the transformed image.


The processor executable instructions further comprise a module causing the hardware processor to perform processes of multi-level spatial convolution, pooling, subsampling, and interpolation.


The memory device stores specified values for the number of levels, pooling parameters, a stride of subsampling, and a step of interpolation.


The processor executable instructions comprise a module causing the hardware processor to perform processes of performance evaluation using a plurality of test images; and revising the number of levels, pooling parameters, a stride of subsampling, and a step of interpolation according to a result of evaluation.


The processor executable instructions further comprise a module causing the hardware processor to perform processes of performance evaluation using a plurality of test images, adding selected test images to the plurality of raw images, and repeating the processes of determining, initializing, defining, and jointly training.


The processor executable instructions further comprise a module causing the hardware processor to perform a cyclic bimodal operation. During a first mode the plurality of raw images is updated and the processes of determining, initializing, defining, and jointly training are executed.


During a second mode, new images are classified according to latest values of the plurality of representation parameters and the plurality of analysis parameters.


Thus, the disclosure provides a learning-machine architecture for joint image reconstruction and image classification that renders classification robust, particularly under low-light conditions. A principled modular design generalizes to other combinations of image formation models and high-level computer vision tasks.


Various refinements exist of the features noted in relation to the above-mentioned aspects. Further features may also be incorporated in the above-mentioned aspects as well. These refinements and additional features may exist individually or in any combination. For instance, various features discussed below in relation to any of the illustrated examples may be incorporated into any of the above-described aspects, alone or in any combination.





BRIEF DESCRIPTION OF DRAWINGS

The following drawings form part of the present specification and are included to further demonstrate certain aspects of the present disclosure. The disclosure may be better understood by reference to one or more of these drawings in combination with the detailed description of specific embodiments presented herein.



FIG. 1 illustrates a conventional learning machine for image refinement and perception;



FIG. 2 illustrates a learning machine based on joint learning of global parameters (joint parameters) relevant to image refinement and perception, in accordance with an embodiment of the present invention;



FIG. 3 illustrates a closed-loop training system comprising an image representation network generating a multi-channel representation of a latent image to be supplied to an image analysis module, in accordance with an embodiment of the present invention;



FIG. 4 illustrates an image representation network used within the learning machine of FIG. 2, in accordance with an embodiment of the present invention;



FIG. 5 illustrates a prior-art image-denoising device employing variance-stabilizing transformation module, a Gaussian denoising module, and an inverse transformation module;



FIG. 6 illustrates further details of the image representation network of FIG. 4, in accordance with an embodiment of the present invention;



FIG. 7 illustrates image representation based on Anscombe's transformation and inverse Anscombe's transformation, in accordance with an embodiment of the present invention;



FIG. 8 illustrates inputs and outputs of an image representation stage of the image representation network of FIG. 4, in accordance with an embodiment of the present invention;



FIG. 9 illustrates pixel-value variance-stabilizing based on Anscombe's transformation producing an added channel, in accordance with an embodiment of the present invention;



FIG. 10 illustrates an image projection module (a U-Net stage) configured as a contracting path and a symmetric expanding path, the contracting path capturing context and the expanding path enabling accurate localization;



FIG. 11 illustrates convolution options for use in the image analysis network of the learning machine of FIG. 2;



FIG. 12 illustrates the contracting path of an image projection module (a U-Net stage);



FIG. 13 illustrates the expanding path of the image projection module;



FIG. 14 illustrates iterative and unrolled activation of image representation stages, in accordance with an embodiment of the present invention;



FIG. 15 illustrates details the learning machine of FIG. 2;



FIG. 16 illustrates a system for continual learning comprising a training phase and an operation phase;



FIG. 17 illustrates an implementation of the system of FIG. 16 enabling concurrent training and operation, in accordance with an embodiment of the present invention;



FIG. 18 illustrates general transformation of pixel values of an image to produce pixel values of lower coefficient of variation;



FIG. 19 illustrates linear transformation of pixel values of an image to produce pixel values of lower coefficient of variation;



FIG. 20 illustrates data structures of a training data set and apparatus parameters; and



FIG. 21 is an overview of a system using the learning machine of FIG. 2 for the training phase and operation phase.





The following reference numerals are used throughout the drawings:

    • 100: A conventional learning machine for image refinement and perception
    • 110: Image acquisition device
    • 112: Raw image
    • 120: Image signal processing module
    • 122: Processed image (denoised, demosaiced, . . . )
    • 130: Image classification network
    • 132: Image classification
    • 140: Signal-processing parameters
    • 150: Learned classification parameters
    • 200: Optimized end-to-end machine learning
    • 210: A learning machine based on joint learning of global parameters (joint parameters) relevant to both image representation and image perception
    • 220: General image representation network
    • 222: Intermediate data
    • 230: Image analysis network with parameters determined according to a global (end-to-end) optimization procedure
    • 232: Image classification
    • 240: Learned global (end-to-end) parameters
    • 300: Closed-loop training of the learning machine of FIG. 2
    • 310: Raw image, c channels, m×n pixels per channels, m, n, c being positive integers
    • 330: Multi-channel representation of latent image
    • 380: Backpropagated gradients
    • 420: Variance stabilizing transform and corresponding inverse transform
    • 430: Image representation stage
    • 440: Soft camera projection module
    • 450: Image projection module (U-Net stage) generating a residual connection
    • 460: Pre-defined number of executing the image representation stage 430
    • 480: Intermediate multi-channel representation of latent image
    • 500: Conventional image-denoising device employing Anscombe transformation
    • 512: Degraded raw image
    • 520: Variance stabilizing transformation module
    • 522: Transformed variance stabilized image (reduced variance in comparison with the raw image)
    • 530: Gaussian denoising module
    • 532: Denoised variance stabilized image
    • 540: Inverse transformation module
    • 542: Improved image with restored variance
    • 600: Generation of multichannel image representation employing image representation network 220
    • 620: Variance stabilizing transformation module producing an added channel (FIG. 9)
    • 622: Transformed variance-stabilized image
    • 624: Added channel
    • 630: Cascaded image representation stages (U-Net stages)
    • 632: Intermediate channels (corresponding to reduced-variance images)
    • 640: Inverse transformation module producing a residual connection
    • 700: Image representation based on Anscombe transform
    • 720: Raw-image shaping unit using Anscombe's transform
    • 722: A form of Anscombe's transform
    • 730: Shaped image according to Anscombe's transform
    • 750: Midway channels
    • 760: Inverse image-shaping unit implementing unbiased inverse Anscombe's transform
    • 762: A form of an unbiased inverse Anscombe's transform
    • 770: Multi-channel representation Λ (., Θ) of latent image based on forward and inverse Anscombe's transforms
    • 800: Inputs and outputs of a single image representation stage 430 comprising a soft camera projection module 440 and an image projection module 450 (one U-Net stage)
    • 812: Transformed (shaped) image or output of an immediately preceding activation of an image representation stage
    • 822: Midway image
    • 830: Specification of image projection module (U-Net stage) including number of levels, parameters of spatial convolution, pooling, subsampling, and interpolation
    • 844: Midway multi-channel representation of latent image
    • 900: Processes of image transformation (shaping) producing an added channel
    • 910: Raw image (processing of one channel illustrated)
    • 920: Anscombe transformation process
    • 930: Transformed image; the raw image with modified pixel values
    • 940: Noise parameter
    • 950: Added channel
    • 1000: Processes of image projection module (a single U-Net stage)
    • 1010: Output of the variance stabilizing module or output of a preceding activation of an image projection module (activation of a U-Net stage)
    • 1020: Feature maps generated during contracting-path first-level convolution
    • 1026: Information transfer
    • 1028: Pooling—first level to second level
    • 1030: Feature maps generated during expanding-path convolution from second level to first level
    • 1040: Feature maps generated during contracting-path second-level convolution
    • 1046: Information transfer
    • 1048: Pooling—second level to third level
    • 1050: Feature maps generated during expanding-path convolution from third level to second level
    • 1058: Interpolation (“upsampling”)—second level to first level
    • 1060: Feature maps generated during contracting-path third-level convolution
    • 1068: Interpolation (“upsampling”)—third level to second level
    • 1100: Convolution options
    • 1110: Filter
    • 1120: Spatial-convolution operator
    • 1130: image of m×n pixels
    • 1140: w×w window (w<<m, W<<n)
    • 1150: Feature-map (no zero padding)
    • 1160: Feature map (zero padding)
    • 1400: Iterative and unrolled activation of image representation stages
    • 1410: Reduced-variance image
    • 1420: An image representation stage
    • 1430: Termination criterion
    • 1440: Multi-channel representation—iterative activation of image representation stage 430
    • 1450: Multi-channel representation—unrolled cascaded activation of image representation stages 430
    • 1500: Processes of learning machine 200
    • 1510: Acquisition of raw images
    • 1520: Image shaping using Anscombe transform
    • 1525: CFA and other optical parameters, for example, optical OTF
    • 1530: Process of soft camera projection
    • 1540: Determining multi-channel representation of an image
    • 1542: Decision to revisit process 1530 or proceed to process 1550
    • 1550: Inverse Anscombe transformation
    • 1560: Intermediate multi-channel representation
    • 1570: Convolution process
    • 1580: ReLU and pooling processes
    • 1590: Perception output, including image label
    • 1600: Continual training procedure of a learning machine
    • 1620: Database of training images with corresponding designated classifications (labels)
    • 1640: Global training model
    • 1650: Learned global parameters (joint parameters relevant to both image representation network 220 and image-analysis network 230)
    • 1660: Perception model (software instructions associated with image-image analysis network 230)
    • 1670: Database of test images
    • 1680: Evaluation module (software instructions)
    • 1690: Data to be considered for training
    • 1700: Learning machine configured for continual training and image analysis
    • 1710: Hardware processor (or an assembly of hardware processors) executing software instructions relevant to learning-machine training
    • 1720: Training module (software instructions)
    • 1730: Training images (from training database)
    • 1740A: Memory device storing learned global parameters (joint parameters) being updated
    • 1740B: Memory device storing learned global parameters (joint parameters) previously determined
    • 1741: Training segment of learning machine 1700
    • 1742: Operational segment of learning machine 1700
    • 1743: Link for periodic, or state driven, update of content of memory 1740B
    • 1750: Hardware processor (or an assembly of hardware processors) executing software instructions relevant to post-training perception
    • 1760: Image analysis network (software instructions)
    • 1770: Incoming images to be classified
    • 1780: Image classification/label
    • 1800: Illustration of raw-image shaping (transformation)
    • 1810: Pixels of raw image
    • 1820: Pixel-shaping function
    • 1830: span of raw pixels
    • 1840: Span of shaped pixels
    • 1850: Shaped pixels
    • 1900: Further illustration of raw-image shaping
    • 1940: Span of shaped pixels
    • 1950: Shaped pixels
    • 2000: Training data
    • 2010: Image index
    • 2020: Image classification and other perception information
    • 2100: Overview of the learning machine of FIG. 2
    • 2120: Learning depot
    • 2124: Training data
    • 2128: Models' weights and other learned parameters
    • 2140: Data to add to learning dept 2120
    • 2190: Image classification (likelihood vector corresponding to candidate objects)


Corresponding reference characters indicate corresponding parts throughout the several views of the drawings. Although specific features of various examples may be shown in some drawings and not in others, this is for convenience only. Any feature of any drawing may be reference or claimed in combination with any feature of any other drawing.


DETAILED DESCRIPTION

The following detailed description and examples set forth preferred materials, components, and procedures used in accordance with the present disclosure. This description and these examples, however, are provided by way of illustration only, and nothing therein shall be deemed to be a limitation upon the overall scope of the present disclosure.



FIG. 1 illustrates a conventional learning machine 100 for image refinement and perception. Learning machine 100 comprises at least one hardware processor (not illustrated) coupled to at least one memory device storing:

    • processor-executable instructions forming an image signal processing module 120;
    • processor-executable instructions forming an image classification network 130;
    • signal-processing parameters 140, generally tuned for human perception; and
    • learned classification parameters 150.


Module 120 is configured for denoising and demosaicing images in addition to performing other image improvement functions according to signal processing parameters 140. Network 130 is configured to classify an image according to the learned classification parameters 150. Upon receiving a raw image 112 from an image acquisition device 110, module 120 produces a refined image 122 which is supplied to module 130 to determine a perceived classification 132 of the raw image 112. A digital camera may save images in a raw format suitable for subsequent software processing. Thus, processes of demosaicing, denoising, deblurring may be performed to reconstruct images.


The signal processing parameters 140 and the learned classification parameters are determined independently.



FIG. 2 illustrates a system 200 of optimized end-to-end machine learning based on a novel learning machine 210 performing processes of image refinement and perception. The learning machine receives raw color filter array (CFA) sensor data and determines corresponding image labels.


Learning machine 210 comprises at least one hardware processor (not illustrated) coupled to at least one memory device storing:

    • processor-executable instructions forming an image representation network 220 (detailed in FIG. 4);
    • processor-executable instructions forming an image analysis network 230; and
    • learned global parameters (joint parameters) 240 tuned for high machine perception.


The term “image analysis” refers to processes encompassing object detection, tracking, scene understanding, etc.


Upon receiving a raw image 112 from an image acquisition device 110, the image representation network 220 produces intermediate data 222 which is supplied to image analysis network 230 to determine a perceived classification 232 of the raw image 112. The intermediate data 222 comprises multiple channels.


The learned global parameters (joint parameters) 240 comprise parameters specific to the image representation network 220 and parameters specific to the image analysis network 230. Thus, learning machine 210 is configured according to joint learning of global parameters relevant to image refinement (denoising, demosaicing, . . . ) and perception (including image classification).


There are two main distinctive features of the novel learning machine 210. The first is the global optimization and the resulting global characterizing parameters. The second is the replacement of a conventional image signal processing module 120 with the image representation network 220. Referring to FIG. 1, a conventional image classification network 130 of FIG. 1 processes training images which have been refined (denoised, demosaiced) to produce learned data 150. In operation (post training or at an advanced stage of training), the conventional image classification network 130 of FIG. 1 may be viewed as a black box trained to receive a single image, which has been refined, and use the learned data 150 to classify (label) the image. In contrast, the image representation network 220 produces multiple channels. Thus, network 230 processes multiple channels representing an image while network 130 processes an image.



FIG. 3 illustrates a closed-loop training system 300 comprising an image representation network 220 generating a multi-channel image representation supplied to an image analysis network. Image representation network 220 produces a multiple-channel representation 330 □ (., □) for each input channel 310. Image analysis network 230 determines an image classification 232 and gradients are backpropagated across all layers.



FIG. 4 details the image representation network 220 of the learning machine of FIG. 2. The network 220 receives a raw image 112 from an image acquisition source and generates a multichannel representation 480 of the image to be used in an image perception stage (image analysis/classification stage) for identifying the content of the raw image 112.


Network 220 relies on repetitive activation of an image projection module 450, hereinafter referenced as module 450, which is adapted from a U-net. The U-Net is a heuristic architecture that has multiple levels, and therefore exploits self-similarity of images (in contrast to single-level architecture). A soft camera projection module 440 precedes module 450 and executes a process which permits explicit use of a color filter array (CFA) hence enabling generalization to different CFAs, or blur kernels, of different sensors. The soft camera projection module 440 together with module 450 form an image representation stage 430. The image representation stage 430 may be activated recursively (feedback loop 460). The number of turns of activation is a design choice. Alternatively, reactivation of the image representation stage may be terminated upon satisfying a specific user-defined criterion.


The raw image 112 is preferably variance stabilized prior to the repetitive activation of the image representation stage 430. Thus, the image representation network 430 employs a variance stabilizing module 420 to modify the values of pixels of the raw image 112 and a corresponding inversion module 470 to reverse the effect of initial pixel modification.



FIG. 5 illustrates a prior-art image-denoising apparatus 500 employing a variance-stabilizing transformation module 520, a Gaussian denoising module 530, and an inverse transformation module 540. The variance stabilizing transformation module 520 applies Anscombe's transform to a raw image 112 received from an image-acquisition device 110 to produce a transformed variance stabilized image 522 of reduced variance in comparison with the raw image. A Gaussian denoising module 530 produces a denoised variance stabilized image 532. Inverse transform module 540 corrects the shape of the image to produce an improved image of restored variance 542.



FIG. 6 illustrates processes 600 of generation of multichannel image representation employing image representation network 220 comprising variance-stabilizing transformation module 620, a module 630 of cascaded image representation stages 430, and an inverse transformation module 640.


The variance stabilizing module 620 modifies the values of the pixels of a raw image 112 received from an image acquisition device 110 yielding a transformed variance stabilized image 622 and an added channel 624 as illustrated in FIG. 9. Image 622 and channel 624 are processed through a cascade 630 of image representation stages 430 as detailed in FIG. 14 to produce midway multiple intermediate channels 632. The inverse transformation module 640 processes the midway channels 632 to generate multiple intermediate channels 642 of proper variance in addition to a residual connection.


Thus, the image representation network 220 applies an optimization algorithm that reconstructs a latent intermediate representation from noisy, single-channel, spatially-subsampled raw measurements. In contrast to standard convolutional neural network models, the image representation network 220 renders the perception light-level independent.


The joint image representation and perception problem may be formulated as a bilevel optimization problem with an outer objective function L (classification loss function) associated with the image analysis network 230 and an inner objective function G associated with the image representation network 220. The bilevel optimization problem may be formulated as:








min



Θ
,
v




L

(


Λ

(

y
,
Θ

)

,
x
,
v

)







Subject


to
:








Λ

(

y
,
Θ

)

=

arg


min
x



G

(

x
,
y
,
Θ

)



,




where Λ minimizes the inner objective function G. The output of the image representation network is a multi-channel intermediate representation Λ(y, □), which is supplied to the image analysis network 230. Here the parameters ν of the image analysis network are absorbed in L as a third argument.



FIG. 7 illustrates an image representation network 700 (corresponding to general image representation network 220) employing an Anscombe image transformation module 720 (corresponding to variance stabilizing module 620), the cascade 630 of image representation stages 430, and an Inverse Anscombe transformation module 760 (corresponding inversion module 640).


Module 720 transforms a raw image 110 to a shaped image 730 so that a pixel of value p, 0≤p<pmax, is replaced with a pixel of value Ã(p); a typical value of pmax is 255. The cascade 630 (of image representation stages 430) generates multiple midway channels 750 corresponding to the shaped image 730. Module 760 offsets the effect of pixel shaping and produces a multi-channel representation 770 of a latent image to be supplied to image analysis network 230.


According to one implementation, module 720 replaces a pixel of raw image 710 of value p with a pixel of value Â(p) determined as: Â(p)=2 (p+⅜)1/2. Module 760 replaces a pixel of value q of each of the midway channels 750 with a pixel of value Ä(q) determined as:








A
¨

(
q
)

=


(


0.25

q
2


-
0.125

)

-

σ
2

+


(


0.3062

q

-
1



+

1.375

q

-
2



+

0.7655

q

-
3




)

.






Alternative variance stabilizing transforms Ã(p) and corresponding inverse transforms Ä(q) are known in the art.



FIG. 8 illustrates inputs and outputs 800 of a single image representation stage 430 comprising a soft camera projection module 440 and an image projection nodule 450 (one U-Net stage). The soft camera projection stage 440 processes a transformed (shaped) image 812 to produce a midway image 822 which is supplied to image projection module 450. A memory device stores specification 830 of the image projection module including number of levels, parameters of spatial convolution, pooling, subsampling, and interpolation. The image projection module 450 processes the midway image 822 to produce a midway multichannel representation 844.



FIG. 9 illustrates processes 900 of image transformation (image shaping, pixel-variance-stabilizing) based on Anscombe's transformation producing an added channel. An Anscombe transformation process 920 is applied to a raw image 910 of one channel to produce a transformed image 930. An added channel 950 is also generated based on a resulting noise parameter 940.



FIG. 10 illustrates processes 1000 of image projection module (a single U-Net stage) configured as a contracting path and a symmetric expanding path. The contracting path captures context and the expanding path enables accurate localization.


The contracting path is a convolutional network where application of two 3×3 unpadded convolutions is repeated. A rectified linear unit (ReLU) and a 2×2 max pooling operation with stride 2 for downsampling succeed each convolution. At each downsampling, the number of feature channels is doubled.


In the expanding path, an upsampling process of the feature map is followed by a 2×2 convolution that halves the number of feature channels, a concatenation with the correspondingly cropped feature map from the contracting path, and two 3×3 convolutions, each followed by a ReLU. The cropping is necessary due to the loss of border pixels in every convolution. At the final layer a 1×1 convolution is used to map each multi-component feature vector to the desired number of classes.


A soft camera projection process 440 is applied to an output 1010 of the variance stabilizing module 620 or output of a preceding activation of an image projection module (activation of a U-Net stage).


Processes 1000 of image projection module 450 (a single U-Net stage) include:

    • generating feature maps 1020 during contracting-path first-level convolution Information transfer 1026;
    • Pooling 1028 from the first level to the second level of the contracting path;
    • generating feature maps 1040 during contracting-path second-level convolution Information transfer 1046;
    • Pooling 1048 from the second level to third level of the contracting path;
    • generating feature maps 1060 during contracting-path third-level convolution;
    • Interpolation (“upsampling”) 1068 from third level to second level of expanding path;
    • generating Feature maps 1050 during expanding-path second convolution;
    • Interpolation (“upsampling”) 1058 from second level to first level; and
    • generating feature maps 1030 during expanding-path first-level convolution first level.



FIG. 11 illustrates options 1100 of convolution processes used in the image projection module (U-Net stage) and the image analysis network 230. An image, or generally a channel, 1130 of dimension m×n pixels is spatially convolved with a filter 1110 of dimension w×w pixels to produce a feature map according to conventional spatial-convolution operator 1120. Typically, w<<m, and w<<n.


According to a first spatial convolution scheme, a window 1140 of pixels of a filter slides within the m×n pixels so that the filter is completely embedded thus yielding a feature map 1150 of dimension (m−w+1)×(n−w+1) pixels. According to a second spatial convolution scheme, the window of pixels of the filter slides within the m×n pixels so that the intersection region exceeds Δ×Δ pixels, 0<Δ<w, yielding a feature map 1160 of dimension (m−Δ+1)×(n−Δ+1) pixels.



FIG. 12 illustrates the contracting path of image projection (U-Net). An image of dimension 64×64 pixels (m=n=64) is convolved with 16 filters each of dimension 3×3 pixels (w=3) to yield 16 feature maps each of dimension 62×62 pixels (m−w+1=62). Each of the 62×62 is convolved with a filter of 3×3 pixels to yield a corresponding 62×62 feature map.



FIG. 13 illustrates the expanding path of image projection.



FIG. 14 illustrates options 1400 of activation of image representation stages 430. A module implementing an image representation stage 1420 may be executed repeatedly, starting with a variance-stabilized image 1410 derived from a raw image until a termination criterion 1430 is satisfied to yield a multi-channel representation 1440. Initially, the image representation stage processes transformed image 1410 and subsequently the output of each image representation stage is reprocessed. An image representation stage 430 comprises a soft camera projection module 440 and an image projection module U-Net) 450 as illustrated in FIG. 4. As illustrated in FIGS. 8, 10, 12, and 13, the image projection module permits specifying operational parameters such as a number of levels, convolution windows, pooling steps, and upsampling (interpolation) steps. In the iterative execution of the image representation stage 430, different parameters may be specified for successive activations. A predefined termination criterion 1430 may be applied. Alternatively, the number of times the image representation stage is to be executed may be predefined as illustrated for the case of four execution cycles where successive image representation stages 1420, individually identified as 1420A, 1420B, 1420C, and 1420D, are executed to yield a multi-channel representation 1450. The operational parameters for each of the four stages are preferably determined according to a global optimization process.



FIG. 15 illustrates processes 1500 performed at learning machine 210. Process 1510 acquires raw images from image acquisition devices 110 which are supplied to image representation network 220. For a selected raw image, process 1520 performs image shaping using, for example, the Anscombe transform. Process 1530 performs a process of soft camera projection (module 440) which permits explicit use of a color filter array (CFA), hence enabling generalization to different CFAs, or blur kernels, of different sensors.


Process 1540 executes the image projection module (a U-Net stage) 450 to determine an image representation. Process 1542 determines whether further activation of processes 1530 and 1540 are beneficial. The decision of process 1542 may be based on a predefined criterion. However, in order to facilitate end-to-end optimization to jointly determine optimal parameters of module 450 and weights of the image analysis network 230, it is preferable to predefine the number of cycles of executing process 1530 and 1540 where the parameters may differ from one cycle to another. A conjectured preferred number of cycles is eight. Process 1550 performs an unbiased inverse transform to offset the effect of pixel shaping of process 1520. Process 1520 may be based on the Anscombe transform, in which case process 1550 would be based on an unbiased inverse Anscombe transform as illustrated in FIG. 7. Process 1550 determines a multichannel representation 1560 which is further processed in image analysis network 230. The image analysis network 230 performs processes of spatial convolution 1570, Re-Lu and pooling 1580, etc., well known in the art, to produce a perception output 1590 including an image label.


The invention provides an end-to-end differentiable architecture that jointly performs demosaicing, denoising, deblurring, tone-mapping, and classification. An end-to-end differentiable model performs end-to-end image processing and perception jointly.


The architecture illustrated in FIG. 15 combines jointly learned image representation network 220 and an image projection network 230, taking raw sensor CFA data as input and determining image labels. A single differentiable model generalizes across cameras and light levels.



FIG. 16 illustrates a learning system 1600 for continual machine learning comprising a training phase and an operation phase. A global training model 1640 uses database 1620 containing training images and corresponding designated classifications (labels) to produce learned global parameters (joint parameters) 1650 relevant to both the image representation network 220 and the image-image analysis network 230. Perception model 1660 comprises software instructions associated with image-image analysis network 230. The model processes test images 1670. Evaluation module 1680 determines a classification success level for each test image and selects test images 1690 to be considered for enhancing the training database.



FIG. 17 illustrates an implementation 1700 of the learning system of FIG. 16 enabling concurrent training and operation of a learning machine. The system employs a hardware processor 1710 (or an assembly of hardware processors) executing software instructions relevant to training and a hardware processor 1750 (or an assembly of hardware processors) executing software instructions relevant to post-training perception.


A memory device storing a training module 1720 comprising software instructions, a memory device storing training images 1730, and a memory device 1740A are coupled to processor 1710 forming a training segment 1741 of the learning system. A memory device storing an image analysis network 1760 comprising software instructions, a buffer storing incoming images 1770 to be analyzed and classified, and a memory device 1740B are coupled to processor 1750 forming an operational segment 1742 of the learning system which determines a classification (a label) for each incoming image.


The training segment 1741 produces continually updated learned global parameters (joint parameters) which are stored in memory device 1740A. The learned global parameters may be transferred, through an activated link 1743, to memory device 1740B periodically or upon completion of significant updates.


The training segment 1741 (first mode) relates to end-to-end training. The operational segment 1742 (second mode) relates to actual use of the trained machine. Alternatively, the learning machine may be operated in a cyclic time-multiplexed manner to train for a first period and perform perception tasks, for which the machine is created, during a second period. Thus, the learning machine may perform a cyclic bimodal operation so that during a first mode the training images 1730 are updated and the training module 1720 is executed, and during a second mode, new images 1770 are analyzed and classified according to latest values of learned parameters.



FIG. 18 illustrates raw-image shaping 1800 using a general transformation function 1820 of pixel values 1810 of a raw image to produce pixel values 1850 of lower coefficient of variation. Pixel values 1810 of the raw image, denoted p1, p2, . . . , are modified to corresponding values q1, q2, . . . , according to a transformation function 1820 which is a monotone increasing function. For the illustrated segment of the raw image, the span 1830 of the raw pixels is indicated as (pmax−pmin) and the span 1840 of the transformed pixels is indicated as (qmax−qmin). The coefficient of variation of the transformed pixels is smaller than the coefficient of variation of the raw pixels.



FIG. 19 illustrates raw-image shaping 1900 using a linear transformation function 1920 of pixel values 1810 of a raw image to produce pixel values 1950 of lower coefficient of variation. The bias q0 and slope of the linear transformation function 1920 are design options. The span 1940 of the transformed pixels is indicated as (qmax−qmin) which is determined from (pmax−pmin) according to the slope of function 1920. The bias q0 determines the reduced coefficient of variation.



FIG. 20 illustrates data structures of a training data set 2000. For each image index 2010, information 2020 relevant to the image classification and other perception information is provided.



FIG. 21 is an overview 2100 of a system using the learning machine of FIG. 2. A Learning depot 2120 stores training data 2124 and learned data 2128 including parameters of the image representation network 220 and weights of the image analysis network 230. During operation to classify incoming images, selected data 2140 may be added to the learning depot 2120. The Image classification 2190 may be determined a label (class identifier) or a likelihood vector corresponding to candidate objects.


Thus, an improved method and system for machine learning have been provided. The method of machine learning is based on acquiring a plurality of raw images and employing at least one hardware processor to execute processes of determining a representation of a raw image of the plurality of raw images, initializing a plurality of representation parameters of the representation, defining a plurality of analysis parameters of an image analysis network configured to process the image representation, and jointly training the plurality of representation parameters and the plurality of analysis parameters to optimize a combined objective function. The combined objective function may be formulated as a nested bilevel objective function comprising an outer objective function relevant to the image analysis network and an inner objective function relevant to the representation.


The process of determining a representation of a raw image starts with transforming pixel-value of the raw image to produce a variance-stabilized transformed image. The transformed image is processed in a sequence of image representation stages, each stage comprising a soft camera projection module and an image projection module, resulting in a multi-channel representation. An inverse pixel-value transformation is applied to the multi-channel representation. The pixel-value transformation may be based on an Anscombe transformation in which case the inverse pixel-value transformation would be an unbiased inverse Anscombe transformation. The process of pixel-value transformation also generates an added channel.


The process of image projection comprises performing steps of multi-level spatial convolution, pooling, subsampling, and interpolation. The plurality of representation parameters comprises values of the number of levels, pooling, a stride of subsampling, and a step of interpolation.


The learned machine may be evaluated using a plurality of test images. The number of levels, pooling parameter, a stride of the subsampling, and a step of the interpolation may be revised according to a result of the evaluation. Selected test images may be added to the plurality of raw images then the processes of determining, initializing, defining, and jointly training would be repeated.


The learned machine may be cyclically operated in alternate modes. During a first mode the plurality of raw images are updated and the processes of determining, initializing, defining, and jointly training are executed. During a second mode, new images are analysed according to latest values of the plurality of representation parameters and the plurality of analysis parameters.


Some embodiments involve the use of one or more electronic processing or computing devices. As used herein, the terms “processor” and “computer” and related terms, e.g., “processing device,” “computing device,” and “controller” are not limited to just those integrated circuits referred to in the art as a computer, but broadly refers to a processors, a processing device, a controller, a general purpose central processing unit (CPU), a graphics processing unit (GPU), a microcontroller, a microcomputer, a programmable logic controller (PLC), a reduced instruction set computer (RISC) processor, a field programmable gate array (FPGA), a digital signal processor (DSP), an application specific integrated circuit (ASIC), and other programmable circuits or processing devices capable of executing the functions described herein, and these terms are used interchangeably herein. These processing devices are generally “configured” to execute functions by programming or being programmed, or by the provisioning of instructions for execution. The above examples are not intended to limit in any way the definition or meaning of the terms processor, processing device, and related terms.


The various aspects illustrated by logical blocks, modules, circuits, processes, algorithms, and algorithm steps described above may be implemented as electronic hardware, software, or combinations of both. Certain disclosed components, blocks, modules, circuits, and steps are described in terms of their functionality, illustrating the interchangeability of their implementation in electronic hardware or software. The implementation of such functionality varies among different applications given varying system architectures and design constraints. Although such implementations may vary from application to application, they do not constitute a departure from the scope of this disclosure.


Aspects of embodiments implemented in software may be implemented in program code, application software, application programming interfaces (APIs), firmware, middleware, microcode, hardware description languages (HDLs), or any combination thereof. A code segment or machine-executable instruction may represent a procedure, a function, a subprogram, a routine, a subroutine, a module, a software package, a class, or any combination of instructions, data structures, or program statements. A code segment may be coupled to, or integrated with, another code segment or a electronic hardware by passing or receiving information, data, arguments, parameters, memory contents, or memory locations. Information, arguments, parameters, data, etc. may be passed, forwarded, or transmitted via any suitable means including memory sharing, message passing, token passing, network transmission, etc.


The actual software code or specialized control hardware used to implement these systems and methods is not limiting of the claimed features or this disclosure. Thus, the operation and behavior of the systems and methods were described without reference to the specific software code being understood that software and control hardware can be designed to implement the systems and methods based on the description herein.


When implemented in software, the disclosed functions may be embodied, or stored, as one or more instructions or code on or in memory. In the embodiments described herein, memory includes non-transitory computer-readable media, which may include, but is not limited to, media such as flash memory, a random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), and non-volatile RAM (NVRAM). As used herein, the term “non-transitory computer-readable media” is intended to be representative of any tangible, computer-readable media, including, without limitation, non-transitory computer storage devices, including, without limitation, volatile and non-volatile media, and removable and non-removable media such as a firmware, physical and virtual storage, CD-ROM, DVD, and any other digital source such as a network, a server, cloud system, or the Internet, as well as yet to be developed digital means, with the sole exception being a transitory propagating signal. The methods described herein may be embodied as executable instructions, e.g., “software” and “firmware,” in a non-transitory computer-readable medium. As used herein, the terms “software” and “firmware” are interchangeable and include any computer program stored in memory for execution by personal computers, workstations, clients, and servers. Such instructions, when executed by a processor, configure the processor to perform at least a portion of the disclosed methods.


Several terms used in the detailed description are commonly used in the art. See, for example, references shown below, all of which are incorporated herein by reference.

  • Felix Heide, Douglas Lanman, Dikpal Reddy, Jan Kautz, Kari Pulli, and David Luebke. 2014a. Cascaded Displays: Spatiotemporal Superresolution Using Offset Pixel Layers. ACM Trans. Graph. (SIGGRAPH) 33, 4 (2014).
  • F. Heide, M. Steinberger, Y.-T. Tsai, M. Rouf, D. Pajak, D. Reddy, O. Gallo, J. Liu, W. Heidrich, K. Egiazarian, J. Kautz, and K. Pulli. 2014b. FlexISP: A flexible camera image processing framework. ACM Trans. Graph. (SIGGRAPH Asia) 33, 6 (2014).
  • Olaf Ronneberger, Philipp Fischer, and Thomas Brox. 2015. U-Net: Convolutional Networks for Biomedical Image Segmentation. CoRR abs/1505.04597 (2015). arXiv:1505.04597 http://arxiv.org/abs/1505.04597
  • A. Foi and M. Makitalo. 2013. Optimal inversion of the generalized Anscombe transformation for Poisson-Gaussian noise. IEEE Trans. Image Process. 22, 1 (2013), 91-103.


As used herein, an element or step recited in the singular and proceeded with the word “a” or “an” should be understood as not excluding plural elements or steps unless such exclusion is explicitly recited. Furthermore, references to “one embodiment” of the disclosure or an “exemplary embodiment” are not intended to be interpreted as excluding the existence of additional embodiments that also incorporate the recited features. Likewise, limitations associated with “one embodiment” or “an embodiment” should not be interpreted as limiting to all embodiments unless explicitly recited.


Disjunctive language such as the phrase “at least one of X, Y, or Z,” unless specifically stated otherwise, is generally intended, within the context presented, to disclose that an item, term, etc. may be either X, Y, or Z, or any combination thereof (e.g., X, Y, and/or Z). Likewise, conjunctive language such as the phrase “at least one of X, Y, and Z,” unless specifically stated otherwise, is generally intended, within the context presented, to disclose at least one of X, at least one of Y, and at least one of Z.


The disclosed systems and methods are not limited to the specific embodiments described herein. Rather, components of the systems or steps of the methods may be utilized independently and separately from other described components or steps.


This written description uses examples to disclose various embodiments, which include the best mode, to enable any person skilled in the art to practice those embodiments, including making and using any devices or systems and performing any incorporated methods. The patentable scope is defined by the claims and may include other examples that occur to those skilled in the art. Such other examples are intended to be within the scope of the claims if they have structural elements that do not differ from the literal language of the claims, or if they include equivalent structural elements with insubstantial differences form the literal language of the claims.

Claims
  • 1. A method of machine learning, the method comprising: forming a learning machine, the learning machine including: an image representation network configured to extract feature maps in an input image and map the feature maps to one or more classes, the image representation network including representation parameters;an image analysis network coupled with the image representation network, the image analysis network configured to classify the input image, the image analysis network including analysis parameters, wherein the learning machine includes global parameters, the global parameters including the representation parameters and the analysis parameters;jointly learning the global parameters by: jointly training the image representation network and the image analysis network;receiving a raw image; andprocessing the raw image through the image representation network and the image analysis network with the global parameters by: processing, using the image representation network, the raw image to produce intermediate data; anddetermining, using the image representation network, a perceived classification of the raw image, by processing the intermediate data.
  • 2. The method of claim 1, wherein jointly learning the global parameters further comprises: optimizing the learning machine in a closed loop by: backpropagating gradients across layers in the image representation network and the image analysis network.
  • 3. The method of claim 1, wherein jointly learning the global parameters further comprises: optimizing a bilevel objective function of the learning machine, wherein the bilevel objective function includes an outer objective function associated with the image analysis network and an inner objective function associated with the image representation network, the inner objective function nested within the outer objective function.
  • 4. The method of claim 3, wherein optimizing the bilevel objective function further comprises: minimizing the inner objective function; andminimizing the outer objective function.
  • 5. The method of claim 1 further comprising: jointly learning the global parameters by training in a global training model using a training database including training images; andevaluating learned global parameters by classifying, in a perception model, test images, wherein the perception model includes the image analysis network having the learned global parameters.
  • 6. The method of claim 5, wherein evaluating the learned global parameters further comprises: selecting test images having a classification success level above a threshold; andupdate the training database with selected test images.
  • 7. The method of claim 1 further comprising: performing a bimodal operation of the learning machine between a first mode and a second mode, wherein: in the first mode, the global parameters are learned; andin a second mode, an incoming image is classified based on the latest global parameters.
  • 8. The method of claim 7 further comprising: transferring learned global parameters in the first mode to the image analysis network via an activated link.
  • 9. The method of claim 7, wherein performing the bimodal operation further comprises: cyclically perform the bimodal operation by operating in the first mode in a first period of time and operating in the second mode in a second period of time.
  • 10. The method of claim 7, wherein performing the bimodal operation further comprises: operating the learning machine in the first mode in a training segment of the learning machine; andoperating the learning machine in a second mode in an operational segment of the learning machine.
  • 11. The method of claim 7 further comprising: updating the global parameters periodically.
  • 12. The method of claim 7 further comprising: updating the global parameters after completion of an update.
  • 13. The method of claim 1 further comprising: processing, using the learning machine, a plurality of raw images to generate perceived classifications of the plurality of raw images; andadding processed raw images and associated perceived classifications to training data of the learning machine.
  • 14. A learning system comprising: at least one memory device having a computer readable instructions stored thereon; andat least one processor coupled to the at least one memory device and configured to execute the computer readable instructions, upon execution of the computer readable instructions, the at least one processor programmed to: form a learning machine, the learning machine including: an image representation network configured to extract feature maps in an input image and map the feature maps to one or more classes, the image representation network including representation parameters;an image analysis network coupled with the image representation network, the image analysis network configured to classify the input image, the image analysis network including analysis parameters, wherein the learning machine includes global parameters, the global parameters including the representation parameters and the analysis parameters; andjointly learn the global parameters by: jointly training the image representation network and the image analysis network.
  • 15. The learning system of claim 14, wherein the at least one processor is further programmed to: perform a bimodal operation of the learning machine between a first mode and a second mode, wherein: in the first mode, the global parameters are learned; andin a second mode, an incoming image is classified based on the latest global parameters.
  • 16. The learning system of claim 15, wherein the at least one processor is further programmed to: transfer learned global parameters in the first mode to the image analysis network via an activated link.
  • 17. The learning system of claim 14, wherein the at least one processor is further programmed to: jointly learn the global parameters by: optimizing a bilevel objective function of the learning machine, wherein the bilevel objective function includes an outer objective function associated with the image analysis network and an inner objective function associated with the image representation network, the inner objective function nested within the outer objective function.
  • 18. The learning system of claim 14 further comprising a learning deport separate from the learning machine, wherein the learning deport includes training data and learned data, the learned data including the global parameters.
  • 19. The learning system of claim 18, wherein the at least one processor is further programmed to: process, using the learning machine, a plurality of raw images to generate perceived classifications of the plurality of raw images; andadd processed raw images and associated perceived classifications to training data.
  • 20. The learning system of claim 14, wherein the image representation network includes an image representation stage, the at least one processor further programmed to: recursively activate the image representation stage, via a feedback loop connecting an output from the image representation stage to an input of the image representation stage; andspecify the global parameters corresponding to a specific activation in recursively activated image representation stages.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. patent application Ser. No. 18/488,010 filed Oct. 16, 2023, which is a Continuation of U.S. patent application Ser. No. 17/850,785 filed Jun. 27, 2022, now U.S. Pat. No. 11,809,975, which is a Continuation of U.S. patent application Ser. No. 17/843,174 filed Jun. 17, 2022, now U.S. Pat. No. 11,790,272, which is a Continuation of U.S. patent application Ser. No. 17/712,727 filed Apr. 4, 2022, now U.S. Pat. No. 11,783,231, which is a Continuation of U.S. patent application Ser. No. 16/927,741 filed Jul. 13, 2020, now U.S. Pat. No. 11,295,176, which is a Continuation of U.S. patent application Ser. No. 16/025,776 filed Jul. 2, 2018, now U.S. Pat. No. 10,713,537, which claims the benefit of U.S. Provisional Patent Application No. 62/528,054 filed on Jul. 1, 2017, the entire contents of which are hereby incorporated herein by reference.

Provisional Applications (1)
Number Date Country
62528054 Jul 2017 US
Continuations (6)
Number Date Country
Parent 18488010 Oct 2023 US
Child 18821683 US
Parent 17850785 Jun 2022 US
Child 18488010 US
Parent 17843174 Jun 2022 US
Child 17850785 US
Parent 17712727 Apr 2022 US
Child 17843174 US
Parent 16927741 Jul 2020 US
Child 17712727 US
Parent 16025776 Jul 2018 US
Child 16927741 US