Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 34 for “"run-length encoding"”.

  1. Binary image compression using run length encoding and multiple scanning techniques

    While run length encoding is a popular technique for binary image compression, a raster (line by line) scanning technique is almost always assumed and scant attention has been given to the possibilities of using other techniques to scan an image as it is encoded. This thesis looks at five different …

    rit Repository record for Binary image compression using run length encoding and multiple scanning techniques (opens in a new tab)

  2. Practical algorithms for image compression and surface estimation

    … algorithms are innovative extensions of the Run Length Encoding image compression algorithm and the third is an image compression technique based on kriging. In general the modified Run Length Encoding algorithms yield a better compression ratio by a factor of two while retaining fast …

    unlv Repository record for Practical algorithms for image compression and surface estimation (opens in a new tab) Download PDF for Practical algorithms for image compression and surface estimation (opens in a new tab)

  3. Compression of bitmapped graphic data

    … of the techniques to graphic bitmapped data. Run-length encoding, statistical encoding (including Huffman codes), and relative encoding are examined and evaluated. A compression application of the Huffman coding of a run-length encoded file is designed and partially implemented in Chapter VII. …

    nps Repository record for Compression of bitmapped graphic data (opens in a new tab)

  4. Comparison of lossless compression models

    … Huffman. Arithmetic. Dynamic Markov Coding, and Run Length Encoding. Finally, the relative performances of the listed algorithms are compared. The thesis also includes C— and ANSI C implementations of the Huffman and RLE algorithms respectively.

    ttu Repository record for Comparison of lossless compression models (opens in a new tab)

  5. Quality and Compressibility Analysis of Checkerboard-based Digital Halftoning Algorithms

    … the C/C++ implementation of two new and original run length encoding (RLE) methods (Villarreal, 2001). These RLE methods are used to remove the positional redundancy from the pixels composing the bi-level images. Other methods are subsequently used to remove statistical redundancies form the …

    texas-state Repository record for Quality and Compressibility Analysis of Checkerboard-based Digital Halftoning Algorithms (opens in a new tab)

  6. Implementation of lossless compression algorithms for the MIL-STD-1553.

    … methods are Common Value Tracking, Modified Run-Length Encoding, and Differential Encoding. It will be shown that in some cases, compression ratios over 10 to 1 are possible, significantly improving the data transfer capabilities of the legacy communication system. The compression algorithms …

    baylor Repository record for Implementation of lossless compression algorithms for the MIL-STD-1553. (opens in a new tab)

  7. Burrows-Wheeler transformacija ir jos taikymai /

    … schemes such as Move to Front (MTF), LZW, Run Length Encoding (RLE) and Arithmetic Code (AC). By using this application and the created compression schemes, a number of different files were compressed, and the results were evaluated by calculating the compression ratio. The best results …

    vilnius Repository record for Burrows-Wheeler transformacija ir jos taikymai / (opens in a new tab)

  8. Exploiting Zero-Entropy Data for Efficient Deduplication

    … blocks prior to chunking, compresses them using Run-Length Encoding (RLE), and stores their metadata for later reconstruction. ZERO improves deduplication space savings by up to 29% without impacting throughput.

    waterloo Repository record for Exploiting Zero-Entropy Data for Efficient Deduplication (opens in a new tab)

  9. Pipelined implementation of Jpeg image compression using Hdl

    … expansion. Finally, the entropy coding uses run-length encoding (RLE), Huffman, variable length coding (VLC) and differential coding to decrease the number of bits used to represent the image. The JPEG compression is a lossy compression, since downsampling and quantization operations are …

    unlv Repository record for Pipelined implementation of Jpeg image compression using Hdl (opens in a new tab) Download PDF for Pipelined implementation of Jpeg image compression using Hdl (opens in a new tab)

  10. Kintamo ilgio kodai /

    … of coursework project, in which two variable-length codes were investigated: Elias gamma and Fibonacci. In this thesis we are investigating two new variable-length codes such as: Elias delta and Levenshtein as well as we are comparing every four of the codes with each other based on some …

    vilnius Repository record for Kintamo ilgio kodai / (opens in a new tab)

  11. Liquid Crystal Display Interface Method

    … the 30X42 font to one line of seven characters. Run-length encoding is used to condense storage of the 30X42 font in the 4K X 8-bit PROM.A significant development presented in this thesis is a method for converting a bottom view display into a top view display. This conversion is accomplished in …

    sdstate Repository record for Liquid Crystal Display Interface Method (opens in a new tab)

  12. Evaluation of Sensing and Machine Vision Techniques in Stress Detection and Quality Evaluation of Turfgrass Species

    … was done after developing and implementing the run length encoding algorithm (RLE) on simulated turf built using twist ties in both planar and turf-type arrangements. Significant relationship was observed between manual measurements of twist ties and RLE-derived values. The algorithm …

    uiuc Repository record for Evaluation of Sensing and Machine Vision Techniques in Stress Detection and Quality Evaluation of Turfgrass Species (opens in a new tab)

  13. Hardware algorithms for data compression

    … for data compression applicable to static binary encoding schemes is presented. A fast hardware algorithm for decompression that uses a balanced binary tree structure to eliminate code storage tables is introduced. Hardware algorithms are presented for the multi-group compression technique, ii …

    ucf Repository record for Hardware algorithms for data compression (opens in a new tab)

  14. Interactive Simulation of Fluid Flow

    … and a na\"ive compression algorithm based on run-length encoding.

    concordia Download PDF for Interactive Simulation of Fluid Flow (opens in a new tab)

  15. Efficient String Algorithms with Applications in Bioinformatics

    … genome with respect to substrings of specific length and a tolerance to define the number of mismatches. The similarity between reads is measured by using the Hamming distance function. Genome mappability is computed for each position in the string and has several applications in designing …

    ucf Repository record for Efficient String Algorithms with Applications in Bioinformatics (opens in a new tab)

  16. Protein Classification Based on Compressed Amino Acid Sequences

    … tested, including lossy versions of the popular Run-Length Encoding and Lempel-Ziv 78 methods as well as methods that randomly delete characters in the strings. Our results suggest that for the kind of protein classification problem analyzed in our study, a substantial amount of compression can …

    regina Repository record for Protein Classification Based on Compressed Amino Acid Sequences (opens in a new tab) Download PDF for Protein Classification Based on Compressed Amino Acid Sequences (opens in a new tab)

  17. Adaptive bit allocation with reduced feedback for wireless multicarrier transceivers

    … coding techniques, such as Huffman coding, Run length encoding and LZW algorithms, the amount of feedback information has been compressed. These calculations have been done for different quantization levels to understand the relationship between quantization levels and system performance. …

    ku Repository record for Adaptive bit allocation with reduced feedback for wireless multicarrier transceivers (opens in a new tab)

  18. Adaptive Bit Allocation With Reduced Feedback for Wireless Multicarrier Transceivers

    … coding techniques, such as Huffman coding, Run length encoding and LZWalgorithms, the amount of feedback information has been compressed. These calculations have been done for different quantization levels to understand the relationship between quantization levels and system performance. …

    ku Repository record for Adaptive Bit Allocation With Reduced Feedback for Wireless Multicarrier Transceivers (opens in a new tab)

  19. Privacy Preserving Data Mining using Unrealized Data Sets: Scope Expansion and Data Compression

    … list of numbers with many replications. Applying run-length encoding on the resulting list can further compress the samples into a constant storage space regardless of the sample size. In this way, the storage requirement of the sample database becomes O(1) and the time complexity of a statistical …

    uvic Repository record for Privacy Preserving Data Mining using Unrealized Data Sets: Scope Expansion and Data Compression (opens in a new tab)

  20. Optimizing Log Data Storage and Query Performance: A Study on Industrial Applications

    … data distributions, and intertwined outer-layer encodings such as delta encoding, dictionary encoding, and run-length encoding. We also considered using Bloom filters on chosen attributes to facilitate more effective pruning of queries, striking a delicate balance between performance improvements …

    chalmers Repository record for Optimizing Log Data Storage and Query Performance: A Study on Industrial Applications (opens in a new tab)

Page 1 of 2