Contextual Swarm-Based Multi-layered Lattices: A New Architecture for Contextual Pattern Recognition

  • David G. Elliman
  • Sherin M. Youssef
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3163)

Abstract

This paper introduces a novel approach for dynamic structuring of contextual lattices. It is anticipated that the approach can be applied to improve the accuracy of word-segmentation patterns in autonomous text recognition systems. A multi-level hierarchical structure of lattices is used to implement the algorithm, and the approach can be applied in a generic manner to other pattern recognition problems. We apply a top-down structural model in parallel with a constrained probabilistic model and intelligent distributed searching paradigm. This paradigm is based on the integration between probabilistic bi-grams and adaptive intelligent swarm-based agent search to identify the most likely sentence structures. The searching paradigm allows the exploitation of positive feedback as a search mechanism and, consequently, makes the model amenable to parallel implementation. The distributed intelligence of the proposed approach enables the dynamic structuring of contextual lattices and has proved to scale well with large lattice sizes. Moreover, we believe that the proposed architecture solves the ill-conditioned nature of most pattern recognition problems that lies in the effect of noise in the segmentation phase. To verify the developed Swarm-based Intelligent Search Algorithm (SISA), a simulation study was conducted on a set of variable size scripts. The proposed paradigm proved to be efficient in identifying the most highly segmented patterns and also returned good decisions concerning lower probability segments enabling further re- segmentations and re-combinations to take place. The paper is the first to apply the intelligent swarm-based paradigm for the identification of optimal segmented patterns in contextual recognition models. The algorithm is compared with other algorithms for the same problem, and the computational results demonstrate that the proposed approach is very efficient and robust for large-scale statistical contextual-lattice structures.

Keywords

Pattern Recognition Problem Contextual Lattice Pheromone Level Segmented Word Swarm Agent 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    H., D., Du, C. et. al.: On The General False Path Problem in Timing Analysis. In: DAC, pp. 555-560 (1989) Google Scholar
  2. 2.
    McGeer, P.C. et.al.: Efficient Algorithms for Computing the Longest Viable Path in a Combinatorial Networks. In: DAC, pp. 561-567 (1989) Google Scholar
  3. 3.
    Elliman, D.G., Lancaster, I.: A review of Segmentation and Contextual Analysis Techniques for Text Recognition. Pattern Recognition 23, 337–346 (1990)CrossRefGoogle Scholar
  4. 4.
    Tikhonov, A.N., Arsenin, V.: Solutions of Ill-posed Problems. W.H. Winston, Washington (1977)MATHGoogle Scholar
  5. 5.
    Di Caro, G., Dorigo, M.: AntNet: A Mobile Agents Approach to Adaptive Routing. IRIDIA, University Libre de Bruxelles, av. F. Roosevelt, CP 194/6, 1050 – Brussels, Belgium, Technical Report IRIDIA, 97–12 (1997) Google Scholar
  6. 6.
    Shi, Y., Eberhart, R.C.: Empirical Study of Particle Swarm Optimization. In: Proceedings of Congress on Evolutionary Computation, pp. 1945–1950 (1999)Google Scholar
  7. 7.
    White, T.: Routing With Swarm Intelligence. System and Computer Engineering (SCE) department, Technical Report SCE-97-15, Carleton University (1997)Google Scholar
  8. 8.
    Dorigo, M.: Optimization, Learning and Natural algorithm. PhD thesis, DEL, Politecnico di Milano, Italy (1992)Google Scholar
  9. 9.
    Di Caro, M.G., Gambardella, M.: Ant Algorithms for discrete optimization. Artificial Life 5, 137–172 (1999)CrossRefGoogle Scholar
  10. 10.
    Amtrup, J.W.: Incremental Speech Translation. LNCS (LNAI), vol. 1735. Springer-Verlag, Berlin Heidelberg, New York (1999)MATHGoogle Scholar
  11. 11.
    Kalnis, P., et al.: View Selection Using Randomized Search. Data & Knowledge Engineering, 89–111 (2002)Google Scholar
  12. 12.
    Jurafsky, D., Martin, J.H.: Speech and Language Processing: An Introduction to Natural Language Processing. In: Computational Linguistics, and Speech Recognition, Prentice-Hall, Inc., New Jersey (2000)Google Scholar
  13. 13.
    Forney, G.D.: A Viterbi Algorithm. Proceedings Of The IEEE 61(3), 268–278 (1973)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • David G. Elliman
    • 1
  • Sherin M. Youssef
    • 1
  1. 1.School of Computer Science & ITNottingham University 

Personalised recommendations