Abstract: An image signal processing device 1 comprises an encoding part 10, a delay part 20, a difference calculation part 30, a decoding part 40, a quantization error determination part 50 and a corrected image data output part 60.

Abstract: A sequence of n coefficients is compressed by determining a cost-determined sequence of n coefficient indices represented by a cost-determined sequence of (run, index derivative) pairs under a given quantization table and run-index derivative coding distribution, wherein each sequence of (run, index derivative) pairs defines a corresponding sequence of coefficient indices such that (i) each index in the corresponding sequence of coefficient indices is a digital number, (ii) the corresponding sequence of coefficient indices includes a plurality of values including a special value, and (iii) each (run, index derivative) pair defines a run value representing a number of consecutive indices of the special value, and an index-based value derived from a value of the index following the number of consecutive indices of the special value.

Abstract: Method determining lookup table (“LUT”) for embedding watermark. For each quantization cell, calculating probabilities that signal point falls into cell. Selecting cell by probabilities. Setting LUT value to watermark value with largest probability, subject to run constraint. For remaining cells, repeating selecting and setting steps. Other method determining quantization ensemble by calculating probability density function for signal points where the watermark value to be embedded. Distortion and robustness functions are formulated. Given robustness or distortion is selected. Functions optimized, and ensemble of quantizers determined with parameters that comply. Other method quantizing in association with lossy compression. Strength of compression determined. Adapting strength of watermark with strength of compression by a mapping. Other method selecting points for embedding watermark. Determine threshold between large and small signal points using statistical method.

Abstract: The present invention enables a circuit configuration to be simplified. An image encoding device (100) receives an input image (91) that is line-scanned in units of MBs as scan blocks, each constituted by a plurality of 4×4 blocks, while being scanned in units of 4×4 blocks as encoding blocks, each constituted by a plurality of pixels. The image encoding device (100) selects a VLC (variable length) table corresponding to a table selection index nC, which is an average value of the numbers nB and nA of nonzero coefficients as encoding values on which variable-length encoding is performed in upper-adjoining and left-adjoining 4×4 blocks of a 4×4 block as an encoding target in quantization coefficients as encoding target data based on the input image (91).

Abstract: An image processing apparatus includes a partitions setting unit that sets up image partitions into which an input image is separated; a tone number setting unit that sets the number of tones for each of the image partitions set up by the partitions setting unit, based on gray levels of pixels included in each of the image partitions; and a conversion unit that converts each of the image partitions of the input image into an image partition represented with tones equal to or less than the number of tones set by the tone number setting unit.

Abstract: First and second codewords are determined, based on first feature vector components of the image elements in an image block, as representations of a first and second component value. Third and fourth codewords are determined, based on second vector components, as representations of a third and fourth component value. First N1 and second N2 resolution numbers are selected based on the relation of a distribution of the first vector components and a distribution of the second vector components. N1 additional component values are generated based on the first and second component values and N2 additional component values are generated based on the third and fourth component values. Component indices indicative of the generated component values are then provided for the different image elements.

Abstract: An image processing apparatus includes image processors and a margin storing buffer. The image processors read an input image data from a frame memory for each image data of a plurality of block lines each having a first number of pixels along the columns and a second number of pixels along the rows. The margin storing buffer stores the image data of the margin portion used also in the image processing of the image data of the next block line, among the image data of the present block line input to each of the image processors. Each of the image processors performs the image processing on an image data including the image data of the present block line and the image data of the margin portion, at the time of image processing on the image data of the next block line.

Abstract: Examples of the present invention provide a method and device for image compression coding. The method includes: obtaining a designated area selected from an image at a decoding side; determining quantization coefficients of the image to make an image compression ratio of the designated area lower than image compression ratios of areas in the image other than the designated area; and performing a compression coding on the image using the determined quantization coefficients of the image. By using the present invention, a video communication system may support a user to select an interested area in a video image, and clearly transmit the interested area selected by the user.

