Готові списки джерел за темами / Run-Length encoding method

Добірка наукової літератури з теми "Run-Length encoding method"

Автор: Grafiati

Опубліковано: 10 грудня 2022

Оновлено: 28 січня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Статті в журналах
Дисертації
Частини книг
Тези доповідей конференцій

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Run-Length encoding method".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Run-Length encoding method"

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 (December 31, 2020): 100–109. http://dx.doi.org/10.29303/jcosine.v4i2.109.

Повний текст джерела

Анотація:

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 about 0,17%. The testing on BMP shows the conventional RLE method successfully compress 5 files out of 11 tested images with average compression ratio about -34,7%, Meanwhile the compression with modified RLE successfully compress all tested images with average compression ratio about 18,8 %.

Стилі APA, Harvard, Vancouver, ISO та ін.

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 (September 1, 2017): 551–62. http://dx.doi.org/10.1515/mms-2017-0039.

Повний текст джерела

Анотація:

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, precision, and distortion degree of the telemetry data are improved significantly compared with those obtained by the existing methods. The implementation and measurement of the proposed telemetry data compression method show its effectiveness when used in a high-precision high-capacity multichannel acquisition system.

Стилі APA, Harvard, Vancouver, ISO та ін.

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 (February 2013): 145–53. http://dx.doi.org/10.1016/j.medengphy.2010.03.003.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

CHOUAKRI, Sid Ahmed, and Fatiha MESKINE. "Three States QRLE (Quantized Run Length Encoding) Based JPEG Image Compression Method." Eurasia Proceedings of Science Technology Engineering and Mathematics 21 (December 31, 2022): 173–81. http://dx.doi.org/10.55549/epstem.1225063.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Liu, Hanlin, Jingju Liu, Xuehu Yan, Pengfei Xue, and Dingwei Tan. "An Audio Steganography Based on Run Length Encoding and Integer Wavelet Transform." International Journal of Digital Crime and Forensics 13, no. 2 (March 2021): 16–34. http://dx.doi.org/10.4018/ijdcf.2021030102.

Повний текст джерела

Анотація:

This paper proposes an audio steganography method based on run length encoding and integer wavelet transform which can be used to hide secret message in digital audio. The major contribution of the proposed scheme is to propose an audio steganography with high capacity, where the secret information is compressed by run length encoding. In the applicable scenario, the main purpose is to hide as more information as possible in the cover audio files. First, the secret information is chaotic scrambling, then the result of scrambling is run length encoded, and finally, the secret information is embedded into integer wavelet coefficients. The experimental results and comparison with existing technique show that by utilizing the lossless compression of run length encoding and anti-attack of wavelet domain, the proposed method has improved the capacity, good audio quality, and can achieve blind extraction while maintaining imperceptibility and strong robustness.

Стилі APA, Harvard, Vancouver, ISO та ін.

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 (April 2020): 2050007. http://dx.doi.org/10.1142/s0219467820500072.

Повний текст джерела

Анотація:

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 raise the compression speed. It uses an MPI-open MP programming paradigm on ORT to improve the compression speed of encoder. The planned work achieves multiple levels of parallelism within an image such as MPI and open MP for parallelism across a group of pictures level and slice level, respectively. At the same time, wide range of data compression like multimedia, executive files and documents are possible in the proposed method. The performance of the proposed work is compared with other methods like accordian RLE, context adaptive variable length coding (CAVLC) and context-based arithmetic coding (CBAC) through the implementation in Matlab working platform.

Стилі APA, Harvard, Vancouver, ISO та ін.

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 (August 10, 2017): 703–7. http://dx.doi.org/10.13005/ojcst/10.03.22.

Повний текст джерела

Анотація:

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 is a special class of data compression. This algorithm involves in reducing numbers of bits by identifying and eliminating statistical data redundancy in input data. It is very simple and effective method. It provides good lossless compression of input data. This is useful on data that contains many consecutive runs of the same values. This paper presents the implementation of Run Length Encoding for data compression.

Стилі APA, Harvard, Vancouver, ISO та ін.

