Log in

Relevant bibliographies by topics / Run-length compression / Journal articles

To see the other types of publications on this topic, follow the link: Run-length compression.

Journal articles on the topic 'Run-length compression'

Author: Grafiati

Published: 4 June 2021

Last updated: 3 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Run-length compression.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Suwardiman, Suwardiman, and Fitri Bimantoro. "Implementasi Modifikasi Kompresi Run-Length Encoding pada Steganografi." Journal of Computer Science and Informatics Engineering (J-Cosine) 4, no. 2 (2020): 100–109. http://dx.doi.org/10.29303/jcosine.v4i2.109.

Full text

Abstract:

RLE is one of the methods to compress data, however it has disadvantages that the compressed data may become twice larger as the original size. Therefore, in this research RLE will be modified to solve the problem. In the experiment we tested 3 file format i.e. JPG, PNG and BMP. The testing on JPG and PNG shows that conventional RLE method is not able to compress all images because it obtained negative compression ratio with an average compression ratio about -98,2%, Meanwhile the compression with RLE modification shows that the all image successfully compress with an average compression ratio

APA, Harvard, Vancouver, ISO, and other styles

2

Cookson, John P., and George R. Thoma. "X-ray image compression using run length coding." Journal of Medical Systems 12, no. 4 (1988): 201–9. http://dx.doi.org/10.1007/bf00999500.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chianphatthanakit, Chiratheep, Anuparp Boonsongsrikul, and Somjet Suppharangsan. "Differential Run-Length Encryption in Sensor Networks." Sensors 19, no. 14 (2019): 3190. http://dx.doi.org/10.3390/s19143190.

Full text

Abstract:

Energy is a main concern in the design and deployment of Wireless Sensor Networks because sensor nodes are constrained by limitations of battery, memory, and a processing unit. A number of techniques have been presented to solve this power problem. Among the proposed solutions, the data compression scheme is one that can be used to reduce the volume of data for transmission. This article presents a data compression algorithm called Differential Run Length Encryption (D-RLE) consisting of three steps. First, reading values are divided into groups by using a threshold of Chauvenet’s criterion. S

APA, Harvard, Vancouver, ISO, and other styles

4

Strasser, Ben, Adi Botea, and Daniel Harabor. "Compressing Optimal Paths with Run Length Encoding." Journal of Artificial Intelligence Research 54 (December 27, 2015): 593–629. http://dx.doi.org/10.1613/jair.4931.

Full text

Abstract:

We introduce a novel approach to Compressed Path Databases, space efficient oracles used to very quickly identify the first edge on a shortest path. Our algorithm achieves query running times on the 100 nanosecond scale, being significantly faster than state-of-the-art first-move oracles from the literature. Space consumption is competitive, due to a compression approach that rearranges rows and columns in a first-move matrix and then performs run length encoding (RLE) on the contents of the matrix. One variant of our implemented system was, by a convincing margin, the fastest entry in the 201

APA, Harvard, Vancouver, ISO, and other styles

5

DUDHAGARA, CHETAN R., and HASAMUKH B. PATEL. "Performance Analysis of Data Compression using Lossless Run Length Encoding." Oriental journal of computer science and technology 10, no. 3 (2017): 703–7. http://dx.doi.org/10.13005/ojcst/10.03.22.

Full text

Abstract:

In a recent era of modern technology, there are many problems for storage, retrieval and transmission of data. Data compression is necessary due to rapid growth of digital media and the subsequent need for reduce storage size and transmit the data in an effective and efficient manner over the networks. It reduces the transmission traffic on internet also. Data compression try to reduce the number of bits required to store digitally. The various data and image compression algorithms are widely use to reduce the original data bits into lesser number of bits. Lossless data and image compression i

APA, Harvard, Vancouver, ISO, and other styles

6

Shan, Yanhu, Yongfeng Ren, Guoyong Zhen, and Kaiqun Wang. "An Enhanced Run-Length Encoding Compression Method for Telemetry Data." Metrology and Measurement Systems 24, no. 3 (2017): 551–62. http://dx.doi.org/10.1515/mms-2017-0039.

Full text

Abstract:

AbstractThe telemetry data are essential in evaluating the performance of aircraft and diagnosing its failures. This work combines the oversampling technology with the run-length encoding compression algorithm with an error factor to further enhance the compression performance of telemetry data in a multichannel acquisition system. Compression of telemetry data is carried out with the use of FPGAs. In the experiments there are used pulse signals and vibration signals. The proposed method is compared with two existing methods. The experimental results indicate that the compression ratio, precis

