Parallel implementation of elastic grid matching using cellular neural networks

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The following paper presents a method that allows for a parallel implementation of the most computationally expensive element of the deformable template paradigm, which is a grid-matching procedure. Cellular Neural Network Universal Machine has been selected as a frame-work for the task realization. A basic idea of deformable grid matching is to guide node location updates in a way that minimizes dissimilarity between an image and grid-recorded information, and that ensures minimum grid deformations. The proposed method provides a parallel implementation of this general concept and includes a novel approach to grid's elasticity modeling. The method has been experimentally verified using two different analog hardware environments, yielding high execution speeds and satisfactory processing accuracy. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

S̀lot, K., Korbel, P., Kim, H., Lee, M., & Ko, S. (2007). Parallel implementation of elastic grid matching using cellular neural networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4418 LNCS, pp. 472–481). Springer Verlag. https://doi.org/10.1007/978-3-540-71457-6_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free