Nechta, Ivan V. "New method of steganalysis for text data obtained by synonym run-length encoding." Bezopasnost informacionnyh tehnology 25, no. 2 (May 2018): 114–20. http://dx.doi.org/10.26583/bit.2018.2.10.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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 (July 25, 2014): 287–90. http://dx.doi.org/10.14445/22315381/ijett-v13p257.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Helong, Dingtao Shen, Wenlong Chen, Yiheng Liu, Yueping Xu, and Debao Tan. "Run-Length-Based River Skeleton Line Extraction from High-Resolution Remote Sensed Image." Remote Sensing 14, no. 22 (November 18, 2022): 5852. http://dx.doi.org/10.3390/rs14225852.

Повний текст джерела

Анотація:

Automatic extraction of the skeleton lines of river systems from high-resolution remote-sensing images has great significance for surveying and managing water resources. A large number of existing methods for the automatic extraction of skeleton lines from raster images are primarily used for simple graphs and images (e.g., fingerprint, text, and character recognition). These methods generally are memory intensive and have low computational efficiency. These shortcomings preclude their direct use in the extraction of skeleton lines from large volumes of high-resolution remote-sensing images. In this study, we developed a method to extract river skeleton lines based entirely on run-length encoding. This method attempts to replace direct raster encoding with run-length encoding for storing river data, which can considerably compress raster data. A run-length boundary tracing strategy is used instead of complete raster matrix traversal to quickly determine redundant pixels, thereby significantly improving the computational efficiency. An experiment was performed using a 0.5 m-resolution remote-sensing image of Yiwu city in the Chinese province of Zhejiang. Raster data for the rivers in Yiwu were obtained using both the DeepLabv3+ deep learning model and the conventional visual interpretation method. Subsequently, the proposed method was used to extract the skeleton lines of the rivers in Yiwu. To compare the proposed method with the classical raster-based skeleton line extraction algorithm developed by Zhang and Suen in terms of memory consumption and computational efficiency, the visually interpreted river data were used to generate skeleton lines at different raster resolutions. The results showed that the proposed method consumed less than 1% of the memory consumed by the classical method and was over 10 times more computationally efficient. This finding suggests that the proposed method has the potential for river skeleton line extraction from terabyte-scale remote-sensing image data on personal computers.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Run-Length encoding method"

Haughey, Kyle J. "Boundless Fluids Using the Lattice-Boltzmann Method." DigitalCommons@CalPoly, 2009. https://digitalcommons.calpoly.edu/theses/117.

Повний текст джерела

Анотація:

Computer-generated imagery is ubiquitous in today's society, appearing in advertisements, video games, and computer-animated movies among other places. Much of this imagery needs to be as realistic as possible, and animators have turned to techniques such as fluid simulation to create scenes involving substances like smoke, fire, and water. The Lattice-Boltzmann Method (LBM) is one fluid simulation technique that has gained recent popularity due to its relatively simple basic algorithm and the ease with which it can be distributed across multiple processors. Unfortunately, current LBM simulations also suffer from high memory usage and restrict free surface fluids to domains of fixed size. This thesis modifies the LBM to utilize a recursive run-length-encoded (RLE) grid data structure instead of the standard fixed array of grid cells, which reduces the amount of memory required for LBM simulations as well as allowing the domain to grow and shrink as necessary to accomodate a liquid surface. The modified LBM is implemented within the open-source 3D animation package Blender and compared to Blender's current LBM simulator using the metrics of memory usage and time required to complete a given simulation. Results show that, although the RLE-based simulator can take several times longer than the current simulator to complete a given simulation, the memory usage is significantly reduced, making an RLE-based simulation preferable in a few specific circumstances.

Стилі APA, Harvard, Vancouver, ISO та ін.

Blaschová, Eliška. "Komprese signálu EKG." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2016. http://www.nusl.cz/ntk/nusl-242195.

Повний текст джерела

Анотація:

This paper represents the most well-known compression methods, which have been published. A Compression of ECG signal is important primarily for space saving in memory cards or efficiency improvement of data transfer. An application of wavelet transform for compression is a worldwide discussed topic and this is the reason why the paper focuses in this direction. Gained wavelet coefficients might be firstly quantized and then compressed using suitable method. There are many options for a selection of wavelet and a degree of decomposition, which will be tested from the point of view of the most efficient compression of ECG signal.

Стилі APA, Harvard, Vancouver, ISO та ін.

Štys, Jiří. "Implementace statistických kompresních metod." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-413295.

Повний текст джерела