APA, Harvard, Vancouver, ISO, and other styles

7

S, Sivanantham, Aravind Babu S, Babu Ramki, and Mallick P.S. "Test Data Compression with Alternating Equal-Run-Length Coding." International Journal of Engineering & Technology 7, no. 4.10 (2018): 1089. http://dx.doi.org/10.14419/ijet.v7i4.10.27925.

Full text

Abstract:

This paper presents a new X-filling algorithm for test power reduction and a novel encoding technique for test data compression in scan-based VLSI testing. The proposed encoding technique focuses on replacing redundant runs of the equal-run-length vector with a shorter codeword. The effectiveness of this compression method depends on a number of repeated runs occur in the fully specified test set. In order to maximize the repeated runs with equal run length, the unspecified bits in the test cubes are filled with the proposed technique called alternating equal-run-length (AERL) filling. The res

APA, Harvard, Vancouver, ISO, and other styles

8

Balasubram, A., S. Saravanan, and Har Narayan Upadhyay. "Run-Length Based Efficient Compression for System-on-Chip." Journal of Artificial Intelligence 6, no. 1 (2012): 107–11. http://dx.doi.org/10.3923/jai.2013.107.111.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ye, Bo, Qian Zhao, Duo Zhou, Xiaohua Wang, and Min Luo. "Test data compression using alternating variable run-length code." Integration 44, no. 2 (2011): 103–10. http://dx.doi.org/10.1016/j.vlsi.2010.11.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lee, Lung-Jen, Wang-Dauh Tseng, Rung-Bin Lin, and Cheng-Ho Chang. "$2^{n}$ Pattern Run-Length for Test Data Compression." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 31, no. 4 (2012): 644–48. http://dx.doi.org/10.1109/tcad.2011.2176733.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Rhodes, Michael L., John F. Quinn, and John Silvester. "Locally Optimal Run-Length Compression Applied to CT Images." IEEE Transactions on Medical Imaging 4, no. 2 (1985): 84–90. http://dx.doi.org/10.1109/tmi.1985.4307701.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Mehta, Usha S., Kankar S. Dasgupta, and Niranjan M. Devashrayee. "Run-Length-Based Test Data Compression Techniques: How Far from Entropy and Power Bounds?—A Survey." VLSI Design 2010 (March 23, 2010): 1–9. http://dx.doi.org/10.1155/2010/670476.

Full text

Abstract:

The run length based coding schemes have been very effective for the test data compression in case of current generation SoCs with a large number of IP cores. The first part of paper presents a survey of the run length based codes. The data compression of any partially specified test data depends upon how the unspecified bits are filled with 1s and 0s. In the second part of the paper, the five different approaches for “don't care” bit filling based on nature of runs are proposed to predict the maximum compression based on entropy. Here the various run length based schemes are compared with max

APA, Harvard, Vancouver, ISO, and other styles

13

Nuha, Hilal H. "Lossless Text Image Compression using Two Dimensional Run Length Encoding." Jurnal Online Informatika 4, no. 2 (2020): 75. http://dx.doi.org/10.15575/join.v4i2.330.

Full text

Abstract:

Text images are used in many types of conventional data communication where texts are not directly represented by digital character such as ASCII but represented by an image, for instance facsimile file or scanned documents. We propose a combination of Run Length Encoding (RLE) and Huffman coding for two dimensional binary image compression namely 2DRLE. Firstly, each row in an image is read sequentially. Each consecutive recurring row is kept once and the number of occurrences is stored. Secondly, the same procedure is performed column-wise to the image produced by the first stage to obtain a

APA, Harvard, Vancouver, ISO, and other styles

14

Girishwaingankar, Poorva, and Sangeeta Milind Joshi. "The PHY-NGSC-Based ORT Run Length Encoding Scheme for Video Compression." International Journal of Image and Graphics 20, no. 02 (2020): 2050007. http://dx.doi.org/10.1142/s0219467820500072.

Full text

Abstract:

