| Class / Patent application number | Description | Number of patent applications / Date published |
|---|
| 382250000 | Discrete cosine or sine transform | 56 |
| 20080267520 | METHOD OF IMAGE AUTHENTICATION AND RESTORATION - A method of effective image authentication and image restoration by hiding watermarks in DCT (Discrete Cosine Transform) coefficients is presented. The basic concept is to embed the selected significant watermarking bits for authentication and restoration into the selected medium- and low-frequency DCT coefficients. Thus, the illegally tampered regions can be detected, and then the original information in that region can be extracted for restoration. Experimental results show that the proposed authentication and restoration techniques can be applied to a DVR (Digital Video Recorder) system, in which no original image information is involved, and it can effectively detect the illegally tampered region and restore the tampered region in the human visual perceptual quality by only using a little embedded original information. | 10-30-2008 |
| 20080298699 | METHOD AND DEVICE FOR DOWN-SAMPLING A DCT IMAGE IN THE DCT DOMAIN - A method and device that uses transform matrices to down-sample a DCT image directly in the DCT domain. The transform matrices have been selected to minimize an optimization problem which is a function of the visual quality of down-sampled images obtained using the matrices and the computational complexity associated with using the transform matrices. The transform matrices comprise a row transform matrix and a column transform matrix. A down-sampled image is produced by determining an intermediary matrix as the product of the DCT image and one of either the row transform matrix or the column transform matrix and then determining the down-sampled image as the product of the intermediary matrix and the transform matrix not already used to determine the intermediary matrix. | 12-04-2008 |
| 20080298700 | METHOD AND DEVICE FOR SELECTING TRANSFORM MATRICES FOR DOWN-SAMPLING DCT IMAGE USING LEARNING WITH FORGETTING ALGORITHM - Down-sampling of an image may be performed in the DCT domain. A multiple layered network is used to select transform matrices for down-sampling a DCT image of size M×N to a DCT image of size I×J. A spatial domain down-sampling method is selected and applied to the DCT image to produce a down-sampled DCT reference image. A learning with forgetting algorithm is used to apply a decay to the elements of the transform matrix and select a transform matrices which solve an optimization problem. The optimization problem is a function of the visual quality of images obtained using the transform matrices and the computational complexity associated with using the transform matrices. The visual quality is a measure of the difference between the down-sampled DCT image obtained using the transform matrices and the visual quality of the DCT reference image obtained using a spatial domain down-sampling method. | 12-04-2008 |
| 20080298701 | Method and Device for Selecting Optimal Transform Matrices for Down-sampling DCT image - Down-sampling of an image may be performed in the DCT domain. Transform matrices are obtained for down-sampling a DCT image of size M×N to a down-sampled DCT image of size I×J. The transform matrices may be used to down-sample the DCT image directly in the DCT domain. A spatial domain down-sampling method is selected and applied to the DCT image to produce a down-sampled DCT reference image. The transform matrices are selected by solving an optimization problem, leading to transform matrices which achieve a desired trade-off between the visual quality of images obtained using the transform matrices and the computational complexity associated with using the transform matrices. The visual quality is a measure of the difference between the down-sampled DCT image obtained using the transform matrices and the visual quality of the DCT reference image obtained using a spatial domain down-sampling method. | 12-04-2008 |
| 20080304763 | Transform Domain Fast Mode Search for Spatial Prediction in Advanced Video Coding - This invention is method for determining direction mode for an image block in intra prediction of video frames. The method calculates a plurality of energy terms from the spatial frequency domain image block, then determines a coarse classification from these energy terms. For at least some coarse classifications the method searches from among a subset of less than all possible direction modes. The method also searches a most likely direction mode determined from neighbor blocks when available. | 12-11-2008 |
| 20090016629 | Method of Performing Fast Compression and Decompression for Image - The present invention relates to an image compression and decompression method, in particular in the areas of computer image processing and data compression. The currently, the process speed for which JPEG (Joint Photographic Experts Group, a compression standard) is applied, it's not all too satisfactory. One aspect of the present invention is simplify compression process based on particular features of an image, thus achieve the aim of accelerate the processing speed. Apply the process described in the present invention, the processing speed for JPEG compression/decompression would rise, without suffers quality reduction compare to current JPEG compression/decompression method. | 01-15-2009 |
| 20090016630 | APPARATUS AND METHOD FOR TRANSFORMING BETWEEN DISCRETE COSINE TRANSFORM COEFFICIENT AND DISCRETE WAVELET TRANSFORM COEFFICIENT - Provided is an apparatus and method for transforming between a DCT coefficient and a DWT coefficient. The transforming apparatus includes a first fundamental matrix calculating unit, a second fundamental matrix calculating unit, and a DWT coefficient calculating unit. The first fundamental matrix calculating unit calculates a first fundamental matrix by multiplying an N×N forward DWT transform matrix and an N×N matrix that has diagonal components corresponding to a transpose matrix of an 8×8 DCT transform matrix and the remaining components corresponding to an 8×8 matrix with all elements being zero. The second fundamental matrix calculating unit calculates a second fundamental matrix by multiplying an M×M matrix, which has diagonal components corresponding to an 8×8 DCT transform matrix and the remaining components corresponding to an 8×8 matrix with all elements being zero, and a transpose matrix of an M×M forward DWT transform matrix. The DWT coefficient calculating unit calculates a 2-dimensional 1-level DWT coefficient by multiplying the first fundamental matrix, a 2-dimensional 8×8 DCT transform coefficient, and the second fundamental matrix. | 01-15-2009 |
| 20090034859 | IMAGE DISPLAY APPARATUS AND METHOD FOR CORRECTION CHROMA WRINKLE - An image display apparatus and a color distortion compensation method are provided. The image display apparatus includes a detecting part which detects whether there is a color distortion in a block, using decoding information acquired from an incoming image and a pixel value of the incoming image, and a compensation part which compensates for the color distortion of the block when it is determined that the color distortion exists. Accordingly, it is possible to detect a color distortion in the block using the decoding information and pixel value acquired from the incoming image, and compensate for the color distortion of the block by performing pixel value adjustment and low pass filtering (LPF) when it is determined that the color distortion exists. | 02-05-2009 |
| 20090041366 | GENERATING SEARCH REQUESTS FROM MULTIMODAL QUERIES - A method and system for generating a search request from a multimodal query that includes a query image and query text is provided. The multimodal query system identifies images of a collection that are textually related to the query image based on similarity between words associated with each image and the query text. The multimodal query system then selects those images of the identified images that are visually related to the query image. The multimodal query system may formulate a search request based on keywords of web pages that contain the selected images and submit that search request to a search engine service. | 02-12-2009 |
| 20090046941 | ENCODING METHOD AND APPARATUS APPLYING COEFFICIENT REORDERING - In a method of encoding and encoder a method step is performed in which the scan order of a set of image region modeling coefficients is established on the basis of information of set of image region modeling coefficients preceding said set of image region modeling coefficients, and said set of image region modeling coefficients subsequently undergoes a scan ordering. | 02-19-2009 |
| 20090052791 | Methods for Calculating Video Inverse Transform - Inverse transforms used in video and image compression/decompression, such as DCT/IDCT used in MPEG-2 and MPEG-4, or the integer transforms used in H.264, are usually calculated with fast algorithms, which only take advantage of the symmetry existing in the transform matrix but ignores the peculiarities in the input data. While these kind of fast algorithms can apply to both forward and inverse transforms, they tend to be inefficient in calculating inverse transforms. In inverse transforms, most of the coefficients become zero after quantization, this invention takes advantage of this fact to further simplify the general fast algorithm and speed up the calculation. | 02-26-2009 |
| 20090067736 | Enhanced Image Compression Utilizing Hilbert Curve Scanning of Quantized Discrete Cosine Transform Coefficients - A method for compressing images, the method including the steps of partitioning image information for an image into partitioned information, transforming the partitioned information into transformed information using a discrete cosine transform (“DCT”), and quantizing the transformed information into quantized information. The method further includes the steps of sequencing the quantized information into sequenced information using a Hilbert curve scan, encoding the sequenced information into encoded information, and storing the encoded information. The DCT is a JPEG DCT. | 03-12-2009 |
| 20090103825 | ARBITRARY RATIO IMAGE RESIZING IN THE DCT DOMAIN - A method and system for arbitrary resizing of a compressed image in the discrete cosine transform (DCT) domain. First and second scaling parameters P and Q are determined in accordance with the block numbers L and M and the scaling ratio L/M or M/L. A non-uniform, or uneven, sampling in the DCT domain is then applied to coefficients of successive blocks in the compressed image in accordance with the scaling parameters. In an embodiment, P blocks are sampled and transformed from a given block length to |P| according to a |P|-point IDCT, while Q blocks are sampled and transformed from a given block length to |Q| according to a |Q|-point IDCT. The non-uniformly sampled and transformed pixel domain samples are then regrouped into a predetermined block size and transformed back to generate the DCT coefficient of the compressed image. The proposed method significantly reduces the computational complexity compared with other DCT domain arbitrary ratio image resizing approach. It also facilitates the practical implementations since only the fast implementations of IDCT with length N (1| 04-23-2009 | |
| 20090110315 | IMAGE DATA COMPRESSING METHOD AND IMAGE DATA COMPRESSING APPARATUS - An image data compressing method, including: storing a plurality of data components of an original image data; assigning a value to a first bit sequence, where the first bit sequence includes a first group of bits associated with zero data components in the plurality of data components and a second group of bits associated with non-zero data components in the plurality of data components, each bit of the first group is assigned a first value, each bit of the second group is assigned a second value different from the first value; counting a first number which is a number of the first value continuing in the first bit sequence; obtaining a significant bit length of at least one of the plurality of data components; translating a combination of the first number and the significant bit length to a code obtained by looking up a coding table; and joining the code to a bit stream of a compressed image data. | 04-30-2009 |
| 20090110316 | APPARATUS AND METHOD FOR PERFORMING VIDEO DECODING PROCESSES IN PARALLEL - An apparatus and a method for performing video decoding processes in parallel are provided. The method is adapted for utilizing a first cluster and a second cluster of a processor to perform the video data decoding process in parallel. The method includes performing a VLD process to the video data with the first cluster, so as to obtain a plurality of coefficients and then performing an IZ process, an IQ process, and an IDCT process to the coefficients with the second cluster, so as to obtain a plurality of pixels values of the video data. When the first cluster decodes a coefficient of the video data, the second cluster performs the IZ, IQ, and IDCT processes to a coefficient previously decoded by the second cluster of the video data. Accordingly, a parallel process is realized and the decoding speed is increased. | 04-30-2009 |
| 20090110317 | METHOD AND APPARATUS FOR COMPRESSING IMAGE SIGNAL - A method of compressing image signals, to provide more efficient compression than a discrete cosine transform (DCT) while having the least amount of overhead information is provided. A partial exchange between a row and a column of a transform matrix is performed by applying several values to a parameter, which shows an extent of partial exchange between rows and columns of the transform matrix. When a value of the used angle parameter is stored or transmitted, an overhead increases. Processes generating a random sequence of the angle parameter, generating a compression coefficient matrix regarding each angle parameter of the generated random sequence, and calculating a compression rate are repeated to obtain an angle parameter with the highest compression rate. The angle parameter having the highest compression rate is not stored or transmitted, but a number in the random sequence of the corresponding angle parameter is obtained, and stored or transmitted. | 04-30-2009 |
| 20090154821 | Method and an apparatus for creating a combined image - A method for generating a combined image that comprises, during capturing a sequence comprising a plurality of initial images, detecting a subset of the plurality of images having no substantial motion thereamong, combining data from the subset to produce a combined image, and outputting the combined image. | 06-18-2009 |
| 20090238484 | LIFTING-BASED DIRECTIONAL LAPPED TRANSFORMS - A “directional lapped transform coder” (“DLT Coder”) provides various techniques for designing directional lapped transforms. In general, lapped transforms are factorized into lifting steps. A “directional operator” is then introduced into each lifting step in order to construct the directional lapped transform by selecting data elements from a data signal along a path corresponding to the directional operator. The resulting directional lapped transform preserves the advantages of conventional lapped transforms while also providing more efficient representation directional signals. In various embodiments, the resulting directional lapped transform is used to enable an image/video coding scheme that provides significant improvement over conventional state-of-the-art image lapped transform based coding schemes for images with strong directional correlations. | 09-24-2009 |
| 20090245673 | SHARED ERROR RESILIENCY PATH THROUGH COEFFICIENT REORDERING - The method, system, and apparatus of a shared error resiliency path through coefficient reordering is disclosed. In on embodiment, determining that an input data is data-partitioned, performing a discrete cosine transform and a quantization of the input data to form a quantized data, separating a first coefficient representing a DC coefficient of the quantized data for each block of the input data, rearranging other coefficients representing AC coefficients of the quantized data for each block of the input data in a fashion produces a zig-zag scan output similar to that of a non-data-partitioned data, bypassing a DC encoding module, determining whether any of the rearranged AC coefficients of the quantized data need to be encoded, performing a zig-zag scan on the rearranged AC coefficients of the quantized data when they need to be encoded, and encoding the rearranged AC coefficients of the quantized data based on the zig-zag scan. | 10-01-2009 |
| 20090263035 | IMAGE NOISE LEVEL ESTIMATION FROM JPEG DATA - A system for estimating noise levels in a data stream includes a calculator for determining DC and AC values of DCT coefficients in coded data blocks, where the coded data blocks are within a strip of an image divided into multiple strips. A classifier is included for forming a plurality of luminance levels, based on the calculated DC values. A selector is included for selecting coded data blocks having minimum AC values, as computed by the calculator. At least two coded data blocks are selected for each of the luminance levels. After decoding, another calculator is used for determining a variance for each of the decoded data blocks corresponding to the selected coded data blocks in each strip. An order statistic filter is included for ordering the decoded data blocks in each strip based on the calculated variances. Another selector selects one of the decoded data blocks, for each of the luminance levels. | 10-22-2009 |
| 20100119169 | METHOD FOR PROCESSING IMAGES AND THE CORRESPONDING ELECTRONIC DEVICE - The invention concerns a method for processing images, texture pattern blocks representative of a typical texture of the images being stored in a memory, the method comprising the following steps:
| 05-13-2010 |
| 20100135590 | METHOD OF ENCODING AN IMAGE AND DEVICE IMPLEMENTING SAID METHOD - The invention relates to a method of encoding an image divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of N by N pixels into a binary stream. It comprises the steps of: —transforming each of the block into a transformed block of coefficients comprising one low frequency coefficient and N2-1 coefficients, called high frequency coefficients, of higher frequencies than the low frequency; —quantizing each coefficient of each of the transformed blocks with a quantizing parameter; —encoding the quantized coefficients into a binary stream. According to the invention, the low frequency coefficients of the transformed blocks are quantized with a same quantizing parameter, called first quantizing parameter. | 06-03-2010 |
| 20100166330 | Systems and Methods of Using Spatial/Spectral/Temporal Imaging for Hidden or Buried Explosive Detection - A method and system for increasing the detection, location, identification or classification of objects hidden on the surface or buried below the surface of the ground is disclosed. The method acquires image data in separate IR and/or visible spectral regions simultaneously and converts the data into intensity value arrays for each spectral region. These intensity value arrays are transformed into two-dimensional discrete wavelet transform arrays for each spectral region. The background clutter from the two-dimensional discrete wavelet transform arrays is removed; forming clutter reduced two-dimensional discrete wavelet transform arrays. The inverse two-dimensional discrete wavelet transform is performed on the clutter reduced two-dimensional discrete wavelet transform arrays to form clutter removed intensity value arrays. These arrays are subtracted in a pair-wise mariner to obtain chemical-specific spectral signatures. The processed images are correlated with 3-dimensional matched filters of known emissive signatures of objects to detect the presence of the object. | 07-01-2010 |
| 20100202710 | DETERMINING SHARPNESS PREDICTORS FOR DIGITAL IMAGES - A method for determining a sharpness predictor for an input digital image includes determining one or more image metrics by analyzing the input digital image; and determining the sharpness predictor from the one or more image metrics. | 08-12-2010 |
| 20100272374 | DCT-BASED TECHNIQUE WITH RHOMBUS SCANNING FOR IMAGE COMPRESSION - A DCT-based technique with rhombus scanning for image compression. A flipped-kernel discrete cosine transform is applied to an eight by eight pixel sub-block of the sixteen by sixteen pixel block. A visually insignificant information is removed from the eight by eight pixel sub-block. A quantization method is used to remove the visually insignificant information. A quantized discrete cosine transform coefficient is scanned of the sixteen by sixteen pixel block. The quantized discrete cosine transform coefficient is scanned according to a rhomboid pattern. A portion of a digital image may be divided into a sixteen by sixteen pixel block. | 10-28-2010 |
| 20110026846 | DISCRETE COSINE PROCESSING CIRCUIT AND IMAGE PROCESSING DEVICE UTILIZING THE SAME - A discrete cosine transformation circuit comprising a pipeline with a memory stage and an arithmetic stage. The arithmetic stage comprises first and second arithmetic logic units (ALU). Each of the ALUs receives from the memory a set of image data, performs a first calculation on the set of image data and outputs calculation result thereof in a first clock cycle. A path in the circuit directs the result to the memory stage, such that at least one ALU can selectively receive the result from the path in a clock cycle subsequent to the first clock cycle. | 02-03-2011 |
| 20110052089 | IMAGE PROCESSING SYSTEM, IMAGE PROCESSING METHOD, AND COMPUTER-READABLE MEDIUM - An image processing system that can reduce the amount of operations for compression processing includes a characteristic region detecting section that detects a characteristic region from an image and a compressing section that compresses the image by compressing each prescribed partial region. The compressing section compresses an image of a partial region included in a characteristic region by using pixel values of pixels, the number of which is larger than the number of pixels used for compressing an image of a partial region included in a region other than the characteristic region. | 03-03-2011 |
| 20110064324 | METHOD AND APPARATUS FOR ENCODING AND DECODING IMAGE BASED ON SKIP MODE - A method and apparatus for encoding and decoding an image. The encoding method includes: deciding whether pixel values of a first block of an image are identical to pixel values of a second block of the image that is encoded prior to the first block in a current slice of the image, and determining whether to encode the first block in a first mode according to the deciding; and selectively encoding the first block in the first mode based on the determining, wherein the first mode is a mode for encoding information representing that the first block is encoded in the first mode, instead of encoding the pixel values of the first block, when the first block is identical or similar to the second block. | 03-17-2011 |
| 20110064325 | METHOD AND APPARATUS FOR ENCODING AND DECODING IMAGE BASED ON SKIP MODE - An image encoding method and apparatus, and an image decoding method and apparatus respectively corresponding to the image encoding method and apparatus are provided. The image encoding method includes: if a current block is an initial block of a current slice, determining whether a virtual block in which pixel values are equal to a predetermined value is identical to the current block; and encoding the current block in a first mode based on the determining, wherein the first mode is a mode for encoding information representing that the current block is encoded in the first mode, instead of encoding pixel values of the current block, when the current block is identical to the virtual block. | 03-17-2011 |
| 20110091124 | System for multi-byte reading - A control device, system and method for multi-pixel reading provides a processor receiving multi-pixel, uses memory units wherein each memory unit sequentially receiving a writing enable signal, and then receiving and storing multi-pixel. Simultaneously, the processor having multi-data bus receives multi-pixel of the each memory unit output. The clock of the enabling all the memory units is less than the delay of the processor reading, so that reducing the spare time of the image decoding system and reducing the reading time of the reading image. | 04-21-2011 |
| 20110103704 | JPEG DECODER CAPABLE OF SCALING AND SCALING METHOD USING THE SAME - A JPEG decoder having a scaling function includes an inverse discrete cosine transform block, wherein the JPEG decoder selectively performs an inverse discrete cosine transform on a part of pixel data of a macroblock through the inverse discrete cosine transform block and outputs a scaled image file. The JPEG decoder and the scaling method using the JPEG decoder increase a decoding speed, thereby enabling an image to be output in real time, especially when the JPEG decoder and/or the scaling method are applied to a mobile field. Also, the JPEG decoder and the scaling method using the JPEG decoder can achieve an efficient scaling, even without a separate circuit for scaling, thereby reducing a circuit size and the number of components. | 05-05-2011 |
| 20110135212 | METHOD AND APPARATUS FOR ENCODING AND DECODING IMAGE BY USING ROTATIONAL TRANSFORM - Disclosed are a method and apparatus for encoding and decoding an image. The image encoding method includes: generating a first frequency coefficient matrix by performing spatial transform (e.g. discrete cosine transform (DCT) on a current block; determining an angle parameter based on whether the current block is intra or inter predicted; generating a second frequency coefficient matrix by performing a partial switch between at least one of rows and columns of the first frequency coefficient matrix based on the determined angle parameter; and encoding the second frequency coefficient matrix and information about the angle parameter. | 06-09-2011 |
| 20110206290 | DISPLAY DRIVING CIRCUIT - The display driving circuit includes: an OD (OverDrive) calculation circuit operable to generate an OD driving signal for improving the response characteristic of a display device according to display image data; a drive-output circuit operable to supply an OD driving signal to the display device; and a compression circuit operable to store compressed display data in a memory. The compression circuit includes a DCT calculation module operable to execute DCT (Discrete Cosine Transform) of display image data, and an entropy coding module operable to execute variable length entropy coding of DCT conversion display data. Preferably, the display driving circuit further includes a decompression circuit operable to supply an OD calculation circuit with display data resulting from decompression of compressed display data read out the memory. | 08-25-2011 |
| 20110235932 | METHOD AND DEVICE FOR SELECTING OPTIMAL TRANSFORM MATRICES FOR DOWN-SAMPLING DCT IMAGE - Down-sampling of an image may be performed in the DCT domain. Transform matrices are obtained for down-sampling a DCT image of size M×N to a down-sampled DCT image of size I×J. The transform matrices may be used to down-sample the DCT image directly in the DCT domain. A spatial domain down-sampling method is selected and applied to the DCT image to produce a down-sampled DCT reference image. The transform matrices are selected by solving an optimization problem, leading to transform matrices which achieve a desired trade-off between the visual quality of images obtained using the transform matrices and the computational complexity associated with using the transform matrices. The visual quality is a measure of the difference between the down-sampled DCT image obtained using the transform matrices and the visual quality of the DCT reference image obtained using a spatial domain down-sampling method. | 09-29-2011 |
| 20110255800 | Fixed Buffer Real-Time Image Compression Technique - Performing real-time compression on an image for target buffer fullness includes dividing the image into N macro-blocks, performing a discrete cosine transformation (DCT) on each of the N macro-blocks, defining a Quantization Parameter Scalar (Q) for each of the N macro-blocks of the image on the DCT being performed, initializing the Quantization Parameter Scalar (Q) for the first Macro-block to a value that correlates to a buffer fullness of a previously compressed image, and monitoring the buffer fullness by comparing the buffer fullness with the target buffer fullness. The N macro-blocks include 16×16 macro-blocks. The Q value is increased to a first new value when the buffer fullness is greater than the target buffer fullness. The Q value is decreased to a second new value when the buffer fullness is less than the target buffer fullness. | 10-20-2011 |
| 20120020583 | METHOD AND DEVICE FOR TRANSFORMATION OF IMAGE AND METHOD AND DEVICE FOR REVERSE TRANSFORMATION OF IMAGE - Provided are methods and apparatuses for transforming and inverse-transforming an image. The method of transforming an image includes: generating a substituted N×N transformation matrix by substituting elements of an N×N transformation matrix used for a 1-dimensional (1D) discrete cosine transform (DCT) of a N×N block of the image with values based on N variables, where N is an integer; obtaining a multiplication matrix of the substituted N×N transformation matrix and a transposed matrix of the substituted N×N transformation matrix; obtaining the N variables that enable a sum of squares of elements excluding diagonal components of the obtained multiplication matrix to be a minimum; and transforming the N×N block by using the substituted N×N transformation matrix, which is substituted with the values based on the obtained N variables. | 01-26-2012 |
| 20120027318 | Mechanism for Processing Order-16 Discrete Cosine Transforms - A computer generated method is disclosed. The method includes receiving data values and performing a 1-D 16×16 discrete cosine transform (DCT) on the data values by replacing each irrational constant used in multiplication operations with a rational dyadic constant that approximates the irrational constant. The output of the DCT is then scaled by a set of scale factors that refine the precision of the approximations used for the 16×16 DCT. | 02-02-2012 |
| 20120093428 | METHOD AND DEVICE FOR DOWN-SAMPLING A DCT IMAGE IN THE DCT DOMAIN - A method and device that uses transform matrices to down-sample a DCT image directly in the DCT domain. The transform matrices have been selected to minimize an optimization problem which is a function of the visual quality of down-sampled images obtained using the matrices and the computational complexity associated with using the transform matrices. The transform matrices comprise a row transform matrix and a column transform matrix. A down-sampled image is produced by determining an intermediary matrix as the product of the DCT image and one of either the row transform matrix or the column transform matrix and then determining the down-sampled image as the product of the intermediary matrix and the transform matrix not already used to determine the intermediary matrix. | 04-19-2012 |
| 20120093429 | ENCODING A SIGNAL INTO A SCALABLE BITSTREAM AND DECODING SUCH BITSTREAM - The invention relates to a bit-plane coding method of signals, for example, an image or video signal in the DCT transform domain. The bit planes of the DCT blocks are transmitted bit-plane by bit-plane in order of significance. As each plane contains more signal energy than the lower significant layers together, the resulting bit-stream is scalable in the sense that it may be truncated at any position. The later the bitstream is truncated, the smaller the residual error when the image is reconstructed. For each bit plane, a zone or partition of bit plane is created that encompasses all the non-zero bits of the DCT coefficients in that bit plane. The partition is created in accordance with a strategy that is selected from a number of options in dependence of the content of the overall signal and/or the actual bit plane. A different zoning strategy may be used for natural images than for graphic content, and the strategy may vary from bitplane to bitplane. The form as well as other properties such as size of each partition can thus be optimally adapted to the content. Two-dimensional rectangular zones and one-dimensional zigzag scan zones may be mixed within an image or even within a DCT block. The selected zone creating strategy is embedded in the bitstream, along with the DCT coefficient bits in the actual partition. | 04-19-2012 |
| 20120195516 | IMAGE PROCESSING APPARATUS AND METHOD FOR PERFORMING A DISCRETE COSINE TRANSFORM - An image processing apparatus and method providing a high speed pipeline structure having a low level of complexity is described. The image processing apparatus includes a memory configured to store a plurality of data in a plurality of memory locations, where an ordinally specified data is in a corresponding ordinal memory location. | 08-02-2012 |
| 20120263392 | ARBITRARY RATIO IMAGE RESIZING IN THE DCT DOMAIN - To resize a compressed image, first and second scaling parameters P and Q are determined in accordance with the block numbers L and M and the scaling ratio L/M or M/L. A non-uniform, or uneven, sampling in the DCT domain is then applied to coefficients of successive blocks in the compressed image in accordance with the scaling parameters. In an embodiment, P blocks are sampled and transformed from a given block length to |P| according to a |P|-point IDCT, while Q blocks are sampled and transformed from a given block length to |Q| according to a |Q|-point IDCT. The non-uniformly sampled and transformed pixel domain samples are then regrouped into a predetermined block size and transformed back to generate the DCT coefficient of the compressed image. The proposed method significantly reduces the computational complexity compared with other DCT domain arbitrary ratio image resizing approach. | 10-18-2012 |
| 20120321209 | DYNAMIC IMAGE COMPRESSION FOR IMAGING WHILE DRILLING APPLICATIONS - A dynamic data compression system for forming and transmitting data from a downhole location within a borehole penetrating the earth to a surface location includes a data source that forms raw data sets of a formation contacting the borehole, the raw data sets being formed at a fixed rate and a data rate sampler that determines a transmission rate of a transmission channel. The system also includes a compression engine configured to compress the raw data sets according to compression parameters to form compressed data sets. The compression parameters are dynamically changed based on the transmission rate. | 12-20-2012 |
| 20130051694 | METHOD AND APPARATUS FOR SHIFT DCT-BASED SHARPENING OF A VIDEO IMAGE - A method of processing a digital image includes applying a discrete cosine transform (DCT) to a plurality of shifted digital images to produce a plurality of DCT coefficients, amplifying at least some of the DCT coefficients by a variable gain, applying an inverse DCT to the amplified DCT coefficients, and averaging the results to produce a visually sharper image. The variable gain may be a function of the amplitude of the DCT coefficients. | 02-28-2013 |
| 20130108185 | IMAGE PROCESSING DEVICE, IMAGE PROCESSING METHOD, AND PROGRAM | 05-02-2013 |
| 20130121604 | IMAGE PROCESSING DEVICE AND IMAGE PROCESSING METHOD - In the printer, the correction content setting portion sets equal to or more than one correction contents, the decimation rate setting portion sets decimation rates for respective planes of Y, Cb, and Cr of JPEG data (compressed data) based on the set correction contents. Pixels are decimated at the set decimation rates and the decompression processing unit decompresses the JPEG data so as to generate image data. In this manner, decimation processing is performed in accordance with the plurality of correction contents. Therefore, for example, inverse quantization processing, inverse DCT operation processing, and the like, can be omitted in accordance with the correction contents. The decompression processing may be executed on a sampling image to be used for sampling when the contents of correction to be performed on the image data are determined and on a print image to be used for printing. | 05-16-2013 |
| 20130170764 | DOWNSIZING AN ENCODED IMAGE - There is provided a system, a computer program product, program storage device readable by machine, and a method of downsizing an input disjoint block level encoded image. According to examples of the presently disclosed subject matter, the method can include calculating a DCT downsize ratio for downsizing the input image in a DCT domain according to a target downsize ratio and according to a size of a DCT transform length associated with the input image; adapting an I-DCT according to the DCT domain downsize ratios; performing the adapted I-DCT; providing an intermediate image as output of a DCT domain process; and applying a pixel domain interpolation to the intermediate image according to dimensions of the intermediate image and according to dimensions of the target image. | 07-04-2013 |
| 20130336594 | DYNAMIC GENERATION OF A QUANTIZATION MATRIX FOR COMPRESSION OF A DIGITAL OBJECT - Some aspects of the disclosure relate to a compression technique that can permit determining dynamically a satisfactory quantization matrix based at least on properties intrinsic to a digital object being compressed and a predetermined compression quality criterion, wherein the quantization matrix is associated with a specific space-domain-to-frequency-domain transforms. In one aspect, the compression technique can permit creation of a compressed digital object that can satisfy a predetermined a compression quality criterion. | 12-19-2013 |
| 20140064630 | METHOD AND DEVICE FOR RECONSTRUCTING A SELF-SIMILAR TEXTURED REGION OF AN IMAGE - The invention proposes a method for reconstructing a self-similar textured region of an image. Said method comprises determining pixels of a part of the self-similar textured region by copying sample pixels from a sample part of the self-similar textured region, the sample pixels being selected using a neighbourhood matching, wherein a size of neighbourhoods used for matching is selected based on an analysis of descriptors computed from coefficients of OCT transform of differently sized blocks of the sample part. The analysis of descriptors computed from coefficients of DCT transform of differently sized blocks of the sample part allows for determining the neighbourhood size close to a feature size of the texture. | 03-06-2014 |
| 20140072240 | METHOD AND APPARATUS FOR CONVERTING AN IMAGE, AND METHOD AND APPARATUS FOR INVERSE CONVERTING AN IMAGE - An image transformation method substitutes element based on a trigonometric function included in a discrete cosine transform (DCT) matrix with a rational number, performs upscaling and transformation process on an input signal using the substituted DCT matrix based on a maximum value of a denominator of an intermediate value generated in the transformation process, and performs downscaling on the transformed signal. | 03-13-2014 |
| 20140205199 | Storage Area and Temporal Based Optimized Run Length Codec For Classic JPEG Image Compression (SAT-BORL CODEC) - This invention optimizes the entropy encoding part of JPEG (Joint Photographic Experts Group) image compression by modifying the run length encoding method that performs the actual compression by removing the redundancy from transformed and quantized image data. Using the fact that the preceding processes of run length coding, in JPEG compression algorithm, produces a large number of zeros, the original run length coding uses an ordered pair (a,b), where ‘a’ is the length of consecutive zeros preceding the ASCII character ‘b’. The proposed run length encoding scheme removes an unintended redundancy, from the original run length encoding scheme, by using an ordered pair only when a zero occurs and using the same EOB (End of Block) parameter at the end of each block. The proposed encoding scheme does not alter the value of PSNR but is found to be very effective in reducing the size of JPEG compressed image data. | 07-24-2014 |
| 20140212060 | IMAGE CODING METHOD AND EMBEDDED SYSTEM USING THE SAME - An image coding method including constructing a plurality of edge models with a Forward Discrete Cosine Transform (FDCT) algorithm; creating adjustment equations each matching one of the edge models; capturing an image comprising pixels; selecting the pixels of the image to define image blocks; detecting by block-edge detection (BED) a pattern collectively exhibited by the pixels in the each of the image blocks and then comparing the detected pattern with patterns of the edge models; changing the patterns of the image blocks to the patterns of the edge models and adjusting the dominating coefficient by the adjustment factor after determining that the patterns of the image blocks approximate to the patterns of the edge models; and performing a coding process on the edge models by LLEC to generate a compressed image corresponding to the edge models. An embedded system is applicable to the image coding method. | 07-31-2014 |
| 20140248000 | SCALABLE IMAGE CODING AND DECODING - A method and device for encoding an image into a scalable bitstream, the method including acts of dividing the Image in image blocks; encoding each image block in accordance with one of a plurality of different encoding modes, to obtain corresponding block bitstreams comprising one or more types of data representative of said encoding mode; and forming the scalable bitstream by iteratively scanning the block bitstreams, each scan including acts of: selecting at least on of said types of data, including in the scalable bitstream data of the selected types from the block bitstreams and including in the scalable bitstream flags indicating the selected types of data. | 09-04-2014 |
| 20140294314 | HIERARCHICAL IMAGE AND VIDEO CODEC - A hierarchical system and method of encoding and compressing image data, or video data including a sequence of images. In one embodiment, a line buffer is used to hold a line of an image, and as the second line of the image is read from the input data stream, 2×2 blocks of the image are transformed, e.g., by a Hadamard transform. Each transform results in a low-frequency component and three high-frequency component. The high-frequency components are encoded, e.g., using entropy coding, and sent out to the output bit stream. The low-frequency components are pushed to the line buffer. This process is continued until enough low-frequency components have been formed to complete a 2×2 block of low-frequency components, which is then transformed. The process may be repeated hierarchically for multiple layers. | 10-02-2014 |
| 20140348439 | System and Method for Compressing Images and Video - A system and method for image and video compression using compressive sensing is provided. An embodiment method for compressing an image having a plurality of image blocks includes selecting an image block from the plurality of image blocks to compress, computing a sum of sinusoidal signals at different frequencies and amplitudes representation for the selected image block, quantizing the amplitudes of the sinusoidal signals at different frequencies, and saving the quantized amplitudes as a first compressed image block. The method also includes truncating the quantized amplitudes, thereby producing truncated quantized amplitudes, saving the truncated quantized amplitudes as a second compressed image block, and selecting either the first compressed image block or the second compressed image block as a final compressed image block. The selecting is based on a measure of the quality of the first compressed image block and the second compressed image block. | 11-27-2014 |
| 20150043835 | MERGING AND SPLITTING DATA BLOCKS - A first set of discrete cosine transform (DCT) blocks is obtained. Each DCT block from the first set of DCT blocks has a first block size. When performing a split operation on the first set of DCT blocks, a filter is applied to the first set of DCT blocks. A second set of data blocks is generated based on the first set of DC blocks using a transform function. Each block in the second set of data blocks has a second block size. When performing a merge operation, the filter is applied to the second set of data blocks. | 02-12-2015 |
| 20150339829 | TUNABLE MULTI-PART PERCEPTUAL IMAGE HASHING - Systems and methods generate a perceptual image hash of an image. The perceptual image hash can be generated from multiple features extracted from a DCT transformation of the image. The perceptual image hash can be compared to other perceptual image hash values using a weighted Hamming distance function. | 11-26-2015 |