Анотація:

This thesis describes Burrow-Wheeler compression algorithm. It focuses on each part of Burrow-Wheeler algorithm, most of all on and entropic coders. In section are described methods like move to front, inverse frequences, interval coding, etc. Among the described entropy coders are Huffman, arithmetic and Rice-Golomg coders. In conclusion there is testing of described methods of global structure transformation and entropic coders. Best combinations are compared with the most common compress algorithm.

Стилі APA, Harvard, Vancouver, ISO та ін.

Cai, Jie. "Region-based techniques for modeling and enhancing cluster OpenMP performance." Phd thesis, 2011. http://hdl.handle.net/1885/8865.

Повний текст джерела

Анотація:

Cluster OpenMP enables the use of the OpenMP shared memory programming clusters. Intel has released a cluster OpenMP implementation called Intel Cluster OpenMP (CLOMP). While this offers better programmability than message passing alternatives such as the Message Passing Interface (MPI), such convenience comes with overheads resulting from having to maintain the consistency of underlying shared memory abstractions. CLOMP is no exception. This thesis introduces models for understanding these overheads of cluster OpenMP implementations like CLOMP and proposes techniques for enhancing their performance. Cluster OpenMP systems are usually implemented using page-based software distributed shared memory systems. A key issue for such system is maintaining the consistency of the shared memory space. This forms a major source of overhead, and it is driven by detecting and servicing page faults. To understand these systems, we evaluate their performance with different OpenMP applications, and we also develop a benchmark, called MCBENCH, to characterize the memory consistency costs. Using MCBENCH, we discover that this overhead is proportional to the number of writers to the same shared page and the number of shared pages. Furthermore, we divide an OpenMP program into parallel and serial regions. Based on the regions, we develop two region-based models to rationalize the numbers and types of the page faults and their associated costs to performance. The models highlight the fact that the major overhead is servicing the type of page faults, which requires data to be transferred across a network. With this understanding, we have developed three region-based prefetch (ReP) techniques based on the execution history of each region. The first ReP technique (TReP) considers temporal paging behaviour between consecutive executions of the same region. The second technique (HReP) considers both the temporal paging behaviour between consecutive region executions and the spatial paging behaviour within a region execution. The last technique (DReP) utilizes a novel stride-augmented run length encoding (sRLE) method to address the both the temporal and spatial paging behaviour between consecutive region executions. RePs effectively reduce the number of page faults and aggregate data into larger transfers, which leverages the network bandwidth provided by interconnects. All three ReP techniques are implemented into runtime libraries of CLOMP to enhance its performance. Both the original and the enhanced CLOMP are evaluated using the NAS Parallel Benchmark OpenMP (NPB-OMP) suite, and two LINPACK OpenMP benchmarks on two clusters connected with Ethernet and InfiniBand interconnects. The performance data is quantitatively analyzed and modeled. MCBENCH is used to evaluate the impact of ReP techniques on memory consistency cost. The evaluation results demonstrate that, on average, CLOMP spends 75% and 55% overall elapsed time of the NPB-OMP benchmarks on Gigabit Ethernet and double data rate InfiniBand network respectively. These ratios of the NPB-OMP benchmarks are reduced effectively by ?60% and ?40% after implementing the ReP techniques on to the CLOMP runtime. For the LINPACK benchmarks, with the assistance of sRLE, DReP significantly outperforms the other ReP techniques with effectively reducing 50% and 58% of page fault handling costs on the Ethernet and InfiniBand networks respectively.

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Run-Length encoding method"

Kathirvalavakumar, T., and R. Palaniappan. "Modified Run-Length Encoding Method and Distance Algorithm to Classify Run-Length Encoded Binary Data." In Communications in Computer and Information Science, 271–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19263-0_33.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Suzuki, Tetsuya. "Introduction of N-gram into a Run-Length Encoding Based ASCII Art Extraction Method." In Current Trends in Web Engineering, 28–39. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24800-4_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Suzuki, Tetsuya. "A Comparison of Whitespace Normalization Methods in a Text Art Extraction Method with Run Length Encoding." In Artificial Intelligence and Computational Intelligence, 135–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23896-3_16.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Milosavljević, Aleksandar. "Discovering Patterns in DNA Sequences by the Algorithmic Significance Method." In Pattern Discovery in Biomolecular Data. Oxford University Press, 1999. http://dx.doi.org/10.1093/oso/9780195119404.003.0006.

