472results about How to "Improve encoding speed" patented technology

The encode thereof at least comprises: an arithmetic coding control module, an encoding instruction queue module, a context management and maintenances module, an encoding engine module and an outputted bits packaging module. The invention also reveals a context self-adaptive arithmetic encoding method which comprises: processing the external command, syntactic element and adjacent block information to generate an output bit-stream.

The invention discloses an H.264 / AVC intra-prediction method based on edge characteristics, which includes: performing data block prejudging before intra-prediction based on principal edge intensity (DES) and the like edge direction characteristics calculated by the edge histogram description describing the image marginal distribution, selecting the mode subclass corresponding to the characteristics to perform RDO calculation, thereby reducing the mode selection number of the intra-prediction; at the same time directly determining the Intra_8*8 chrominance prediction mode from the Intra_16*16 brightness prediction mode according to the correlativity of the chrominance prediction mode and the brightness prediction mode, to further reduce the complexity of the algorithm. The method has six steps, and is convenient and facilitating. Practice shows that the method can obviously improve the encoding speed, and can ensure that the bit-rate encoding (an increase of 3%) and peak signal-noise ratio (reduced about 0.02dB) have little change compared with the full search method. The method has very good practical value and application prospects.

The invention discloses a video inter-frame compression coding method based on macroblock features and statistical properties and relates to the field of video compression coding. The method comprisesthe following steps: firstly extracting brightness information of the current coding macroblock from original video data, adopting the dual-layer prejudgment criteria for determining the optimal inter-frame coding mode according to the statistical properties of the optimal inter-frame mode selected by the current coding macroblock, further utilizing the time-space relevant features of the currentcoding macroblock for selectively carrying out intra-frame coding, comparing the optimal inter-frame coding mode with the optimal intra-frame coding mode according to a rate distortion cost function,determining the final inter-frame coding mode and coding the current macroblock. Compared with the ergodic full-search inter-frame predictive coding method adopted in video coding standard H.264, themethod has almost no loss of video quality, strictly controls the increase of code rate, keeps the excellent performance of high compression ratio of the original standard algorithm and can greatly improve the inter-frame coding speed.

A joint estimation method for movement and parallax error in multi-view video coding of the invention has the following steps: 1. taking parallax error vector and movement vector of image corresponding block of same view and adjacent moment as the initial value of the current coding block parallax error vector; 2. comparing the initial value with the prediction vectors of coded adjacent blocks respectively, and selecting the optimal prediction vector as the search initial point according to the match error minimum rule; and 3. combining geometric relationship between the movement vector and parallax error vector of adjacent images, estimating and obtaining a candidate from a previous movement / parallax error to perform the next movement / parallax error, correcting the current movement and parallax error vector continuously until obtaining the optimal movement vector and parallax error vector of the current coding block. The method only needs one time search process to simultaneously confirm the optimal movement vector and parallax error vector. Compared with full search algorithm, the peak SNR of the invention reduces not more than 0.09dB, code rate bits are slightly saved, code rate ranges between minus 14.20% and 0.60% and coding time is saved by over 90%.

The invention provides a method and a device for parallel coding of a panoramic video. The method comprises the following steps of acquiring a spherical panoramic video; mapping the spherical panoramic video into a flat panoramic video according to a preset mapping mode, and segmenting the flat panoramic video into a plurality of plane views; recombining the flat panoramic video into a plurality of video sequences, wherein the plane views in each video sequence are plane views which are mapped to the same position and are formed according to time sequence; performing parallel coding on all the video sequences; restoring decoded videos according to positions of respective decoded videos in the flat panoramic video and splicing the restored videos into a complete flat panoramic video; inversely mapping the complete flat panoramic video into the spherical panoramic video. According to the method, the panoramic video can be coded by fully utilizing multi-core processing capacity of a CPU (Central Processing Unit) / GPU (Graphics Processing Unit), the coding speed of the panoramic video is improved, real-time coding of the panoramic video is realized, and large-scale industrial application and generalization of the panoramic video are favorably promoted.