This paper proposes a compression algorithm using octonary repetition tree (ORT) based on run length encoding (RLE). Generally, RLE is one type of lossless data compression method which has duplication problem as a major issue due to the usage of code word or flag. Hence, ORT is offered instead of using a flag or code word to overcome this issue. This method gives better performance by means of compression ratio, i.e. 99.75%. But, the functioning of ORT is not good in terms of compression speed. For that reason, physical- next generation secure computing (PHY-NGSC) is hybridized with ORT to ra

APA, Harvard, Vancouver, ISO, and other styles

15

kumar, K. S. Ganesh, Karen Thangam Jacob, and B. Manjurathi. "Test Data Compression Using Variable Prefix Run Length (VPRL) Code." IOSR journal of VLSI and Signal Processing 4, no. 2 (2014): 91–95. http://dx.doi.org/10.9790/4200-04219195.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Ishikawa, Shota, Haiyuan Wu, Chongke Bi, Qian Chen, Hirokazu Taki, and Kenji Ono. "Fluid Data Compression and ROI Detection Using Run Length Method." Procedia Computer Science 35 (2014): 1284–91. http://dx.doi.org/10.1016/j.procs.2014.08.228.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Nunez, J. L., and S. Jones. "Run-length coding extensions for high performance hardware data compression." IEE Proceedings - Computers and Digital Techniques 150, no. 6 (2003): 387. http://dx.doi.org/10.1049/ip-cdt:20030750.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Aldemir, Erdoğan, Gulay Tohumoglu, and M. Alper Selver. "Binary medical image compression using the volumetric run-length approach." Imaging Science Journal 67, no. 3 (2019): 123–35. http://dx.doi.org/10.1080/13682199.2019.1565695.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Arazaki, S. I., M. Saigusa, S. Hashiguchi, M. Ohki, M. Uchiyama, and F. Itoh. "Image data compression by DCT with adaptive run-length coding." IEEE Transactions on Consumer Electronics 37, no. 4 (1991): 860–66. http://dx.doi.org/10.1109/30.106950.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

HUR, Y. "Test Data Compression Using a Hybrid Run-Length Code Method." IEICE Transactions on Information and Systems E88-D, no. 7 (2005): 1607–9. http://dx.doi.org/10.1093/ietisy/e88-d.7.1607.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Tseng, Wang-Dauh, and Lung-Jen Lee. "Test Data Compression Using Multi-dimensional Pattern Run-length Codes." Journal of Electronic Testing 26, no. 3 (2010): 393–400. http://dx.doi.org/10.1007/s10836-009-5138-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Abu-Taieh, Evon, and Issam AlHadid. "CRUSH: A New Lossless Compression Algorithm." Modern Applied Science 12, no. 11 (2018): 387. http://dx.doi.org/10.5539/mas.v12n11p387.

Full text

Abstract:

Multimedia is highly competitive world, one of the properties that is reflected is speed of download and upload of multimedia elements: text, sound, pictures, animation. This paper presents CRUSH algorithm which is a lossless compression algorithm. CRUSH algorithm can be used to compress files. CRUSH method is fast and simple with time complexity O(n) where n is the number of elements being compressed.Furthermore, compressed file is independent from algorithm and unnecessary data structures. As the paper will show comparison with other compression algorithms like Shannon&ndash;Fano code, H

APA, Harvard, Vancouver, ISO, and other styles

23

Abu-Taieh, Evon, and Issam AlHadid. "CRUSH: A New Lossless Compression Algorithm." Modern Applied Science 12, no. 11 (2018): 406. http://dx.doi.org/10.5539/mas.v12n11p406.

Full text

Abstract:

Multimedia is highly competitive world, one of the properties that is reflected is speed of download and upload of multimedia elements: text, sound, pictures, animation. This paper presents CRUSH algorithm which is a lossless compression algorithm. CRUSH algorithm can be used to compress files. CRUSH method is fast and simple with time complexity O(n) where n is the number of elements being compressed.Furthermore, compressed file is independent from algorithm and unnecessary data structures. As the paper will show comparison with other compression algorithms like Shannon&ndash;Fano code, H

APA, Harvard, Vancouver, ISO, and other styles

24

Sadiq, B. J. S., V. Yu Tsviatkou та М. N. Bobov. "Аdaptive combined image coding with prediction of arithmetic code volume". Doklady BGUIR 19, № 2 (2021): 31–39. http://dx.doi.org/10.35596/1729-7648-2021-19-2-31-39.

Full text

Abstract:

