Abstract: Some embodiments facilitate encoding/decoding of a frame by organizing frame data in a storage structure in a novel manner. Specifically, in a portion of the storage structure allocated for a frame slice, used partition entries are stored in a first section of the allocated portion and unused partition entries are stored in a second section of the allocated portion, the first and second sections each comprising a continuous area of storage in the storage structure so that used partition entries are not interspersed with nonused partition entries. In some embodiments, additional data useful in the encoding or decoding of video data is determined and stored into the unused bytes of used partition entries (such as macroblock header data or canonical reference frame index data). In some embodiments, two or more identical partitions of a macroblock are coalesced into a single partition.

Abstract: A method of video coding/decoding that includes transforming to/from transform coefficients and residual pixel data in moving pictures by a set of vectors. Two alternative vector sets are disclosed both providing an optimal balance between good performance and simplified computation.

Abstract: Provided is a method and apparatus for controlling a bit-rates in which an amount of generated bits is adjusted according to the complexity of each frame, and a bit-rate within a frame can be further effectively adjusted by applying different quantization parameter (QP) values to respective macro blocks. In the apparatus for controlling a bit-rate, a motion compensated temporal filtering (MCTP) operation is performed for each group of pictures (GOP) in an input scalable layer, and thereafter bits are allocated to respective frames in consideration of frame type and frame complexity. Furthermore, a QP is adaptively determined in the unit of a macro block on the basis of the allocated bits.

Abstract: A signal processing system adapted for sparse representation of signals is provided, comprising: (i) one or more training signals; (ii) a dictionary containing signal-atoms; (iii) a representation of each training signal using a linear combination of said dictionary's signal-atoms; (iv) means for updating the representation of the training signal; (v) means for updating the dictionary one group of atoms at a time, wherein each atom update may include all representations referring to said updated atom; and (vi) means for iterating (iv) and (v) until a stopping rule is fulfilled. The system uses the K-SVD algorithm for designing dictionaries for sparse representation of signals.

Abstract: 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.

Abstract: An image reading apparatus has an image sensor in which a plurality of sensor arrays for reading a document image are connected into a line, and parallel-output image data. In the image reading apparatus, of image data output from each sensor array, image data of a pixel at one end and image data of the remaining pixels are compressed by different compression methods. The compressed data of one line are decompressed by a set method at the timing when the number of pixels reaches a preset number of pixels.

Abstract: Respective codewords of quantization codebooks corresponding to a number of data streams are selected based on channel information estimated by a received training symbol. A stream mode is selected among stream modes to determine a modulation method applied to each data stream. The data stream is detected by using the codeword corresponding to the quantization codebook of the data stream corresponding to the selected stream mode as a precode matrix, and the detected data stream is modulated. In this case, a receiving apparatus performs a feedback operation so that indexes of the selected stream mode and the codeword used as the precode matrix may be transmitted to the transmitting apparatus. The transmitting apparatus selects the number of transmitted data streams and the modulation method based on the transmitted index of feedback streams by the feedback operation.

Abstract: A system and method for decoding a digital video data stream. In one aspect, a plurality of hardware acceleration modules are used together with a core processor. The accelerators operate in a decoding pipeline wherein, in any given stage, each accelerator operates on a particular macroblock of video data. In the subsequent pipeline stage, each accelerator works on the next macroblock in the data stream, which was worked on by another one of the accelerators in the previous stage. The core processor polls all of the accelerators during each stage. When all accelerators finish their tasks for a given stage, the core processor initiates the next stage. In another aspect, two variable-length decoders are employed to simultaneously decode two macroblock rows of a video frame. Each variable-length decoder works to decode an assigned row and the rows are variable-length decoded in parallel.

Abstract: A residual picture is produced and encoded that is a residual picture that is a residual signal between a picture to be coded that is an input moving-picture video signal to be subjected to coding and a predictive picture produced from a reference picture that is a local decoded video signal for each of a plurality of rectangular zones, each composed of a specific number of pixels, into which a video area of the moving-picture video signal is divided. A boundary condition of each of a plurality of borders is obtained between the rectangular zones and another plurality of rectangular zones adjacent to the rectangular zones, and a border, of the reference picture, having a boundary condition that matches the boundary condition, is found by motion-vector search in the reference picture, and border motion-vector data is generated that is data on a motion vector from a border of the rectangular zone in the picture to be coded to the border of the reference picture thus found.

