摘要:
Storing of data items in a memory (31) is provided wherein the data items are divided into successive data pieces of decreasing significance, and the data pieces are stored in respective parts of the memory (31), and when applying a data piece to the memory (31) in case all candidate memory parts are assigned to other data pieces: if the significance of the applied data piece is lower than a lowest significance of the other data pieces, discarding the applied data piece; if the significance of the applied data piece is higher than the lowest significance, storing the applied data piece in one of the candidate memory parts at expense of a given other data piece which has a lower significance than the significance of the applied data piece. Advantageous use of the invention is made in applications using a device of fixed storage capacity for storing compressible data, such as video, images, audio, speech.
摘要:
Disclosed is a method of compressing information for storage in a fixed size memory. The data items (D(k)) that constitute the information are divided into pieces (D(s,k)) of decreasing significance. For example, the DCT blocks of an image are hierarchically quantized (3). The memory (5) is organized in corresponding memory layers (501-504). Successive memory layers have a decreasing number of memory locations. Every time a data item is applied to the memory, its less significant data pieces will have to compete with corresponding data pieces of previously stored data items. Depending on its contribution to perceptual image quality, the applied data piece is stored or the stored data piece is kept. Links (511-513, 521-522) are stored in the memory to identify the path along which a data item is stored. Eventually, the image is automatically compressed so as to exactly fit in the memory. FIG. 2.
摘要:
A signal having blocks of values is coded by: producing respective bit-streams (DCT—1 . . . DCT_N) for respective individual blocks, and obtaining a scalable bit-stream by cyclically and sequentially scanning selected parts (P1,P2, . . . ) of the respective bit-streams (DCT—1 . . . DCT_N) of the respective individual blocks, wherein, in a given scanning cycle, the respective bit-streams (DCT—1 . . . DCT_N) are scanned in an order of decreasing significance. In a further embodiment, the blocks represent a coded image and the given scanning cycle starts at a block approximately at a center of the coded image. In another embodiment, the blocks represent a coded image and the given scanning cycle scans the respective bit-streams in an image-adaptive order being determined by a predetermined criterion, such as a contrast value.
摘要:
The invention proposes a method of and a device for coding a signal (S) to obtain a scalable bit-stream (O). The signal (S) comprises blocks of values. Each block is represented (20) as a sequence of bit planes and the values are scanned and transmitted (21, 23) in an order of decreasing bit plane significance. For each bit plane the scanning and transmitting (21,23) are performed in a rectangular scan zone (RMAX/CMAX) starting from a corner of the block (usually an upper-left corner). Preferably, the scanning and transmitting (21,23) is performed on each block individually. The produced bit-stream (O) is quantized to a desired bit-rate by simple truncating (3) the bit-stream (O) at a desired position.
摘要翻译:本发明提出了一种用于对信号(S)进行编码以获得可缩放比特流(O)的方法和装置。 信号(S)包括数值块。 每个块被表示为(20)作为比特平面的序列,并且以降低位平面有效性的顺序扫描和发送这些值(21,23)。 对于每个位平面,扫描和发射(21,23)从块的角开始的矩形扫描区(R MAX MAX / / SUB MAX)中执行(通常 左上角)。 优选地,分别对每个块执行扫描和发送(21,23)。 所产生的比特流(O)通过简单地截短(3)所需位置处的比特流(O)来量化到期望的比特率。
摘要:
A data compression apparatus receives a digital information signal, determines a probability signal from the digital information signal and at least one previously determined value of the probability signal, entropy encodes the digital information signal into a compressed digital information signal, in response to the probability signal, and transmits or records the compressed signal. Also, a data expansion apparatus receives the compressed signal and entropy decodes the compressed signal into a expanded replica of the digital information signal, in response to a second probability signal determined from the replica and at least one previously determined value of the second probability signal. Thus, complex division operations can be avoided.
摘要:
The invention relates to measures to improve an arithmetic decoder. The method of arithmetically decoding an arithmetically encoded information signal into an information signal comprising a serial sequence of n-bit symbols is adapted to decode two subsequent symbols of the information signal in one decoding cycle if the first symbol to be decoded has the most probable symbol.
摘要:
The invention relates to a scalable video (de)coding method for wireless transmission of high definition television signals. Scalable means that the bitstream contains successively smaller quality refinements and that the bitstream can be truncated. The video images are divided in slices, and each slice is divided in blocks of 8×8 pixels. For each block, an optimal encoding method is chosen. Depending on whether the block is found to contain natural or synthetic image content, transform coding (DCT) or graphic coding is applied. Because the different encoding modes have different properties as regards picture quality, the bitstream format has to enable the encoder to very flexibly choose which bits to send first. The bitstream format in accordance with the invention consists of a multitude of scans (31-34) through the coded data of a series of individual blocks, e.g. a slice. In each scan, the encoder decides whether it will include data for natural blocks (BS1,BS2), for synthetic blocks (BS0,BS1), or both. For the DCT blocks, it can further choose between DC coefficient bits (22) and AC coefficient bits (23). For example, the encoder can choose to first send a few scans of DCT DC bits, then send a few scans of graphics bits and then send some DCT AC bits. The decisions that the encoder makes are signaled to the decoder in the form of flags that precede each block part (e.g. encoded bit plane) and/or plurality of blocks (e.g. a slice).
摘要:
Coding is provided in which a multi-media object is coded to obtain a bit-stream, and quality information is added to the bit-stream, which quality information indicates a quality of the object in relation to a given position in (or a given part of) the bit-stream. By adding quality information to the bit-stream, jointly storing or transmitting multiple coded objects can be optimized in that the quality of the object can be easily taken into account.
摘要:
In order to improve an arithmetic decoder, the method of arithmetically decoding an arithmetically-encoded information signal into an information signal including a serial sequence of n-bit symbols is adapted to decode two subsequent symbols of the information signal in one decoding cycle if the first symbol to be decoded has the most probable symbol value.
摘要:
The invention relates to a bit-plane coding method of signals, for example, an image or video signal in the DCT transform domain. The bit planes of the DCT blocks are transmitted bit-plane by bit-plane in order of significance. As each plane contains more signal energy than the lower significant layers together, the resulting bitstream is scalable in the sense that it may be truncated at any position. The later the bitstream is truncated, the smaller the residual error when the image is reconstructed. For each bit plane, a zone or partition of bit plane is created that encompasses all the non-zero bits of the DCT coefficients in that bit plane. The partition is created in accordance with a strategy that is selected from a number of options in dependence of the content of the overall signal and/or the actual bit plane. A different zoning strategy may be used for natural images than for graphic content, and the strategy may vary from bitplane to bitplane. The form as well as other properties such as size of each partition can thus be optimally adapted to the content. Two-dimensional rectangular zones and one-dimensional zigzag scan zones may be mixed within an image or even within a DCT block. The selected zone creating strategy is embedded in the bitstream, along with the DCT coefficient bits in the actual partition.