About: Evolutionary Algorithm for Landmark Detection     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

there are several algorithms for locating landmarks in images such as satellite maps, medical images etc.nowadays evolutionary algorithms such as particle swarm optimization are so useful to perform this task. evolutionary algorithms generally have two phase, training and test. The fundamental particle swarm optimization algorithm used in training phase generally as follows:

AttributesValues
rdfs:label
  • Evolutionary Algorithm for Landmark Detection (en)
rdfs:comment
  • there are several algorithms for locating landmarks in images such as satellite maps, medical images etc.nowadays evolutionary algorithms such as particle swarm optimization are so useful to perform this task. evolutionary algorithms generally have two phase, training and test. The fundamental particle swarm optimization algorithm used in training phase generally as follows: (en)
sameAs
dbp:wikiPageUsesTemplate
Subject
gold:hypernym
prov:wasDerivedFrom
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
Link from a Wikipage to another Wikipage
has abstract
  • there are several algorithms for locating landmarks in images such as satellite maps, medical images etc.nowadays evolutionary algorithms such as particle swarm optimization are so useful to perform this task. evolutionary algorithms generally have two phase, training and test. in the training phase, we try to learn the algorithm to locate landmark correctly. this phase performs in some iterations and finally in the last iteration we hope to obtain a system that can locate the landmark, correctly. in the particle swarm optimization there are some particles that search for the landmark. each particle uses a specific formula in each iteration to optimizes the landmark detecting. The fundamental particle swarm optimization algorithm used in training phase generally as follows: Randomly initialise 100 individuals in the search space in the range [-1,1]LOOP UNTIL 100 iterations performed OR detection error of gbest is 0%FOR each particle pDetection errors at x = 0FOR each image i in training setFOR each pixel coordinate c in iEvaluate x of p on visual features at cIF evaluation is highest so far for i THENDetected position in i = cIF distance between detected position and marked-up position > 2mm THENDetection errors at x = Detection errors at x + 1Fitness of p at x = 1- ( Detection errors at x /Total no. of images in training set)IF new _tness of p at x > previous _tness of p at pbest THENpbest _tness of p = new _tness of p at xpbest position of p = x of p IF new _tness of p at x > previous gbest _tness THENgbest _tness = new _tness of p at xgbest position of p = x of pFOR each particle pCalculate v of pIF magnitude of v > v max THENMagnitude of v = v maxMove x of p to next position using vIF x of p outside [-1,1] range THENx of p = -1 or 1 as appropriateREPEATOutput gbest of last iteration as trained detector d (en)
foaf:isPrimaryTopicOf
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git151 as of Feb 20 2025


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 2 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software