Abstract: A wavelet pyramid-based still-image and video compression apparatus uses line-vectors, context-dependent quantization thresholds, hierarchical tree-structured displacement coding, synchronous prediction, and conditional zerotree branch updates to improve intra- and inter-frame coding speed and efficiency, and to improve video stream noise resilience. The disclosed intra-frame coding methods can be used to improve the coding efficiency of wavelet-based still-image compression algorithms.

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: Embodiments of the present invention comprise systems and methods for managing and combining data contained in layers in a multilayer bitstream such that one or more transform coefficients in a first layer are used to modify one or more coefficients in a second layers that in turn is reconstructed using the modified one or more coefficients.

Abstract: The disclosure relates to a method for treating digital data, including a quantification step of calculating, in a space of dimension d, at least one vector index I1 for at least some of the vectors 1, the vectors 1 forming input data descriptors. The method is characterised in that the vector index I1 corresponds to the number of vectors preceding the vector 1 in the reverse lexicographic order, without involving a step of determining all of the vectors.

Abstract: The system carries out conversion of digital video signals organized in blocks of pixels from a first format to a second format. The second format is a format compressed via vector quantization. The vector quantization is performed by means of repeated application of a scalar quantizer to the pixels of said blocks with a quantization step (Q) determined in an adaptive way according to the characteristics of sharpness and/or brightness of the pixels and representing said vector quantization in a n-dimensional space indicative of the characteristics on n of said pixels in the block partitioned into cells of size proportional to said quantization step, each cell being assigned to an appropriate binary code, wherein said process further includes identifying at least one symmetry element in said n-dimensional space suitable for separating at least two symmetrical set of cells, and selecting one of said at least two symmetrical set of cells for the assignment of said binary codes.

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: A decoding apparatus includes a random number generating section and a decoding section. The random number generating section generates random numbers according to distribution of original data corresponding to respective quantization indexes. The decoding section generates decoded data on a basis of the random numbers generated by the random number generating section.

Abstract: A decoding apparatus includes a classification section, a distribution-information generation section and an inverse-quantization-value generation section. The classification section classifies quantization indices contained in input code data into a plurality of groups. The distribution-information generation section generates distribution information of the quantization indices for each group, based on the quantization indices classified by the classification section. The inverse-quantization-value generation section generates inverse quantization values, which correspond to the respective quantization indices, based on the distribution information generated by the distribution-information generation section.

Abstract: To provide a code amount estimating device which can perform, at high speed and with high precision, estimation of code amount obtained after arithmetic coding. The code amount estimating device includes a context index calculation unit which calculates a context index of a binary symbol included in binary data, and an estimate code amount calculation unit which calculates an estimate code amount for the binary data based on symbol occurrence probability information stored in association with the calculated context index and on a held probability interval range. The estimate code amount calculation unit estimates the code amount for the binary data according to code amount information indicating an association between (i) a combination of a binary symbol string including one or more binary symbols, symbol occurrence probability information, and a probability interval range and (ii) an estimate code amount for the binary symbol string.

Abstract: There is provided an image data compression apparatus capable of effectively suppressing an image data volume after compression processing. A bit rate value is detected according to the image data volume after the compression processing. According to the bit rate size value detected, a quantization step size value used in the compression processing is modified. According to the quantization step size value, a skip frame number is set and a frame skip of the image data before or after the compression processing is performed according to the number of frame skip frames which has been set.

Abstract: An apparatus configured to: generate a first quantized signal by applying a lattice quantization to an encoded signal; determine at least one parameter of the first quantized signal; and encode the at least one parameter of the first quantized signal.

Abstract: The present invention provides methods implemented in a base station having a plurality of antennas and one or more user terminals. One embodiment of the method includes receiving feedback from at least one user in response to transmitting a first frame to said at least one user. The first frame is formed by pre-coding at least one symbol using at least one first code word selected from at least one first code book associated with the at least one user. The method also includes transmitting at least one second frame to the user(s). The second frame(s) are pre-coded using at least one second codeword selected from at least one second codebook. The second codebook(s) determined based on the feedback and the first codeword(s).

