Abstract: Local descriptors are extracted from an image. An image vector is generated having vector elements indicative of parameters of mixture model components of a mixture model representing the extracted local descriptors. The image vector is compressed using a vector quantization algorithm to generate a compressed image vector. Optionally, the compressing comprises splitting the image vector into a plurality of sub-vectors each including at least two vector elements, compressing each sub-vector independently using the vector quantization algorithm, and concatenating the compressed sub-vectors to generate the compressed image vector. Optionally, each sub-vector includes only vector elements indicative of parameters of a single mixture model component, and any sparse sub-vector whose vector elements are indicative of parameters of a mixture model component that does not represent any of the extracted local descriptors is not compressed.

Abstract: A video encoder identifies one or more AC coefficients of each of plural blocks in the picture. The encoder identifies a threshold quantization step size such that the identified AC coefficient(s) of each of the plural blocks are nonzero after quantization according to the threshold quantization step size. The threshold quantization step size is such that quantization according to the next higher quantization step size would result in at least one of the identified AC coefficient(s) of at least one of the plural blocks being zero. For example, identifying the threshold quantization step size comprises identifying n top AC coefficients in each of four blocks of a macroblock, determining the smallest AC coefficient among the identified n top AC coefficients of the four blocks, and iteratively evaluating the smallest AC coefficient with respect to candidate quantization step sizes until the threshold quantization step size is identified.

Abstract: A pattern generating apparatus includes a sequence generating unit and an image data generating unit. The sequence generating unit generates a sequence formed by terms having M-value numeric values. The image data generating unit generates the image data by converting each numeric value of the sequence into a gray-level value according to each numeric value, and the sequence is generated by the sequence generating unit. The sequence generating unit generates the sequence such that vectors expressed by sub-sequences have different directions for the sub-sequence constituting the generated sequence.

Abstract: An image processing apparatus includes a quantizing unit configured to quantize an input moving image signal using a set quantization scale; a coding unit configured to perform variable length coding on an output of the quantizing unit; an activity detecting unit configured to detect an activity of the input moving image signal; a quantization-scale determining unit configured to determine the quantization scale; a changing unit configured to change a value determined by the quantization-scale determining unit, and to set the changed value, as the quantization scale; and a filling level detecting unit configured to detect the filling level of a virtual buffer in a decoder which decodes the coded moving image signal, and to control the changing unit such that the degree of change in the quantization scale caused by use of the activity is reduced as the detected filling level decreases.

Abstract: A method of reducing computations utilizing a threshold to increase efficiency and speed of a video encoder is described. Computations of transform and scaling processes of a video encoder are able to be streamlined by utilizing one or more thresholds stored within one or more lookup tables. A selected threshold is compared with a value before scaling. If the value before scaling is less than the threshold, it is known that the coefficient will be zero and thus no further computations are required. Furthermore, the coefficient is set to zero. If the value before scaling is greater than the threshold, then further calculations are performed. The method is able to be extended to eliminate computations in forward transform as well. By skipping computations when the coefficient is zero, the method eliminates wasted computation power and time.

Abstract: Systems and methods to compress MQDF data are disclosed herein. A plurality of eigenvectors is identified. Each eigenvector in the plurality of eigenvectors can correspond to a pattern to be recognized. Each eigenvector in the plurality of eigenvectors can be split into sub-vectors. The sub-vectors can then be grouped into one or more groups according to a location of the sub-vectors within each of the eigenvectors. Each group can be associated with location data of the sub-vectors in the group. At least one group can be compressed according to a codebook. The codebook can be identifiable via the location data.

Abstract: An object of the present invention is to detect characteristics of images such as blurring and the like without expanding compressed and stored image data. And, the above-described detection is realized by detecting image characteristics on the basis of attached information of an image, such as relation between low frequency components and high frequency components of alternate current components and contents of a quantization table of image data compressed by a compression system for converting image data into spatial frequency components. In addition, for example, as a result of detection, an image discriminated to be in a blurred state is controlled so as not to be inserted into an album template or to be inserted into a small area inside the album template. Thereby, a user can omit work of picking and choosing images to insert into an album template while taking a look at a lot of images.

Abstract: An image quantization method and apparatus are provided in which a block with a high possibility of having color distortion is more elaborately quantized using a predetermined color distortion removing quantization matrix. The image quantization method includes determining a possibility of color distortion in the block using discrete cosine transform (DCT) coefficients and pixel values of the block of predetermined size of an image and performing initial quantization on the block using a predetermined color distortion quantization matrix to remove color distortion if the block has a high possibility of color distortion.

