Abstract
Categorization is an important problem in image document processing and is often a preliminary step for solving subsequent tasks such as recognition, understanding, and information extraction. In this paper the problem is formulated in the framework of concept learning and each category corresponds to the set of image documents with similar physical structure. We propose a solution based on two algorithmic ideas. First, we transform the image document into a structured representation based on X-Y trees. Compared to “flat” or vector-based feature extraction techniques, structured representations allow us to preserve important relationships between image sub-constituents. Second, we introduce a novel probabilistic architecture that extends hidden Markov models for learning probability distributions defined on spaces of labeled trees.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Y. Bengio and P. Frasconi, “An input output HMM architecture,” in Advances in Neural Information Processing Systems 7, (G. Tesauro, D. Touretzky, and T. Leen, eds.), pp. 427–434, The MIT Press, 1995.
R. Brugger, A. Zramdini, and R. Ingold, “Modeling documents for structure recognition using generalized n-grams,” in Proceedings of ICDAR, 1997.
A. Dengel, “Initial learning of document structure,” in Proceedings of ICDAR, pp. 86–90, 1993.
U. M. Fayyad and K. B. Irani, “Multi-interval discretization of continuous-valued attributes for classification learning,” in Proc. 13th Int. Joint Conf. on Artificial Intelligence, pp. 1022–1027, Morgan Kaufmann, 1993.
P. Frasconi, M. Gori, and A. Sperduti, “A general framework for adaptive processing of data structures,” IEEE Trans. on Neural Networks, vol. 9, no. 5, pp. 768–786, 1998.
R. C. Gonzalez and M. G. Thomason, Syntactic Pattern Recognition. Reading, Massachusettes: Addison Wesley, 1978.
D. Heckerman, “Bayesian networks dor data mining,” Data Mining and Knowledge Discovery, vol. 1, no. 1, pp. 79–120, 1997.
F. V. Jensen, S. L. Lauritzen, and K. G. Olosen, “Bayesian updating in recursive graphical models by local computations,” Computational Statistical Quarterly vol. 4, pp. 269–282, 1990.
G. Nagy and S. Seth, “Hierarchical representation of optically scanned documents,” in Proc. Int. Conf. on Pattern Recognition, pp. 347–349, 1984.
J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
L. R. Rabiner, “A tutorial on hidden Markov models and selected applications in speech recognition,” Proc. of the IEEE, vol. 77, no. 2, pp. 257–286, 1989.
P. Smyth, D. Heckerman, and M. I. Jordan, “Probabilistic independence networks for hidden markov probability models,” Neural Computation, vol. 9, no. 2, pp. 227–269, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diligenti, M., Frasconi, P., Gori, M. (2001). Image Document Categorization using Hidden Tree Markov Models and Structured Representations. In: Singh, S., Murshed, N., Kropatsch, W. (eds) Advances in Pattern Recognition — ICAPR 2001. ICAPR 2001. Lecture Notes in Computer Science, vol 2013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44732-6_15
Download citation
DOI: https://doi.org/10.1007/3-540-44732-6_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41767-5
Online ISBN: 978-3-540-44732-0
eBook Packages: Springer Book Archive