Abstract: In encoding input image data including first and second images, the first image is divided into blocks. A second block corresponding to a first block that is one of the blocks is detected from the second image. Pixels forming the first and second blocks are sorted in order according to pixel values. Block difference data indicating the amount of change in the pixel values of the sorted pixels between the first and second blocks is determined and encoded. In decoding, block information identifying the second block, sort-order information indicating the sorted pixels forming the first block, and the encoded block difference data are obtained. The encoded block difference data is decoded. The decoded block difference data and the second block identified by the block information are used to generate pixel values of the first block. The generated pixel values are reverse-sorted according to the sort-order information.

Abstract: A shot-based video content analysis method and system is described for providing automatic recognition of logical story units (LSUs). The method employs vector quantization (VQ) to represent the visual content of a shot, following which a shot clustering algorithm is employed together with automatic determination of merging and splitting events. The method provides an automated way of performing the time-consuming and laborious process of organising and indexing increasingly large video databases such that they can be easily browsed and searched using natural query structures.

Abstract: Provided are, among other things, systems, methods and techniques for decoding an audio signal from a frame-based bit stream. Each frame includes processing information pertaining to the frame and entropy-encoded quantization indexes representing audio data within the frame. The processing information includes: (i) code book indexes, (ii) code book application information specifying ranges of entropy-encoded quantization indexes to which the code books are to be applied, and (iii) window information. The entropy-encoded quantization indexes are decoded by applying the identified code books to the corresponding ranges of entropy-encoded quantization indexes. Subband samples are then generated by dequantizing the decoded quantization indexes, and a sequence of different window functions that were applied within a single frame of the audio data is identified based on the window information.

Abstract: A decoder receives an entry point header comprising plural control parameters for an entry point segment corresponding to the entry point header. The entry point header is in an entry point layer of a bitstream comprising plural layers. The decoder decodes the entry point header. The plural control parameters can include various combinations of control parameters such as a pan scan on/off parameter, a reference frame distance on/off parameter, a loop filtering on/off parameter, a fast chroma motion compensation on/off parameter, an extended range motion vector on/off parameter, a variable sized transform on/off parameter, an overlapped transform on/off parameter, a quantization decision parameter, and an extended differential motion vector coding on/off parameter, a broken link parameter, a closed entry parameter, one or more coded picture size parameters, one or more range mapping parameters, a hypothetical reference decoder buffer parameter, and/or other parameter(s).

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: Efficient search window storage schemes for motion estimation in video signal processing are disclosed. According to one embodiment, motion estimation is carried out as follows: allocating a ring buffer to store at least critical number of macro-blocks of luminance data from a reference frame on the motion estimator, establishing a rule to relate each storage unit of the ring buffer with each of the macro-blocks of the reference frame, initializing the ring buffer by reading in one less than the critical number of macro-blocks from the reference frame, when the macro-block is located next to a border of the reference frame, generating one or more added border macro-blocks and storing into the corresponding position of the ring buffer in accordance with the rule, constructing the search window from the macro-blocks stored in the ring buffer, and conducting motion estimation of the current macro-block of the current frame with the search window.

Abstract: Some embodiments facilitate encoding/decoding of a frame by organizing frame data in a storage structure in a novel manner. Specifically, in a portion of the storage structure allocated for a frame slice, used partition entries are stored in a first section of the allocated portion and unused partition entries are stored in a second section of the allocated portion, the first and second sections each comprising a continuous area of storage in the storage structure so that used partition entries are not interspersed with nonused partition entries. In some embodiments, additional data useful in the encoding or decoding of video data is determined and stored into the unused bytes of used partition entries (such as macroblock header data or canonical reference frame index data). In some embodiments, two or more identical partitions of a macroblock are coalesced into a single partition.

