33results about How to "Avoid the disadvantages of double counting" patented technology

The invention discloses a quick fractal compression and decompression method for a multicasting stereo video based on an object. A middle eye is selected as a reference eye and is compressed by MCP (motion compensation prediction), and other eyes are compressed by DCP (disparity compensated predication) +MCP; the middle eye is the reference eye, and independent motion compensation prediction mode MCP coding is adopted; a video object splitting plane, i.e. an Alpha plane, is obtained with a video splitting method to cause an initial frame to be subjected to DCT coding; the non I frame is subjected to motion estimation / compensation coding to calculate the pixel sum and the pixel quadratic sum of sub blocks relevant to a sub block region and a father block region; the pixel sum and the pixel quadratic sum of the interpolated value corresponding block of a subpixel are calculated; preview search limiting condition judgment is carried out; the most similar matching block in a previous frame of search window is found by an unsymmetrical cross-shaped multi-level hexagon lattice point search algorithm matched and improved by a subpixel block; and the left eye and the right eye are coded by MCP+DCP. During DCP coding, the subpixel block is matched, and conditions are restricted by disparity distribution. In the decoding process, the step of filtering is carried out with a deblocking loop method.

The invention provides a quick fractal video compression and decompression method, comprising the following steps: firstly, coding an initial frame by block DCT (discrete cosine transformation); carrying out block movement estimation / compensation coding on a non-I frame; calculating the pixel sum and the pix quadratic sum of a sub block relevant to a sub block region and a father block region; meanwhile, calculating the pixel sum and the pixel quadratic sum of the interpolated value corresponding block of a subpixel; then, carrying out preview search restricted condition judgment; finding the most similar matching block in a previous frame of search window by an unsymmetrical cross-shaped multi-level hexagon lattice point search algorithm matched and improved by a subpixel block; and finally, compressing an iterated function system coefficient by a Huffman coding method. The corresponding decompression process comprises the following steps: decoding the I frame in an inverse DCT mode; performing Huffman decoding on the non-I frame to obtain the iterated function system coefficient; then, decoding on the basis of a macroblock; calculating the pixel sum and the pixel quadratic sum of a relevant sub block in the father block region; then, successively decoding each macroblock in the current frame; and utilizing a deblocking loop filter method.

The invention provides a fractal-based multi-view three-dimensional video compression coding and decoding method. In the multi-view three-dimensional video coding, the intermediate view is selected as a reference view which is compressed by using a motion compensation prediction (MCP) principle, and other views are compressed by using a difference compensation prediction and motion compensation prediction-based (DCP+MCP) principle. Taking a three-view video for example, the intermediate view is used as the reference view, the independent MCP is used for coding, block discrete cosine transform(DCT) is used for coding an initial frame, block motion estimation / compensation coding is performed on non-I frames, the most similar matching block is searched from the previous frame, namely a reference frame search window of the intermediate-view video, by a full-search method, and finally the coefficient of an iterated function system is compressed by a Huffman coding method. The left view and the right view are coded by using the MCP mode and the DCP mode respectively; and when DCP coding is performed, polarization and directivity in a three-dimensional parallel camera structure are fully utilized. A corresponding decoding process comprises the following steps of: decoding the I frame by using an inverse DCT transform mode; performing Huffman decoding on the non-I frames to obtain the coefficient of the iterated function system; performing macro block-based decoding; calculating pixel sum and pixel quadratic sum of sub-blocks associated with a master block domain in the previous frame; and calculating the pixel sum and the pixel quadratic sum of the sub-blocks associated with the master block domains of the previous frame and the frame corresponding to the intermediate view for the left view and the right view respectively.