Abstract: A sequence of n coefficients is compressed by determining a cost-determined sequence of n coefficient indices represented by a cost-determined sequence of (run, index derivative) pairs under a given quantization table and run-index derivative coding distribution, wherein each sequence of (run, index derivative) pairs defines a corresponding sequence of coefficient indices such that (i) each index in the corresponding sequence of coefficient indices is a digital number, (ii) the corresponding sequence of coefficient indices includes a plurality of values including a special value, and (iii) each (run, index derivative) pair defines a run value representing a number of consecutive indices of the special value, and an index-based value derived from a value of the index following the number of consecutive indices of the special value.

Abstract: An image processor that achieves reduction in delay amount, in comparison with code amount control GOP by GOP or frame by frame, is obtained.

Abstract: An image coding method for run-length coding (RLC), including quantizing a coefficient string representing a plurality of pixel values to generate a first quantization coefficient string, determining a cutoff quantization coefficient in the first quantization coefficient string, discarding a part of quantization coefficients of the first quantization coefficient string according to the cutoff quantization coefficient, and forming remaining quantization coefficients of the first quantization coefficient string as a second quantization coefficient string, and performing image coding to the second quantization coefficient string with the RLC.

Abstract: Embodiments of the present invention include systems and methods for processing and coding image data. In one embodiment, image data is coded using a first image coding process. If a bit rate constraint is satisfied, the image data is output. If the bit rate constraint is not satisfied, the image data is coded using a second different coding process. In one embodiment, the second coding process is a layered coding process. In another embodiment, if the constraint is satisfied, quantization data may be included in the output, and may be coded using layered coding. Variable length coding processes and hardware implementations are further disclosed for efficient image processing.

Abstract: Where a quantized data value is produced by a first quantization of an input data value, followed by a first inverse quantization and subsequently by a second quantization and the first quantization has first quantization intervals and the second quantization has second quantization intervals, third quantization intervals are generated by displacing interval boundaries of the second quantization intervals, respectively, to the next interval boundaries of the first quantization intervals. A third reconstruction value is determined for the third quantization intervals such that the third reconstruction value lies within the associated third quantization intervals. A corrected data value is generated by a third inverse quantization of the quantized data value and the third inverse quantization is affirmed by the third quantization intervals containing the associated third reconstruction value.

Abstract: In order to set a quantization step according to a target amount of code with high precision, a coefficient set according to the resolution of a moving picture to be encoded and the encoding method of a frame to be encoded is selected from a plurality of coefficient sets corresponding to the resolutions of moving pictures and encoding methods of frames. A feature amount of the frame to be encoded is extracted, and when the frame to be encoded undergoes inter-frame coding, a function indicating the relationship between a quantization step and amount of generated data is generated based on the selected coefficient set and feature amount. When the function is generated, a quantization step according to a target amount of code is set based on that function in encoding of the frame to be encoded.

Abstract: A Method And Apparatus For Control of Rate-Distortion Tradeoff by Mode Selection in Video Encoders is Disclosed. The system of the present invention first selects a distortion value D near a desired distortion value. Next, the system determines a quantizer value Q using the selected distortion value D. The system then calculates a Lagrange multiplier lambda using the quantizer value Q. Using the selected Lagrange multiplier lambda and quantizer value Q, the system begins encoding pixelblocks. If the system detects a potential buffer overflow, then the system will increase the Lagrange multiplier lambda. If the Lagrange multiplier lambda exceeds a maximum lambda threshold then the system will increase the quantizer value Q. If the system detects a potential buffer underflow, then the system will decrease the Lagrange multiplier lambda. If the Lagrange multiplier lambda falls below a minimum lambda threshold then the system will decrease the quantizer value Q.

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: Disclosed herein is an image processing apparatus including: a screen processor for determining each pixel value of a screen processing application unit region composed of a plurality of pixels to which a threshold matrix is applied, in an inputted image; and for carrying out a screen processing by applying one threshold matrix among a plurality of threshold matrices in which applied positions of the threshold values are different from each other, to the plurality of pixels in the screen processing application unit region based on each determined pixel value.

Abstract: An example embodiment provides a method, comprising: storing pre-calculated quantisation error data relating to a data quantisation process; receiving data to be quantised; quantising the data to reduce the number of significant bits thereof; and determining a quantisation error for the quantised data from the pre-calculated quantisation error data.

