Paper
1 April 1998 Image preprocessing by neuronlike algorithms
Sergey O. Kuznetsov, Irina V. Nuidel, Andrey I. Panfilov, Vladimir G. Yakhno
Author Affiliations +
Abstract
The problem of image pre-processing by neuron-like algorithms concerns development of systems and methods of image processing in parallel regime. The processing algorithms of grey-tone images to sets of simplified binary images by software of neuron-like filtration (based on the models of homogeneous neural networks) are considered in the paper and partially realized. The time of image processing is calculated. Carrying out of the required set of operations with image is possible according to the convolution function view. The neural network parameters (the type of coupling function and type of element response to the external influence) are selected in accordance with the solution which we want to receive. The program uses function similar to the Mask Convolution function. This function as any other functions basic for image processing are realized in the Intel Corporation `Recognition Primitives Library (RPL) for the Pentium Processor' with great efficiency. Library works under Windows NT. Performed calculations confirm that neuron-like model may be applied for real time image processing using RPL.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sergey O. Kuznetsov, Irina V. Nuidel, Andrey I. Panfilov, and Vladimir G. Yakhno "Image preprocessing by neuronlike algorithms", Proc. SPIE 3402, Optical Information Science and Technology (OIST97): Optical Memory and Neural Networks, (1 April 1998); https://doi.org/10.1117/12.304983
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image processing

Algorithm development

Convolution

Neural networks

Chemical elements

Detection and tracking algorithms

Binary data

Back to Top