Abstract: An image coding apparatus includes a first coding unit that discretely selects quantization parameters of a first range to perform calculation of generated code amounts corresponding to the selected quantization parameters, a second coding unit that performs calculation of generated code amounts corresponding to quantization parameters of a second range, a code amount control unit that decides deciding a temporary quantization parameter corresponding to a target code amount by calculating generated code amounts through an interpolation process for quantization parameters not selected by the first coding unit, and by comparing the generated code amounts corresponding to the selected quantization parameters and the generated code amounts calculated through the interpolation process with the target code amount, and decides an optimal quantization parameter corresponding to the target code amount by comparing the generated code amounts calculated by the second coding unit with the target code amount.

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 encoding method includes generating a predictive signal and encoding mode information according to each encoding mode from a macroblock signal corresponding to each macroblock, selecting a quantization code table corresponding to each macroblock, generating a predictive error signal for each encoding mode based on the macroblock signal and the predictive signal, subjecting the predictive error signal to orthogonal transformation, quantizing the orthogonal-transformed predictive error signal while changing a quantization parameter for every plural sub-pixel-blocks, using the quantization code table corresponding to the macroblock, encoding quantization transformation coefficient, calculating an encoding cost, selecting one encoding mode based on the encoding cost, selecting one quantization code table based on the encoding cost, and encoding information of an index indicating the selected quantization code table for every frame of the input image signal or every region of the frame.

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: A content presentation system comprising content playing apparatus and content providing apparatus operative to receive an array of digitally represented numbers, representing content as P points in D-dimensional space, to generate therefrom a plurality of projections on at least one sub-space of a vector space comprising a span of at least one D-dimensional vector, and to provide the plurality of projections to the content playing apparatus, the content playing apparatus being operative to reconstruct the array of digitally represented numbers from the plurality of projections and to expose human users to content accordingly.

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 compression and decompression method encodes and decodes pixel data based on a color conversion method. Based on the relationships of corresponding color components of two adjacent pixels, the corresponding color components are encoded either by a white and black modification, a down-sampling or an edge modification. Based on the relationships of encoded color components of the two adjacent pixels, the corresponding encoded color components are decoded either by an inverse white and black modification, an up-sampling or an inverse edge modification.

Abstract: A vector coding apparatus includes a decomposing unit to obtain a sign vector and an initial absolute vector, a sign coding unit to code the sign to obtain a sign code, a multi-level permutation-based coding unit to perform multi-level permutation-based coding to obtain an absolute vector code, a combining unit to combine the sign and absolute vector codes to obtain an initial vector code. A vector decoding apparatus includes a decomposing unit to decompose a code of an initial vector to obtain a sign code and an absolute vector code, a sign decoding unit to decode the sign code to obtain a sign vector, a multi-level permutation-based decoding unit to perform multi-level permutation-based decoding on the absolute vector code to obtain an initial absolute vector, and a combining unit to combine the sign and initial absolute vectors to obtain an initial vector. A media player includes the vector decoding apparatus.

Abstract: A vector coding apparatus and method includes decomposing an initial vector to obtain a sign vector and an initial absolute vector. Coding the sign vector to obtain a sign code, performing multi-level permutation-based coding on the initial absolute vector to obtain an absolute vector code, and combining the sign code and the absolute vector code. Optionally determining, before decomposing the initial vector, a characteristic codebook to which the initial vector belongs, obtaining a characteristic value of the characteristic codebook, and combining a code of the initial vector to obtain a final code of the initial vector. The performing step can include removing from the initial absolute vector any element having a value which satisfies a preset condition, constructing a new absolute vector with elements not satisfying the preset condition, and coding positions of the elements not satisfying the preset condition in the initial absolute vector to obtain a position code.

Abstract: A vector decoding method includes decomposing a code of an initial vector to obtain a sign code and an absolute vector code, decoding the sign code to obtain a sign vector, performing multi-level permutation-based decoding on the absolute vector code to obtain an initial absolute vector, and combining the sign vector and the initial absolute vector to obtain an initial vector, wherein each respective vector ha a plurality of elements. A vector decoding apparatus includes a decomposing unit configured to decompose a vector code to obtain a sign code and an absolute vector, a sign decoding unit configured to decode the sign code to obtain a sign vector, a multi-level permutation-based decoding unit configured to perform multi-level permutation-based decoding on the absolute vector to obtain an initial absolute vector, and a combining unit configured to combine the sign vector and the initial absolute vector to obtain an initial vector.