The invention discloses a method for realizing rapid video coding by adopting hierarchical structure anticipation, which relates to the field of video compression coding. The method comprises the following steps of: extracting the brightness information of a current coded macro block from original video data; defining, calculating and comparing time / space correlation characteristics of the current coded macro block, and anticipating whether the macro block may adopt inter-frame prediction or intra-frame prediction; and if the macro block adopts the inter-frame prediction, defining and calculating the flatness characteristic of the macro block, dividing the current coded macro block into one type of a flat macro block, a texture-rich macro block and a characteristic-unremarkable macro block according to the flatness characteristic, anticipating a set of inter-frame prediction mode to be adopted in a targeted way, determining an optimal inter-frame prediction mode in advance to realize rapid inter-frame compression coding. By the method provided by the invention, the inter-frame coding complexity and coding time are greatly reduced on the premise of ensuring lossless video quality, not increasing compression code rate and keeping an output code stream structure, and the high performance of high compression ratio of a conventional standard algorithm is maintained.

The invention provides an object and fractal-based binocular three-dimensional video compression and decompression method. In binocular three-dimensional video coding, a left channel is used as a basic layer, a right channel is used as an enhancement layer, and the left channel is encoded by an independent motion compensation prediction (MCP) mode. The object and fractal-based binocular three-dimensional video compression coding method comprises the following steps of: firstly, acquiring a video object partition plane, namely an Alpha plane by a video partition method, encoding the initial frame of a left eye through block discrete cosine transformation (DCT), and performing block motion estimation / compensation coding on a non-I frame of the left eye; secondly, determining the area attribute of an image block by utilizing the Alpha plane, and if the block is not within a video object area of the current code, not processing an external block, and if the block is within the video object area of the current code completely, searching the most similar matching block by a full-searching method in a previous frame of an internal block, namely a reference frame searching window of a left eye video; and finally, compressing coefficients of an iterated function system by a Huffman coding method, and if part of pixels of the block are within the video object area of the current code, and the other part of pixels are not within the video object area of the current code, processing a boundary block independently. The right channel is encoded by a MCP mode and a disparity compensation prediction (DCP) mode, the MCP is similar to the processing of the left eye, and the block with the minimum error is used as a prediction result. When the DCP coding mode is performed, the polarization and directionality in a three-dimensional parallel camera structure are utilized fully.

Through designing encoder for paralleled convolution codes (LDPC), the method carries out encoding, and obtains check matrix H for LDPC code. The encoding procedure is as following: grouped information sequence is stored in memory; through different random interleaving units, the interleaved information sequence is sent to corresponding modulus 2 and processing unit to carry out precoding; then check bit obtained from the precoding is sent to different convolutional coders of recursion to carry out convolutional coding; finally, recombination of check bit outputted from convolutional coders and information bit in memory creates LDPC code words with code rate Rú¢M / (M+N), code length as (M+N)L. Under condition of ensuring performance, the method realizes encoding in high speed. Features are: lower memory space needed, and flexible design and application.

Image pairing information and image classification information are optimized and a Hash code quantization process is used to realize a simple and easy end-to-end deep multi-scale supervision Hash method, and meanwhile design a brand new pyramid connected convolutional neural network structure, and the convolutional neural network structure takes paired images as training input and enables the output of each image to be approximate to a discrete Hash code. In addition, the feature map of each convolution layer is trained, feature fusion is carried out in the training process, and the performance of deep features is effectively improved. A neural network is constrained through a new binary constraint loss function based on end-to-end learning, and a Hash code with high feature representationcapability is obtained. High-quality multi-scale Hash codes are dynamically and directly learned through an end-to-end network, and the representation capability of the Hash codes in large-scale image retrieval is improved. Compared with an existing Hash method, the method has higher retrieval accuracy. Meanwhile, the network model is simple and flexible, can generate characteristics with strongrepresentation ability, and can be widely applied to other computer vision fields.