Abstract: A frame memory holds a reference frame that is to be referenced for motion detection for a target block of a coding target frame in motion images. A motion compensation unit that includes a motion detecting unit and a motion compensated prediction unit. The motion detecting unit detects the motion of said target block by repeated motion estimation with reference to said reference frame stored in said frame memory, and the motion compensated prediction unit performs motion compensation processing for the target block using information on the detected motion. A coding unit that performs coding processing for the subtraction image and the information on the detected motion and thereby creates a coded stream. The motion compensation unit includes a pre-reading memory which stores pixel data beforehand, where said pixel data is part of pixel data in said reference frame, which is to be frequently referenced for motion detection, and which has been transmitted from said frame memory.

Abstract: An image processing apparatus which compresses an image, the apparatus includes: a storage unit which stores a code book, the code book being prepared by allocating identification codes to code blocks, the code blocks being formed by executing quantization processing regarding a plurality of first image blocks as multidimensional vectors, the plurality of first image blocks being generated by cutting, in preset sizes, first regions out of a code book preparation image containing a first edge, each of the first regions surrounding and including an edge point of the first edge, the first edge being detected from the code book preparation image; an edge detection unit which detects a second edge from a compression target image containing the second edge; an image block generation unit which cuts, in preset sizes, second regions out of the compression target image to generate a plurality of second image blocks, each of the second regions surrounding and including an edge point of the detected second edge; a searc

Abstract: Provided is a method for constructing an image database for object recognition, which includes a feature extraction step of extracting local descriptors from object images which are to be stored in an image database, a scalar quantization step of quantizing a numeric value indicating each dimension of each of the local descriptors into a predetermined number of bit digits, and a storing step of organizing each of the local descriptors after the quantization to be able to be searched for in the closest vicinity, giving to the local descriptor an identifier of the image from which the local descriptor has been extracted, and storing the local descriptor to which the identifiers are given in the image database.

Abstract: An image processing system includes a coding device configured to code input image data, and a decoding device configured to decode the coded input image data, wherein, if coding and decoding are repeated on the input image data, the image quality of an image corresponding to the input image data is deteriorated. The decoding device includes an input section inputting quantized data in which the input image data is quantized; and a decoding section dequantizing the quantized data that is input by the input section and converting a dequantized value obtained as a result of the quantization into a value in the vicinity of the boundary of a quantization threshold value within a range corresponding to the dequantized value when the quantization is performed.

Abstract: A pattern generating apparatus includes a sequence generating unit and an image data generating unit. The sequence generating unit generates a sequence formed by terms having M-value numeric values. The image data generating unit generates the image data by converting each numeric value of the sequence into a gray-level value according to each numeric value, and the sequence is generated by the sequence generating unit. The sequence generating unit generates the sequence such that vectors expressed by sub-sequences have different directions for the sub-sequence constituting the generated sequence.

Abstract: Introducing a further prediction stage, namely a prediction of the motion vectors or the prediction error of the first prediction stage, does indeed at first increase the encoding or compression effort and, correspondingly, also the decoding or decompression effort, but the prediction proposed here leads to a significant improvement of the compression gain in relation to the effort in most graphics model sequences due to the uniformity of the motion.

Abstract: Disclosed is an apparatus and method for detecting a face from an image. The apparatus and method uses color components and enables a Support Vector Machine (SVM) having superior recognition performance to previously learn face and non-face images and determine whether an image is a face image based on a learned image database by reducing the size of a feature vector of a face as compared to conventional systems. Accordingly, the apparatus converts a face image into a mosaic image having a minimum size to reduce the dimension of the feature vector, in order to rapidly and correctly detect a face image.

Abstract: In a learning process, first, images having different resolutions are obtained from a target region of the subject (S101). Further, the subject characteristic of the target region is obtained (S102). Then, the resolution conversion rules are learned from the images having different resolutions, and those are recorded to a storage device along with the subject characteristics (S103). When converting the resolutions, the resolution conversion rules learned for the corresponding subject characteristics are applied to each region of the original image so as to convert the resolutions of the original image.

