1991
DOI: 10.1364/ol.16.000648
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithm for optical pattern recognition

Abstract: A genetic algorithm is used to generate binary reference functions for optical pattern recognition and classification. Procedures based on the properties of convex functions can be implemented directly on hybrid electro-optical systems. Computer simulations demonstrate the efficiency of this novel approach.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

1998
1998
2015
2015

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 61 publications
(21 citation statements)
references
References 5 publications
0
21
0
Order By: Relevance
“…(11) and (12), we can create a unique corresponding relationship from point to point on the hemisphere and the observation plane. (11) and (12), we can create a unique corresponding relationship from point to point on the hemisphere and the observation plane.…”
Section: Procedures Of the Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…(11) and (12), we can create a unique corresponding relationship from point to point on the hemisphere and the observation plane. (11) and (12), we can create a unique corresponding relationship from point to point on the hemisphere and the observation plane.…”
Section: Procedures Of the Algorithmmentioning
confidence: 99%
“…Having known the amplitude of the object plane and the target plane, one solves the phase information of the object plane. 10 A global algorithm, such as a genetic algorithm 11 and simulated annealing 12 algorithm, can also be applied as the global-minima-searching method, but these algorithms generally have a slow convergence speed and the reconstruction precision is also not very high. In the 1970s, Gerchberg and Saxton had proposed the GS algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…Genetic algorithms (GA) are categorized as global search heuristics [30][31][32]. Genetic algorithms are a particular class of evolutionary algorithms (also known as evolutionary computation) that use techniques inspired by evolutionary biology, such as inheritance, mutation, selection and crossover (also called recombination).…”
Section: Genetic Optimization Algorithmsmentioning
confidence: 99%
“…The procedure is continued until jC i j reaches a minimum value. Various optimization techniques for improving computer generated holograms have been implemented, such as simulated annealing [60] or the use of genetic algorithms [61]. Simulated annealing uses DBS but also includes a probabilistic evaluation of the cost function that helps to find out more global minima than in a simple DBS method.…”
Section: Computer Generated Hologramsmentioning
confidence: 99%