Abstract
In this paper, we present the problem of noisy images recognition and in particular the stage of primitives selection in a classification process. We suppose that segmentation and statistical features extraction on documentary images are realized. We describe precisely the use of concept lattice and compare it with a decision tree in a recognition process. From the experimental results, it appears that concept lattice is more adapted to the context of noisy images.
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
Adam, S., et al.: Multi-scaled and multi oriented character recognition: An original strategy. In: ICDAR 1999, September 1999, pp. 45–48 (1999)
Tombre, K., Lamiroy, B.: Graphics recognition - from re-engineering to retrieval. In: Proceedings of 7th ICDAR, Edinburgh (Scotland, UK), August 2003, pp. 148–155 (2003)
Canu, S., Smola, A.: Kernel methods and the exponential family. In: National ICT (2005)
Bunke, H.: Recent developments in graph matching. In: 15th International Conference on Pattern Recognition, vol. 2, pp. 117–124 (2000)
Lefevre, E., Colot, O., Vannoorenberghe, P., De Brucq, D.: Contribution des mesures d’information á la modélisation crédibiliste de connaissances. Traitement du Signal 17(2) (2000)
Milgram, M.: Reconnaissance des formes: méthodes numériques et connexionnistes. Colin, A. (1993)
Gunes, V., Menard, M., Loonis, P.: A multiple classifier system using ambiguity rejection for clustering-classification cooperation. In: IJUFKS. World Scientific, Singapore (2000)
Birkhoff, G.: Lattice theory, 3rd edn., vol. 25. American Mathematical Society, Providence (1967)
Ganter, B., Wille, R.: Formal concept analysis, Mathematical foundations. Springer, Heidelberg (1999)
Bordat, J.: Calcul pratique du treillis de Galois d’une correspondance. Math. Sci. Hum. 96, 31–47 (1986)
Godin, R., Mili, H.: Building and maintening analysis-level class hierarchies using Galois lattices. In: OOPSLA, pp. 394–410 (1993)
Nourine, L., Raynaud, O.: A fast algorithm for building lattices. In: Third International Conference on Orders, Algorithms and Applications, Montpellier, France (August 1999)
Bertet, K., Nebut, M.: Efficient algorithms on the family associated to an implicationnal system. DMTCS 6(2), 315–338 (2004)
Taouil, R., Bastide, Y.: Computing proper implications. In: Proceedings of ICCS 2001 Internationnal Workshop on Concept Lattices-Based Theory, Methods and tools for Knowledge Discovery in Databases, pp. 290–303 (2001)
Obiedkov, S., Duquenne, V.: Incremental construction of the canonical implication basis. In: Fourth International Conference Journée de l’Informatique messine, pp. 15–23 (2003) (Submitted to Discrete Applied Mathematics)
Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Transactions on Information Theory 13(1), 21–27 (1967)
Kanungo, T., et al.: Document degradation models: parameter estimation and model validation. In: IAPR Workshop on machine vision applications, Kawasaki (Japan), pp. 552–557 (1994)
Derrode, S., Daoudi, M., Ghorbel, F.: Invariant content-based image retrieval using a complete set of fourier-mellin descriptors. In: Int. Conf. on Multimedia Computing and Systems (ICMCS 1999), June 1999, pp. 877–881 (999)
Tabbone, S., Wendling, L.: Recherche d’images par le contenu l’aide de la transforme de radon. In: Technique et Science Informatiques (2003)
Teague, M.: Image analysis via the general theory of moments. Journal of Optical Society of America (JOSA) 70, 920–930 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guillas, S., Bertet, K., Ogier, JM. (2006). A Generic Description of the Concept Lattices’ Classifier: Application to Symbol Recognition. In: Liu, W., Lladós, J. (eds) Graphics Recognition. Ten Years Review and Future Perspectives. GREC 2005. Lecture Notes in Computer Science, vol 3926. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11767978_5
Download citation
DOI: https://doi.org/10.1007/11767978_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34711-8
Online ISBN: 978-3-540-34712-5
eBook Packages: Computer ScienceComputer Science (R0)