Abstract: Vectors representing objects in n-dimensional space are approximated by local polar coordinates on partitioned cells of the data space in response to a query, e.g., a query data vector entered with a request to find “k” nearest neighbors to the query vector. A set of candidate near neighbors is generated using the approximations, with the local polar coordinates being independent of the dimensionality of the data space. Then, an answer set of near neighbors is returned in response to the query. Thus, the present invention acts as a filter to reduce the number of actual data vectors in the data set that must be considered in responding to the query.

Abstract: A texture filtering apparatus includes a first generating unit configured to generate first texture data having a size designated by a user or satisfying a condition designated by the user by using not less than second texture data acquired under different conditions or generated under different conditions, a second generating unit configured to generate texture data for filtering used for filtering by using the first texture data, and a filtering unit configured to perform filtering on the first texture data by using a designated filtering condition and the texture data for filtering.

Abstract: An image processing apparatus processes vector image data in units of blocks. When vector image data associated with a first block satisfies a predetermined condition, the image processing apparatus stores the result of processing the vector image data associated with the first block. When vector image data associated with a second block matches the vector image data associated with the first block, the image processing apparatus outputs the result of processing the vector image data associated with the first block, which is stored therein.

Abstract: To reduce the complexity of the encoding/decoding of pulse positions and/or pulse magnitudes associated with complex combinatorial computations, a method and structure for encoding and decoding of pulse position and/or pulse magnitudes requires fewer computations of these combinatorial functions. Adaptive switching between coding or encoding is performed in accordance with the estimated density of the plurality of occupied positions.

Abstract: A “Vector Graphics Encoder” encodes vector graphics in a randomly accessible format. This encoding format enables particular portions of encoded images to be directly accessed, at any desired level of zoom, without processing or otherwise decoding the entire image. This random-access format is based on a coarse image grid of partially overlapping cells wherein each cell is defined by a “texel program.” Unlike fixed-complexity cells used by conventional vector images, each cell defined by a texel program is locally specialized without requiring global constraints on the complexity of each cell. The texel program for each cell is provided as a variable-length string of tokens representing a locally specialized description of one or more of layers of graphics primitives overlapping the cell. Images are then rendered by interpreting the texel programs defining one or more cells.

Abstract: Techniques for providing a coefficient scaling operational unit to perform the coefficient scaling computation for various image compression schemes are disclosed. To minimize multiple units, each for one image encoding/decoding scheme (e.g., MPEG4 and WMV9), a single coefficient scaling operational unit is designed to accommodate various standards. In one embodiment, the coefficient scaling operational unit comprises an arithmetic logic unit. The arithmetic logic unit operates in accordance with a formula involving multiplication and division. Parameters such as coefficients and quantization parameters are provided to perform the coefficient scaling operation.

Abstract: This invention provides an image processing system and image processing method which allow a user to easily confirm conversion result information when image information is converted into vector data. Image information input from an input device (113) is vectorized by a data processing device (115). Vector data which has successfully been vectorized is converted into image data. The input image information and the converted image data are combined to generate and output combined image data.

Abstract: A compressor for compressing a block of feature vectors representing a feature associated with image elements, includes electronic circuitry for determining the distribution of the feature vectors, electronic circuitry for transforming each point pattern in a predetermined set of point patterns to fit the determined distribution, and a selector for selecting a transformed point pattern that best fits the determined distribution. Furthermore, an encoder represents the block of feature vectors by an identifier identifying the selected point pattern in the set of point patterns, parameters representing the transformation associated with the selected point pattern, and an index for each feature vector representing the nearest point in the transformed selected point pattern.

Abstract: Systems and methods for image pattern recognition comprise digital image capture and encoding using vector quantization (“VQ”) of the image. A vocabulary of vectors is built by segmenting images into kernels and creating vectors corresponding to each kernel. Images are encoded by creating a vector index file having indices that point to the vectors stored in the vocabulary. The vector index file can be used to reconstruct an image by looking up vectors stored in the vocabulary. Pattern recognition of candidate regions of images can be accomplished by correlating image vectors to a pre-trained vocabulary of vector sets comprising vectors that correlate with particular image characteristics.

Abstract: This disclosure describes residual coding techniques that use vector quantization coding, which relies on template matching. However, rather than transmit vector quantization codebook indexes (or codewords) that may have no meaning to standard compliant CODECs, the techniques described herein map the residual templates to pre-computed compressed residual blocks that are compliant with a video standard. The standard compliant compressed residual blocks can then be transmitted to another device, which complies with the standard. The techniques can exploit the advantages associated with vector quantization coding, such as the ability to perform more parallel processing, while still maintaining compliance with a video coding standard.

