z-logo
open-access-imgOpen Access
Predictability and redundancy of natural images
Author(s) -
Daniel Kersten
Publication year - 1987
Publication title -
journal of the optical society of america a
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.803
H-Index - 158
eISSN - 1520-8532
pISSN - 1084-7529
DOI - 10.1364/josaa.4.002395
Subject(s) - predictability , computer science , entropy (arrow of time) , artificial intelligence , redundancy (engineering) , pixel , pattern recognition (psychology) , mathematics , computer vision , algorithm , statistics , physics , quantum mechanics , operating system
One aspect of human image understanding is the ability to estimate missing parts of a natural image. This ability depends on the redundancy of the representation used to describe the class of images. In 1951, Shannon [Bell. Syst. Tech. J. 30, 50 (1951)] showed how to estimate bounds on the entropy and redundancy of an information source from predictability data. The entropy, in turn, gives a measure of the limits to error-free information compaction. An experiment was devised in which human observers interactively restored missing gray levels from 128 X 128 pixel pictures with 16 gray levels. For eight images, the redundancy ranged from 46%, for a complicated picture of foliage, to 74%, for a picture of a face. For almost-complete pictures, but not for noisy pictures, this performance can be matched by a nearest-neighbor predictor.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom