scispace - formally typeset
Search or ask a question

Showing papers on "Run-length encoding published in 2004"


Patent
01 Dec 2004
TL;DR: In this paper, variable bit size run length encoding (RLE) is used to encode uninterrupted runs of adjacent first symbols and adjacent second symbols within a sequence that may represent an image.
Abstract: Variable bit size run length encoding (“RLE”) is used to encode uninterrupted runs of adjacent first symbols and adjacent second symbols within a sequence that may represent an image. The symbols may be 1s and 0s. The bit size used to encode a run length for a current run is varied in dependence on the bit sized used or required to encode a run length of a previous run of the same symbol type. Further, an image to be encoded may be transformed into an image/bit sequence representing changes from line to line in the image. By so transforming the image, the correlation from run length to run length of like colors is increased, thereby improving the efficiency of the variable bit size RLE.

23 citations


Proceedings ArticleDOI
30 Jun 2004
TL;DR: Experiments show that simplified context clustering is very useful in error modeling for prediction refinement and the execution time of FSWAP can be accelerated with minor degradation in the bit rates associated with the modifications.
Abstract: In this paper, we propose a switching adaptive predictor (FSWAP) with run-length encoding for lossless image coding. The proposed FSWAP system has two operation modes; run mode and regular mode. If the members in the texture context of the coding pixel have identical grey values, the run mode is used, otherwise the regular mode is used. The run mode, using run-length coding, with an arithmetic coder, is very useful for images with flat regions. The regular mode borrows the switching predictor structure in SWAP (Lih-Jen Kau et al, IEEE Trans. Fuzzy Systems) with some modifications. Experiments show that simplified context clustering is very useful in error modeling for prediction refinement. Furthermore, the execution time of FSWAP can be accelerated with minor degradation in the bit rates associated with the modifications. Comparisons of the proposed system to existing state-of-the-art predictive coders are given to demonstrate its coding efficiency

19 citations


Journal ArticleDOI
TL;DR: An extendable volumetric representation based on run- lengths called spatial run-length encoding (S-RLE) is presented and has the features of efficient memory usage, quick collision detection, inherent representation for heterogeneous objects, and fast visual rendering.
Abstract: In this paper, an extendable volumetric representation based on run-lengths called spatial run-length encoding (S-RLE) is presented. The S-RLE representation is developed for a haptic shape modeling system that is based on simulated machining processes. In the system, shape modeling is simulated as virtual material removal processes similar to machining processes with volume-based haptic rendering. The object and the tools are represented by S-RLE. The data structure of S-RLE consists of two cross-referenced databases: one is a stack of lists in geometrical domain, recording the runs describing the space occupation of the object; the other is a table in physical domain, describing the physical properties of each element. The latter is extendable to include more diverse physical properties such as parts composed of heterogeneous materials. Algorithms for geometric operations and haptic rendering based on S-RLE are developed. The proposed S-RLE data structure has the features of efficient memory usage, quick collision detection, inherent representation for heterogeneous objects, and fast visual rendering. Copyright 2003 Elsevier Ltd.

10 citations


GO Guo-qin1
01 Jan 2004
TL;DR: An effective approach of vectorization by using the run-length encoding system of compressed raster is developed in this paper, and the implementation procedures of the algorithm are given in detail.
Abstract: In order to overcome the restriction of the traditional methods of converting raster to vector, an effective approach of vectorization by using the run-length encoding system of compressed raster is developed in this paper, and the implementation procedures of the algorithm are given in detail. Because the run-length encoding system has the characteristics of accessing easy, proper compressed ratio, and inter-converting with normal raster rapidly, by using this approach, the computer's ability and speed of handling large scale and complex raster with high precision will be promoted. It can be used to extracting the attribute's borderline from the results of raster-type geographical spatial analysis and remote sensing images, this approach has been proved to be high efficiency and implementation easy in the test.

10 citations


Book ChapterDOI
18 Nov 2004
TL;DR: It is shown that at the same compression rate a lower loss of information can be obtained by using fully 3D wavelets as compared to iterated 2D methods.
Abstract: This paper deals with the implementation of 3D wavelets techniques for compression of medical images, specifically in the MRI modality. We show that at the same compression rate a lower loss of information can be obtained by using fully 3D wavelets as compared to iterated 2D methods. An adaptive thresholding step is performed in each sub-band and a simple Run Length Encoding (RLE) method for compression is finally used. A reconstruction algorithm is then implemented and a comparison study of the reconstructed image is then proposed, showing the high performance of the proposed algorithm.