Abstract: An image processing system including an image encoder and image decoding system is provided. The image encoder system includes an image decomposer, a block encoder, and an encoded image composer. The image decomposer decomposes the image into blocks. The block encoder, which includes a selection module, a codeword generation module and a construction module, processes the blocks. Specifically, the selection module computes a set of parameters from image data values of a set of image elements in the image block. The codeword generation module generates codewords, which the construction module uses to derive a set of quantized image data values. The construction module then maps each of the image element's original image data values to an index to one of the derived image data values. The image decoding system reverses this process to reorder decompressed image blocks in an output data file.

Abstract: Provided are a method and an apparatus for selectively encoding/decoding point sequences to maximize bit efficiency of a lightweight application scene representation (LASeR) binary stream. The point sequence encoding method includes the steps of: for each point sequence, (a) selecting one of exponential-Golomb (EG) encoding and fixed length (FL) encoding schemes; (b) when the FL encoding scheme is selected, encoding the point sequence using the FL encoding scheme to generate a binary stream; and (c) when the EG encoding scheme is selected, encoding the point sequence using the EG encoding scheme to generate a binary stream. The binary stream includes a flag indicating which encoding scheme is selected and a parameter k, with which the EG encoding can be most effectively performed, when the EG encoding scheme is selected. According to the encoding method, LASeR point sequences can be efficiently encoded and, during a decoding process, a large overhead is not incurred to a decoder (terminal).

Abstract: A parallel dynamical system for computing sparse representations of data, i.e., where the data can be fully represented in terms of a small number of non-zero code elements, and for reconstructing compressively sensed images. The system is based on the principles of thresholding and local competition that solves a family of sparse approximation problems corresponding to various sparsity metrics. The system utilizes Locally Competitive Algorithms (LCAs), nodes in a population continually compete with neighboring units using (usually one-way) lateral inhibition to calculate coefficients representing an input in an over complete dictionary.

Abstract: Vector-based images and documents, such as those written in SVG and Adobe Flash, can be converted into equivalent bitmap or other non-vector-based image by parsing the vector-based image to detect objects in the vector-based code. For each detected object, a separate bitmap of the object is created and information about where that image lies on the z-axis is retained. A separate bitmap image is created for each object, and the separate bitmap images are layered on top of one another, which is to say ordered along the z-axis in accordance with their z-axis coordinates. Animation of an image can be implemented by selectively rendering different ones of the bitmap images as transparent.

Abstract: A video codec that allows for improved performance of embedded devices using vector quantization and the high correlation between frames in a scene to reduce the overhead associated with displaying video data. Video coding includes determining scene changes in a movie, producing one codebook for each scene, and coding each frame within a scene with the same codebook. The quantized video data is then losslessly compressed and formed into a video stream. Video decoding includes decoding the codebook for a frame and supplying the codebook and frame indices for frame rendering. Alternatively, video coding also includes dividing CPU time between codebook processing, indices processing, and frame rendering to ensure smooth video output.

Abstract: An image distribution apparatus divides image data of a single frame into a plurality of blocks, orthogonally transforms the blocks and calculates transformation coefficients, quantizes the calculated transformation coefficients, codes the quantized transformation coefficients, and distributes the coded image data. The image distribution apparatus acquires the quantized transformation coefficients, stores the acquired transformation coefficients in a storage unit, calculates differences between the transformation coefficients of a first frame and the transformation coefficients of a second frame stored in the storage unit in a unit of block, counts blocks whose difference values calculated above are equal to or greater than a predetermined value as changing blocks of the first frame, and determines that the first frame has changed when the counted number of blocks is equal to or greater than a predetermined value.

Abstract: A method and system for quantizing a vector corresponding to an input signal is described. The vector has a plurality of components corresponding to an N-dimensional space. In one aspect, the method and system include recursively dividing the space into equal spaces having one dimension less than a previous recursion until end spaces are formed. Each end space is two-dimensional. The method and system also include asynchronously comparing the components in each end space to determine a sub-space of a particular end space having a closest match to the vector. In another aspect, the method and system include providing tree(s) including a plurality of nodes and asynchronously traversing the tree(s) to determine a closest match to the vector. The nodes correspond to ANDs of comparisons between the components. Each comparison determines whether a first component is greater than a second component.