The invention provides a video compression and decompression method based on fractal and H.264. Intra prediction of coding based on the H.264 is adopted for an I frame to obtain a prediction frame. A block motion estimation or complementary coding which are based on fractal is used for obtaining a prediction frame of a P frame. Difference between each initial frame and each corresponding prediction frame is a residual frame. After the residual frames are transformed through discrete cosine transformation (DCT) and are quantified, on one hand, the residual frames are written in a code rate, on the other hand, the residual frames are inversely quantified and reversely transformed though the DCT and then plus the prediction frames to get rebuilt frames (as reference frames). Fractal parameter is generated when the P frame is encoded in a predictive mode, the residual frames of the I frame and the P frame are compressed by the utilization entropy encoding CALCV, and the fractal parameter is compressed by utilization of an exponential-Golomb code with symbols, and a corresponding decompression process is that a prediction frame is obtained from an intra prediction of the I frame, and a prediction frame is obtained by a prediction of a frame in front of the P frame. Residual information in the code rate is reversely quantified and reversely transformed through the DCT to respectively obtain the residual frames of the I frame and the P frame.

The invention discloses an object and fractal-based multi-ocular three-dimensional video compressing and decompressing method. In multi-ocular three-dimensional video encoding, a middle ocular video is selected as a reference ocular video and is compressed by using a motion compensation prediction (MCP) principle; and other ocular videos are compressed by using a disparity compensation prediction(DCP)+MCP-based principle. Taking a trinocular video as an example, the middle ocular video is selected as the reference ocular video and is encoded by using a single MCP mode principle, wherein the method comprises the following steps of: first, acquiring a video object segmentation plane, namely an Alpha plane, by a video segmentation method, encoding a start frame by adopting discrete cosine transform (DCT), and performing block motion estimation / compensation encoding on a non-I frame; then, judging the area attribute of an image block by utilizing the Alpha plane, if the block is not in acurrently encoded video object area, then not processing the external block, and if all of the block is in the currently encoded video object area, searching a most similar matching block in a reference frame of a previous frame, namely the middle ocular video, by a full search method; and finally, compressing coefficients of an iteration function system by utilizing a Huffman encoding method, ifpart pixels of the block are in the currently encoded video object area while part pixels are not in the currently encoded video object area, independently processing a boundary block. A left ocular video and a right ocular video are respectively encoded by adopting the MCP+DCP mode; and when the DCP encoding mode is performed, the polarization and the direction in a three-dimensional parallel camera structure are fully utilized.

The invention provides a quick fractal video compression and decompression method based on an object. The method comprises the following steps: firstly obtaining a video object splitting plane, i.e. an Alpha plane, by using a video splitting method; coding an initial frame by block DCT (Discrete Cosine Transformation); carrying out block motion estimation / compensation coding on a non I frame; calculating the pixel sum and the pixel quadratic sum of sub blocks relevant to a son block domain and a father block domain; calculating the pixel sum and the pixel quadratic sum of the interpolated value corresponding block of a fractional pixel; carrying out preplanned search limiting condition judgment; finding the most similar matching block in a previous frame of search window by using an unsymmetrical cross multi-level hexagon lattice point search algorithm matched with and improved by a fractional pixel block; and compressing an iterated function system coefficient by Huffman coding. The corresponding decompression process comprises the following steps: carrying out Huffman decoding on the non I frame to obtain the iterated function system coefficient; carrying out macroblock-based decoding; calculating the pixel sum and the pixel quadratic sum of the son blocks relevant to the father block domain; then, successively decoding each macroblock in the current frame; and carrying out a deblocking loop filtering method.

The invention provides a quick fractal compression and decompression method for a binocular stereo video based on an object. In coding, a left path is used as a basic layer to code in an MCP (motion compensation prediction) mode; a video splitting method is used to obtain a video object splitting plane, i.e. an Alpha plane; a left-eye starting frame is coded by DCT (discrete cosine transformation); a non I frame is subjected to motion estimation / compensation coding to calculate the pixel sum and the pixel quadratic sum of sub blocks relevant to a sub block region and a father block region; the pixel sum and the pixel quadratic sum of the interpolated value corresponding block of a subpixel are calculated; preview search limiting condition judgment is carried out; the most similar matching block in a previous frame of search window is found by an unsymmetrical cross-shaped multi-level hexagon lattice point search algorithm matched and improved by a subpixel block; a right path is an enhanced layer and is coded by an MCP+DCP (disparity compensated predication) mode; and the result with the minimum error is selected as a prediction result. During DCP coding, conditions are restricted by disparity distribution. In the decoding process, the step of filtering is carried out with a deblocking loop method.