An image is divided into subbands by wavelet transform using the Haar function as the base, and the lowest-frequency LL subband is entirely encoded. LH, HL, and HH subband coefficients which belong to the wavelet decomposition level of each hierarchy are then encoded such that coefficients at the same spatial position are encoded at once. The decoding side first decompresses the lowest-frequency LL subband, and then decodes sets of the LH, HL, and HH coefficients at the same spatial position in the subband of each wavelet decomposition level one by one. The decoding side immediately performs inverse wavelet transform by using the coefficient values, thereby obtaining the LL coefficient value of the next wavelet decomposition level. This makes it possible to sufficiently increase the processing speed even when the wavelet encoding / decoding is performed using a sequential CPU.

The invention discloses a high-performance macroblock coding implementation method, which mainly solves the problems of low processing speed, complexity in implementation, and a large number of occupied resources of the conventional method for implementing macroblock coding based on hardware. The method is implemented by the following steps of: (1) caching initial data and inter prediction data; (2) performing two-path parallel intra prediction on the current macroblock; (3), selecting the optimal mode of the intra prediction and cost thereof according to the intra prediction result; (4), acquiring the optimal mode of the inter prediction and cost thereof; (5), comparing the cost of the optimal modes of the inter prediction and the intra prediction to obtain the optimal prediction modes of the current macroblock; and (6) quantizing discrete cosine transformation (DCT) results of the optimal prediction modes and performing entropy coding and reestablishing respectively and depositing and outputting the reestablished results simultaneously. The method has the advantages that coding speed is high, a field programmable gate array (FPGA) is easy to implement and resources are fully reused, and can be used for a video coding system, particularly the video coding system with high resolution.

The invention discloses a high-performance adaptive binary arithmetic encoder which mainly solves the problems of low encoding speed and complicated structure of the existing binary arithmetic encoder. The encoder comprises a probability model storing module, a probability model updating module, an encoding state updating module, a normalization module and register groups, wherein a first register group is inserted between the probability model storing module and the probability model updating module, and a second register group is inserted between the encoding state updating module and the normalization module so as to form a three-level flow structure to improve the encoding speed by sufficiently using the parallelism of hardware; a caching register unit is adopted in the probability model storing module so that the read / write conflict of a probability model memory is effectively avoided; and a prefix zero detection unit is adopted in the normalization module so that the structure of the normalization module is simple and easy to implement with hardware. The high-performance adaptive binary arithmetic encoder disclosed by the invention has the characteristics of high encoding speed and simple structure, and can be applied to the real-time encoding of high-definition videos.

The invention discloses a video coding method and a video coding device. The video coding method comprises the following steps: performing downsampling on a video image with highest resolution level to generate D video damages with different resolution levels; performing inter-frame coding predication mode screening on the video image with the lowest resolution level to obtain the optimal inter-frame prediction mode with lowest resolution level; for the video images without lowest resolution level, adding the optical inter-frame coding predication mode of the video image with resolution level Ld+1 into the inter-frame coding predication mode screening set of the video image with the resolution level Ld according to the low-to-high sequence of the resolution level, performing inter-frame coding predication mode screening to obtain the optimal inter-frame predication mode of the video image with the resolution level Ld; performing predication and video coding on the video image with the highest resolution level by using the optimal inter-frame coding predication mode with the highest resolution level. Compared with an existing HEVC (high efficiency video coding) method, the video coding method disclosed by the invention can be used for increasing the video coding speed by 2-4 times.

The embodiment of the invention discloses a construction method of check codes with low density, an encoder and a decoder. A message part and a redundant part of the LDPC codes to be constructed are respectively divided into M message subsets and K check subsets and are respectively stored in the different lines of an encoding matrix; a circulating shift matrix is generated according to code length and code rate of the LDPC codes to be constructed, elements in the encoding matrix are carried out the circulating shift according to the circulating shift matrix before carrying out exclusive or plus of the elements in the encoding matrix by lines each time respectively, thereby leading information bits and check bits in the same line in the encoding matrix which participate in the exclusive or plus to be different and further generating the different check bits by the exclusive or plus; therefore, the embodiment of the invention can construct the LDPC codes by the search of the circulating shift matrix, compared with a great number of matrix operations in the prior art, the construction method, the encoder and the decoder of the invention can reduce the complexity for constructing, encoding and decoding the LDPC codes.

