Memory-efficient contour-based region-of-interest coding of arbitrarily large images

Nabil G. Sadaka, Glen P. Abousleman, Lina Karam

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we present a memory-efficient, contour-based, region-of-interest (ROI) algorithm designed for ultra-low-bit-rate compression of very large images. The proposed technique is integrated into a user-interactive wavelet-based image coding system in which multiple ROIs of any shape and size can be selected and coded efficiently. The coding technique compresses region-of-interest and background (non-ROI) information independently by allocating more bits to the selected targets and fewer bits to the background data. This allows the user to transmit large images at very low bandwidths with lossy/lossless ROI coding, while preserving the background content to a certain level for contextual purposes. Extremely large images (e.g., 65000 × 65000 pixels) with multiple large ROIs can be coded with minimal memory usage by using intelligent ROI tiling techniques. The foreground information at the encoder/decoder is independently extracted for each tile without adding extra ROI side information to the bit stream. The arbitrary ROI contour is down-sampled and differential chain coded (DCC) for efficient transmission. ROI wavelet masks for each tile are generated and processed independently to handle any size image and any shape/size of overlapping ROIs. The resulting system dramatically reduces the data storage and transmission bandwidth requirements for large digital images with multiple ROIs.

Original languageEnglish (US)
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
Volume6579
DOIs
StatePublished - 2007
EventMobile Multimedia/Image Processing for Military and Security Applications 2007 - Orlando, FL, United States
Duration: Apr 11 2007Apr 12 2007

Other

OtherMobile Multimedia/Image Processing for Military and Security Applications 2007
CountryUnited States
CityOrlando, FL
Period4/11/074/12/07

Fingerprint

coding
Data storage equipment
Tile
tiles
Bandwidth
Image coding
bandwidth
Masks
decoders
Pixels
data transmission
data storage
coders
preserving
masks
pixels
requirements

Keywords

  • Differential chain coding
  • Lossy/lossless coding
  • Region-of-interest coding
  • Wavelet-based coding

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Cite this

Sadaka, N. G., Abousleman, G. P., & Karam, L. (2007). Memory-efficient contour-based region-of-interest coding of arbitrarily large images. In Proceedings of SPIE - The International Society for Optical Engineering (Vol. 6579). [657903] https://doi.org/10.1117/12.719881

Memory-efficient contour-based region-of-interest coding of arbitrarily large images. / Sadaka, Nabil G.; Abousleman, Glen P.; Karam, Lina.

Proceedings of SPIE - The International Society for Optical Engineering. Vol. 6579 2007. 657903.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sadaka, NG, Abousleman, GP & Karam, L 2007, Memory-efficient contour-based region-of-interest coding of arbitrarily large images. in Proceedings of SPIE - The International Society for Optical Engineering. vol. 6579, 657903, Mobile Multimedia/Image Processing for Military and Security Applications 2007, Orlando, FL, United States, 4/11/07. https://doi.org/10.1117/12.719881
Sadaka NG, Abousleman GP, Karam L. Memory-efficient contour-based region-of-interest coding of arbitrarily large images. In Proceedings of SPIE - The International Society for Optical Engineering. Vol. 6579. 2007. 657903 https://doi.org/10.1117/12.719881
Sadaka, Nabil G. ; Abousleman, Glen P. ; Karam, Lina. / Memory-efficient contour-based region-of-interest coding of arbitrarily large images. Proceedings of SPIE - The International Society for Optical Engineering. Vol. 6579 2007.
@inproceedings{1b9f601e65464c9b91a8a0eb54594fc9,
title = "Memory-efficient contour-based region-of-interest coding of arbitrarily large images",
abstract = "In this paper, we present a memory-efficient, contour-based, region-of-interest (ROI) algorithm designed for ultra-low-bit-rate compression of very large images. The proposed technique is integrated into a user-interactive wavelet-based image coding system in which multiple ROIs of any shape and size can be selected and coded efficiently. The coding technique compresses region-of-interest and background (non-ROI) information independently by allocating more bits to the selected targets and fewer bits to the background data. This allows the user to transmit large images at very low bandwidths with lossy/lossless ROI coding, while preserving the background content to a certain level for contextual purposes. Extremely large images (e.g., 65000 × 65000 pixels) with multiple large ROIs can be coded with minimal memory usage by using intelligent ROI tiling techniques. The foreground information at the encoder/decoder is independently extracted for each tile without adding extra ROI side information to the bit stream. The arbitrary ROI contour is down-sampled and differential chain coded (DCC) for efficient transmission. ROI wavelet masks for each tile are generated and processed independently to handle any size image and any shape/size of overlapping ROIs. The resulting system dramatically reduces the data storage and transmission bandwidth requirements for large digital images with multiple ROIs.",
keywords = "Differential chain coding, Lossy/lossless coding, Region-of-interest coding, Wavelet-based coding",
author = "Sadaka, {Nabil G.} and Abousleman, {Glen P.} and Lina Karam",
year = "2007",
doi = "10.1117/12.719881",
language = "English (US)",
isbn = "0819467014",
volume = "6579",
booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",

}