The invention provides a fractal-based binocular stereoscopic video compression and decompression method. In binocular stereoscopic video coding, a left channel is taken as a basic layer, a single motion compensation predictive mode (MCP) is adopted for coding, and the method comprises the following steps of: performing block DCT transformation coding on a left-eye start frame, performing motion estimation / compensation coding on a left-eye non-I frame, and calculating the pixel sum and the sum of squares of pixels of subblock domain and father block domain-related subblocks; searching the most similar matching block by using a full search method in a previous frame, namely a reference frame searching window of left-eye video; and finally compressing the coefficient of an iterated functionsystem by using a Huffman coding method. A right channel is taken as an enhancement layer, the MCP and a parallax compensation predictive mode (DCP) are adopted for coding, and the lowest error is selected as a predicted result. During the DCP coding mode, the polalization and directionality in a stereoscopic parallel shooting structure are fully utilized; and the corresponding decompression process comprises the following steps of: for the left eye, decoding the start frame I by adopting a reverse DCT transformation mode, and performing Huffman decoding on the non-I frame so as to acquire the coefficient of the iterated function system; performing macrolbock-based decoding, calculating the pixel sum and the sum of squares of pixels of father block domain-related subblocks in the previousframe; and for a right eye, calculating the pixel sum and the sum of squares of pixels of the father block domain-related subblocks in the right-eye previous frame and a left-eye corresponding frame.

The invention provides a fractal-based video compression and decompression method. The compression method is a novel video compression and encoding method which adopts the fractal iteration principle for video encoding, and comprises the following steps: encoding a starting frame through block-DCT transformation, and carrying out block motion estimation / compensation coding for a non-I frame, which comprises calculating the sum and sum of squares of the pixels of sub-blocks related to sub-block domains and parent-block domains, finding a most similar matching block in a previous frame search window through full search, and finally compressing factors of an iteration function system through Huffman encoding. The corresponding decompression method comprises the following steps: decoding the I frame through anti-DCT transformation, carrying out Huffman decoding for the non-I frame to obtain the factors of the iteration function system, and carrying out macroblock-based decoding, which comprises calculating the sum and sum of squares of the pixels of the sub-blocks relevant to the parent-block domains, and decoding the macroblocks in the current frame in sequence. The method improves the traditional method of fractal video compression, and not only greatly increases the compression ratio and the peak signal-noise ratio, but also improves the encoding speed, thereby enhancing the fractal video compression and decoding performance, and making the fractal video compression and decoding more practical.

The invention provides a multi-view stereoscopic video compression and decompression method based on fractal and H.264. A middle view is used as a base layer and encoded on the principle of a motion compensated prediction (MCP) method in a compression mode, and other views are encoded on the principle of MCP + digitally controlled potentiometers (DCP) in a compression mode. Three views are taken for example, intra prediction coding of the H.264 is adopted by an I frame of the middle view, a rebuilt frame (as a reference frame) is obtained after filtration, a P frame of the middle view is encoded with block MCP by the utilization of the encoded rebuilt frame as the reference frame, the most matched fractal parameter of the block of each time is recorded, the fractal parameters are respectively substituted in a compression iterative function system to achieve a prediction frame of the P frame, and the rebuilt frame is obtained after filtration. The MCP + DCP is adopted for coding by a left view and a right view and a reference frame can be an encoded front frame of the respective view or an encoded frame of other views. Entropy encoding CALCV is used for compressing a residual frame of each frame and an exponential-Golomb code with symbols is used for compressing the fractal parameter.