A data encoding method of a multiple-valued information source in accordance with the present invention includes a prediction setting process which divides a multiple-valued information source into bit planes or level planes, defines either "0" or "1" of the plane as a superior symbol and the other as an inferior symbol, and predicting the superior symbol to continue for n units, and sets the n units as a prediction bit number run, and a prediction result output process which outputs either signal of "0" or "1" as a prediction correct signal as a code word, when prediction is correct for an observed series that includes the prediction bit number input, and moves to the operation of encoding the next string of n bits, or outputs the other of either "0" or "1" as a prediction failed signal as a code word, when the prediction has failed in the encoding operation. A similar prediction setting process and prediction result output process are recursively iterated, setting a newly-decreased prediction bit number as a prediction bit number less than n units when the prediction has failed a specified number of times.

The invention discloses a low-complexity method for selecting HEVC (High Efficiency Video Coding) coding multiple reference frames. The method comprises the following steps of inputting an original coding sequence, taking a code tree cell as the unit, and selecting the optimal reference frame for each coding cell through the operations of a, if the parent coding unit of the current coding unit is in an SKIP mode, taking the optimal reference frame of all forecast cells in the current coding unit as the optimal reference frame of the parent coding unit, and b, if the parent coding unit of the current coding unit is not in the SKIP mode, firstly selecting multiple reference frames for forecast cells in an inter-frame dividing mode of 2N*2N of the current coding unit, and calculating the rate distortion cost of each reference frame in the 2N*2N inter-frame dividing mode, gathering all reference frames of which the rate distortion costs are lower than a threshold in a reference frame set, and selecting the optimal reference frame for the rest inter-frame dividing modes in the reference frame set. The low-complexity method is capable of remarkably speeding up HEVC video coding.

The invention provides a quick inter-frame prediction mode selection method for AVS-M video coding. Algorithms can be classified according to the distribution situation of inter-frame coding modes and are arranged according to processing priority, different types are judged sequentially, possible modes are compared selectively, and the number of modes to be judged is reduced. Early termination judgment is utilized to carry out priority judgment on an SKIP mode, and whether other modes are early termination is judged through threshold value judgment. If threshold value judgment conditions are met, the SKIP mode is directly utilized to code. If the threshold value judgment conditions are not met, an Inter4*4 mode, an Inter 8*8 mode and an Inter 16*16 mode are used as initial modes. A part of macro block modes are removed according to whether rate-distortion cost meets monotony, and accordingly useless block mode search processes are reduced. Compared with a full-mode selection algorithm, the calculating times is reduced by 52.5% to 85.8%, and the calculating complexity of inter-frame forecasting modules is reduced.

The invention discloses a method for encoding multi-view depth video, wherein a B frame image is divided into a depth continuous area and a depth discontinuous area according to deviation factors by computing each macro block of all B frames in a multi-view depth video. For each macro block in the depth continuous area, an encoder traverses fewer macro block encoding modes by, so that the search range of the macro block encoding modes of each macro block in the depth continuous area in the multi-view depth video is reduced greatly, which reduces the computational complexity of multi-view depth video encoding, and effectively improves the encoding speed of the multi-view depth video encoding; for each macro block in the depth discontinuous area which has great influence on drawing a virtual view image, the encoder traverses all macro block encoding modes so that each macro block is protected by adopting the method for searching all macro block encoding modes. Therefore, the method of the invention improves the encoding speed and ensures the quality of drawing the virtual view image at the same time.

