On the Minimum Description Length Principle for Sources with Piecewise Constant Parameters

IEEE Transactions on Information Theory

Volumn 39, Issue 6, 1993, Pages 1962-1967

  Merhav, Neri ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

edge detection; Minimum description length; segmentation; sequential coding; universal coding

Indexed keywords

BINARY SEQUENCES; ESTIMATION; IMAGE PROCESSING; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PIECEWISE LINEAR TECHNIQUES; REDUNDANCY; SENSITIVITY ANALYSIS; STATISTICAL METHODS; VECTORS;

EDGE DETECTION; ENCODER; MINIMUM DESCRIPTION LENGTH PRINCIPLE; PARAMETRIC MODEL; PIECEWISE CONSTANT PARAMETER; SEGMENTAL; SEGMENTATION; SEQUENTIAL CODING; STATISTICAL PARAMETER VECTORS; UNIVERSAL LOSSLESS CODING;

SIGNAL ENCODING;

EID: 0027696297     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.265504     Document Type: Article

References (30)

1. L. D. Davisson, “Universal noiseless coding,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 783-795, Nov. 1973.
2. F. Jelinek and K. S. Schneider, “Variable-length encoding of fixed-rate Markov sources for fixed-rate channels,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 750-755, 1974.
3. R. E. Krichevsky and V. K. Trofimov, “The performance of universal encoding,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 199-207, Mar. 1981.
4. L. D. Davisson, G. Longo, and A. Sgarro, “The error exponent for the noiseless encoding of finite ergodic Markov sources,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 431-438, July 1981.
5. J. Rissanen and G. G. Langdon, “Universal modeling and coding,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 12-23, Jan. 1981.
6. L. D. Davisson, “Minimax noiseless universal coding for Markov sources,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 211-215, Mar. 1983.
7. J. Rissanen, “Universal coding, information, prediction, and estimation,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 629-636, July 1984.
8. A. C. Blumer, “Minimax universal noiseless coding for unifilar and Markov sources,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 925-930, Nov. 1987.
9. T. J. Tjalkens and F. M. J. Willems, “Variable to fixed-length codes for Markov sources,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 246-257, Mar. 1987.
10. M. J. Weinberger, A. Lempel, and J. Ziv, “A sequential algorithm for the universal coding of finite memory sources,” IEEE Trans. Inform. Theory, vol. 38, pp. 1002-1014, May 1992.
11. J. Ziv and A. Lempel, “Compression of individual sequences via variable-rate coding,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, Sept. 1978.
12. J. C. Kieffer, “A unified approach to weak universal source coding,” IEEE Trans, inform. Theory, vol. IT-24, pp. 674-682, Nov. 1978.
13. A. D. Wyner and J. Ziv, “Some properties of the entropy of a stationary ergodic data source with applications to data compression,” IEEE Trans. Inform. Theory, vol. 35, pp. 1250-1258, Nov. 1989.
14. R. G. Gallager, “Variations on a theme by Huffman,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 668-674, Nov. 1978.
15. D. E. Knuth, “Dynamic Huffman coding,” J. Algorithms, vol. 6, pp. 163-180, June 1985.
16. J. S. Vitter, “Design and analysis of dynamic Huffman codes,” J. Ass. Comput. Mach., vol. 34, pp. 825-845, Oct. 1987.
17. H. Yokoo, “An improvement of dynamic Huffman coding with a simple repetition finder,” IEEE Trans. Commun., vol. 39, pp. 8-10, Jan. 1991.
18. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
19. T. Svendsen and F. K. Soong, “On the automatic segmentation of speech signals,” in Proc. Int. Conf. Acoust., Speech, Signal Processing, Apr. 1987, pp. 77-80.
20. F. K. Soong and B.-H. Juang, “A segment model based approach to speech recognition,” in Proc. Int. Conf. Acoust., Speech, Signal Processing, Apr. 1988, pp. 501-504.
21. J. G. Wilpon and L. R. Rabiner, “Application of hidden Markov models to automatic speech endpoint detection,” Comput. Speech Language, vol. 2, pp. 321-341, 1988.
22. M. A. Fischler and R. C. Bolles, “Perceptual organization of curve partitioning,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-8, pp. 100-105, Jan. 1986.
23. N. Katzir, M. Lindenbaum, and M. Porat, “Planar curve segmentation for recognition of partially occluded shapes,” in Proc. Int. Conf. Pattern Recognition, June 1990, pp. 842-846.
24. R. C. Dubes, A. K. Jain, S. G. Nadaban, and C. C. Chen, “MRF model based algorithms for image segmentation,” in Proc. Int. Conf. Pattern Recognition, June 1990, pp. 804-814.
25. K. Keeler, “Minimum-length encoding of planar subdivision topologies with application to image segmentation,” in Proc. 1990 Spring Symp. Ser. Theory and Appl, of Minimal-Length Encoding, Mar. 1990, pp. 95-99.
26. A. Pentland and T. Darrell, “Part segmentation for object recognition,” in Proc. 1990 Spring Symp. Ser. Theory and Appl, of Minimal-Length Encoding, Mar. 1990, pp. 105-109.
27. M. S. Babcock, W. K. Olson, and E. P. D. Pednault, “The use of the minimum description length principle to segment DNA into structural and functional domains,” in Proc. 1990 Spring Symp. Ser. Theory and Appl. of Minimal-Length Encoding, Mar. 1990, pp. 40-44.
28. A. Milosavljevic, D. Haussler, and J. Jurka, “Clustering of macro-molecular sequences by minimal length encoding,” in Proc. 1990 Spring Symp. Ser. Theory and Appl, of Minimal-Length Encoding, Mar. 1990, pp. 45-49.
29. Yu. M. Shtar'kov, “Universal sequential coding of single messages,” Probi. Inform. Transmission, pp. 175-186, July-Sept. 1988.
30. B. Ya. Ryabko, “Prediction of random sequences and universal coding,” Probi. Inform. Transmission, pp. 87-96, Apr.-June 1988.