TY - GEN

T1 - Memory-efficient contour-based region-of-interest coding of arbitrarily large images

AU - Sadaka, Nabil G.

AU - Abousleman, Glen P.

AU - Karam, Lina

PY - 2007

Y1 - 2007

N2 - In this paper, we present a memory-efficient, contour-based, region-of-interest (ROI) algorithm designed for ultra-low-bit-rate compression of very large images. The proposed technique is integrated into a user-interactive wavelet-based image coding system in which multiple ROIs of any shape and size can be selected and coded efficiently. The coding technique compresses region-of-interest and background (non-ROI) information independently by allocating more bits to the selected targets and fewer bits to the background data. This allows the user to transmit large images at very low bandwidths with lossy/lossless ROI coding, while preserving the background content to a certain level for contextual purposes. Extremely large images (e.g., 65000 × 65000 pixels) with multiple large ROIs can be coded with minimal memory usage by using intelligent ROI tiling techniques. The foreground information at the encoder/decoder is independently extracted for each tile without adding extra ROI side information to the bit stream. The arbitrary ROI contour is down-sampled and differential chain coded (DCC) for efficient transmission. ROI wavelet masks for each tile are generated and processed independently to handle any size image and any shape/size of overlapping ROIs. The resulting system dramatically reduces the data storage and transmission bandwidth requirements for large digital images with multiple ROIs.

AB - In this paper, we present a memory-efficient, contour-based, region-of-interest (ROI) algorithm designed for ultra-low-bit-rate compression of very large images. The proposed technique is integrated into a user-interactive wavelet-based image coding system in which multiple ROIs of any shape and size can be selected and coded efficiently. The coding technique compresses region-of-interest and background (non-ROI) information independently by allocating more bits to the selected targets and fewer bits to the background data. This allows the user to transmit large images at very low bandwidths with lossy/lossless ROI coding, while preserving the background content to a certain level for contextual purposes. Extremely large images (e.g., 65000 × 65000 pixels) with multiple large ROIs can be coded with minimal memory usage by using intelligent ROI tiling techniques. The foreground information at the encoder/decoder is independently extracted for each tile without adding extra ROI side information to the bit stream. The arbitrary ROI contour is down-sampled and differential chain coded (DCC) for efficient transmission. ROI wavelet masks for each tile are generated and processed independently to handle any size image and any shape/size of overlapping ROIs. The resulting system dramatically reduces the data storage and transmission bandwidth requirements for large digital images with multiple ROIs.

KW - Differential chain coding

KW - Lossy/lossless coding

KW - Region-of-interest coding

KW - Wavelet-based coding

UR - http://www.scopus.com/inward/record.url?scp=36048967892&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=36048967892&partnerID=8YFLogxK

U2 - 10.1117/12.719881

DO - 10.1117/12.719881

M3 - Conference contribution

AN - SCOPUS:36048967892

SN - 0819467014

SN - 9780819467010

VL - 6579

BT - Proceedings of SPIE - The International Society for Optical Engineering

ER -