A method for real-time video encoding includes buffering frames in an encoder input buffer, retrieving the frames from the encoder input buffer, encoding the retrieved frames into a bit stream, monitoring the encoder input buffer for buffer overflow, and, if the encoder input buffer is about to overflow, encoding one of the retrieved frames as a pseudo-frame that completely references one reference frame of the one retrieved frame. Encoding one of the retrieved frames as a pseudo-frame bypasses a majority of the encoding procedures to improve the overall encoding speed. The method further includes monitoring a hypothetical decoder input buffer that models an actual decoder input buffer in a video decoder, encoding one of the retrieved frames with a pseudo-frame if the hypothetical decoder input buffer is about to underflow, and adding stuffing bits to the bit stream if the hypothetical decoder input buffer is about to overflow.

This invention discloses a quick moving estimation method for forcasting controllable quality including: A, a current macro-block presets a search window in a reference frame to predicate the position of an initial search center of the current macro-block in the window, B, judging if the maximum match point of the current macro-block in the reference frame is the initial search center position, C, if not, when the macro-block is in the moving state relative to th reference frame, the search window is adjusted, D, after the current macro-block is sampled in terms of a proportion, several pixel blocks are got and analyzed, E, quality controllable block match operation is done to the pixel block with the greatest variance.

The embodiment of the invention discloses a motion estimation method and apparatus. The method comprises: according to a motion vector of a coded block with coding completion, an initial motion vectorof a target coding block is determined; on the basis of the initial motion vector, an initial search range of the target coding block is adjusted to obtain a target searching range; a coding cost corresponding to the initial motion vector is obtained and a searching template corresponding to the target coding block is determined based on the obtained coding cost; and according to the initial motion vector, the target searching range, and the determined searching template, motion estimation for the target coding block is carried out to obtain a motion vector of the target coding block. Therefore, the searching range of the coding block can be adjusted adaptively and the coding speed is increased.

A method and apparatus are provided for encoding and decoding a multi-view moving picture. A method of estimating a disparity vector to encode a multi-view moving picture includes: estimating disparity vectors for a predetermined number of encoded macroblocks; and calculating disparity vectors of macroblocks adjacent to the encoded macroblocks using the estimated disparity vectors. Therefore, it is possible to quickly perform encoding of a multi-view moving picture and enhance compressibility of the multi-view moving picture.

The invention provides a rapid fractal compression and decompression method for multi-cast stereo video. The method comprises the following steps of: selecting an intermediate cast as a reference cast; and compressing the intermediate cast by using a motion compensation prediction (MCP) principle and compressing other casts by using a principle of disparity compensation prediction (DCP) and MCP. Three casts are taken for example; the intermediate cast is used as the reference cast and is coded by a separate MCP mode; an initial frame is subjected to block discrete cosine transform (DCT) transform coding, and non-I frames are subjected to block motion estimation / compensation coding; a pixel sum and a pixel quadratic sum of a subblock related to a subblock domain and a father block domain are calculated; a pixel sum and a pixel quadratic sum of an interpolation corresponding block in a subpixel are calculated; a pre-search limiting condition is judged; and the most similar block is searched in a front frame search window through subpixel block matching and an adaptive hexagonal search algorithm based on a motion vector field. According to the method, the MCP mode and the DCP mode are adopted for coding left casts and right casts, the subpixel block matching and disparity distribution constraint condition are utilized during coding of the DCP mode, and deblocking loop filtering is adopted during decoding.

The invention discloses a depth map coding compression method applied to 3DTV and FTV systems. The depth map is divided into an immobile non-edge region, a non-edge region and an edge region in a moving object according to the edge information of the depth map and the motion information of viewpoint images, the depth map is coded after the coding of the viewpoint images is completed, and the searching range of a macro block coding mode in the immobile non-edge region and the non-edge region in the moving object can be reduced on the premise of the ensured coding quality of the depth map coding process by using the macro block coding mode and a motion vector determined after the viewpoint image coding in combination with the three regions of the depth map, thereby reducing the depth map coding complexity and improving the depth map coding speed.

