WO1992022986A1 - Procede de codage d'une sequence d'images d'un signal video numerique de mouvement - Google Patents

Procede de codage d'une sequence d'images d'un signal video numerique de mouvement Download PDF

Info

Publication number
WO1992022986A1
WO1992022986A1 PCT/US1992/004575 US9204575W WO9222986A1 WO 1992022986 A1 WO1992022986 A1 WO 1992022986A1 US 9204575 W US9204575 W US 9204575W WO 9222986 A1 WO9222986 A1 WO 9222986A1
Authority
WO
WIPO (PCT)
Prior art keywords
image
target image
complexity
images
sequence
Prior art date
Application number
PCT/US1992/004575
Other languages
English (en)
Inventor
Stuart J. Golin
Original Assignee
Intel Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Intel Corporation filed Critical Intel Corporation
Publication of WO1992022986A1 publication Critical patent/WO1992022986A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/85—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression
    • H04N19/87—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression involving scene cut or scene change detection in combination with video compression
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/124—Quantisation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/14—Coding unit complexity, e.g. amount of activity or edge presence estimation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/142—Detection of scene cut or scene change
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/179—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a scene or a shot
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/189—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding
    • H04N19/196—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/189—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding
    • H04N19/196—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters
    • H04N19/197—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters including determination of the initial value of an encoding parameter
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/146—Data rate or code amount at the encoder output
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/146—Data rate or code amount at the encoder output
    • H04N19/149—Data rate or code amount at the encoder output by estimating the code amount by means of a model, e.g. mathematical model or statistical model
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/146—Data rate or code amount at the encoder output
    • H04N19/15—Data rate or code amount at the encoder output by monitoring actual compressed data size at the memory before deciding storage at the transmission buffer