Повний текст джерела

Анотація:

The parsimony method for reconstruction of evolutionary trees (Sober, 1988) and the minimal edit distance method for DNA sequence alignments (e.g., Waterman, 1984) are both based on the principle of Occam’s Razor (e.g., Losee, 1980; also known as the Parsimony principle). This principle favors the most concise theories among the multitudes that can possibly explain observed data. The conciseness may be measured by the number of postulated mutations within an evolutionary tree, by the number of edit operations that transform one DNA sequence into the other, or by another implicit or explicit criterion. A very general mathematical formulation of Occam’s Razor has been proposed via minimal length encoding by computer programs (for recent reviews, see Cover and Thomas, 1991; Li and Vitányi, 1993). Algorithmic significance is a general method for pattern discovery based on Occam’s Razor. The method measures parsimony in terms of encoding length, in bits, of the observed data. Patterns are defined as datasets that can be concisely encoded. The method is not limited to any particular class of patterns; the class of patterns is determined by specifying an encoding scheme. To illustrate the method, consider the following unusual discovery experiment: . . . 1. Pick a simple pseudorandom generator for digits from the set {0, 1, 2, 3}. 2. Pick a seed value for the generator and run it to obtain a sequence of 1000 digits; convert the digits to a DNA sequence by replacing all occurrences of digit 0 by letter A, 1 by G, 2 by C, and 3 by T. 3. Submit the sequence to a similarity search against a database containing a completely sequenced genome of a particular organism. . . . Assume that after an unspecified number of iterations of the three steps, with each iteration involving a different random generator or seed value or both, the search in the third step finally results in a genomic sequence highly similar to the query sequence. Does the genomic sequence contain a pattern? To argue for the presence of a pattern, one may directly apply the algorithmic significance method.

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Run-Length encoding method"

Birajdar, Amit, Harsh Agarwal, Manan Bolia, and Vedang Gupte. "Image Compression Using Run Length Encoding and Lempel Ziev Welch Method." In 2019 Global Conference for Advancement in Technology (GCAT). IEEE, 2019. http://dx.doi.org/10.1109/gcat47503.2019.8978408.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Nechta, Ivan V. "New Steganalysis Method for Text Data Produced by Synonym Run-Length Encoding." In 2018 XIV International Scientific-Technical Conference on Actual Problems of Electronics Instrument Engineering (APEIE). IEEE, 2018. http://dx.doi.org/10.1109/apeie.2018.8545230.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

SUZUKI, Tetsuya. "Comparison of Two ASCII Art Extraction Methods: A Run-Length Encoding based Method and a Byte Pattern based Method." In Modelling, Identification and Control / 827: Computational Intelligence. Calgary,AB,Canada: ACTAPRESS, 2015. http://dx.doi.org/10.2316/p.2015.827-026.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Chouakri, Sid Ahmed, and Abdelmaik Taleb-Ahmed. "Quantized Run Length Encoding QRLE -New Compression Method-: Application to ECG Transmission via IEEE802.11b WLAN Channel." In 2018 International Conference on Innovation and Intelligence for Informatics, Computing, and Technologies (3ICT). IEEE, 2018. http://dx.doi.org/10.1109/3ict.2018.8855775.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Mufid, Mohammad Robihul, Saniyatul Mawaddah, Arif Basofi, Mochammad Jauhar Ulul Albab, Nur Syaela Majid, Devvana Arya Pratama, Risalatun Nuriyah, and Nidalifa Choirunnisa. "Image Data Compression in the Public Reporting System in Lamongan using the Huffman Method and Run Length Encoding." In International Conference on Applied Science and Technology on Social Science 2021 (iCAST-SS 2021). Paris, France: Atlantis Press, 2022. http://dx.doi.org/10.2991/assehr.k.220301.146.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kim, Seung-Cheol, Sang-Tae Lee, and Eun-Soo Kim. "Efficient generation of CGH of 3-D objects by use of run-length encoding and look-up table methods." In SPIE OPTO: Integrated Optoelectronic Devices, edited by Hans I. Bjelkhagen and Raymond K. Kostuk. SPIE, 2009. http://dx.doi.org/10.1117/12.808386.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!