Paper
10 February 2009 Concurrent grammar inference machines for 2-D pattern recognition: a comparison with the level set approach
K. P. Lam, P. Fletcher
Author Affiliations +
Proceedings Volume 7245, Image Processing: Algorithms and Systems VII; 724515 (2009) https://doi.org/10.1117/12.806035
Event: IS&T/SPIE Electronic Imaging, 2009, San Jose, California, United States
Abstract
Parallel processing promises scalable and effective computing power which can handle the complex data structures of knowledge representation languages efficiently. Past and present sequential architectures, despite the rapid advances in computing technology, have yet to provide such processing power and to offer a holistic solution to the problem. This paper presents a fresh attempt in formulating alternative techniques for grammar learning, based upon the parallel and distributed model of connectionism, to facilitate the more cognitively demanding task of pattern understanding. The proposed method has been compared with the contemporary approach of shape modelling based on level sets, and demonstrated its potential as a prototype for constructing robust networks on high performance parallel platforms.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
K. P. Lam and P. Fletcher "Concurrent grammar inference machines for 2-D pattern recognition: a comparison with the level set approach", Proc. SPIE 7245, Image Processing: Algorithms and Systems VII, 724515 (10 February 2009); https://doi.org/10.1117/12.806035
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Pattern recognition

Computer architecture

Detection and tracking algorithms

Intelligence systems

Interfaces

Modeling

Control systems

Back to Top