Abstract: An image decoding method is for decoding a bit stream in an image decoding apparatus. The method includes receiving the bit stream and a weight parameter that is added to a luma quantization parameter by an addition operation. The method also includes decoding, in a decoding unit in the image decoding apparatus, the bit stream and generating a chroma component of quantized coefficients. In addition, the method includes performing, in a dequantization unit in the image decoding apparatus, dequantization on the chroma component of quantized coefficients using the chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by the weight parameter.

Abstract: A method and apparatus for processing an image are provided that can suppress blur edges at an edge portion of a character so that sharpness and quality of the image can be improved. The apparatus comprises an inside and outside edge discrimination portion for discriminating whether a target pixel to be processed belongs to an inside edge or to an outside edge, a threshold value generating portion for selecting a threshold value from plural threshold values for error diffusion process in accordance with an area discriminated by the inside and outside edge discrimination portion to output the selected threshold value and an error diffusion process portion for performing the error diffusion process for multilevel input data concerning the target pixel by utilizing the threshold value generated by the threshold value generating portion so as to produce output data whose gradation steps are reduced.

Abstract: A method and system generates and compares fingerprints for videos in a video library. The video fingerprints provide a compact representation of the spatial and sequential characteristics of the video that can be used to quickly and efficiently identify video content. Because the fingerprints are based on spatial and sequential characteristics rather than exact bit sequences, visual content of videos can be effectively compared even when there are small differences between the videos in compression factors, source resolutions, start and stop times, frame rates, and so on. Comparison of video fingerprints can be used, for example, to search for and remove copyright protected videos from a video library. Further, duplicate videos can be detected and discarded in order to preserve storage space.

Abstract: In an image conversion method, a value which reflects the mutual relationship between the classes of pixel patterns each formed from a pixel classified as one of a plurality of classes and peripheral pixels is set as a converted value corresponding to each of the plurality of classes, a pixel of interest is sequentially selected from the input image, and a pixel pattern formed from the selected pixel of interest and a predetermined number of pixels around it is classified as one of the plurality of classes in accordance with a neighboring pattern obtained based on the relationship between the value of the pixel of interest and the values of peripheral pixels located at predetermined relative positions with respect to the pixel of interest. The value of the pixel of interest is converted into a converted value set for a class to which the pixel of interest has been classified.

Abstract: Provided is an apparatus and a method for inserting additional data into an image file in an electronic device. According to the method, when an event of inserting additional data into the image file occurs, an identification code representing insertion of additional data is recorded in a corresponding header within the image file, and the additional data is added to an end portion of the image file.

Abstract: A decoding apparatus includes a standard predicted image generating unit which generates a standard decoded image and a standard predicted image of standard image quality; a non-standard decoded image generating unit which generates a non-standard decoded image different in image quality based on a prediction error information; a non-standard predicted image generating unit which generates a non-standard predicted image different in image quality based on the non-standard decoded image; and a correction value calculating unit which calculates correction values corresponding to differences between the standard and non-standard predicted images. The non-standard decoded image generating unit includes a predicted image reconstructing unit which corrects the non-standard predicted image, and a decoding unit which inverse-quantizes the prediction error information and adds the inverse-quantized prediction error information and the corrected non-standard predicted image to generate the non-standard decoded image.

Abstract: An information retrieval apparatus includes an obtaining unit configured to obtain dynamic ranges or re-quantization codes of a target object to be retrieved and dynamic ranges or re-quantization codes of each of comparison objects to be compared with the target object, the dynamic ranges or re-quantization codes of the target object and the dynamic ranges or re-quantization codes of the comparison objects being obtained as a result of adaptive dynamic range coding; a distance computation unit configured to compute distances between the target object and the comparison objects using the obtained dynamic ranges or re-quantization codes of the target object and the obtained dynamic ranges or re-quantization codes of the comparison objects; and a comparison unit configured to compare the distances between the target object and the comparison objects to select one of the comparison objects having a minimum distance.

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

