The disclosure relates to image compression.
As reliance on computers and the Internet continues to grow, so too does the need for efficient ways of storing and sending large amounts of data. For example, a web page with dozens, if not hundreds, of images needs to use some form of image compression to store images. Likewise, an online catalog packed with images requires image compression to download the images over the Internet quickly.
The Joint Photographic Experts Group (JPEG) has created a popular image compression process that simplifies certain high-frequency components in an image and then compresses the image for storage. Typical JPEG files convert images from the RGB color space to the YCbCr space. The Y channel, often referred to as the Luma, is preserved; whereas the CbCr channel, often referred to as the Chroma, is down-sampled, or reduced, and then both channels are split into 8×8 blocks. That is, the first “lossy” step of the algorithm and, depending on the size of the image, can result in artifacts being introduced into the image. Next, the discrete cosine transform (DCT) is used to convert the 8×8 Luma and Chroma blocks into DCT coefficients in order to minimize, or eliminate, the higher frequencies, which are not perceived by the human eye as readily as the lower frequencies. The DCT coefficients for Luma and Chroma are then quantized, which, among other things, eliminates the higher coefficients representing the higher frequencies. Next, the quantized coefficients are compressed using Run Length Encoding to group all like coefficients such as “zeros” left over from quantizing. Finally, the Run Length Encoded values are further compressed using Huffman coding which uses shorter code words for more often used run-length encoding (RLE) values and longer code words for less often used RLE values. Because JPEG is a lossy compression algorithm, decompression will present artifacts in the image, such as so called blocking artifacts.
The invention provides methods for removing image artifacts in JPEG compressed images. The result is an improved JPEG process that produces high-quality decompressed images. In particular aspect, methods of the invention apply a low-pass filter to de-quantized upsampled Chroma data to reduce output image blocking artifacts. The invention also contemplates applying a low-pass filter in other ways as discussed below. In any case, the invention provides the benefits of compression while maintaining image quality at a high level in the decompressed image.
In certain preferred aspects, the invention provides methods for compressing image data. Methods include executing a JPEG transform, storing and/or transmitting the compressed image, decompressing the image data, applying a low-pass filter to the Chroma channel of the decompressed data and converting the Chroma and Luma portions back to the RGB color space for display. An example of this process is shown in
In certain embodiments, the various compression steps (e.g., DCT, quantization, entropy encoding (e.g., Huffman encoding, bitpacking, etc.) are performed by a computer system comprising a processor coupled to a non-transitory memory device. Methods may optionally include writing the compressed image data to disc as an image file, such as a JPEG file, or transmitting the compressed image.
In certain aspects, the invention provides methods for compressing image data. Embodiments of the methods include obtaining a JPEG compressed image corresponding to an original image and decompressing the JPEG compressed image to produce an output image via a decompression operation that includes a low pass filter. Preferably, decompressing the JPEG image comprises decoding the image to produce a YCbCr image having Luma and Chroma components. The low pass filter may be applied to the Chroma components of the YCbCr image to produce a filtered YCbCr image. The method may include transforming the filtered YCbCr image into the RGB color space to produce the output image.
In certain embodiments, obtaining the JPEG compressed image includes receiving the original image and performing a discrete cosine transform (DCT) (e.g., such as a type-II DCT) and quantization step on image data from the original image, and may include transforming the original image from the RGB color space into the YCbCr color space and blocking the image into blocks of pixels. In some embodiments, quantizing the DCT coefficients includes scaling the DCT coefficients and rounding the scaled DCT coefficients to the nearest integers. The quantized DCT coefficients may be compressed via entropy encoding (e.g., Huffman coding or run length encoding) to create the JPEG compressed image. Preferably, the steps are performed using a device such as a computer or a camera that includes a processor coupled to a non-transitory, tangible memory. The JPEG compressed image may be written to the tangible memory. Preferably, the low pass filter removes one or more blocking artifacts from the output image.
Aspects of the invention provide a hardware system in which at least one device includes a processor coupled to a non-transitory memory device. The memory device stores instructions executable by the processor to cause the system to obtain a JPEG compressed image corresponding to an original image and decompress the JPEG compressed image to produce an output image via a decompression operation that includes a low pass filter.
Methods disclosed herein can be carried out by any suitable device, such as a digital camera, a computer, a tablet computer, a wearable computer, a mobile phone, or a smartphone. In such examples, the method is written as a set of instructions that when executed by a device processor, causes the device to perform the method. These instructions can be stored in a non-transitory computer readable medium, such RAM or disk memory.
Methods of the invention may be implemented within a camera so that the camera can capture, store, or transmit pictures or videos with improved quality or compression. Thus in some embodiments, methods of the invention include receiving, from an image sensor, image data onto a processing device on a camera. The processing device may be a chip such as a field-programmable gate array or application-specific integrated circuit. The processing device transforms the image data into the frequency domain and quantizes and low-pass filters the resultant frequency components.
In some aspects, the disclosure provides a method for compressing image data. The method includes: performing a discrete cosine transform (DCT) on image data to return DCT coefficients; quantizing and applying a low-pass filter (LPF) to the DCT coefficients to return quantized, filtered DCT coefficients; and compressing the quantized, filtered DCT coefficients to produce the compressed image data. Prior art compressed formats such as JPEG do not have an LP applied to DCT coefficients independently of a quantization step. The low-pass filter may be applied prior to the quantizing or the quantizing may be performed prior to the low-pass filter. Preferably the low-pass filter discards non-zero values for one or more of the DCT coefficients that represent a high-frequency component of the image data. The low pass filter may be used to remove one or more blocking artifacts from the output image. The steps may be performed by a computer system comprising a processor coupled to a non-transitory memory device. In some embodiments, compressing the quantized, filtered DCT coefficients comprises Huffman coding and writing the compressed image data to the non-transitory memory device as a JPEG file. The method may include transforming the original image from the RGB color space into the YCbCr color space.
In certain embodiments, quantizing the DCT coefficients includes scaling the DCT coefficients and rounding the scaled DCT coefficients to the nearest integers. Compressing the quantized, filtered DCT coefficients to produce the compressed image data may be done by entropy encoding to create a JPEG compressed image. The entropy coding may include Huffman coding or run length encoding. The steps may be performed by a computer system comprising a processor coupled to a non-transitory memory device and the method may include writing the JPEG compressed image to the memory device.
The invention provides methods that improve the JPEG process by using a low-pass filter to remove high frequency components from image data, preferably by applying a low-pass filter to the Chroma components after decompressing a JPEG file. Generally, in methods of the invention, an RGB file is converted into YCbCr color space. The Y, Cr, and Cb channels are blocked by minimum code unit (MCU). The MCUs are subject to a discrete cosine transform (DCT) and quantization. The resultant matrices are encoded in a compressed manner by, e.g., Huffman encoding. The compressed data may be written to a file and/or transmitted, e.g., over the Internet. The compression may be performed by a general purpose computer or may be implemented in a device such as a camera that uses an image sensor to capture images and may further include a processing device to operate as an image compressor.
JPEGs compress images based on their spatial frequency, or level of detail in the image. In the forward JPEG transform block 111, the JPEG algorithm transforms the image from an RGB color space into the luminance/chrominance (YCbCr) color space. In preferred embodiments, the algorithm leaves luminance alone and “downsamples” the Chroma components 2:1 horizontally (either by discarding every second horizontal sample or averaging the two hue values into one) and 2:1 or 1:1 vertically, saving about one-half to one-third off the image data. This is often abbreviated as 4:2:2 or 4:1:1 sampling.
Additionally, the pixel values for each component are grouped into 8×8 blocks, or MCUs. These blocks then are transformed from the spatial domain to the frequency domain with a Discrete Cosine Transform (DCT), performed separately for the Luma and both Chroma components. The DCT converts the image into a two-dimensional array of frequency coefficients, which are then quantized. In quantization, each block of 64 frequency components is divided by a separate quantization coefficient and rounded to integer values. For encoding (e.g., run-length encoding, Huffman encoding, Bitpacking) each block is scanned in a zig-zag pattern starting from the top-left corner. This outputs a linear stream of bits which allows for lossless compression of non-zero coefficients with arithmetic or Huffman coding. The product of this portion of the pipeline is highly compressed and suitable for storage or transmission 117.
The remaining steps of the method 101 show the decompression of JPEG, i.e., the reverse JPEG transform 121. The reverse transform 121 includes undoing the encoding (e.g., reversing the Huffman/RLE) and then multiplying by the quantization matrix to re-constitute the DCT coefficients. Those are transformed back into the spatial domain by the inverse DCT (IDCT) equation. The blocks are up-sampled and subject to filtering 127 before reversing the MCU blocker and transforming from YCbCr into RGB color space.
In some preferred embodiments, the invention includes the filtering 127 within the method 101 of JPEG compression/decompression. In the filtering 127 step, the Luma components may be passed through the pipeline without applying any filters, while the Chroma components are subject to a low-pass filter (LPF).
The LPF improves the image quality by removing blocking artifacts that have been introduced via other steps of the method 101. Blocking artifacts are visible elements not appearing the original image but that are present after the JPEG method 101. Blocking artifacts are present predominantly in the higher frequencies, and thus are removed by the LPF. Thus the LPF 127 is applied to the Chroma components, the high-frequency blocking artifacts are removed, and the final output JPEG has an improved appearance—lacking blocking artifacts—relative to a JPEG produced by a method that is similar but lacking an LPF.
Preferably the low-pass filter discards non-zero values for one or more of the DCT coefficients that represent a high-frequency component of the image data. The steps may be performed by a computer system comprising a processor coupled to a non-transitory memory device. In some embodiments, compressing the quantized, filtered DCT coefficients 201 comprises Huffman coding and writing the compressed image data (e.g., the stream of bits 237) to the non-transitory memory device as a JPEG file. The method may include transforming 200 the original image from the RGB color space into the YCbCr color space.
The DCT may use a DCT equation given by Equation 1 below. The DCT equation computes the i,jth entry of the DCT of the image data 15. Thus p(x, y) is the x,yth element of the image represented by the matrix p. The DCT equation calculates one entry (i,jth) of a transformed image from pixel values of an original image matrix.
By way of non-limiting example, the image data can include an image block of 8×8 pixels so that N equals 8, and x and y range from 0 to 7. (Other image block sizes are contemplated such as 4×4 pixels and 16×16 pixels) The DCT equation for an 8×8 image block is given Equation 3 below.
To put Equation 1 into matrix form, use Equation 4.
Matrix D include 64 DCT coefficients in which the top-left entry corresponds to the low frequencies of the original image block. The matrix D will next be quantized through the use of a quantization matrix Q. One may choose a level of compression or quality through the choice of which matrix Q is used. A middle-ground example is shown wherein the matrix is Q50.
For quantization, each element in the matrix D is divided by the corresponding element in the quantization matrix Q (here, Q50). This yields the matrix C of quantized coefficients. Thus, here, the method 111, quantizing the DCT coefficients includes scaling the DCT coefficients and rounding the scaled DCT coefficients to the nearest integers.
The quantized matrix C is then encoded. Encoding includes converting the coefficients of C into binary and reading entries from the matrix C in a zig-zag order, starting with entry (0,0), and proceeding through (0,1), (1,0), (1,1), (0,2). This results in a linear stream 237 of bits which is encoded in a compressed fashion by, e.g., Huffman encoding.
The resulting encoded, compressed stream of bits 237 can then be stored or transmitted 117. Due to the encoding and compression, the file will be smaller and thus take up less disc space than the original file. Here, compressing the quantized, filtered DCT coefficients 201 to produce the compressed image data may be done by entropy encoding to create a JPEG compressed image. The entropy coding may include Huffman coding or run length encoding. After storing or transmitting 117 the file(s), the image can be subject to the reverse JPEG transform 121 of method 101 for decompression and presentation of a high-quality image.
Decompression refers to the process of reconstruction the image from the compressed, encoded bits.
The matrix R is subject to an inverse DCT (IDCT), and 128 is added to each entry, which produces an decompressed JPEG version of the original corresponding MCU.
Decompression is accomplished by applying the inverse of each of the preceding steps in opposite order. Thus, the decoding process starts with entropy decoding and proceeds to convert the run lengths to a sequence of zeros and coefficients. Coefficients are de-quantized and subject to the Inverse Discrete Cosine Transform (IDCT). The resulting upsampled image in the YCbCr color space may then be filtered according to methods of the invention.
By including an LPF, blocking artifacts are removed. An LPF is a type of filter that removes signals above a certain frequency or removes high-frequency signal from the image. Implementation of an LPF is understood in the art and is applied herein the reverse JPEG transform 121 to improve image quality by, e.g., removing blocking artifacts.
Blocking artifacts include distortion in compressed images that may appear as a pattern of visible block boundaries. Those artifacts result from the coarse quantization of the coefficients and the independent processing of the blocks. Implementing an LPF may remove the blocking artifacts. The LPF may be implemented as a kernel (e.g., with positive values) that operates on the Chroma components during decompression 121. Thus the invention provides a method 101 for JPEG compression/decompression that includes an LPF to remove blocking artifacts.
Preferably the LPF operates on the Chroma components during decompression 121. Optionally, it may be found that the LPF is useful or beneficial at other step(s) of the forward JPEG compression block 111 or the reverse transform 121. Thus it is within the scope of the invention to include one or more LPF at any step of the diagramed methods.
Obtaining the JPEG compressed image may proceed as shown in
Methods of the invention may be implemented in hardware or using software as embodied within a device or systems of the invention.
The system 801 thus includes a processor coupled to a non-transitory memory device. The memory preferably stores instructions executable by the processor to cause the system to obtain a JPEG compressed image corresponding to an original image and decompress the JPEG compressed image to produce an output image via a decompression operation that includes a low pass filter.
Processor refers to any device or system of devices that performs processing operations. A processor will generally include a chip, such as a single core or multi-core chip, to provide a central processing unit (CPU). A process may be provided by a chip from Intel or AMD. A processor may be any suitable processor such as the microprocessor sold under the trademark XEON E7 by Intel (Santa Clara, CA) or the microprocessor sold under the trademark OPTERON 6200 by AMD (Sunnyvale, CA).
Memory refers a device or system of devices that store data or instructions in a machine-readable format. Memory may include one or more sets of instructions (e.g., software) which, when executed by one or more of the processors of the disclosed computers can accomplish some or all of the methods or functions described herein. Preferably, each computer includes a non-transitory memory such as a solid state drive, flash drive, disk drive, hard drive, subscriber identity module (SIM) card, secure digital card (SD card), micro SD card, or solid-state drive (SSD), optical and magnetic media, others, or a combination thereof.
An input/output device is a mechanism or system for transferring data into or out of a computer. Exemplary input/output devices include a video display unit (e.g., a liquid crystal display (LCD) or a cathode ray tube (CRT)), an alphanumeric input device (e.g., a keyboard), a cursor control device (e.g., a mouse), a disk drive unit, a signal generation device (e.g., a speaker), a touchscreen, an accelerometer, a microphone, a cellular radio frequency antenna, and a network interface device, which can be, for example, a network interface card (NIC), Wi-Fi card, or cellular modem.
Various aspects and functions of the method 101 for JPEG compression/decompression can be implemented using components of the system 801. Those components may include, among others, network appliances, personal computers, workstations, mainframes, networked clients, servers, media servers, application servers, database servers, and web servers. Other examples of computer systems may include mobile computing devices, such as cellular phones and personal digital assistants, and network equipment, such as load balancers, routers, and switches. Further, aspects may be located on a single computer system or may be distributed among a plurality of computer systems connected to one or more communications networks.
References and citations to other documents, such as patents, patent applications, patent publications, journals, books, papers, web contents, have been made throughout this disclosure. All such documents are hereby incorporated herein by reference in their entirety for all purposes.
Various modifications of the invention and many further embodiments thereof, in addition to those shown and described herein, will become apparent to those skilled in the art from the full contents of this document, including references to the scientific and patent literature cited herein. The subject matter herein contains important information, exemplification and guidance that can be adapted to the practice of this invention in its various embodiments and equivalents thereof.
Number | Name | Date | Kind |
---|---|---|---|
2560351 | Kell | Jul 1951 | A |
2642487 | Schroeder | Jun 1953 | A |
2971051 | Back | Feb 1961 | A |
3202039 | DeLang | Aug 1965 | A |
3381084 | Wheeler | Apr 1968 | A |
3474451 | Abel | Oct 1969 | A |
3601480 | Randall | Aug 1971 | A |
3653748 | Athey | Apr 1972 | A |
3659918 | Tan | May 1972 | A |
3668304 | Eilenberger | Jun 1972 | A |
3720146 | Yost, Jr. | Mar 1973 | A |
3802763 | Cook et al. | Apr 1974 | A |
3945034 | Suzuki | Mar 1976 | A |
4009941 | Verdijk et al. | Mar 1977 | A |
4072405 | Ozeki | Feb 1978 | A |
4084180 | Stoffels et al. | Apr 1978 | A |
4134683 | Goetz et al. | Jan 1979 | A |
4268119 | Hartmann | May 1981 | A |
4395234 | Shenker | Jul 1983 | A |
4396188 | Dreissigacker et al. | Aug 1983 | A |
4486069 | Neil et al. | Dec 1984 | A |
4555163 | Wagner | Nov 1985 | A |
4584606 | Nagasaki | Apr 1986 | A |
4743011 | Coffey | May 1988 | A |
4786813 | Svanberg et al. | Nov 1988 | A |
4805037 | Noble et al. | Feb 1989 | A |
4916529 | Yamamoto et al. | Apr 1990 | A |
4933751 | Shinonaga et al. | Jun 1990 | A |
5024530 | Mende | Jun 1991 | A |
5092581 | Koz | Mar 1992 | A |
5093563 | Small et al. | Mar 1992 | A |
5134468 | Ohmuro | Jul 1992 | A |
5153621 | Vogeley | Oct 1992 | A |
5155623 | Miller et al. | Oct 1992 | A |
5194959 | Kaneko et al. | Mar 1993 | A |
5272518 | Vincent | Dec 1993 | A |
5275518 | Guenther | Jan 1994 | A |
5333212 | Ligtenberg | Jul 1994 | A |
5355165 | Kosonocky et al. | Oct 1994 | A |
5386316 | Cook | Jan 1995 | A |
5642191 | Mende | Jun 1997 | A |
5644432 | Doany | Jul 1997 | A |
5707322 | Dreissigacker et al. | Jan 1998 | A |
5729011 | Sekiguchi | Mar 1998 | A |
5734507 | Harvey | Mar 1998 | A |
5801773 | Ikeda | Sep 1998 | A |
5835278 | Rubin et al. | Nov 1998 | A |
5856466 | Cook et al. | Jan 1999 | A |
5881043 | Hasegawa et al. | Mar 1999 | A |
5881180 | Chang et al. | Mar 1999 | A |
5900942 | Spiering | May 1999 | A |
5905490 | Shu et al. | May 1999 | A |
5926283 | Hopkins | Jul 1999 | A |
5929908 | Takahashi et al. | Jul 1999 | A |
6011876 | Kishner | Jan 2000 | A |
6215597 | Duncan et al. | Apr 2001 | B1 |
6392687 | Driscoll, Jr. et al. | May 2002 | B1 |
6429016 | McNeil | Aug 2002 | B1 |
6614478 | Mead | Sep 2003 | B1 |
6633683 | Dinh et al. | Oct 2003 | B1 |
6646716 | Ramanujan et al. | Nov 2003 | B1 |
6674487 | Smith | Jan 2004 | B1 |
6747694 | Nishikawa et al. | Jun 2004 | B1 |
6801719 | Szajewski et al. | Oct 2004 | B1 |
6856466 | Tocci | Feb 2005 | B2 |
6937770 | Oguz et al. | Aug 2005 | B1 |
7068890 | Soskind et al. | Jun 2006 | B2 |
7084905 | Nayar et al. | Aug 2006 | B1 |
7138619 | Ferrante et al. | Nov 2006 | B1 |
7177085 | Tocci et al. | Feb 2007 | B2 |
7283307 | Couture et al. | Oct 2007 | B2 |
7336299 | Kostrzewski et al. | Feb 2008 | B2 |
7397509 | Krymski | Jul 2008 | B2 |
7405882 | Uchiyama et al. | Jul 2008 | B2 |
7535647 | Otten, III et al. | May 2009 | B1 |
7623781 | Sassa | Nov 2009 | B1 |
7714998 | Furman et al. | May 2010 | B2 |
7719674 | Furman et al. | May 2010 | B2 |
7731637 | D'Eredita | Jun 2010 | B2 |
7961398 | Tocci | Jun 2011 | B2 |
8035711 | Liu et al. | Oct 2011 | B2 |
8320047 | Tocci | Nov 2012 | B2 |
8323047 | Reusche et al. | Dec 2012 | B2 |
8340442 | Rasche | Dec 2012 | B1 |
8441732 | Tocci | May 2013 | B2 |
8606009 | Sun | Dec 2013 | B2 |
8610789 | Nayar et al. | Dec 2013 | B1 |
8619368 | Tocci | Dec 2013 | B2 |
8622876 | Kelliher | Jan 2014 | B2 |
8659683 | Linzer | Feb 2014 | B1 |
8843938 | MacFarlane et al. | Sep 2014 | B2 |
8982962 | Alshin et al. | Mar 2015 | B2 |
9087229 | Nguyen et al. | Jul 2015 | B2 |
9129445 | Mai et al. | Sep 2015 | B2 |
9131150 | Mangiat et al. | Sep 2015 | B1 |
9258468 | Cotton et al. | Feb 2016 | B2 |
9264659 | Abuan et al. | Feb 2016 | B2 |
9277122 | Imura et al. | Mar 2016 | B1 |
9459692 | Li | Oct 2016 | B1 |
9488984 | Williams et al. | Nov 2016 | B1 |
9560339 | Borowski | Jan 2017 | B2 |
9633417 | Sugimoto et al. | Apr 2017 | B2 |
9654738 | Ferguson et al. | May 2017 | B1 |
9661245 | Kawano | May 2017 | B2 |
9675236 | McDowall | Jun 2017 | B2 |
9677840 | Rublowsky et al. | Jun 2017 | B2 |
9720231 | Erinjippurath et al. | Aug 2017 | B2 |
9779490 | Bishop | Oct 2017 | B2 |
9800856 | Venkataraman et al. | Oct 2017 | B2 |
9904981 | Jung et al. | Feb 2018 | B2 |
9948829 | Kiser et al. | Apr 2018 | B2 |
9955084 | Haynold | Apr 2018 | B1 |
9974996 | Kiser | May 2018 | B2 |
9998692 | Griffiths | Jun 2018 | B1 |
10038855 | Cote et al. | Jul 2018 | B2 |
10165182 | Chen | Dec 2018 | B1 |
10200569 | Kiser et al. | Feb 2019 | B2 |
10257393 | Kiser et al. | Apr 2019 | B2 |
10257394 | Kiser et al. | Apr 2019 | B2 |
10264196 | Kiser et al. | Apr 2019 | B2 |
10536612 | Kiser et al. | Jan 2020 | B2 |
10554901 | Kiser et al. | Feb 2020 | B2 |
10601908 | Ragupathy et al. | Mar 2020 | B1 |
10616512 | Ingle et al. | Apr 2020 | B2 |
10679320 | Kunz | Jun 2020 | B1 |
10742847 | Kiser et al. | Aug 2020 | B2 |
10805505 | Kiser et al. | Oct 2020 | B2 |
10819925 | Kiser et al. | Oct 2020 | B2 |
10951888 | Kiser et al. | Mar 2021 | B2 |
11303932 | Kiser | Apr 2022 | B2 |
20020014577 | Ulrich et al. | Feb 2002 | A1 |
20020089765 | Nalwa | Jul 2002 | A1 |
20020164084 | Baggs | Nov 2002 | A1 |
20030007254 | Tocci | Jan 2003 | A1 |
20030016334 | Weber et al. | Jan 2003 | A1 |
20030048493 | Pontifex et al. | Mar 2003 | A1 |
20030072011 | Shirley | Apr 2003 | A1 |
20030081674 | Malvar | May 2003 | A1 |
20030122930 | Schofield et al. | Jul 2003 | A1 |
20030138154 | Suino | Jul 2003 | A1 |
20040119020 | Bodkin | Jun 2004 | A1 |
20040125228 | Dougherty | Jul 2004 | A1 |
20040143380 | Stam et al. | Jul 2004 | A1 |
20040156134 | Furuki et al. | Aug 2004 | A1 |
20040179834 | Szajewski et al. | Sep 2004 | A1 |
20040202376 | Schwartz et al. | Oct 2004 | A1 |
20040228406 | Song | Nov 2004 | A1 |
20050001983 | Weber et al. | Jan 2005 | A1 |
20050041113 | Nayar et al. | Feb 2005 | A1 |
20050099504 | Nayar et al. | May 2005 | A1 |
20050117799 | Fuh et al. | Jun 2005 | A1 |
20050151860 | Silverstein et al. | Jul 2005 | A1 |
20050157943 | Ruggiero | Jul 2005 | A1 |
20050168578 | Gobush | Aug 2005 | A1 |
20050198482 | Cheung et al. | Sep 2005 | A1 |
20050212827 | Goertzen | Sep 2005 | A1 |
20050219659 | Quan | Oct 2005 | A1 |
20060001761 | Haba et al. | Jan 2006 | A1 |
20060002611 | Mantiuk et al. | Jan 2006 | A1 |
20060061680 | Madhavan et al. | Mar 2006 | A1 |
20060104508 | Daly et al. | May 2006 | A1 |
20060184040 | Keller et al. | Aug 2006 | A1 |
20060209204 | Ward | Sep 2006 | A1 |
20060215882 | Ando et al. | Sep 2006 | A1 |
20060221209 | McGuire et al. | Oct 2006 | A1 |
20060249652 | Schleifer | Nov 2006 | A1 |
20060262275 | Domroese et al. | Nov 2006 | A1 |
20060291729 | Wu | Dec 2006 | A1 |
20070025717 | Raskar et al. | Feb 2007 | A1 |
20070073484 | Horibe | Mar 2007 | A1 |
20070086087 | Dent et al. | Apr 2007 | A1 |
20070133889 | Horie et al. | Jun 2007 | A1 |
20070152804 | Breed et al. | Jul 2007 | A1 |
20070182844 | Allman et al. | Aug 2007 | A1 |
20070189750 | Wong et al. | Aug 2007 | A1 |
20070189758 | Iwasaki | Aug 2007 | A1 |
20070201560 | Segall et al. | Aug 2007 | A1 |
20070258641 | Srinivasan et al. | Nov 2007 | A1 |
20080013051 | Glinski et al. | Jan 2008 | A1 |
20080030611 | Jenkins | Feb 2008 | A1 |
20080037883 | Tsutsumi et al. | Feb 2008 | A1 |
20080055683 | Choe et al. | Mar 2008 | A1 |
20080068721 | Murnan et al. | Mar 2008 | A1 |
20080094486 | Fuh et al. | Apr 2008 | A1 |
20080100910 | Kim et al. | May 2008 | A1 |
20080112651 | Cho et al. | May 2008 | A1 |
20080175496 | Segall | Jul 2008 | A1 |
20080198235 | Chen et al. | Aug 2008 | A1 |
20080198266 | Kurane | Aug 2008 | A1 |
20080239155 | Wong et al. | Oct 2008 | A1 |
20080297460 | Peng et al. | Dec 2008 | A1 |
20080304562 | Chang | Dec 2008 | A1 |
20090015683 | Ando | Jan 2009 | A1 |
20090059048 | Luo et al. | Mar 2009 | A1 |
20090161019 | Jang | Jun 2009 | A1 |
20090213225 | Jin et al. | Aug 2009 | A1 |
20090225433 | Tocci | Sep 2009 | A1 |
20090244717 | Tocci | Oct 2009 | A1 |
20090290043 | Liu et al. | Nov 2009 | A1 |
20100013963 | Jannard | Jan 2010 | A1 |
20100098333 | Aoyagi | Apr 2010 | A1 |
20100100268 | Zhang et al. | Apr 2010 | A1 |
20100149546 | Kobayashi et al. | Jun 2010 | A1 |
20100172409 | Reznik et al. | Jul 2010 | A1 |
20100201799 | Mohrholz et al. | Aug 2010 | A1 |
20100225783 | Wagner | Sep 2010 | A1 |
20100266008 | Reznik | Oct 2010 | A1 |
20100271512 | Garten | Oct 2010 | A1 |
20100328780 | Tocci | Dec 2010 | A1 |
20110028278 | Roach | Feb 2011 | A1 |
20110058050 | Lasang et al. | Mar 2011 | A1 |
20110188744 | Sun | Aug 2011 | A1 |
20110194618 | Gish et al. | Aug 2011 | A1 |
20110221793 | King, III et al. | Sep 2011 | A1 |
20120025080 | Liu et al. | Feb 2012 | A1 |
20120134551 | Wallace | May 2012 | A1 |
20120147953 | El-Mahdy et al. | Jun 2012 | A1 |
20120154370 | Russell et al. | Jun 2012 | A1 |
20120179833 | Kenrick et al. | Jul 2012 | A1 |
20120193520 | Bewersdorf et al. | Aug 2012 | A1 |
20120212964 | Chang et al. | Aug 2012 | A1 |
20120241867 | Ono et al. | Sep 2012 | A1 |
20120242867 | Shuster | Sep 2012 | A1 |
20120260174 | Imaida et al. | Oct 2012 | A1 |
20120299940 | Dietrich, Jr. et al. | Nov 2012 | A1 |
20120307893 | Reznik et al. | Dec 2012 | A1 |
20130021447 | Brisedoux et al. | Jan 2013 | A1 |
20130021505 | Plowman et al. | Jan 2013 | A1 |
20130027565 | Solhusvik et al. | Jan 2013 | A1 |
20130038689 | McDowall | Feb 2013 | A1 |
20130057971 | Zhao et al. | Mar 2013 | A1 |
20130063300 | O'Regan et al. | Mar 2013 | A1 |
20130064448 | Tomaselli et al. | Mar 2013 | A1 |
20130083855 | Kottke | Apr 2013 | A1 |
20130093805 | Iversen | Apr 2013 | A1 |
20130094705 | Tyagi et al. | Apr 2013 | A1 |
20130128957 | Bankoski et al. | May 2013 | A1 |
20130148139 | Matsuhira | Jun 2013 | A1 |
20130190965 | Einecke et al. | Jul 2013 | A1 |
20130194675 | Tocci | Aug 2013 | A1 |
20130215290 | Solhusvik et al. | Aug 2013 | A1 |
20130250113 | Bechtel et al. | Sep 2013 | A1 |
20130286451 | Verhaegh | Oct 2013 | A1 |
20130329053 | Jones et al. | Dec 2013 | A1 |
20130329087 | Tico et al. | Dec 2013 | A1 |
20140002694 | Levy et al. | Jan 2014 | A1 |
20140063300 | Lin et al. | Mar 2014 | A1 |
20140085422 | Aronsson et al. | Mar 2014 | A1 |
20140104051 | Breed | Apr 2014 | A1 |
20140132946 | Sebastian et al. | May 2014 | A1 |
20140152694 | Narasimha et al. | Jun 2014 | A1 |
20140168486 | Geiss | Jun 2014 | A1 |
20140184894 | Motta | Jul 2014 | A1 |
20140192214 | Laroia | Jul 2014 | A1 |
20140198187 | Lukk | Jul 2014 | A1 |
20140204195 | Katashiba et al. | Jul 2014 | A1 |
20140210847 | Knibbeler et al. | Jul 2014 | A1 |
20140263950 | Fenigstein et al. | Sep 2014 | A1 |
20140297671 | Richard | Oct 2014 | A1 |
20140313369 | Kageyama et al. | Oct 2014 | A1 |
20140321766 | Jo | Oct 2014 | A1 |
20150077281 | Taniguchi et al. | Mar 2015 | A1 |
20150078661 | Granados et al. | Mar 2015 | A1 |
20150138339 | Einecke et al. | May 2015 | A1 |
20150151725 | Clarke et al. | Jun 2015 | A1 |
20150172608 | Routhier et al. | Jun 2015 | A1 |
20150175161 | Breed | Jun 2015 | A1 |
20150201222 | Mertens | Jul 2015 | A1 |
20150208024 | Takahashi et al. | Jul 2015 | A1 |
20150215595 | Yoshida | Jul 2015 | A1 |
20150245043 | Greenebaum et al. | Aug 2015 | A1 |
20150245044 | Guo et al. | Aug 2015 | A1 |
20150256843 | Roskowski | Sep 2015 | A1 |
20150296140 | Kim | Oct 2015 | A1 |
20150302562 | Zhai et al. | Oct 2015 | A1 |
20150312498 | Kawano | Oct 2015 | A1 |
20150312536 | Butler et al. | Oct 2015 | A1 |
20160007052 | Haitsuka et al. | Jan 2016 | A1 |
20160007910 | Boss et al. | Jan 2016 | A1 |
20160026253 | Bradski et al. | Jan 2016 | A1 |
20160050354 | Musatenko et al. | Feb 2016 | A1 |
20160057333 | Liu et al. | Feb 2016 | A1 |
20160093029 | Micovic et al. | Mar 2016 | A1 |
20160163356 | De Haan et al. | Jun 2016 | A1 |
20160164120 | Swiegers et al. | Jun 2016 | A1 |
20160165120 | Lim | Jun 2016 | A1 |
20160173811 | Oh et al. | Jun 2016 | A1 |
20160191795 | Han et al. | Jun 2016 | A1 |
20160195877 | Franzius et al. | Jul 2016 | A1 |
20160205341 | Hollander et al. | Jul 2016 | A1 |
20160205368 | Wallace et al. | Jul 2016 | A1 |
20160227193 | Osterwood et al. | Aug 2016 | A1 |
20160239276 | Maclean et al. | Aug 2016 | A1 |
20160252727 | Mack et al. | Sep 2016 | A1 |
20160301959 | Oh et al. | Oct 2016 | A1 |
20160307602 | Mertens | Oct 2016 | A1 |
20160323518 | Rivard et al. | Nov 2016 | A1 |
20160344977 | Murao | Nov 2016 | A1 |
20160345032 | Tsukagoshi | Nov 2016 | A1 |
20160353123 | Ninan | Dec 2016 | A1 |
20160360212 | Dai et al. | Dec 2016 | A1 |
20160360213 | Lee et al. | Dec 2016 | A1 |
20160375297 | Kiser | Dec 2016 | A1 |
20170006273 | Borer et al. | Jan 2017 | A1 |
20170026594 | Shida et al. | Jan 2017 | A1 |
20170039716 | Morris et al. | Feb 2017 | A1 |
20170070719 | Smolic et al. | Mar 2017 | A1 |
20170084006 | Stewart | Mar 2017 | A1 |
20170111643 | Bugdayci Sansli et al. | Apr 2017 | A1 |
20170126987 | Tan et al. | May 2017 | A1 |
20170155818 | Bonnet | Jun 2017 | A1 |
20170155873 | Nguyen | Jun 2017 | A1 |
20170186141 | Ha et al. | Jun 2017 | A1 |
20170237879 | Kiser et al. | Aug 2017 | A1 |
20170237890 | Kiser et al. | Aug 2017 | A1 |
20170237913 | Kiser et al. | Aug 2017 | A1 |
20170238029 | Tocci | Aug 2017 | A1 |
20170270702 | Gauthier et al. | Sep 2017 | A1 |
20170279530 | Tsukagoshi | Sep 2017 | A1 |
20170302858 | Porter et al. | Oct 2017 | A1 |
20170352131 | Berlin et al. | Dec 2017 | A1 |
20170374390 | Leleannec et al. | Dec 2017 | A1 |
20180005356 | Van Der Vleuten et al. | Jan 2018 | A1 |
20180048801 | Kiser et al. | Feb 2018 | A1 |
20180054566 | Yaguchi | Feb 2018 | A1 |
20180063537 | Sasai et al. | Mar 2018 | A1 |
20180152721 | Rusanovskyy et al. | May 2018 | A1 |
20180189170 | Dwarakanath et al. | Jul 2018 | A1 |
20180198957 | Kiser et al. | Jul 2018 | A1 |
20190014308 | Kiser et al. | Jan 2019 | A1 |
20190130630 | Ackerson et al. | May 2019 | A1 |
20190166283 | Kiser et al. | May 2019 | A1 |
20190238725 | Kiser et al. | Aug 2019 | A1 |
20190238726 | Kiser et al. | Aug 2019 | A1 |
20190238766 | Kiser et al. | Aug 2019 | A1 |
20190324888 | Evans et al. | Oct 2019 | A1 |
20190349581 | Fuchie et al. | Nov 2019 | A1 |
20190373260 | Kiser et al. | Dec 2019 | A1 |
20200036918 | Ingle et al. | Jan 2020 | A1 |
20200058104 | Kiser et al. | Feb 2020 | A1 |
20200059670 | Kiser et al. | Feb 2020 | A1 |
20200097295 | Xu et al. | Mar 2020 | A1 |
20200154030 | Kiser et al. | May 2020 | A1 |
20200235607 | Kanarellis et al. | Jul 2020 | A1 |
20200320955 | Kiser et al. | Oct 2020 | A1 |
20200368616 | Delamont | Nov 2020 | A1 |
20210029271 | Kiser et al. | Jan 2021 | A1 |
20210034342 | Hoy | Feb 2021 | A1 |
20210044765 | Kiser et al. | Feb 2021 | A1 |
20210099616 | Kiser et al. | Apr 2021 | A1 |
20210227220 | Kiser et al. | Jul 2021 | A1 |
Number | Date | Country |
---|---|---|
101344706 | Sep 2010 | CN |
105472265 | Apr 2016 | CN |
0484802 | May 1992 | EP |
1225574 | Jul 2002 | EP |
1395062 | Mar 2004 | EP |
1511319 | Mar 2005 | EP |
3051821 | Aug 2016 | EP |
3070934 | Sep 2016 | EP |
2526047 | Nov 2015 | GB |
2539917 | Jan 2017 | GB |
S53093026 | Aug 1978 | JP |
S53124028 | Oct 1978 | JP |
S60213178 | Oct 1985 | JP |
S63160489 | Jul 1988 | JP |
H0468876 | Mar 1992 | JP |
H0564070 | Mar 1993 | JP |
H06335006 | Dec 1994 | JP |
H07107346 | Apr 1995 | JP |
H08220585 | Aug 1996 | JP |
H11127441 | May 1999 | JP |
2000019407 | Jan 2000 | JP |
2000338313 | Dec 2000 | JP |
2001136434 | May 2001 | JP |
2002165108 | Jun 2002 | JP |
2002-369210 | Dec 2002 | JP |
2003035881 | Feb 2003 | JP |
2005-117524 | Apr 2005 | JP |
2007-96510 | Apr 2007 | JP |
2007-243942 | Sep 2007 | JP |
2007-281816 | Oct 2007 | JP |
2007295326 | Nov 2007 | JP |
2009-17157 | Jan 2009 | JP |
2013-27021 | Feb 2013 | JP |
2014-524290 | Sep 2014 | JP |
100695003 | Mar 2007 | KR |
101310140 | Sep 2013 | KR |
2005025685 | Mar 2005 | WO |
2009043494 | Apr 2009 | WO |
2009111642 | Sep 2009 | WO |
2009121068 | Oct 2009 | WO |
2010080662 | Jul 2010 | WO |
WO-2010080662 | Jul 2010 | WO |
2011032028 | Mar 2011 | WO |
2012076646 | Jun 2012 | WO |
2013025530 | Feb 2013 | WO |
2015072754 | May 2015 | WO |
2015173570 | Nov 2015 | WO |
2017139363 | Aug 2017 | WO |
2017139596 | Aug 2017 | WO |
2017139600 | Aug 2017 | WO |
2017157845 | Sep 2017 | WO |
Entry |
---|
Tocci, 2011, A versatile HDR video production system, ACM Transactions on Graphics (TOG)—Proceedings of ACM SIGGRAPH 2011, 30(4):article 41 (9 pages). |
Tourapis, 2015, Deblocking in HEVC: some observations from the HDR/WCG CfE, JCTVC-U0043. |
Touze, 2014, HDR video coding based on local LDR quantization, Second International Conference and SME Workshop on HDR imaging (6 pages). |
Unattributed, 2018, JPEG YCbCr Support, Microsoft, Retrieved from the Internet on Nov. 20, 2019 from <https://docs.microsoft.com/en-us/windows/win32/wic/jpeg-ycbcr-support> (14 pages). |
Wei, 2011, Analysis of JPEG encoder for image compression, IEEEICMT 205-208. |
Wige, 2010, Analysis of In-Loop Denoising in Lossy Transform Coding, 28th Picture Coding Symposium, pp. 82-85. |
Wong, 2017, Ultra-low latency contiguous block-parallel stream windowing using FPGA on-chip memory, FPT 56-63. |
Yeadon, 1996, Qos filters: Addressing the heterogeneity gap, Interactive Distributed Multimedia Systems and Services, Springer Berlin Heidelberg, pp. 227-243. |
Aggarwal, 2004, Split Aperture Imaging for High Dynamic Range, Int J Comp Vis 58(1):7-17. |
Alleysson, 2006, HDR CFA Image Rendering, Proc EURASIP 14th European Signal Processing Conf. (5 pages). |
Altera, 2010, Memory System Design, Chapter 7 in Embedded Design Handbook, Altera Corporation (18 pages). |
Banterle, 2009, High dynamic range imaging and low dynamic range expansion for generating HDR content, Eurographics State of the The Art Report (18 pages). |
Borer, 2014, Non-linear opto-electrical transfer functions for high dynamic range television, Research and Development White Paper, British Broadcasting Corporation (24 pages). |
Bravo, 2011, Efficient smart CMOS camera based on FPGAs oriented to embedded image processing, Sensors 11:2282-2303. |
Cao, 2003, Dynamic configuration management in a graph-oriented distributed programming environment, Sci Comp Prog 48:43-65. |
Cao, 2005, GOP: A graph-oriented programming model for parallel and distributed systems, Chapter 2 in New Horizons of Parallel and Distributed Computing, Guo & Yang, Eds., Springer (Boston, MA) (17 pages). |
Chan, 2005, Visual programming support for graph-oriented parallel/ distributed processing, Softw Pract Exper 35:1409-1439. |
Damazio, 2006, A codec architecture for real-time High Dynamic Range video, VIII Symposium on Virtual and Augmented Reality (Belém, PA, Brazil) (9 pages). |
Debevec, 1997, Recovering High Dynamic Range Radiance Maps from Photographs, Int Conf Comp Graphics and Interactive Techniques, proceedings (10 pages). |
Dhanani, 2008, HD video line buffering in FPGA, EE Times (5 pages). |
Flux Data Inc, 2008, FD-1665 High Resolution 3 CCD Multispectral Industrial Camera, web.archive.orgweb20080113023949www.fluxdata.com/prod (7 pages). |
Geronimo, 2010, Survey of pedestrian detection for advanced driver assistance systems, IEEE Trans Pat Anal Mach Int 32(7):1239-58. |
Gurel, 2016, A comparative study between RTL and HLS for image processing applications with FPGAs, Thesis, UC San Diego (78 pages). |
Hegarty, 2014, Darkroom: compiling high-level image processing code into hardware pipelines, ACM Trans Graph 33(4):144. |
Jack, 2005, Color spaces, Chapter 3 in Video Demystified: A Handbook for the Digital Engineer, 4Ed, Newnes (20 pages). |
Kao, 2008, High Dynamic Range Imaging by Fusing Multiple Raw Images and Tone Reproduction, IEEE Transactions on Consumer Electronics 54(1):10-15. |
Kresch, 1999, Fast DCT domain filtering using the DCT and the DST, IEEE Trans Imag Proc (29 pages). |
Lawal, 2007, C++ based system synthesis of real-time video processing systems targeting FPGA implementation, IEEE Int Par Dist Proc Symposium, Rome, pp. 1-7. |
Lawal, 2008, Memory synthesis for FPGA implementations of real-time video processing systems, Thesis, Mid Sweden U (102 pages). |
Lukac, 2004, Demosaicked Image Postprocessing Using Local Color Ratios, IEEE Transactions on Circuits and Systems for Video Technology 14(6):914-920. |
Lyu, 2014, A 12-bit high-speed col. parallel two-step single-slope analog-to-digital converter (ADC) for CMOS image sensors, Sensors 14:21603-21625. |
Machine translation of CN 101344706 B, generated on May 19, 2017, by espacenet (11 pages). |
Machine translation of JP 2000019407 A generated on May 30, 2017, by EPO website (52 pages). |
Machine translation of JP 2000338313 A generated on Dec. 21, 2016, by Espacenet (9 pages). |
Machine translation of JP 2001136434 A generated on Dec. 21, 2016, by Espacent (25 pages). |
Machine translation of JP 2002165108 A generated on Dec. 21, 2016, by Espacenet (27 pages). |
Machine translation of JP 2003035881 A genertaed on May 30, 2017, by EPO website (19 pages). |
Machine translation of JP 2007295326 A generated on Dec. 21, 2016, by the European Patent Office website Espace.net (12 pages). |
Machine translation of JP 2007295326 A generated on Dec. 21, 2016, by the European Patent Office website Espacent (12 pages). |
Machine translation of JP H04068876 A generated on Dec. 21, 2016, by Espacent (8 pages). |
Machine translation of JP H0564070 A generated on Dec. 21, 2016, by Espacenet (19 pages). |
Machine translation of JP H06335006 A generated on Dec. 21, 2016, by Espacenet (9 pages). |
Machine translation of JP H07107346 generated on Dec. 21, 2016, by Espacent (21 pages). |
Machine translation of JP H08 220585 A obtained Feb. 3, 2020, from Espacenet (14 pages). |
Machine translation of JP S53093026 A, issued as JP S599888, generated on Dec. 21, 2016 (5 pages). |
Machine translation of JP S60213178 A generated on May 30, 2017, by EPO website (6 pages). |
Machine translation of JPH08220585 generated by European Patent Office on Oct. 15, 2019 (11 pages). |
Myszkowki, 2008, High Dynamic Range Video, Morgan & Claypool Publishers, San Rafael, CA (158 pages). |
Nayar, 2000, High dynamic range imaging: spatially varying pixel exposures, 2000 Proc IEEE Conf on Comp Vision and Pattern Rec, ISSN: 1063-6919 (8 pages). |
Nosratinia, 2002, Enhancement of JPEG-compressed images by re-application of JPEG, Journal of VLSI signal processing systems for signal, image and video technology (20 pages). |
Oliveira, 2012, Functional programming with structured graphs, ICFP'12 (12 pages). |
Rahman, 2011, Pipeline synthesis and optimization of FPGA-based video processing applications with CAL, EURASIP J Image Vid Processing 19:1-28. |
Roberts, 2017, Lossy Data Compression: JPEG, Stanford faculty page (5 pages) Retrieved from the Internet on Feb. 3, 2017, from <https://cs.stanford.edu/people/eroberts/courses/soco/projects/data-compression/lossy/jpeg/dct.htm>( 5 pages). |
Schulte, 2016, HDR Demystified: Emerging UHDTV systems, SpectraCal 1-22. |
Sedigh, 1998, Evaluation of filtering mechanisms for MPEG video communications, IEES Symp Rel Dist Sys (6 pages). |
Sony, 2017, HDR (High Dynamic Range), Sony Corporation (15 pages). |
Stumpfel, 2004, Direct HDR Capture of the Sun and Sky, Computer graphics, virtual reality, visualisation and Interaction in Africa (9 pages). |
Tiwari, 2015, A review on high-dynamic range imaging with its technique, Int J Sig Proc, IPPR 8(9):93-100. |
Kronander, 2014, Unified HDR reconstrucction from raw CFA data, CCP13 (10 pages). |
Okuda, 2007, Effective color space representation for wavelet based compression of HDR images, unsourced (5 pages). |
Tourapis, 2015, Deblocking in HEVC: some observations from the HDR/WCG CfE, JCT-VC 21st Meeting. |
Wige, 2010, Analysis of in-loop denoising in lossy transform coding, Pict Coding Symp 8-12-2010-10-12-2010. |
Number | Date | Country | |
---|---|---|---|
20220272384 A1 | Aug 2022 | US |
Number | Date | Country | |
---|---|---|---|
62718610 | Aug 2018 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16539601 | Aug 2019 | US |
Child | 17717727 | US |