Premium
Genetic algorithms for scene interpretation from prototypical semantic description
Author(s) -
Prabhu D.,
Buckles B. P.,
Petry F. E.
Publication year - 2000
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/1098-111x(200010)15:10<901::aid-int1>3.0.co;2-c
Subject(s) - fitness function , computer science , interpretation (philosophy) , ideal (ethics) , algorithm , genetic algorithm , image (mathematics) , artificial intelligence , semantic interpretation , representation (politics) , basis (linear algebra) , norm (philosophy) , domain (mathematical analysis) , mathematics , machine learning , mathematical analysis , philosophy , geometry , epistemology , politics , political science , law , programming language
Abstract Use of a genetic algorithm assumes the existence of a figure of merit called fitness, for which there is a value for every candidate solution. The fitness must be measurable over the representation of the solution by means of a computable function. The fitness function is, in most cases, independent of the other factors, including the algorithm used. Often, the fitness is an estimation of the nearness to an ideal solution or the distance from a default solution. In image scene interpretation, the solution takes the form of a set of labels corresponding to the components of an image and its fitness is difficult to conceptualize in terms of distance from a default or nearness to an ideal. Here we describe a model in which a semantic net is used to capture the salient properties of an ideal labeling. Instantiating the nodes of the semantic net with the labels from a candidate solution (a chromosome) provides a basis for estimating a logical distance from a norm. This domain‐independent model can be applied to a broad range of scene‐based image analysis tasks. © 2000 John Wiley & Sons, Inc.