The problem of increasing the efficiency of coding of halftone images in the space of bit planes of differences in pixel values obtained using differential coding (DPCM – Differential pulse-code modulation) is considered. For a compact representation of DPCM pixel values, it is proposed to use a combined compression encoder that implements arithmetic coding and run-length coding. An arithmetic encoder provides high compression ratios, but has high computational complexity and significant encoding overhead. This makes it effective primarily for compressing the mean-value bit-planes of DPCM pixe

APA, Harvard, Vancouver, ISO, and other styles

25

Sinaga, Helbert, Poltak Sihombing, and Handrizal Handrizal. "Perbandingan Algoritma Huffman Dan Run Length Encoding Untuk Kompresi File Audio." Talenta Conference Series: Science and Technology (ST) 1, no. 1 (2018): 010–15. http://dx.doi.org/10.32734/st.v1i1.183.

Full text

Abstract:

Penelitian ini dilakukan untuk menganalisis perbandingan hasil kompresi dan dekompresi file audio*.mp3 dan *.wav. Kompresi dilakukan dengan mengurangi jumlah bit yang diperlukan untuk menyimpan atau mengirim file tersebut. Pada penelitian ini penulis menggunakan algoritma Huffman dan Run Length Encoding yang merupakan salah satu teknik kompresi yang bersifat lossless.Algoritma Huffman memiliki tiga tahapan untuk mengkompres data, yaitu pembentukan pohon, encoding dan decodingdan berkerja berdasarkan karakter per karakter. Sedangkan teknik run length ini bekerja berdasarkan sederetan karakter y

APA, Harvard, Vancouver, ISO, and other styles

26

Tian, Zhi Jian, and Fa Yong Zhao. "A Comprehensive Test Compression Scheme Based on Precomputed Test Sets." Advanced Materials Research 756-759 (September 2013): 533–41. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.533.

Full text

Abstract:

To cope with increasingly rigorous challenges that large scale digital integrated circuit testing is confronted with, a comprehensive compression scheme consisting of test-bit rearrangement algorithm, run-length assignment strategy and symmetrical code is proposed. The presented test-bit rearrangement algorithm can fasten dont-care bits, 0s or 1s in every test pattern on one of its end to the greatest extent so as to lengthen end-run blocks and decrease number of short run-lengths. A dynamical dont-care assignment strategy based on run-lengths can be used to specify the remaining dont-care bit

APA, Harvard, Vancouver, ISO, and other styles

27

Alsaade, Fawaz Waselallah, and Mahaboob Basha Shaik. "Joint Photographic Experts Group Image Compression using Revised Run Length Encoding." Research Journal of Information Technology 9, no. 1 (2016): 38–45. http://dx.doi.org/10.3923/rjit.2017.38.45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

WU, Diancheng, Yu LIU, Hao ZHU, Donghui WANG, and Chengpeng HAO. "A Novel Pattern Run-Length Coding Method for Test Data Compression." IEICE Transactions on Electronics E96.C, no. 9 (2013): 1201–4. http://dx.doi.org/10.1587/transele.e96.c.1201.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Agulhari, Cristiano M., Ivanil S. Bonatti, and Pedro L. D. Peres. "An Adaptive Run Length Encoding method for the compression of electrocardiograms." Medical Engineering & Physics 35, no. 2 (2013): 145–53. http://dx.doi.org/10.1016/j.medengphy.2010.03.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Arif, Mohammad, and R. S. Anand. "Effect of noise on speech compression in Run Length Encoding scheme." International Journal of Signal and Imaging Systems Engineering 4, no. 4 (2011): 248. http://dx.doi.org/10.1504/ijsise.2011.044550.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Stabno, Michał, and Robert Wrembel. "RLH: Bitmap compression technique based on run-length and Huffman encoding." Information Systems 34, no. 4-5 (2009): 400–414. http://dx.doi.org/10.1016/j.is.2008.11.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Liu, Jilin, and M. W. Engelhorn. "Improvement in the locally optimum run-length compression of CT images." Journal of Biomedical Engineering 12, no. 2 (1990): 108–10. http://dx.doi.org/10.1016/0141-5425(90)90130-f.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Khan, Sulaiman, Shah Nazir, Anwar Hussain, Amjad Ali, and Ayaz Ullah. "An efficient JPEG image compression based on Haar wavelet transform, discrete cosine transform, and run length encoding techniques for advanced manufacturing processes." Measurement and Control 52, no. 9-10 (2019): 1532–44. http://dx.doi.org/10.1177/0020294019877508.