The invention relates to a scheme for encoding QC-LDPC (quasi-cyclic low-density parity-check) codes with three kinds of different code rates in a DTMB (digital terrestrial multimedia broadcasting) system. The scheme is characterized in that an encoder for the QC-LDPC codes of the system is based on a register sharing mechanism and mainly comprises five parts, i.e. a shared register part, a multifunctional shifter part, a parallel filter part, a linear feedback shift register part and a parallel rotate left accumulator part. The latter four function modules share sixty-two b-bit registers. The QC-LDPC encoder provided by the invention has the advantages that the memory is not needed, the QC-LDPC encoder is compatible with multiple code rates, the encoding time is not related to the code rates, the encoding speed can be obviously improved, the logic resource demands are effectively decreased, the encoding speed is fast, the resource consumption is small, the power consumption is small, the cost is low and the like.

The invention pertains to video coding technique, in particular relates to a transformation and quantization method. The technical problem to be solved by the invention is providing a transformation and quantization method which reduces the video coding complexity. The invention can detect the situation in which a residual block system is zero after transformation and quantization in advanced through prediction before the transformation and quantization, thus saving the transformation and quantization process of an all-zero block. The proposal has an outstanding meaning for video coding with a low bit rate, as the proportion of the all-zero block is lager in the situation of low bit rate. Detecting most parts of the all-zero block in advance can greatly reduce the calculating complexity of transformation and quantization, further increase the coding efficiency. Furthermore, the invention can real-timely adjust the judging conditions for the all-zero block, further enhance the coding speed and quality and avoid occurrence of missed judgment.

An encoding method by which an encoding speed is improved is disclosed. An encoder (100) comprises an input data storage section (107) for outputting the stored input data (D100) according to an output control signal (108), an input data count section (101) for counting the inputs of input data (D100), an output control section (102) for controlling the output destination of the input data (D100)according to the input counts, one-bit storage sections (103-1 to 103-(N-K)) for holding one-bit data, row-vector storage sections (104-1 to 104-K) for holding row vectors of an LDPC code creation matrix, vector multiplying sections (105-1 to 105-K) for multiplying a row vector and a column vector, a parity storage section (109) for holding a parity created by the multiplication, and an LDPC code-word series creating section (106) for creating an LDPC code word from the input data series and parity series and outputting it.

The invention discloses a method of dividing code blocks in video compression. The method is characterized by comprising the following steps: reading pixel values of a whole local control unit (LCU), and finishing block combination searching chart; entering each deep control unit (CU), and obtaining information of depth and locations of combined block corresponding to the location of the searching chart according to the information of the depth and the locations; conducting the judging process of a block partition method from bottom to top if the current depth is uniform with the depth of the combination block; and conducting the judging process of block partition quick algorithm from top to bottom. Under the premise of ensuing that video quality and an output code rate of a high efficiency video coding (HEVC) coder are basically not changed, coding speed is greatly quickened, and coding efficiency is improved when the method of dividing the code blocks is adopted and combined with the block partition quick algorithm brought out from two aspects.

The invention relates to a method and a device for increasing a video encoding speed, and belongs to the field of image processing. The method and the device are characterized in that a CPU (central processing unit) of a video compression encoder performs logical operation for infra-frame prediction or inter-frame prediction mode selection, loop filter and entropy encoding, a GPU (graphics processing unit) of the video compression encoder performs numerical operation for movement estimation, movement compensation, transformation and quantization and inverse transformation and inverse quantization, and the device comprises a CPU framework flow line and a GPU framework flow line which are parallel to each other. The method and the device have the advantages that a heterogenous system with a combination of a CPU framework and a GPU framework is comprehensively utilized for increasing video compressing and encoding speeds, so that videos are effectively compressed on the premise that the quality is guaranteed, the encoding elapsed time is greatly shortened, the integral performance of the encoder is greatly improved, the integral complexity of the encoder is assuredly unchanged basically, the instantaneity of the video encoder is greatly improved, and the method and the device can be applied to real-time encoding and decoding places.