Lower bounds on the redundancy of natural images

被引:14
|
作者
Hosseini, Reshad [1 ]
Sinz, Fabian [1 ]
Bethge, Matthias [1 ]
机构
[1] Max Planck Inst Biol Cybernet, D-72076 Tubingen, Germany
关键词
Redundancy; Natural image statistics; Multi information rate; Information theory; INFORMATION; STATISTICS; MODELS;
D O I
10.1016/j.visres.2010.07.025
中图分类号
Q189 [神经科学];
学科分类号
071006 ;
摘要
The light intensities of natural images exhibit a high degree of redundancy Knowing the exact amount of their statistical dependencies is important for biological vision as well as compression and coding applications but estimating the total amount of redundancy the multi-Information is intrinsically hard The common approach is to estimate the multi-information for patches of increasing sizes and divide by the number of pixels Here we show that the limiting value of this sequence the multi-information rate can be better estimated by using another limiting process based on measuring the mutual information between a pixel and a causal neighborhood of increasing size around It Although in principle this method has been known for decades its superiority for estimating the multi-information rate of natural Images has not been fully exploited yet Either method provides a lower bound on the multi-information rate but the mutual information based sequence converges much faster to the multi-information rate than the conventional method does Using this fact we provide improved estimates of the multi-Information rate of natural images and a better understanding of its underlying spatial structure (C) 2010 Elsevier Ltd All rights reserved
引用
收藏
页码:2213 / 2222
页数:10
相关论文
共 50 条
  • [21] TIGHT BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES
    MANSTETTEN, D
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (01) : 144 - 151
  • [22] Improved Probabilistic bounds on stopping redundancy
    Han, Junsheng
    Siegel, Paul H.
    Vardy, Alexander
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (04) : 1749 - 1753
  • [23] Tight bounds on the redundancy of Huffman codes
    Mohajer, Soheil
    Pakzad, Payam
    Kakhbod, Ali
    [J]. 2006 IEEE INFORMATION THEORY WORKSHOP, 2006, : 131 - +
  • [24] NEW BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES
    CAPOCELLI, RM
    DESANTIS, A
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (04) : 1095 - 1104
  • [25] Improved upper bounds on stopping redundancy
    Han, Junsheng
    Siegel, Paul H.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (01) : 90 - 104
  • [26] ARE LOWER BOUNDS ON THE COMPLEXITY LOWER BOUNDS FOR UNIVERSAL CIRCUITS
    NIGMATULLIN, RG
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 331 - 340
  • [27] Tight Bounds on the Redundancy of Huffman Codes
    Mohajer, Soheil
    Pakzad, Payam
    Kakhbod, Ali
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (11) : 6737 - 6746
  • [28] Lower Bounds on ß(α)
    Carl, Merlin
    [J]. REVOLUTIONS AND REVELATIONS IN COMPUTABILITY, CIE 2022, 2022, 13359 : 64 - 73
  • [29] Statistical lower bounds on protein copy number from fluorescence expression images
    Zamparo, Lee
    Perkins, Theodore J.
    [J]. BIOINFORMATICS, 2009, 25 (20) : 2670 - 2676
  • [30] REDUNDANCY IN NATURAL LANGUAGES
    BONNER, S
    [J]. VERBATIM, 1991, 17 (03): : 1 - 3