Full text

Abstract:

Image compression plays a key role in the transmission of an image and storage capacity. Image compression aims to reduce the size of the image with no loss of significant information and no loss of quality in the image. To reduce the storage capacity of the image, the image compression is proposed in order to offer a compact illustration of the information included in the image. Image compression exists in the form of lossy or lossless. Even though image compression mechanism has a prominent role for compressing images, certain conflicts still exist in the available techniques. This paper pre

APA, Harvard, Vancouver, ISO, and other styles

34

Sundara Rajan, Priya Vasanth, and A. Lenin Fred. "An Efficient Compound Image Compression Using Optimal Discrete Wavelet Transform and Run Length Encoding Techniques." Journal of Intelligent Systems 28, no. 1 (2019): 87–101. http://dx.doi.org/10.1515/jisys-2016-0096.

Full text

Abstract:

Abstract Reduction in file size leads to reduction in the number of bits required to store it. When data is compressed, it must be decompressed into its original form bit for bit. Compound images are defined as images that contain a combination of text, natural (photo) images and graphic images. Here, compression is the process of reducing the amount of data required to represent information. Image compression is done on the basis of various loss and lossless compression algorithms. This research work deals with the preprocessing and transformations used to compress a compound image to produce

APA, Harvard, Vancouver, ISO, and other styles

35

Journal, Baghdad Science. "Combined DWT and DCT Image Compression Using Sliding RLE Technique." Baghdad Science Journal 8, no. 3 (2011): 832–39. http://dx.doi.org/10.21123/bsj.8.3.832-839.

Full text

Abstract:

A number of compression schemes were put forward to achieve high compression factors with high image quality at a low computational time. In this paper, a combined transform coding scheme is proposed which is based on discrete wavelet (DWT) and discrete cosine (DCT) transforms with an added new enhancement method, which is the sliding run length encoding (SRLE) technique, to further improve compression. The advantages of the wavelet and the discrete cosine transforms were utilized to encode the image. This first step involves transforming the color components of the image from RGB to YUV plane

APA, Harvard, Vancouver, ISO, and other styles

36

Radhika, K., and D. Mohana Geetha. "Augmented Recurrence Hopping Based Run-Length Coding for Test Data Compression Applications." Wireless Personal Communications 102, no. 4 (2018): 3361–74. http://dx.doi.org/10.1007/s11277-018-5372-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Ruan, Xiaoyu, and Rajendra S. Katti. "Data-Independent Pattern Run-Length Compression for Testing Embedded Cores in SoCs." IEEE Transactions on Computers 56, no. 4 (2007): 545–56. http://dx.doi.org/10.1109/tc.2007.1007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Berghorn, W., T. Boskamp, M. Lang, and H. O. Peitgen. "Fast variable run-length coding for embedded progressive wavelet-based image compression." IEEE Transactions on Image Processing 10, no. 12 (2001): 1781–90. http://dx.doi.org/10.1109/83.974563.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Erdeljan, Andrea, Bogdan Vukobratović, and Rastislav Struharik. "IP core for efficient zero-run length compression of CNN feature maps." Telfor Journal 10, no. 1 (2018): 44–49. http://dx.doi.org/10.5937/telfor1801044e.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Davis, G., L. Lau, R. Young, F. Duncalfe, and L. Brebber. "Parallel Run Length Encoding Compression: Reducing I/o in dYnamic Environmental Simulations." International Journal of High Performance Computing Applications 12, no. 4 (1998): 396–410. http://dx.doi.org/10.1177/109434209801200402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Liu, Yong-Kui, Borut Žalik, Peng-jie Wang, and David Podgorelec. "Directional difference chain codes with quasi-lossless compression and run-length encoding." Signal Processing: Image Communication 27, no. 9 (2012): 973–84. http://dx.doi.org/10.1016/j.image.2012.07.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Anandita, Ida Bagus Gede, I. Gede Aris Gunadi, and Gede Indrawan. "Analisis Kinerja Dan Kualitas Hasil Kompresi Pada Citra Medis Sinar-X Menggunakan Algoritma Huffman, Lempel Ziv Welch Dan Run Length Encoding." SINTECH (Science and Information Technology) Journal 1, no. 1 (2018): 7–15. http://dx.doi.org/10.31598/sintechjournal.v1i1.179.