Definitions

  • This invention relates to video signal processing generally and particularly to methods and systems for allocating resources when encoding a full motion digital video signal.
  • such compression techniques read a sequence and produce a bitstream that satisfies the bit rate and decode time constraints.
  • the compression system can adjust to gradually changing image complexity and to abrupt scene changes. However, images often break up during periods of rapid motion. This is because the automated system reacts to increased image complexity by loosening tolerances. This causes image quality to deteriorate, but has been deemed necessary to control the bit rate. It was subsequently determined that such is not always necessary; and, by inclusion of a sophisticated buffering scheme, such a system would be able to ride out a temporary bit-rate overload.
  • the compression system does not know whether the overload is temporary until it is too late. Therefore, it does not know whether to react slowly or rapidly to the overload. If it reacts too slowly to a major increase in image complexity, a serious overload will develop. On the other hand, if the system reacts too quickly, the resulting difficult scenes are of poor quality. In addition, an instability is possible where the tolerances oscillate long after the image complexity has stabilized.
  • the present invention is directed to providing a method and system for compressing digital video signals which helps control the fluctuation in the bit rate and enhances response to transients in image complexity.
  • Complexity is defined as a measure of the difficulty of compressing an image; that is, the number of bits necessary to obtain acceptable image quality.
  • one exemplary measure of complexity is the mean-square-difference between adjacent images, after motion compensation.
  • Another exemplary measure of complexity is the mean square value of a target image.
  • information regarding future images in an image sequence is obtained by making an initial analysis of the image data before compression.
  • Such initial analysis provides information to the compression system regarding variations in complexity between images that is used to determine the setting of a compression controller, and from which setting other compression system thresholds and quantizers are scaled. Furthermore, such initial analysis provides qualitative information regarding events such as scene changes, brief periods of rapid motion, dissolves, wipes, and the appearance of a single anomalous image. Additional information, such as average illumination, is useful in the calculation of complexity.
  • FIGURE 1 is a block diagram of a method of automating video compression in accordance with the present invention.
  • FIGURE 2 is a block diagram of a method of performing motion analysis for determining difference images and complexities based thereon in accordance with a preferred embodiment of the present invention.
  • FIGURE 3 is a block diagram of a method of determining complexities associated with target images treated as stills.
  • the present invention makes use of future information which is obtained by making a pass over the digital video data before compression.
  • this information may be used for example, the compression system may decide not to use too many bits on an image if it knows that the next image belongs to a new scene.
  • An important piece of information which is reported to the compression system is the complexity. Complexity is a measure of the difficulty of compressing an image; for example the number of bits necessary to obtain acceptable image quality.
  • the output of a typical compression system feeds into a channel with a fixed capacity, which constrains the average number of bits used to encode an image. In general the number of bits used to encode an image will increase with complexity and decrease with thresholds and quantization. Accordingly, when the compression system observes that the number of bits required to encode images is increasing, it is likely to increase thresholds and/or quantization levels to bring the bit rate back down. However, this is not always the correct response.
  • bit rate increase is caused by a few images of fast motion. If these frames are encoded with the same number of bits as the others, they are likely to exhibit poor visual quality. Overall quality will be improved if these images are given extra bits, even at the expense of other images.
  • the increase in bit rate is caused by the sequence entering a new and more difficult phase, then the compression system must react quickly. Otherwise the compression buffers will be overloaded. The system can decide between these two actions if it has advance information. The following formula shows how advance information can be used to control the bit rate:
  • T[n+l] T[n]*(C[n+1]/C[n])*(1+k*(b[n]-R) )
  • T[n+1] is the setting of the compression controller used when compressing image n+1, after image n has been compressed with compression controller setting T[n].
  • quantization and various thresholds can be scaled. For example, if the setting of the compression controller is increased, the coarseness of the quantizers would be increased. If T has units of mean-square-error, as in the preferred embodiment of the present invention, then quantization would scale as the square root of T.
  • R is the target bit rate and b[n] is the bit rate of image n.
  • b[n] is a weighted average of the bit rate of image n and a few earlier images
  • k is an adjustable parameter which determines the restoration force.
  • C[n] is the complexity of image n, calculated from the initial analysis of the sequence.
  • C[n] is a weighted average of the complexities of image n and a few images before and after n.
  • a preferred measure of C is the displaced-frame- difference; that is, the mean-square-error resulting from using the motion-compensated previous image without correction. It should be noted that the above formula reduces to simple proportional control if the C , s are set to one.
  • the averaging of b prevents the system from overreacting to discontinuities in the bit rate, which might be caused by 3:2 pulldown, or the triggering of the threshold.
  • the averaging of C prevents the system from overreacting to a short period of rapid motion, but ensures that it will adequately respond to changing sequence characteristics. In general, if the average is over many images, the system will be able to ride out fairly long periods of rapid motion, but large buffers will be required.
  • the compression system will know what is happening in the future.
  • the system can predict the future since compression is not performed in real time.
  • Previous systems lacked the ability to determine whether an increase in bit rate was transient or part of a new sequence or something in between. Those systems accommodated increases in bit rate by increasing thresholds. Inclusion of sophisticated buffering could also ameliorate the problem.
  • the present invention utilizes complexity to optimize image quality while controlling the bit rate.
  • complexity is determined by approximately calculating motion vectors between subsequent images. The calculated motion vectors are applied to get prediction errors. For example, the image n-1 to image n motion vectors are calculated. These calculated motion vectors are then applied to image n-1 which should result in image n.
  • the calculated vectors produce image n based upon image n-1.
  • the prediction error is the difference between image n and the image resulting from the application of the calculated motion vectors to image n-1. This prediction error is sometimes called the difference image.
  • the vectors are applied to the previous original, image.
  • the decoder has no access to original images; therefore, it applies motion vectors to the last image it decoded.
  • the image n-1 to image n motion vectors could be calculated at full image resolution, it is preferred that such calculations are made at a resolution level lower than full resolution. This will speed up the formation of the difference images without an appreciable loss in effectiveness.
  • complexity is determined by calculating the mean square value of a target image.
  • This type of determination is useful where each image in a sequence is treated like a still image. This type of determination is also useful when applied to the first image and/or selected images in a motion sequence. In such a case, the complexities associated with the remainder of the images can be that determined from the difference images as described above.
  • FIGURE 1 there is shown a block diagram of a preferred embodiment of the method, generally designated 100, of automating digital video compression in accordance with the present invention.
  • a prepass, or first pass is made over a sequence of images 102 from a sequence of frames of a digital motion video signal.
  • the first pass is schematically represented in FIGURE 1 by means of a switch 104 which is shown in the first pass position.
  • the sequence of images is prescanned 106 in order to determine the complexity of 110 of each image in the sequence.
  • the details of preferred embodiments of prescanning 106 and determining image complexities 110 will be subsequently described with respect to FIGURES 2 and 3.
  • the measure of complexity is the mean square value of the difference image as will be subsequently described.
  • the measure of complexity is the mean square value of a target image as will be subsequently described.
  • C n is the average complexity of image n in the sequence of images
  • M n is the mean square value of difference image n
  • M n _. is the mean square value of the difference image preceding image n
  • M ⁇ . is the mean square value of the difference image subsequent to image n, etc.
  • l>r>0 In general, when r is close to one the averaging effectively includes lots of images. This will cause a large sharing of bits and require large buffers.
  • the weighted averages are used to set a compression controller 114, from which setting all other compression system thresholds and quantizers are scaled during a second, video signal compression pass through the sequence of images.
  • the second pass through the sequence of images takes place.
  • This second pass is schematically represented in FIGURE 1 by placing switch 104 in the second pass position.
  • the digital video signal will be compressed 116 to form a compressed digital video signal 118.
  • Compression of the digital video signal may be accomplished by any method known to those skilled in the art which utilizes threshold or quantization control for maintaining the bit rate of the compressed signal.
  • such a system can be, for example, the system described in commonly owned U.S. Patent Application Serial No. 07/657,708, the full text of which is incorporated into this detailed description by reference as if fully set forth herein.
  • Another exemplary system which is usable in connection with the present application is described in commonly owned U.S. Patent No. 4,868,653 which patent is incorporated in its entirety into this detailed description by reference as if fully set forth herein.
  • compression controller 114 utilizes the weighted averages of the image complexities determined in the first pass to scale the compression system thresholds and quantizers. By scaling the thresholds and quantizers the compression system controls the bit rate of the compressed digital video signal in a manner, for example, such as that described in U.S. Patent No. 4,868,653 which patent has been incorporated by reference into this detailed description.
  • the dashed lines are used to signify a feedback control path over which the bit rate is fed back to the compression controller 114 from the digital video compression system 116.
  • the complexity values are the mean square differences between adjacent images in the sequence of images; or, as shown in FIGURE 2, the mean square values of difference images.
  • the method comprises the steps of selecting a target image 202 from a sequence of frames of a digital motion video signal.
  • the target image 202 is an image, other than the first image in the sequence. Since the target image 202 is not the first image in the sequence, a previous target image 204 is provided.
  • the previous target image 204 is the image which immediately precedes the target image 202 in the sequence of images. In the block diagram of FIGURE 2, this is represented by the delay 206.
  • This delay is accomplished by storing the target image 202 in a first memory device for a predetermined period of time, preferably one frame period, whereby the target image becomes the previous target image for the purposes of motion analysis 208.
  • the delay 206 represents a delay of l/30th of a second.
  • displacement vectors are determined by determining the direction and magnitude of motion of pixels in the target image 202 with respect to corresponding pixels in the previous target image 204. If no motion has occurred, the previous and present pixels will have the same coordinates within the image frame. If motion has occurred, at least some pixels in the previous target image will be offset or translated relative to the corresponding pixels in the present target image by amounts and directions which are represented by displacement vectors.
  • the determination of displacement vectors can be performed, for example, in accordance with the procedure set forth in the parent application serial no. 07/657,708, the full text of which is incorporated into this detailed description by reference as if fully set forth herein; or in accordance with the procedure set forth in U.S. Patent No. 4,868,653, the full text of which has been incorporated into this detailed description by reference. It should be noted that the use of such procedures is exemplary and that other procedures for motion analysis known to those skilled in the art may also be used.
  • the displacement vectors resulting from the motion analysis 208 are used in performing motion compensation 210.
  • motion compensation 210 the displacement vectors from the motion analysis 208 are applied to the previous target image 204 to form a predicted image 212. That is, the displacement vectors are applied to the locations of pixels as they exist in the previous target image 204 to determine the locations of corresponding pixels in the predicted image 212. If the value of a displacement vector is not an integer number of pixels, then the pixel values for that vector are calculated by interpolation, preferably linear interpolation. The pixel values of the predicted image 212 are subtracted from corresponding pixel values in the target image 202 to form a difference image 214. The mean square value of the difference image is then determined 216 to obtain complexity values as will be subsequently described.
  • complexity C[n] is a measure of the difficulty of compressing image n.
  • the mean square value of the difference image is used as the measure of complexity. Accordingly, the mean square value (power) of each difference image 214 is determined 216 using the expression:
  • e is equal to the magnitude of the pixel value in location i, j in the difference image 214 and n is equal to the number of pixels in the difference image 214.
  • the complexity value is the mean square value of a target image.
  • the method comprises the step of selecting a target image 302 from a sequence of frames of a digital motion video signal.
  • the target image can be the first image in a sequence of images, the first image in a scene change, or any other image selected from the sequence of images.
  • the mean square value of the target image is used as the measure of complexity. Accordingly, the mean square value (power) of the target image 302 is determined as previously described with respect to the determination 216 of the mean square value of each difference image 214 described above with reference to FIGURE 2.
  • C[n] comprise the weighted average of the complexities of image n and a selected number of images before and after image n as previously described.
  • the average complexity C[n] for image n is used to control the bit rate through adjusting the threshold as previously described.
  • the threshold is adjusted as a function of the quantity T[n+1] which is determined in accordance with the formula previously set forth. That formula, without the feedback term, is:
  • complexity enables a reduction in the strength of the feedback. This is because in the present invention the complexity predicts the threshold needed to keep the bit rate constant. Feedback is then needed only to correct the prediction error.
  • the above formula assumes that the prediction is perfect and ignores feedback. If the complexity is not averaged, then all images will use the same number of bits, and there is no redistribution. However, the average complexity, and hence the threshold, will begin to rise before the blip, and begin to return to normal only after the blip. At the blip itself, the average complexity will be smaller than the instantaneous complexity, and hence the threshold will be smaller than it would be without averaging. As a result, the number of bits used for the blip will be increased.
  • the difference image 214 is formed using a predicted image resulting from motion compensation which is based upon the previous target image and not based upon the previous reconstructed target image which is typically used to increase the accuracy of the difference image.
  • motion analysis 208 is performed at a lower level of resolution than full resolution. Use of a lower level of resolution speeds up the process and is described in U.S. Patent Application Serial No. 07/104,457 which has been incorporated by reference into this detailed description. If there is a large change in illumination between adjacent frames, as occurs in fades, the complexity as defined above will exaggerate the difficulty in compression. This is because it requires only a few bits to instruct the decoder to increase every pixel value by say, 10 gray levels, or by, say 5%. Therefore, the differences in overall illumination should be eliminated before the complexity is calculated.
  • a dissolve is a scene change in which the two scenes coexist for one or more frames.
  • a simple scene change can usually be identified by its large complexity.
  • each frame in a dissolve of a few frames is likely to have a large complexity, and each one can be misinterpreted as the start of a new scene.
  • Other sequence features can also cause this misinterpretation, such as a brief period of rapid motion.
  • the first frame of a new scene is encoded as a still, which usually requires a lot more bits than a difference image. This jump in bit rate can be tolerated if scene changes are rare, but can be very serious if each frame in the dissolve is encoded as a still. Since the first frame of a new scene and the first frame of a dissolve can both have high complexities, the complexity of that first frame is insufficient to distinguish the two cases. Rather it is necessary to look ahead. The distinguishing feature of a simple scene change is that the sudden increase lasts a single frame. The complexity of the first frame of a new scene is much larger than the complexities of the preceding frames, as well as of the subsequent frames.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Computing Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

