JOURNAL ARTICLE

Lossless compression of images using logic minimization

Abstract

In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon and consider the problem of finding the polygon which can be encoded with the smallest number of bits for a given maximum distortion. The presented scheme is an extension of the approaches introduced in [l, 2], in that the admissible polygon vertices belong to a band around the original boundary and a new vertex encoding scheme is proposed.

Keywords:
Lossy compression Polygon (computer graphics) Lossless compression Algorithm Encoding (memory) Boundary (topology) Computer science Mathematics Vertex (graph theory) Data compression Combinatorics Discrete mathematics Graph Frame (networking) Artificial intelligence

Metrics

11
Cited By
2.37
FWCI (Field Weighted Citation Impact)
5
Refs
0.90
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Cellular Automata and Applications
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Algorithms and Data Compression
Physical Sciences →  Computer Science →  Artificial Intelligence
graph theory and CDMA systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

JOURNAL ARTICLE

Lossless Compression Using Two-Level and Multilevel Boolean Minimization

Jeehong YangSerap A. SavariOskar Mencercv

Journal:   SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems Year: 2006 Pages: 148-152
© 2026 ScienceGate Book Chapters — All rights reserved.