Nonredundant image representations

Francis Man Lung Ng, Jelena Kovacevic

Research output: Contribution to conferencePaper

Abstract

We consider the problem of sending raw image data over lossy or heterogeneous network connections with as little overhead as possible. If the network connection does not support multiple priority levels and the network drops packets at random, a technique is needed where the data would be divided into parts of equal importance, so that the image could be at least partially reconstructed from the packets available. We found theoretical criteria for an image to be broken into pieces of equal importance, developed an algorithm for such criteria to be implemented and devised a signal processing scheme based on critically-sampled fast implementation filter banks. Experiments show that although the overhead is not large, it can further be reduced by using a scrambler. This scheme also solves the problem of holographic image representation.

Original languageEnglish (US)
Pages434-437
Number of pages4
StatePublished - Dec 1 1997
EventProceedings of the 1997 International Conference on Image Processing. Part 2 (of 3) - Santa Barbara, CA, USA
Duration: Oct 26 1997Oct 29 1997

Other

OtherProceedings of the 1997 International Conference on Image Processing. Part 2 (of 3)
CitySanta Barbara, CA, USA
Period10/26/9710/29/97

Fingerprint

Heterogeneous networks
Filter banks
Signal processing
Experiments

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Ng, F. M. L., & Kovacevic, J. (1997). Nonredundant image representations. 434-437. Paper presented at Proceedings of the 1997 International Conference on Image Processing. Part 2 (of 3), Santa Barbara, CA, USA, .

Nonredundant image representations. / Ng, Francis Man Lung; Kovacevic, Jelena.

1997. 434-437 Paper presented at Proceedings of the 1997 International Conference on Image Processing. Part 2 (of 3), Santa Barbara, CA, USA, .

Research output: Contribution to conferencePaper

Ng, FML & Kovacevic, J 1997, 'Nonredundant image representations' Paper presented at Proceedings of the 1997 International Conference on Image Processing. Part 2 (of 3), Santa Barbara, CA, USA, 10/26/97 - 10/29/97, pp. 434-437.
Ng FML, Kovacevic J. Nonredundant image representations. 1997. Paper presented at Proceedings of the 1997 International Conference on Image Processing. Part 2 (of 3), Santa Barbara, CA, USA, .
Ng, Francis Man Lung ; Kovacevic, Jelena. / Nonredundant image representations. Paper presented at Proceedings of the 1997 International Conference on Image Processing. Part 2 (of 3), Santa Barbara, CA, USA, .4 p.
@conference{f8c79a21c17e44fb8f180a4fe57febe0,
title = "Nonredundant image representations",
abstract = "We consider the problem of sending raw image data over lossy or heterogeneous network connections with as little overhead as possible. If the network connection does not support multiple priority levels and the network drops packets at random, a technique is needed where the data would be divided into parts of equal importance, so that the image could be at least partially reconstructed from the packets available. We found theoretical criteria for an image to be broken into pieces of equal importance, developed an algorithm for such criteria to be implemented and devised a signal processing scheme based on critically-sampled fast implementation filter banks. Experiments show that although the overhead is not large, it can further be reduced by using a scrambler. This scheme also solves the problem of holographic image representation.",
author = "Ng, {Francis Man Lung} and Jelena Kovacevic",
year = "1997",
month = "12",
day = "1",
language = "English (US)",
pages = "434--437",
note = "Proceedings of the 1997 International Conference on Image Processing. Part 2 (of 3) ; Conference date: 26-10-1997 Through 29-10-1997",

}

TY - CONF

T1 - Nonredundant image representations

AU - Ng, Francis Man Lung

AU - Kovacevic, Jelena

PY - 1997/12/1

Y1 - 1997/12/1

N2 - We consider the problem of sending raw image data over lossy or heterogeneous network connections with as little overhead as possible. If the network connection does not support multiple priority levels and the network drops packets at random, a technique is needed where the data would be divided into parts of equal importance, so that the image could be at least partially reconstructed from the packets available. We found theoretical criteria for an image to be broken into pieces of equal importance, developed an algorithm for such criteria to be implemented and devised a signal processing scheme based on critically-sampled fast implementation filter banks. Experiments show that although the overhead is not large, it can further be reduced by using a scrambler. This scheme also solves the problem of holographic image representation.

AB - We consider the problem of sending raw image data over lossy or heterogeneous network connections with as little overhead as possible. If the network connection does not support multiple priority levels and the network drops packets at random, a technique is needed where the data would be divided into parts of equal importance, so that the image could be at least partially reconstructed from the packets available. We found theoretical criteria for an image to be broken into pieces of equal importance, developed an algorithm for such criteria to be implemented and devised a signal processing scheme based on critically-sampled fast implementation filter banks. Experiments show that although the overhead is not large, it can further be reduced by using a scrambler. This scheme also solves the problem of holographic image representation.

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

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

M3 - Paper

AN - SCOPUS:0031333697

SP - 434

EP - 437

ER -