Abstract: Searching an optimal quantization step size at high speed when controlling the coding rate of an image sequence. A skip binary search section determines quantization step size ?skip by binary search, using a frame out of every m [0] frames of an image sequence. A quantization step size correcting section determines quantization step size ?a that can achieve the target bit rate R by linear approximation from ?skip, generated bit rate at that time, quantization step size ?last of the immediately preceding loop and the generated bit rate at that time. A first coding section encodes the every m [1]-th frame of the image sequence with quantization step size ?a and a quantization step size forecasting section determines quantization step size ?e that can achieve the target bit rate R by linear approximation. A second coding section encodes all the frames with the quantization step size ?e.

Abstract: A method, system and computer program product for optimal encoding for an image defined by image data. The quantization table, run-length coding and Huffman codebook are selected to minimize a Lagrangian cost function, wherein the minimization includes iteratively determining the optimal run-size pairs and in-category indices for minimizing a rate-distortion cost function, and wherein the rate-distortion cost function includes a perceptual weighting factor applied to a quantization error. The perceptual weighting factor adjusts the rate-distortion cost function to apply greater weight to lower frequency quantization error than to higher frequency quantization error.

Abstract: A wavelet transform unit performs a wavelet transform on original images and a quantization unit quantizes wavelet transform coefficients. A ROI selector selects a region of interest or regions of interest in the original image, and a ROI mask generator generates ROI masks with which the wavelet transform coefficients (which are also called ROI transform coefficients) corresponding to the regions of interest are specified. By referring to the ROI masks, a lower-bit zero substitution unit substitutes low-order bits of non-ROI transform coefficients with zeros. An entropy coding unit entropy-codes the wavelet transform coefficients sequentially from high-order bit-planes, after the substitution. A coded data generator turns coded data into streams together with parameters and then outputs coded images.

Abstract: A method for encoding an image is disclosed. The method generally includes the steps, of (A) generating a quantization matrix as a function of at least four parameters, (B) optimizing the parameters to maximize a quality metric for encoding the image and (C) encoding the image with the quantization matrix as optimized.

Abstract: An image printing system which determines dot forming condition when printing an image containing a plurality of pixels by using dots of a plurality of sizes includes: a fine drawing detecting unit which detects a dot color fine drawing pixel having a dot color used for printing the image and positioned on a fine drawing portion having a drawing width equal to or smaller than a predetermined value; an edge area detecting unit which detects a dot color edge area pixel having a dot color used for printing the image and positioned at a distance equal to or shorter than a predetermined value from an edge of the image; a first dot allocating unit which allocates dots such that a dot of predetermined size in the dots of the plural sizes can be formed for the dot color fine drawing pixel during printing the image; and a second dot allocating unit which allocates dots such that a dot of a size determined according to the distance from the edge of the image in the dots of the plural sizes can be formed for the dot col

Abstract: An image processor includes a frequency transform unit performing frequency transform independently on a luminance signal and plural chrominance signals and outputting an item of frequency data of the luminance signal and plural items of frequency data of the chrominance signals, and a quantization unit performing quantization independently on plural items of frequency data inputted from the frequency transform unit. The quantization unit performs quantization on one or plural specific items of frequency data corresponding to a signal with noise among the frequency data of the luminance signal and the chrominance signals, employing a quantization coefficient having a value greater than “1”, and performs quantization on frequency data apart from the specific items of frequency data, employing a quantization coefficient having a value “1”.

Abstract: An image encoding method for encoding an image in an image encoding apparatus. The encoding process includes performing, in a quantization unit in the image encoding apparatus, quantization on a chroma component of transform coefficients using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by an addition operation that adds a weight parameter; and encoding, in an encoding unit in the image encoding apparatus, a chroma component of quantized coefficients.

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

Abstract: Adaptive pulse-width modulated sequences for sequential color display systems and methods. A method for displaying an image comprises receiving the image, computing a duty cycle for the image, generating a color sequence based on the computed duty cycle, and displaying the image using the color sequence. The generating comprises assigning a color cycle order to display time blocks in the color sequence, and assigning bitplane states for each display time block in the color sequence.

