Author's personal copy 3984 F. Chapeau-Blon<strong>de</strong>au, D. Rousseau / Physica A 388 (2009) 3969–3984 [20] S.S. Chen, L.F. Chen, Y.T. Wu, Y.Z. Wu, P.L. Lee, T.C. Yeh, J.C. Hsieh, Detection of synchronization between chaotic signals: An adaptive simi<strong>la</strong>rity-based approach, Physical Review E 76 (2007) pp. 066208, 1–11. [21] W. Szpankowski, W. Ren, L. Szpankowski, An optimal DNA segmentation based on the MDL principle, International Journal of Bioinformatics Research and Applications 1 (2005) 3–17. [22] J.S. Conery, Aligning sequences by minimum <strong>de</strong>scription length, EURASIP Journal on Bioinformatics and Systems Biology 72936 (2007) 1–14. [23] R. Meir, J.F. Fontanari, Data compression and prediction in neural networks, Physica A 200 (1993) 644–654. [24] M. Small, C.K. Tse, Minimum <strong>de</strong>scription length neural networks for time series prediction, Physical Review E 66 (2002) pp. 066701, 1–12. [25] D.G. Luenberger, Information Science, Princeton University Press, Princeton, 2006. [26] F.A. Bais, J.D. Farmer, The physics of information, in: P. Adriaans, J. van Benthem (Eds.), Philosophy of Information, in: Handbook of the Philosophy of Science, North Hol<strong>la</strong>nd, Amsterdam, 2008 (Chapter 5b). Also arXiv:0708.2837v2. [27] M. Mézard, A. Montanari, Information, Physics, and Computation, Oxford University Press, Oxford, 2009. [28] P. Hall, E.J. Hannan, On stochastic complexity and nonparametric <strong>de</strong>nsity estimation, Biometrika 75 (1988) 705–714. [29] J. Rissanen, Density estimation by stochastic complexity, IEEE Transactions on Information Theory 38 (1992) 315–323. [30] A.R. Baron, T.M. Cover, Minimum complexity <strong>de</strong>nsity estimation, IEEE Transactions on Information Theory 37 (1991) 1034–1054. [31] T. Zhang, From ɛ-entropy to KL-entropy: Analysis of minimum information complexity <strong>de</strong>nsity estimation, The Annals of Statistics 34 (2006) 2180–2210. [32] L. Birgé, Y. Rozenholc, How many bins should be put in a regu<strong>la</strong>r histogram, European Series in Applied and Industrial Mathematics: Probability and Statistics 10 (2006) 24–45. [33] P. Kontkanen, P. Myllymäki, Information-theoretically optimal histogram <strong>de</strong>nsity estimation, Technical Report 2006-2 Helsinki Institute for Information Technology, Fin<strong>la</strong>nd, 17 March 2006. [34] P. Kontkanen, P. Myllymäki, MDL histogram <strong>de</strong>nsity estimation, in: Proceedings 11th International Conference on Artificial Intelligence and Statistics, San Juan, Puerto Rico, 21–24 March 2007. [35] J.W. Lee, J.B. Park, H.H. Jo, J.S. Yang, H.T. Moon, Minimum entropy <strong>de</strong>nsity method for the time series analysis, Physica A 388 (2009) 137–144. [36] G. Nicolis, Equality governing nonequilibrium fluctuations and its information theory and thermodynamic interpretations, Physical Review E 79 (2009) pp. 011106, 1–8. [37] A. Carbone, H.E. Stanley, Scaling properties and entropy of long-range corre<strong>la</strong>ted time series, Physica A 384 (2007) 21–24. [38] S. Martinez, A. P<strong>la</strong>stino, B.H. Soffer, Information and thermodynamics first <strong>la</strong>w, Physica A 356 (2005) 167–171. [39] A. Papoulis, Probability, Random Variables, and Stochastic Processes, McGraw-Hill, New York, 1991. [40] W. Feller, An Introduction to Probability Theory and Its Applications, vol. I, Wiley, New York, 1968. [41] H. Wang, K.C. Sevcik, Histograms based on the minimum <strong>de</strong>scription length principle, The VLDB (Very Large Data Base) Journal 17 (2008) 419–442. 165/197
J. CHAUVEAU and D. ROUSSEAU and F. CHAPEAU-BLONDEAU, Fractal capacity dimension of three-dimensional histogram from color images. Multidimensional Systems and Signal Processing, in press, DOI 10.1007/S11045-009-0097-0, 2009. 166/197
- Page 1 and 2:
Université d’Angers Laboratoire
- Page 3 and 4:
Ce mémoire est dédié à mon épo
- Page 5 and 6:
4 Physique de l’information 39 4.
- Page 7 and 8:
1.2 Organisation du document L’es
- Page 9 and 10:
4/197
- Page 11 and 12:
de Rennes 1. Licence et Maîtrise
- Page 13 and 14:
2.5 Activités de recherche 2.5.1 B
- Page 15 and 16:
2.5.2 Encadrement Thèses Thèse so
- Page 17 and 18:
2.5.3 Responsabilités Management d
- Page 19 and 20:
[A20] S. BLANCHARD, D. ROUSSEAU, D.
- Page 21 and 22:
In 8th Euro-American Workshop on In
- Page 23 and 24:
études visaient alors à analyser
- Page 25 and 26:
Fig. 3.1 réside dans le fait qu’
- Page 27 and 28:
également permis de réaliser qu
- Page 29 and 30:
caracteristique effective g eff (u)
- Page 31 and 32:
des architectures neuronales contr
- Page 33 and 34:
Dans l’ Éq.(3.10), ∆t représe
- Page 35 and 36:
quantifieur, le niveau de saturatio
- Page 37 and 38:
exemples présentés dans [39], l
- Page 39 and 40:
• le type de validation des résu
- Page 41 and 42:
présenté de façon condensée dan
- Page 43 and 44:
38/197
- Page 45 and 46:
pour l’étude de la turbulence pa
- Page 47 and 48:
A B C Figure 4.1 : Images de coupe
- Page 49 and 50:
atteint la capacité informationnel
- Page 51 and 52:
* Figure 4.5 : Échelle optimale d
- Page 53 and 54:
• L’“intégrale de corrélati
- Page 55 and 56:
4.2.3 Analyse multifractale en imag
- Page 57 and 58:
fonction de partition Z 10 30 10 25
- Page 59 and 60:
exposant τ(q) 15 10 5 0 −5 −10
- Page 61 and 62:
complexité colorimétrique des ima
- Page 63 and 64:
dimension fractale généralisée D
- Page 65 and 66:
est la moyenne du signal calculée
- Page 67 and 68:
A B C Figure 4.17 : Observations in
- Page 69 and 70:
A B C Figure 4.20 : Nombre moyen de
- Page 71 and 72:
[14] S. Blanchard, D. Rousseau et F
- Page 73 and 74:
[43] J. Chauveau, D. Rousseau et F.
- Page 75 and 76:
[76] A. Humeau, B. Buard, F. Chapea
- Page 77 and 78:
[100] M. D. McDonnell, N. G. Stocks
- Page 79 and 80:
[131] D. Rousseau, F. Duan, J. Roja
- Page 81 and 82:
76/197
- Page 83 and 84:
D. ROUSSEAU and F. CHAPEAU-BLONDEAU
- Page 85 and 86:
ROUSSEAU AND CHAPEAU-BLONDEAU: BAYE
- Page 87 and 88:
ROUSSEAU AND CHAPEAU-BLONDEAU: BAYE
- Page 89 and 90:
D. ROUSSEAU, G. V. ANAND, and F. CH
- Page 91 and 92:
quantizers. Classically, the design
- Page 93 and 94:
Fig. 2. Nonlinear array used as pre
- Page 95 and 96:
probability of error P er 10 0 10 -
- Page 97 and 98:
probability of error (expected as s
- Page 99 and 100:
[3] N.H. Lu, B.A. Einstein, Detecti
- Page 101 and 102:
Abstract Neurocomputing 71 (2007) 3
- Page 103 and 104:
3. Assessing nonlinear transmission
- Page 105 and 106:
output SNR 250 200 150 100 50 0 N=3
- Page 107 and 108:
precisely the scope of the present
- Page 109 and 110:
[4] F. Chapeau-Blondeau, G. Chauvet
- Page 111 and 112:
Nonlinear SNR amplification of harm
- Page 113 and 114:
P.R. BHAT and D. ROUSSEAU and G. V.
- Page 115 and 116:
It is assumed that the signal s is
- Page 117 and 118:
Let us de£ne the improvement in pe
- Page 119 and 120: F. CHAPEAU-BLONDEAU and D. ROUSSEAU
- Page 121 and 122: Contents Raising the noise to impro
- Page 123 and 124: Raising the noise to improve perfor
- Page 125 and 126: Raising the noise to improve perfor
- Page 127 and 128: Raising the noise to improve perfor
- Page 129 and 130: Raising the noise to improve perfor
- Page 131 and 132: Raising the noise to improve perfor
- Page 133 and 134: Raising the noise to improve perfor
- Page 135 and 136: S. BLANCHARD, D. ROUSSEAU, D. GINDR
- Page 137 and 138: 1984 OPTICS LETTERS / Vol. 32, No.
- Page 139 and 140: F. CHAPEAU-BLONDEAU, D. ROUSSEAU, S
- Page 141 and 142: 1288 J. Opt. Soc. Am. A/Vol. 25, No
- Page 143 and 144: 1290 J. Opt. Soc. Am. A/Vol. 25, No
- Page 145 and 146: 1292 J. Opt. Soc. Am. A/Vol. 25, No
- Page 147 and 148: 36 IEEE SIGNAL PROCESSING LETTERS,
- Page 149 and 150: 38 IEEE SIGNAL PROCESSING LETTERS,
- Page 151 and 152: A. HISTACE and D. ROUSSEAU. Constru
- Page 153 and 154: noises Z i in (3) are chosen Gaussi
- Page 155 and 156: Author's personal copy Physica A 38
- Page 157 and 158: Author's personal copy F. Chapeau-B
- Page 159 and 160: Author's personal copy F. Chapeau-B
- Page 161 and 162: edundancy Author's personal copy F.
- Page 163 and 164: model description length Author's p
- Page 165 and 166: total description length x 10 4 1.6
- Page 167 and 168: Author's personal copy F. Chapeau-B
- Page 169: Author's personal copy F. Chapeau-B
- Page 173 and 174: 2 for natural images, and carry rel
- Page 175 and 176: 4 Fig. 2 Random RGB color image I2(
- Page 177 and 178: 6 log2[ number of boxes N(a) ] 24 2
- Page 179 and 180: 8 Fig. 7 Color histogram in the RGB
- Page 181 and 182: 10 log2[ number of boxes N(a) ] 8 7
- Page 183 and 184: 12 17. Landgrebe, D.: Hyperspectral
- Page 185 and 186: Numerical simulation of laser Doppl
- Page 187 and 188: esults are meaningful to better app
- Page 189 and 190: A. HUMEAU, B. BUARD, F. CHAPEAU-BLO
- Page 191 and 192: 618 A Humeau et al 1. Introduction
- Page 193 and 194: 620 A Humeau et al (a) (b) (c) Figu
- Page 195 and 196: 622 A Humeau et al (a) (b) (c) Figu
- Page 197 and 198: 624 A Humeau et al Figure 5. Averag
- Page 199 and 200: 626 A Humeau et al Therefore, the m
- Page 201 and 202: 628 A Humeau et al peripheral cardi