k-d Tree-Segmented Block Truncation Coding for Image Compression
Block truncation coding (BTC) is a class of image compression algorithms whose main technique is the partitioning of an image into pixel blocks that are then each encoded using a representative set of pixel values. It is commonly used because of its simplicity and low computational complexity. The Q...
Saved in:
Main Authors: | Fernandez, Proceso L, Jr, Daga, Ryan Rey M |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2016
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/discs-faculty-pubs/87 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1086&context=discs-faculty-pubs |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Similar Items
-
New Algorithms for image compression based on block truncation coding
by: RYAN REY, DAGA
Published: (2016) -
VLSI Design Based on Block Truncation Coding for Real-Time Color Image Compression for IoT
by: Chen, Shih Lun, et al.
Published: (2023) -
Introducing Sub-Block Absorption to Improve the Performance of the Layered Indexless Indexed Flash Code
by: Fernandez, Proceso L, Jr, et al.
Published: (2014) -
EMS-GT2: An Improved Exact Solution for the (l, d)-Planted Motif Problem
by: Fernandez, Proceso L, Jr, et al.
Published: (2017) -
Hierarchical segmentation-based image coding using hybrid quad-binary trees
by: Kassim, A.A., et al.
Published: (2014)