Abstract: A block of image elements is compressed by determining a parameter representative of a size of a bounding section in vector space encompassing feature vectors associated with the image elements. This size parameter is used to provide a deterministic, pseudo-random pattern of multiple representation vectors encompassed by the bounding section. A vector among multiple representation vectors is selected as representation of the feature vector of an image element. An identifier associated with selected vector is assigned to the image element and included in the compressed block which also comprises representations of the size parameter.

Abstract: A system and method are disclosed which include providing a first layer of an image, the first layer including features of the image having locations within the first layer; and providing a second layer of the image, the second layer including data blocks corresponding to respective ones of the features; each data block being in a location in the second layer substantially corresponding to a location in the first layer of the feature corresponding to each data block, wherein a size and shape of the second layer substantially correspond to a size and shape of said first layer.

Abstract: A method for compressing image data into a sequence of codes, the image data being represented by a plurality of input color vectors. The method includes a repetitive processing of one color vector at a time with the following steps: receiving one of the input color vectors; comparing the received input color vector with codebook words in a codebook, the codebook words being expressed as color vectors; compressing the received input color vector to generate a code based on the comparison; updating the codebook with a color vector, the color vector being generated by decoding the code; and outputting the code before receiving a next one of the input color vectors; wherein the updating may include rearranging the order of the codebook words based on the comparison.

Abstract: A method for transforming a matrix representation of pixels of an image into a vector representation of the image involves partition of the image into contiguous homogeneous regions by applying a watershed type morphologic algorithm to the matrix representation of pixels and identifying the contours of the contiguous homogeneous regions by applying a vector code contouring algorithm of the chain-code type to every region. By selecting quantization level of the gradient, improved image quality, dimensions and noise are achieved.

Abstract: The invention relates to compression coding and/or decoding of digital signals, in particular by vector variable-rate quantisation defining a variable resolution. For this purpose an impulsion dictionary comprises: for a given dimension, increasing resolution dictionaries imbricated into each other and, for a given dimension, a union of: a totality (D?i<N>) of code-vectors produced, by inserting elements taken in a final set (A) into smaller dimension code-vectors according to a final set of predetermined insertion rules (F1) and a second totality of code-vectors (Y?) which are not obtainable by insertion into the smaller dimension code vectors according to said set of the insertion rules.

Abstract: The restoration of images by vector quantization utilizing visual patterns is disclosed. One disclosed embodiment comprises restoring detail in a transition region of an unrestored image, by first identifying the transition region and forming blurred visual pattern blocks. These blurred visual pattern blocks are compared to a pre-trained codebook, and a corresponding high-quality visual pattern blocks is obtained. The high-quality visual pattern block is then blended with the unrestored image to form a restored image.

Abstract: The image processing method for obtaining a quantized image from a multiple tone image, the method comprises: an image dividing step of dividing an input image into a plurality of image blocks of a unit block size; a threshold value matrix specification step of specifying threshold value matrices for the input image with respect to each of the image blocks from a plurality of threshold value matrices including a first threshold value matrix having the unit block size and a second threshold value matrix dividable into a plurality of sub-matrices each having the unit block size; and a threshold value matrix setting step of setting threshold value matrices in image blocks for which the second threshold value matrix has been specified as the threshold value matrix, in such a manner that adjacent positional relationships between sub-matrices formed when the second threshold value matrix is divided into sub-matrix units are preserved.

Abstract: Methods and systems for compressing a continuous data flow for numerous applications where it is necessary to process large data sets such as hyper-spectral data cubes in real-time. A predetermined number of 2D focal plane frames in a boundary area of a previous regional data cube close to a current regional data cube are included in a training set used for codevector training for the current region. Therefore, no artificial boundary occurs between the two adjacent regions when codevectors trained in this way are used for codebook generation and encoding of the spectral vectors of the current regional data cube. This process substantially reduces image artifacts between adjacent regions. A remedy for the single bit error problem is also provided. Full redundancy of compressed data for a regional data cube is obtained by combining a previous regional data cube and the current regional data cube for codebook training.

Abstract: A system and method comprise defining a current rectangular region of the image bitmap, quantifying spectral characteristics of the current rectangular region, dividing the current rectangular region into four rectangular sub-regions in response to the spectral characteristics being greater than a predetermined threshold value, tagging the current rectangular sub-region as a terminal rectangular region in response to the spectral characteristics being less than or equal to the predetermined threshold value, tagging each rectangular sub-region as a terminal rectangular region in response to a size of the rectangular sub-region being less than or equal to a predetermined threshold size, defining one of the non-terminal rectangular sub-regions as the current rectangular region and repeating the above until all rectangular regions are tagged terminal, and determining color characteristics for each of the terminal rectangular regions.