Full text

Abstract:

Technological progress in the medical area made medical images like X-rays stored in digital files. The medical image file is relatively large so that the image needs to be compressed. The lossless compression technique is an image compression where the decompression results are the same as the original or no information lost in the compression process. The existing algorithms on lossless compression techniques are Run Length Encoding (RLE), Huffman, and Lempel Ziv Welch (LZW). This study compared the performance of the three algorithms in compressing medical images. The result of image decomp

APA, Harvard, Vancouver, ISO, and other styles

43

Irshid, Mansour I. "A Simple Binary Run-Length Compression Technique for Non-Binary Sources Based on Source Mapping." Active and Passive Electronic Components 24, no. 4 (2001): 211–21. http://dx.doi.org/10.1155/2001/23505.

Full text

Abstract:

In this paper, we propose a very simple and efficient binary run-length compression technique for non-binary sources. The technique is based on mapping the non-binary information source into an equivalent binary source using a new fixed-length code instead of the ASCII code. The codes are chosen such that the probability of one of the two binary symbols; say zero, at the output of the mapper is made as small as possible. Moreover, the “all ones” code is excluded from the code assignments table to ensure the presence of at least one “zero” in each of the output codewords. Compression is achieve

APA, Harvard, Vancouver, ISO, and other styles

44

A. Otair, Mohammed, and Ahmad M. Odat. "Does an Arithmetic Coding Followed by Run-length Coding Enhance the Compression Ratio?" Research Journal of Applied Sciences, Engineering and Technology 10, no. 7 (2015): 736–41. http://dx.doi.org/10.19026/rjaset.10.2425.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Sharmila, K., and K. Kuppu samy. "An Efficient Image Compression Method using DCT, Fractal and Run Length Encoding Techniques." International Journal of Engineering Trends and Technology 13, no. 6 (2014): 287–90. http://dx.doi.org/10.14445/22315381/ijett-v13p257.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Hardi, S. M., B. Angga, M. S. Lydia, I. Jaya, and J. T. Tarigan. "Comparative Analysis Run-Length Encoding Algorithm and Fibonacci Code Algorithm on Image Compression." Journal of Physics: Conference Series 1235 (June 2019): 012107. http://dx.doi.org/10.1088/1742-6596/1235/1/012107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Wan, M. Y., Y. Ding, Y. Pan, S. Zhou, and X. L. Yan. "Test data compression using extended frequency-directed run length code based on compatibility." Electronics Letters 46, no. 6 (2010): 404. http://dx.doi.org/10.1049/el.2010.2449.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Zhang, Jiawei, and Dawei Sun. "Improvement of data compression technology for power dispatching based on run length encoding." Procedia Computer Science 183 (2021): 526–32. http://dx.doi.org/10.1016/j.procs.2021.02.093.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Mados, Branslav, Zuzana Bilanová та Ján Hurtuk. "ΔRLE". Journal of information and organizational sciences 45, № 1 (2021): 329–49. http://dx.doi.org/10.31341/jios.45.1.15.

Full text

Abstract:

Lossless data compression algorithms can use statistical redundancy to represent data using a fewer number of bits in comparison to the original uncompressed data. Run-Length Encoding (RLE) is one of the simplest lossless compression algorithms in terms of understanding its principles and software implementation, as well as in terms of temporal and spatial complexity. If this principle is applied to individual bits of original uncompressed data without respecting the byte boundaries, this approach is referred to as bit-level Run-Length Encoding. Lightweight algorithm for lossless data compress

APA, Harvard, Vancouver, ISO, and other styles

50

Xin, Rui, and Tinghua Ai. "Run length coding and efficient compression of hexagonal raster data based on Gosper curve." Abstracts of the ICA 1 (July 15, 2019): 1–2. http://dx.doi.org/10.5194/ica-abs-1-411-2019.

Full text

Abstract:

<p><strong>Abstract.</strong> Compared with regular quadrilateral grid, regular hexagonal grid is isotropy and has higher cell compactness and sampling density. This gives regular hexagonal grid advantages in visual display, spatial analysis, and many other aspects. However, the studies of raster data mainly focus on regular quadrilateral grid, and various encoding methods are also focused on it. The researches on hexagonal raster data are relatively insufficient.</p><p>In this paper, encoding and compression for regular hexagonal grid are studied. By introducing

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!