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 published on a yearly basis
Papers
More filters
Patent•
25 Sep 1992
TL;DR: In this article, a picture data is divided into plural bit planes in a picture processor and a different data compression system is applied to each bit plane, for example, the run length encoding system having plural prediction devices corresponding to the bit frequency pattern was applied to the low-order bit plane.
Abstract: PURPOSE:To attain efficient data compression by applying the proper compression method to each bit plane when a picture data has a data structure of plural bits. CONSTITUTION:The picture processor consists of a picture data reader 101, a picture data processing system 102, a picture data compression expansion processor 103, an input interface 104, a data compressor 105, a transmission line 106, a page buffer 107, a picture data storage device 108, a data expander 109, and a picture output device 111 or the like. A picture data is divided into plural bit planes in this processor and a different data compression system is applied to each bit plane. That is, for example, the run length encoding system is applied to a high-order bit plane, and the prediction coding system having plural prediction devices corresponding to the bit frequency pattern is applied to the low-order bit plane.
1 citations
Posted Content•
TL;DR: In this paper, a quad tree (QT) segmentation map derived from adjacent intensity images is proposed to estimate 2D spatial priority within the 3D space-time volume.
Abstract: With several advantages over conventional RGB cameras, event cameras have provided new opportunities for tackling visual tasks under challenging scenarios with fast motion, high dynamic range, and/or power constraint. Yet unlike image/video compression, the performance of event compression algorithm is far from satisfying and practical. The main challenge for compressing events is the unique event data form, i.e., a stream of asynchronously fired event tuples each encoding the 2D spatial location, timestamp, and polarity (denoting an increase or decrease in brightness). Since events only encode temporal variations, they lack spatial structure which is crucial for compression. To address this problem, we propose a novel event compression algorithm based on a quad tree (QT) segmentation map derived from the adjacent intensity images. The QT informs 2D spatial priority within the 3D space-time volume. In the event encoding step, events are first aggregated over time to form polarity-based event histograms. The histograms are then variably sampled via Poisson Disk Sampling prioritized by the QT based segmentation map. Next, differential encoding and run length encoding are employed for encoding the spatial and polarity information of the sampled events, respectively, followed by Huffman encoding to produce the final encoded events. Our Poisson Disk Sampling based Lossy Event Compression (PDS-LEC) algorithm performs rate-distortion based optimal allocation. On average, our algorithm achieves greater than 6x compression compared to the state of the art.
1 citations
Journal Article•
TL;DR: The paper introduces run-length encoding into algorithm to solve separation of connected component by image segmentation and shows that the parallel algori-thm runs faster than the traditional algorithm in multi-core processor.
Abstract: To meet the real-time requirement of moving objects detection and tracing based on omnidirectional vision,multi-core programming and parallel processing technology are applied to the redesign and realization of the connected component labeling algorithm The paper introduces run-length encoding into algorithm to solve separation of connected component by image segmentation Two segmented connected components for different tasks’ block are merged into one connected component Experiments show that the parallel algori-thm runs faster than the traditional algorithm in multi-core processor It has better solved the problem of hunger in multi-core processors and made the multi-core processor more efficient
1 citations
TL;DR: This paper proposes an efficient bitmask-based compression technique to drastically reduce the control word size while keeping the decompression overhead in an acceptable range, and only requires 1-3 on-chip RAMs, thus making it suitable for FPGA implementation.
1 citations
Patent•
26 Apr 2017
TL;DR: In this paper, a rapid area erosion algorithm and device based on a random structural element of run-length encoding was proposed to reduce the memory occupation and reduce the time consumption, which can effectively reduce the computation time.
Abstract: The present invention provides a rapid area erosion algorithm and device based on a random structural element of run-length encoding. The algorithm comprises: performing run-length encoding of an input image; and performing erosion of the encoded interest area by employing the structural element of run-length encoding. The rapid area erosion algorithm and device based on the random structural element of run-length encoding can effectively reduce the memory occupation and reduce the time consumption.
1 citations