3 citations


Patent
14 Oct 2004
TL;DR: In this paper, a plane dividing section divides an enlarged image into blocks by receiving the enlarged image from an image forming section 201 and interpolation information of an interpolating method used when the image is generated.
Abstract: PROBLEM TO BE SOLVED: To provide an image encoder, an image encoding method and a program capable of preventing lowering of encoding efficiency due to nonconformity of an interpolating method and an encoding system. SOLUTION: A plane dividing section 202 divides an enlarged image into blocks by receiving the enlarged image from an image forming section 201 and interpolation information of an interpolating method used when the image is generated. The image is then divided into a plurality of planes by setting parameters depending on the interpolation information of the interpolating method. Encoding is performed by applying different encoding methods to respective planes divided at a run length encoding section 203 and a JPEG encoding section 204. COPYRIGHT: (C)2005,JPO&NCIPI

1 citations


Patent
15 Jul 2004
TL;DR: In this article, an image encoder for reducing the capacity of a line memory and efficiently applying encoding compression to a high-resolution image even when the high resolution image includes character information was proposed.
Abstract: PROBLEM TO BE SOLVED: To provide an image encoder for reducing the capacity of a line memory and efficiently applying encoding compression to a high resolution image even when the high resolution image includes character information. SOLUTION: The line memory 41 and an exclusive OR circuit 42 sequentially detect a difference between color codes at corresponding pixel positions in a horizontal line and a just preceding horizontal line adjacent to the horizontal line as to each of the horizontal lines in a block every time the block is updated with respect to an image equally divided in M (M: an optional integer of 1 or over) in the horizontal direction. Further, when a code generation / output circuit 44 performs run length encoding after a run end detection circuit 43 detects a run from the difference corresponding to the horizontal lines from the circuit 42, the circuit 44 applies the run length encoding to a code word with respect to the first run, the code word including difference information for the run, and the circuit 44 respectively applies the run length encoding to other code words corresponding to the runs other than the first run, the other code words including transition type information denoting a type of transition to the difference for the concerned run from the difference for its just preceding run in place of the difference information for the concerned run. COPYRIGHT: (C)2004,JPO&NCIPI

1 citations


Journal Article
01 Jan 2004-Scopus
TL;DR: In this article, an efficient run-length encoding of binary sources with unknown statistics is described, which uses adaptive Golomb-Rice coders, using a maximum-likelihood approach.
Abstract: This paper describes an efficient run-length encoding of binary sources with unknown statistics. Binary entropy coders are used in many multimedia codec standards, which uses adaptive Golomb-Rice coders. Using a maximum-likelihood approach, an excess rate for the Golomb-like coder when compared to an adaptive Rice coder is up to 4.2% for binary sources with unknown statistics with respect to the source entropy.

Patent
06 May 2004
TL;DR: In this paper, a bitmap is overlaid on the video separation layer, e.g., synchronized video subtitles, animations and navigation menus, and therefore contain many transparent pixels.
Abstract: 字幕旨在呈现编码为像素位图的文字信息和图形数据。 Subtitles intended encoded as pixel bitmaps rendered text information and graphical data. 字幕位图的大小可以超过视频帧的维度,从而一次只显示一部分。 The size of the subtitle bitmaps may exceed video frame dimensions, so as to display only a part. 位图是覆盖在视频之上的分离层,例如,同步视频字幕、动画以及导航菜单,因此,包含许多透明像素。 A bitmap is overlaid on the video separation layer, e.g., synchronized video subtitles, animations and navigation menus, and therefore contain many transparent pixels. 通过四级行程长度编码,实现了对HDTV(例如,针对蓝光光盘预记录格式定义为每帧1920×1280像素,其对这种字幕位图提供最优化压缩结果)位图编码的高级修改。 By four run-length encoding, to achieve (e.g., for a Blu-ray Disc Prerecorded format is defined for each frame of 1920 × 1280 pixels, which provide optimal compression result of this subtitle bitmap) advanced editing bitmap encoding for HDTV. 使用第二或第三短的码字来对优选色彩(例如,透明)的像素的较短或较长序列进行编码,而使用最短码字来对不同色彩的单个像素进行编码,并且使用第三或第四短的码字来对相等色彩的像素序列进行编码。 Using the second or third shortest code words of the preferred color (e.g., transparent) of shorter or longer sequences of pixels is encoded using the shortest code words to code a single pixel of different colors, and a third or fourth shortest code words to the sequence of pixels of equal color coded.