Abstract: An image processing apparatus executes an area dividing process on color image data that have been divided into blocks of a prescribed size, and for each block, selects a three-color mode when tone gradation is of higher priority and a four-color mode when resolution is of higher priority, as a color mode for an area averaging process. The image processing device executes a compression process in the selected color mode block by block, and outputs image data in a data format of 256 bit length, regardless of the color mode for compression.

Abstract: Various embodiments of a system are provided for detecting scrolling text in a mixed-mode video sequence. The system of certain embodiments includes a motion estimator that generates a plurality of motion vectors between blocks of two or more extracted frames of a mixed-mode video sequence. An extracted frame motion analyzer analyzes the motion vectors to detect substantially constant motion of at least some of the blocks between the two or more extracted frames, wherein the presence of substantially constant motion is indicative of the presence of scrolling text in the mixed-mode video sequence. A consecutive frame motion analyzer calculates differences in pixel values between blocks of two or more consecutive frames in the mixed-mode video sequence, wherein the differences in pixel values are further indicative of the presence of scrolling text in the mixed-mode video sequence.

Abstract: A bit rate control circuit for image compression includes a compression unit, a R-value calculation unit, a linear quantization factor (LQF) calculation unit. The compression unit is used to performs a first quantization process on an image based on a default LQF (LQFini) to obtain an initial bits per pixel (bbpini) with an initial number of zero coefficients (Rini). The R-value calculation unit calculates out a target R value (Rtarget) based on the initial bits per pixel (bbpini), the initial number zero coefficients (Rini), and a target bpp (bbptarget). The LQF calculation unit calculates a target LQF (LQFtarget) based on the target R value Rtarget. The LQFtarget can be used to perform a second compression on the image to obtain a compressed image corresponding to the target bpp (bpptarget).

Abstract: A system and method uses the capabilities of a geometry shader unit within the multi-threaded graphics processor to offload data compression computations from a central processing unit (CPU), reduce the memory needed to store image data, and reduce the bandwidth needed to transfer image data between graphics processors and between a graphics processor and a system memory. The multi-threaded graphics processor is also configured to perform decompression of the variable length compressed data using the geometry shader unit.

Abstract: A reflectance image that represents a reflectance distribution, and an illuminance component image that represents an illuminance distribution are generated from an input image. A plurality of small regions, which are divided based on illuminance components of the generated illuminance component image, are specified. A quantized image is generated from the reflectance image for respective specified small regions. Regions having equal quantized pixel values are acquired in the quantized image. Representative pixel values for the respective acquired regions are acquired based on the illuminance component image. Quantized pixel values of the respective acquired regions are corrected using the acquired representative pixel values.

Abstract: An image processing device configured to compress image data to be used for printing with a plurality of compression levels having different compression rates includes a former stage compression unit, a storing unit and a latter stage compression unit. The latter stage compression unit is configured, after the former stage compression unit finishes compressing all of the areas, to recompress each of areas of a latest compression level at the moment being different from a compression level stored in the storing unit with the latest compression level.

Abstract: Enhanced dynamic range requires more than 8 bit representation for single color components of pixels. For this purpose, normal color resolution images and high color resolution images are available. Backward compatibility can be achieved by a layered approach using a color enhancement layer, and a conventional image as color base layer. Both have same spatial and temporal resolution. Encoding of the color enhancement layer uses prediction and residual. A methods for optimized color enhancement prediction is disclosed. Color bit depth prediction is done by constructing a polynomial that approximates for all pixels of one color component of a block the color enhancement layer from the color base layer. A predicted version of the high color resolution image and a residual are generated and updated by a residual. The coefficients are compressed and added as metadata to the data stream.

Abstract: A method and a system for adaptively (dynamically) reducing quantization layer reduction for removing quantization artifacts in quantized video signals is provided. Adaptively reducing quantization layer reduction involves detecting if a selected pixel in a quantized image belongs to a ramp area in each of multiple pre-defined directions, dynamically selecting a quantization level for each of the pre-defined directions based on the corresponding detection results, and refining the pixel based on the selected quantization levels.