Abstract: Image descriptor quantization technique embodiments are presented which quantize an image descriptor defined by a vector of number elements. This is generally accomplished by lowering the number of bits per number element to a prescribed degree. The resulting quantized image descriptor exhibits minimal loss of matching reliability while at the same time reducing the amount of storage space needed to store the descriptor in a database. Lowering the number of bits per number element also allows for increased matching speed.

Abstract: The present invention discloses a method for compressing and decompressing pixel data and the device thereof. The method comprises receiving current pixel data from a preprocessor and comparing the current pixel data with predictor pixel data to obtain a section index from a quantization table. Output the section index to a memory as compressed data. Then, receive the compressed data from the memory. Use the quantization table to look up a representative level corresponding to the compressed data and output decompressed pixel data based on the representative level to an image processing unit. The device mentioned above comprises a memory, a compressor and a decompressor. The memory stores compressed data. The compressor quantizes and compresses pixel data and outputs the compressed pixel data to the memory. The decompressor receives the compressed pixel data and decompresses the compressed pixel data and outputs the decompressed pixel data as pixel data.

Abstract: This invention relates to a method, a device and a software application product for N-level quantization of vectors, wherein N is selectable prior to said quantization from a set of at least two pre-defined values that are smaller than or equal to a pre-defined maximum number of levels M. A reproduction vector for each vector is selected from an N-level codebook of N reproduction vectors that are, for each N in said set of at least two pre-defined values, represented by the first N reproduction vectors of the same joint codebook of M reproduction vectors. The invention further relates to a method, a device and a software application product for retrieving reproduction vectors for vectors that have been N-level quantized, to a system for transferring representations of vectors, to a method, a device and a software application product for determining a joint codebook, and to such a joint codebook itself.

Abstract: Systems and methods for information compression. In a first method embodiment, a computer implemented method for compressing information includes finding a closest match entry of a dictionary to a data block, the dictionary stored in computer usable media. A logical exclusive OR combination of the closest match entry and the data block is performed to form a spatial difference vector identifying locations wherein the data block differs from the closest match entry. An information difference vector comprising differences between the data block and the closest match entry is formed. A compressed data block comprising the spatial difference vector, the information difference vector and a reference to the closest match entry is produced. The compressed data block is characterized as being smaller than the data block.

Abstract: A vector quantizer includes a lattice quantizer (10) approximating a vector x by a lattice vector belonging to a lattice ?0. A lattice vector decomposer (14) connected to the lattice quantizer successively decomposes the lattice vector into a sequence of quotient vectors y, and a sequence of remainder vectors ri on successive lattices ?l?1, by lattice division with a corresponding predetermined sequence of integers pi?2, where i=1 . . . k and k is a positive integer representing the number of elements in each sequence.

Abstract: Regions within a scanned document are labeled according to content. These labeled regions allow for particular enhancement and sharpening methods to be applied. The labeled regions may be further leveraged in subsequent rendering of the scanned document on a printer or other output device and/or in storing the scanned document.

Abstract: Disclosed are methods and apparatus for accomplishing the fetching or sampling of channels of pixels or texels such as neighboring pixels or texels or non-neighboring pixels or texels in a simultaneous operation in order to achieve optimization of the performance of a texture pipeline. In particular, logic is disclosed including selector logic configured to retrieve data including a plurality of channels from each of a plurality of pixels or texels and operable to select one channel from the plurality of channels of the data from each of the pixels or texels. The logic also includes combination logic configured to combine two or more of the selected channels into a single vector, such as an RGBA vector representing the color.

Abstract: The present invention relates to an image processing technique, and in particular to a method for restoring a compressed image by using a hybrid motion compensation discrete cosine transform (hybrid MC/DCT) mechanism, including: a step of defining a smoothing functional having a smoothing degree of an image and reliability for an original image by pixels having an identical property in image block units; and a step of computing a restored image by performing a gradient operation on the smoothing functional in regard to the original image, thereby preventing the blocking artifacts and the ringing effects in regard to the pixels having an identical property in image blocks. In one embodiment, the method includes obtaining a pixel value in a current block and at least one adjacent pixel value. A type of the current block is one of an intra-coded type and inter-coded type. A smoothing value of the current block is determined based on the obtained pixel value in the current block and the adjacent pixel value.