Dans un procédé de codage d'une séquence d'images d'un signal vidéo numérique de mouvement, on obtient les informations relatives aux images à venir dans la séquence d'image en effectuant une analyse initiale de données d'image avant la compression. L'analyse initiale fournit des informations au système de compression, qui concernent les variations de la complexité entre les images. Ces informations sont utilisées pour déterminer le positionnement d'une unité de commande de la compression. A partir de ce positionnement, on change l'échelle d'autres seuils et quantificateurs du système de compression. En outre, l'analyse initiale fournit des informations qualitatives relatives à des événements tels que des changements de décors, des périodes courtes de mouvement rapide, des fondus enchaînés, des balayages et l'aspect d'une image anormale individuelle.
PCT/US1992/004575 1991-06-13 1992-06-01 Procede de codage d'une sequence d'images d'un signal video numerique de mouvement WO1992022986A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US71486391A 1991-06-13 1991-06-13
US714,863 1991-06-13

Publications (1)

Publication Number Publication Date
WO1992022986A1 true WO1992022986A1 (fr) 1992-12-23

Family

ID=24871757

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1992/004575 WO1992022986A1 (fr) 1991-06-13 1992-06-01 Procede de codage d'une sequence d'images d'un signal video numerique de mouvement

Country Status (2)

Country Link
AU (1) AU2161192A (fr)
WO (1) WO1992022986A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1997009828A1 (fr) * 1995-09-06 1997-03-13 Philips Electronics N.V. Procede et dispositif de codage d'une sequence d'images segmentees, signal code et support de stockage correspondants et procede et systeme de decodage dudit signal code
WO2016196405A1 (fr) * 2015-06-04 2016-12-08 Microsoft Technology Licensing, Llc Régulateur de cadence pour codage et transmission en temps réel
CN111324678A (zh) * 2018-12-14 2020-06-23 北京京东尚科信息技术有限公司 数据处理方法、装置和计算机可读存储介质
CN116567286A (zh) * 2023-07-10 2023-08-08 武汉幻忆信息科技有限公司 一种基于人工智能的在线直播视频处理方法及系统

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2003001A (en) * 1977-08-16 1979-02-28 Dennis T Improvements in methods and apparatus for coding digital television signals
US4217609A (en) * 1978-02-28 1980-08-12 Kokusai Denshin Denwa Kabushiki Kaisha Adaptive predictive coding system for television signals
GB2128847A (en) * 1979-06-07 1984-05-02 Japan Broadcasting Corp A motion-compensated interframe coding system
US4667233A (en) * 1984-09-17 1987-05-19 Nec Corporation Apparatus for discriminating a moving region and a stationary region in a video signal
US4689673A (en) * 1985-06-10 1987-08-25 Nec Corporation Movement compensation predictive encoder for a moving picture signal with a reduced amount of information
US4698672A (en) * 1986-10-27 1987-10-06 Compression Labs, Inc. Coding system for reducing redundancy
EP0288963A2 (fr) * 1987-04-28 1988-11-02 Mitsubishi Denki Kabushiki Kaisha Dispositif pour le codage et la transmission d'images
US4931879A (en) * 1987-04-30 1990-06-05 Nec Corp. Image processing system for recording or reproducing an image signal sequence which has been encoded by employing two predictive coding methods and combining the results of those methods
EP0424060A2 (fr) * 1989-10-14 1991-04-24 Sony Corporation Méthode de codage de signaux vidéo et système de transmission à cette fin
EP0444918A2 (fr) * 1990-02-28 1991-09-04 Victor Company Of Japan, Limited Dispositif de compression de données
EP0493136A2 (fr) * 1990-12-28 1992-07-01 Victor Company Of Japan, Ltd. Système pour la commande de la qualité des données de sortie codées entre-trames

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2003001A (en) * 1977-08-16 1979-02-28 Dennis T Improvements in methods and apparatus for coding digital television signals
US4217609A (en) * 1978-02-28 1980-08-12 Kokusai Denshin Denwa Kabushiki Kaisha Adaptive predictive coding system for television signals
GB2128847A (en) * 1979-06-07 1984-05-02 Japan Broadcasting Corp A motion-compensated interframe coding system
US4667233A (en) * 1984-09-17 1987-05-19 Nec Corporation Apparatus for discriminating a moving region and a stationary region in a video signal
US4689673A (en) * 1985-06-10 1987-08-25 Nec Corporation Movement compensation predictive encoder for a moving picture signal with a reduced amount of information
US4698672A (en) * 1986-10-27 1987-10-06 Compression Labs, Inc. Coding system for reducing redundancy
EP0288963A2 (fr) * 1987-04-28 1988-11-02 Mitsubishi Denki Kabushiki Kaisha Dispositif pour le codage et la transmission d'images
US4931879A (en) * 1987-04-30 1990-06-05 Nec Corp. Image processing system for recording or reproducing an image signal sequence which has been encoded by employing two predictive coding methods and combining the results of those methods
EP0424060A2 (fr) * 1989-10-14 1991-04-24 Sony Corporation Méthode de codage de signaux vidéo et système de transmission à cette fin
EP0444918A2 (fr) * 1990-02-28 1991-09-04 Victor Company Of Japan, Limited Dispositif de compression de données
EP0493136A2 (fr) * 1990-12-28 1992-07-01 Victor Company Of Japan, Ltd. Système pour la commande de la qualité des données de sortie codées entre-trames

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1997009828A1 (fr) * 1995-09-06 1997-03-13 Philips Electronics N.V. Procede et dispositif de codage d'une sequence d'images segmentees, signal code et support de stockage correspondants et procede et systeme de decodage dudit signal code
WO2016196405A1 (fr) * 2015-06-04 2016-12-08 Microsoft Technology Licensing, Llc Régulateur de cadence pour codage et transmission en temps réel
CN111324678A (zh) * 2018-12-14 2020-06-23 北京京东尚科信息技术有限公司 数据处理方法、装置和计算机可读存储介质
CN111324678B (zh) * 2018-12-14 2024-05-17 北京京东尚科信息技术有限公司 数据处理方法、装置和计算机可读存储介质
CN116567286A (zh) * 2023-07-10 2023-08-08 武汉幻忆信息科技有限公司 一种基于人工智能的在线直播视频处理方法及系统
CN116567286B (zh) * 2023-07-10 2023-09-22 武汉幻忆信息科技有限公司 一种基于人工智能的在线直播视频处理方法及系统