Abstract: A method and apparatus for representing motion in a sequence of digitized images derives a dense motion vector field and vector quantizes the motion vector field.

Abstract: A low bit rate digital audio coding system includes an encoder which assigns codebooks to groups of quantization indexes based on their local properties resulting in codebook application ranges that are independent of block quantization boundaries. The invention also incorporates a resolution filter bank, or a tri-mode resolution filter bank, which is selectively switchable between high and low frequency resolution modes or high, low and intermediate modes such as when detecting transient in a frame. The result is a multichannel audio signal having a significantly lower bit rate for efficient transmission or storage. The decoder is essentially an inverse of the structure and methods of the encoder, and results in a reproduced audio signal that cannot be audibly distinguished from the original signal.

Abstract: An audio signal encoding apparatus includes a frame dividing unit (1), an auditory psychological arithmetic unit (2), a filter bank unit (3), a scale factor calculation unit (4) which weights the spectra in the respective frequency bands by an arithmetic result of the auditory psychological arithmetic unit (2), a quantization step determination unit (7) which determines a quantization step of the entire frame prior to spectrum quantization by subtracting an information size of all quantized spectra from an auditory information size of all the weighted spectra before quantization, and multiplying the difference by a coefficient obtained from a step width of a quantization coarseness, a spectrum quantization unit (8), and a bit shaping unit (9) which outputs a bitstream obtained by shaping quantized spectra. The quantization step determination unit predicts the information size of all the quantized spectra based on a bit size assigned to a frame to be encoded.

Abstract: An image compression and decompression method encodes and decodes pixel data based on a color conversion method. Base on the relationships of corresponding color components of two adjacent pixels, the corresponding color components are encoded either by a white and black modification, a down-sampling or an edge modification. Based on the relationships of encoded color components of the two adjacent pixels, the corresponding encoded color components are decoded either by an inverse white and black modification, an up-sampling or an inverse edge modification.

Abstract: A decoder decodes skipped macroblocks of an interlaced frame. Skipped macroblocks use exactly one motion vector and have no motion vector differential information, and lack residual information. The skipped macroblock signal indicates one-motion-vector coding. The skipped macroblock signal can be a compressed bitplane (in a selected bitplane coding mode) sent at frame layer in a bitstream, or an individual bit sent at macroblock layer. In another aspect, an encoder jointly encodes motion compensation type and field/frame coding type for a macroblock in an interlaced P-frame. The encoder also can jointly encode other information for the macroblock (e.g., the presence of a differential motion vector). A decoder decodes a joint code (e.g., a variable length code in a variable length code table) to obtain both motion compensation type and field/frame coding type (and potentially other information) for the macroblock.

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: A resource allocation of multiple compressed AV streams delivered over the Internet is disclosed that achieves end-to-end optimal quality through a multimedia streaming TCP-friendly transport (MSTFP) protocol that adaptively estimates the network bandwidth while smoothing the sending rate. Resources allocated dynamically according to a media encoding distortion and network degradation algorithm. A scheme is also disclosed for dynamically estimating the available network bandwidth for streaming of objects, such as MPEG4 multiple video objects, in conjunction with the MSTFP protocol. The scheme can account for packet-loss rates to minimize end-to-end distortion for media delivery.

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: 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.

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, obtaining a difference value between the pixel value in the current block and the adjacent pixel value, and obtaining a smoothing value of the current image based on the difference value.

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 according to a smoothing direction, and obtaining a smoothing value of the current image based on the obtained pixel value in the current block and the adjacent pixel value according to the smoothing direction.

Abstract: This invention relates to the creation of dictionary functions for the encoding of video signals using matching pursuit compression techniques. After an initial set of reference dictionary images is chosen, training video sequences are selected, and motion residuals are calculated. High energy portions of the residual images are extracted and stored when they match selection criteria with the reference dictionary. An energy threshold is used to limit the number of video signal “atoms” encoded for each frame, thus avoiding the encoding of noise. A new dictionary is then synthesized from the stored portions of the image residuals and the original reference dictionary. The process can then be repeated using the synthesized dictionary as the new reference dictionary. This achieves low bit rate signals with a higher signal-to-noise ratio than have been previously achieved.