Abstract: A method of image processing using kernel regression is provided. An image gradient is estimated from original data that is analyzed for local structures by computing a scaling parameter, a rotation parameter and an elongation parameter using singular value decomposition on local gradients of the estimated gradients locally to provide steering matrices. A steering kernel regression having steering matrices is applied to the original data to provide a reconstructed image and new image gradients. The new gradients are analyzed using singular value decomposition to provide new steering matrices. The steering kernel regression with the new steering matrices is applied to the noisy data to provide a new reconstructed image and further new gradients. The last two steps are repeated up to ten iterations to denoise the original noisy data and improve the local image structure.

Abstract: The temperature distribution associated with a design of an integrated circuit is calculated by convoluting a surface power usage represented by a power matrix with a heat spreading function. The heat spreading function may be calculated from a simulation of a point source on the integrated circuit using a finite element analysis model of the integrated circuit or other techniques. To account for spatial variations on the chip, the heat spreading function may be made dependent on position using a position scaling function. Steady-state or transient temperature distributions may be computed by using a steady-state or transient heat spreading function. A single heat spreading function may be convolved with various alternative power maps to efficiently calculate temperature distributions for different designs. In an inverse problem, one can calculate the power map from an empirically measured temperature distribution and a heat spreading function using various de-convolution techniques.

Abstract: A computer method of creating a super-resolved grayscale image from lower-resolution images using an L1 norm data fidelity penalty term to enforce similarities between low and a high-resolution image estimates is provided. A spatial penalty term encourages sharp edges in the high-resolution image, the data fidelity penalty term is applied to space invariant point spread function, translational, affine, projective and dense motion models including fusing the lower-resolution images, to estimate a blurred higher-resolution image and then a deblurred image. The data fidelity penalty term uses the L1 norm in a likelihood fidelity term for motion estimation errors. The spatial penalty term uses bilateral-TV regularization with an image having horizontal and vertical pixel-shift terms, and a scalar weight between 0 and 1. The penalty terms create an overall cost function having steepest descent optimization applied for minimization. Direct image operator effects replace matrices for speed and efficiency.

Abstract: An integrated method for both super-resolution and multi-frame demosaicing includes an image fusion followed by simultaneous deblurring and interpolation. For the case of color super-resolution, the first step involves application of recursive image fusion separately on the three different color layers. The second step is based on minimizing a maximum a posteriori (MAP) cost function. In one embodiment, the MAP cost function is composed of several terms: a data fidelity penalty term that penalizes dissimilarity between the raw data and the super-resolved estimate, a luminance penalty term that favors sharp edges in the luminance component of the image, a chrominance penalty term that favors low spatial frequency changes in the chrominance component of the image, and an orientation penalty term that favors similar edge orientations across the color channels. The method is also applicable to color super-resolution (without demosaicing), where the low-quality input images are already demosaiced.

Abstract: A method is provided of solving the dynamic super-resolution (SR) problem of reconstructing a high-quality set of monochromatic or color superresolved images from low-quality monochromatic, color, or mosaiced frames. The invention includes a joint method for simultaneous SR, deblurring, and demosaicing, this way taking into account practical color measurements encountered in video sequences. For the case of translational motion and common space-invariant blur, the proposed invention is based on a very fast and memory efficient approximation of the Kalman filter (KF). Experimental results on both simulated and real data are supplied, demonstrating the invention algorithms, and their strength.

Abstract: The temperature distribution associated with a design of an integrated circuit is calculated by convoluting a surface power usage represented by a power matrix with a heat spreading function. The heat spreading function may be calculated from a simulation of a point source on the integrated circuit using a finite element analysis model of the integrated circuit or other techniques. To account for spatial variations on the chip, the heat spreading function may be made dependent on position using a position scaling function. Steady-state or transient temperature distributions may be computed by using a steady-state or transient heat spreading function. A single heat spreading function may be convolved with various alternative power maps to efficiently calculate temperature distributions for different designs. In an inverse problem, one can calculate the power map from an empirically measured temperature distribution and a heat spreading function using various de-convolution techniques.

Abstract: A computer method of creating a super-resolved grayscale image from lower-resolution images using an L1 norm data fidelity penalty term to enforce similarities between low and a high-resolution image estimates is provided. A spatial penalty term encourages sharp edges in the high-resolution image, the data fidelity penalty term is applied to space invariant point spread function, translational, affine, projective and dense motion models including fusing the lower-resolution images, to estimate a blurred higher-resolution image and then a deblurred image. The data fidelity penalty term uses the L1 norm in a likelihood fidelity term for motion estimation errors. The spatial penalty term uses bilateral-TV regularization with an image having horizontal and vertical pixel-shift terms, and a scalar weight between 0 and 1. The penalty terms create an overall cost function having steepest descent optimization applied for minimization. Direct image operator effects replace matrices for speed and efficiency.