Also Published As

Publication number Publication date
AU2161192A (en) 1993-01-12

Similar Documents

Publication Publication Date Title
US5265180A (en) Method of encoding a sequence of images of a digital motion video signal
EP0434427B1 (fr) Dispositif de codage de signal pour images animées
EP0660612B1 (fr) Appareil de codage d'image
US4833535A (en) Image transmission apparatus
US6301428B1 (en) Compressed video editor with transition buffer matcher
JP3866538B2 (ja) 動画像符号化方法及び装置
US5689307A (en) Encoding and decoding systems for transmitting moving pictures
US20080063054A1 (en) System and method for the dynamic resolution change for video encoding
EP0267579A2 (fr) Système de codage d'images capable de surveiller une quantité d'informations par l'établissement d'un histogramme
AU658889B2 (en) MC predicting apparatus
US4683494A (en) Inter-frame predictive coding apparatus for video signal
JPH06205386A (ja) 画像再生装置
CA1252569A (fr) Methode et dispositif de codage de signaux video numeriques pour la reproduction d'images de haute qualite meme en cas de changement brusque entre les images
US6553068B1 (en) Video signal coding method and device adapted to control code amounts according to the characteristics of pictures
JP3907875B2 (ja) 符号化レート制御装置及び情報符号化装置
US5521643A (en) Adaptively coding method and apparatus utilizing variation in quantization step size
EP0427108B1 (fr) Dispositif de codage d'images
US6577680B2 (en) Video signal coding method and coding device adapted to control code amounts according to the characteristics of pictures
WO1992022986A1 (fr) Procede de codage d'une sequence d'images d'un signal video numerique de mouvement
US6781637B2 (en) Image change detecting apparatus and image change detecting method, image encoding apparatus and information recording medium with image change detecting program recorded readable by computer
US6473465B1 (en) Method and apparatus for video coding at high efficiency
US20020097797A1 (en) Method and apparatus for decoding picture signal at variable picture rate
US6885773B2 (en) Method of detecting a fade change in image information based on intra-field dispersion values and intra-field DC levels
EP1434443B1 (fr) Codage vidéo à faible débit
US6836513B2 (en) Moving picture encoding method and apparatus

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AT AU BB BG BR CA CH CS DE DK ES FI GB HU JP KP KR LK LU MG MN MW NL NO PL RO RU SD SE

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE BF BJ CF CG CH CI CM DE DK ES FR GA GB GN GR IT LU MC ML MR NL SE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: CA