Abstract: A coding method for an ordered series of quantized transform coefficients of a block of image data, including a context adaptive position coding process to encode the position of clusters of non-zero-valued coefficients, e.g., a multidimensional position coder that uses one of a plurality of code mappings selected according to at least one criterion including at least one context-based criterion, and an amplitude encoding process to encode any amplitudes remaining to be coded, the amplitude coding using one or a plurality of amplitude code mappings selected according to at least one criterion, including a context-based criterion. A context-based selection criterion means a criterion that during encoding is known or derivable from one or more previously encoded items of information. Also a coding apparatus, a decoding apparatus, a computer readable medium configured with instructions that when executed implement a coding method, and another medium for a decoding method.

Abstract: A decoding method includes: obtaining a plurality of quantization parameter sets from a header of a coded stream (S400); parsing an identifier from a header of a coded picture included in the coded stream (S402); selecting at least one quantization parameter set from among the plurality of quantization parameter sets, based on the parsed identifier (S404); determining whether a flag parsed from the header of the coded picture has a predetermined value (S408); generating a new quantization matrix from another quantization matrix when the flag has the predetermined value (S410); decoding the coded picture by inversely quantizing the coded picture using the generated new quantization matrix (S412); and decoding the coded picture by inversely quantizing the coded picture using a quantization matrix included in the selected quantization parameter set when the flag does not have the predetermined value (S414).

Abstract: Techniques described herein are generally related to steganalysis of suspect media. Steganalysis techniques may include receiving instances of suspect media as input for steganalytic processing. A first set of quantized blocks of data elements may be identified within the media, with this first set of blocks being eligible to be embedded with steganographic data. A second set of quantized blocks of data elements may be identified within the media, with this second set of blocks being ineligible to be embedded with steganographic data. The steganalysis techniques may requantize the first and second blocks. In turn, these techniques may compare statistics resulting from requantizing the first block with statistics resulting from requantizing the second block. The steganalysis techniques may then assess whether the first block of data elements is embedded with steganographic features based on how the statistics of the second blocks compare with the statistics of the first blocks.

Abstract: An encoding device includes: a difference generation unit for obtaining a first pixel difference value as a difference value between a first pixel value and a pixel value of a pixel having the same color as the first pixel positioned in the vicinity of the first pixel; a quantization width decision unit for deciding a quantization width in data generation by quantizing the first and the second pixel value according to the number of digits of an unsigned integer binary value of the first pixel difference value and the number of digits of an unsigned integer binary value of the second pixel difference value generated in the difference generation unit for the second pixel value of the second pixel; a quantization width information generation unit for generating quantization width information having a quantization width used for quantization/decoding of the first and the second pixel value; and a quantization unit for generating a first and a second compressed encoded pixel value of n-bit length.

Abstract: A video encoding system encodes video streams for multiple bit rate video streaming using an approach that permits the encoded resolution to vary based, at least in part, on motion complexity. The video encoding system dynamically decides an encoding resolution for segments of the multiple bit rate video streams that varies with video complexity so as to achieve a better visual experience for multiple bit rate streaming. Motion complexity may be considered separately, or along with spatial complexity, in making the resolution decision.

Abstract: The present invention enables a reduction in circuit scale. In an image coding apparatus (100), as for DCT coefficients as simple coded data obtained by coding an input image (91) by simple processing, the input image (91) is coded by at least quantizing the input image (91) as an input image on the basis of selected quantization parameters (QPl) discretely selected from quantization parameters (QP) as quantization factors, thereby computing generated code sizes of the input image (91) upon coding. The image coding apparatus (100) corrects an error in the generated code sizes of the input image upon coding which occurs in accordance with the simple processing, thereby computing low-precision generated code sizes.

Abstract: The present invention relates to a method for eliminating a blocking effect in a compressed video signal signal. The method of the invention includes: the encoding step of eliminating a blocking effect by compensating the motion of a signal compressed in block unit to be transmitted; the decoding step of restoring the motion compensated video signal to the original video signal by reducing the prediction residual between the motion compensated video signal and the original video signal and the blocking effect; and the post-filtering step of performing post-filtering in a blocking elimination filter in order to eliminate a blocking effect and ring effect remained in the compensated signal. The equation for obtaining the original pixel is made simple by eliminating the remaining blocking effect and ring effect using a loop/post filter.