Abstract: A method is provided of solving the dynamic super-resolution (SR) problem of reconstructing a high-quality set of monochromatic or color superresolved images from low-quality monochromatic, color, or mosaiced frames. The invention includes a joint method for simultaneous SR, deblurring, and demosaicing, this way taking into account practical color measurements encountered in video sequences. For the case of translational motion and common space-invariant blur, the proposed invention is based on a very fast and memory efficient approximation of the Kalman filter (KF). Experimental results on both simulated and real data are supplied, demonstrating the invention algorithms, and their strength.

Abstract: A method of image processing using kernel regression is provided. An image gradient is estimated from original data that is analyzed for local structures by computing a scaling parameter, a rotation parameter and an elongation parameter using singular value decomposition on local gradients of the estimated gradients locally to provide steering matrices. A steering kernel regression having steering matrices is applied to the original data to provide a reconstructed image and new image gradients. The new gradients are analyzed using singular value decomposition to provide new steering matrices. The steering kernel regression with the new steering matrices is applied to the noisy data to provide a new reconstructed image and further new gradients. The last two steps are repeated up to ten iterations to denoise the original noisy data and improve the local image structure.

Abstract: Methods and apparatus for non-contact thermal measurement which are capable of providing sub micron surface thermal characterization of samples, such as active semiconductor devices. The method obtains thermal image information by reflecting a light from a surface of a device in synchronous with the modulation of the thermal excitation and then acquiring and processing an AC-coupled thermoreflective image. The method may be utilized for making measurements using different positioning techniques, such as point measurements, surface scanning, two-dimensional imaging, and combinations thereof. A superresolution method is also described for increasing the resultant image resolution, based on multiple images with fractional pixel offsets, without the need to increase the resolution of the image detectors being utilized.

Abstract: An integrated method for both super-resolution and multi-frame demosaicing includes an image fusion followed by simultaneous deblurring and interpolation. For the case of color super-resolution, the first step involves application of recursive image fusion separately on the three different color layers. The second step is based on minimizing a maximum a posteriori (MAP) cost function. In one embodiment, the MAP cost function is composed of several terms: a data fidelity penalty term that penalizes dissimilarity between the raw data and the super-resolved estimate, a luminance penalty term that favors sharp edges in the luminance component of the image, a chrominance penalty term that favors low spatial frequency changes in the chrominance component of the image, and an orientation penalty term that favors similar edge orientations across the color channels. The method is also applicable to color super-resolution (without demosaicing), where the low-quality input images are already demosaiced.

Abstract: A method for computing a high resolution gray-tone image from a sequence of low-resolution images uses an L1 norm minimization. In a preferred embodiment, the technique also uses a robust regularization based on a bilateral prior to deal with different data and noise models. This robust super-resolution technique uses the L1 norm both for the regularization and the data fusion terms. Whereas the former is responsible for edge preservation, the latter seeks robustness with respect to motion error, blur, outliers, and other kinds of errors not explicitly modeled in the fused images. This computationally inexpensive method is resilient against errors in motion and blur estimation, resulting in images with sharp edges. The method also reduces the effects of aliasing, noise and compression artifacts. The method's performance is superior to other super-resolution methods and has fast convergence.

Abstract: In one aspect, the present invention provides a dynamic super-resolution technique that is computationally efficient. A recursive computation takes as input a previously computed super-resolved image derived from a sequence of low-resolution input frames. Combining this super-resolved image with a later low-resolution input frame in the sequence, the technique produces a new super-resolved image. By recursive application, a sequence of super-resolved images is produced. In a preferred embodiment, the technique uses a computationally simple and effective method based on adaptive filtering for computing a high resolution image and updating this high resolution image over time to produce an enhanced sequence of images. The method may be implemented as a general super-resolution software tool capable of handing a wide variety of input image data.

Abstract: A method of creating a super-resolved color image from multiple lower-resolution color images is provided by combining a data fidelity penalty term, a spatial luminance penalty term, a spatial chrominance penalty term, and an inter-color dependencies penalty term to create an overall cost function. The data fidelity penalty term is an L1 norm penalty term to enforce similarities between raw data and a high-resolution image estimate, the spatial luminance penalty term is to encourage sharp edges in a luminance component to the high-resolution image, the spatial chrominance penalty term is to encourage smoothness in a chrominance component of the high-resolution image, and the inter-color dependencies penalty term is to encourage homogeneity of an edge location and orientation in different color bands. A steepest descent optimization is applied to the overall cost function for minimization by applying a derivative to each color band while the other color bands constant.

Abstract: Methods and apparatus for non-contact thermal measurement which are capable of providing sub micron surface thermal characterization of samples, such as active semiconductor devices. The method obtains thermal image information by reflecting a light from a surface of a device in synchronous with the modulation of the thermal excitation and then acquiring and processing an AC-coupled thermoreflective image. The method may be utilized for making measurements using different positioning techniques, such as point measurements, surface scanning, two-dimensional imaging, and combinations thereof. A superresolution method is also described for increasing the resultant image resolution, based on multiple images with fractional pixel offsets, without the need to increase the resolution of the image detectors being utilized.