scispace - formally typeset
Search or ask a question
Topic

Run-length encoding

About: Run-length encoding is a research topic. Over the lifetime, 504 publications have been published within this topic receiving 4441 citations. The topic is also known as: RLE.


Papers
More filters
Patent
14 Dec 2018
TL;DR: In this article, a memory controller is used to generate an encoded physical address using a run length encoding (RLE) algorithm on a physical address to reduce the length of the encoded address.
Abstract: Apparatus and methods are disclosed, including using a memory controller to generate an encoded physical address using a run length encoding (RLE) algorithm on a physical address to reduce a length of the encoded physical address, and storing the encoded physical address as a map entry of a logical-to-physical (L2P)) table in a cache random access memory of the memory controller
Proceedings ArticleDOI
25 Jul 2010
TL;DR: A new fast algorithm for the remote sensing image progressive compression was proposed that can decrease the coding and decoding time evidently compared with the JPEG2000 algorithm, while maintains favorable loss compression performance.
Abstract: A new fast algorithm for the remote sensing image progressive compression was proposed. This algorithm has three embedded characters (resolution, region of interest, and fidelity), low computing complexity and favorable loss compression performance. Every resolution of wavelet transform coefficients were partitioned into many precincts according to the area. In each sub-band of each precinct, the spatio-temporal neighborhood relationship was used to remove redundancies between different bit-planes and neighbors in the same bit-plane, and the bits of every bit-plane were modeled and reordered to form three sub-processes and run-length encoded only in one pass. The adaptive Golomb_Rice coding for the dyadic sequence was used to entropy code effectively. In addition, the uniform scalar quantization with dead-zone and adjustable parameter was used. The experiments showed that the new algorithm can decrease the coding and decoding time evidently compared with the JPEG2000 algorithm, while maintains favorable loss compression performance.
Journal Article
TL;DR: A new lossless reversible data hiding technique is presented coupled with compression that can be used to hide patient's information hiding at boundary of Region of Interest (ROI) in medical images.
Abstract: In this paper, a new lossless reversible data hiding technique is presented coupled with compression. Medical images, different from other images, require additional care when embedding other information inside them because the additional information should not change the image quality and readability. Lossless data hiding techniques are used for overcome any misdiagnose caused by embedding data into medical images. In this paper, proposed a lossless reversible data hiding. The proposed technique implements a pure lossless reversible data hiding scheme. It can be used to hide patient's information hiding at boundary of Region of Interest (ROI) in medical images. Run Length Encoding is used for compression. It has recovery facility without any loss of information. The experimental results show that the host image and hidden information can be exactly retrieved from the Stego image. Keywords: Reversible data hiding, Medical image compression, RLE
Journal ArticleDOI
19 Nov 2020
TL;DR: The characteristic of video coding from the scratch of key frame selection to the evolutions of various standards is discussed and the characteristics of video compression techniques are discussed.
Abstract: Video compression is the process of decreasing the number of bits required to represent a certain video. Video compression can be done by a specific algorithm for deciding the most ideal approach to reduce the amount of data storage. The video file is coded in such a way that consuming less space than the original file and is easier to transmit over the Internet. The basic idea of video compression based on removing the redundant data that exists in the video. There are four types of redundancy in digital video: colorize redundancy, temporal redundancy, statistical redundancy, and spatial redundancy. Video compression algorithms must reduce these redundancies in such a way that keep the quality of the compressed video when the decompression process is done. Most video compression techniques consist of the following steps: Motion Estimation,Motion Compensation, Discrete Cosine Transform, Run Length Encoding, Huffman Coding. Frame Difference. This paper discusses the characteristic of video coding from the scratch of key frame selection to the evolutions of various standards
Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
76% related
Feature extraction
111.8K papers, 2.1M citations
75% related
Convolutional neural network
74.7K papers, 2M citations
74% related
Image processing
229.9K papers, 3.5M citations
74% related
Cluster analysis
146.5K papers, 2.9M citations
74% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202123
202020
201920
201828
201727
201624