Εμφάνιση απλής εγγραφής

dc.contributor.author Δελήμπασης, Κωνσταντίνος Κ. el
dc.contributor.author Ασβεστάς, Παντελής Α. el
dc.contributor.author Ματσόπουλος, Γεώργιος Κ. el
dc.date.accessioned 2015-02-09T10:22:23Z
dc.date.available 2015-02-09T10:22:23Z
dc.date.issued 2015-02-09
dc.identifier.uri http://hdl.handle.net/11400/5911
dc.rights Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες *
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/us/ *
dc.source http://www.elsevier.com/ en
dc.subject Automatic correspondence
dc.subject Medical images
dc.subject Αυτόματη αλληλογραφία
dc.subject Ιατρικές εικόνες
dc.title Multimodal genetic algorithms-based algorithm for automatic point correspondence en
heal.type journalArticle
heal.classification Medicine
heal.classification Biomedical engineering
heal.classification Ιατρική
heal.classification Βιοϊατρική τεχνολογία
heal.classificationURI http://id.loc.gov/authorities/subjects/sh00006614
heal.classificationURI http://id.loc.gov/authorities/subjects/sh85014237
heal.classificationURI **N/A**-Ιατρική
heal.classificationURI **N/A**-Βιοϊατρική τεχνολογία
heal.identifier.secondary doi:10.1016/j.patcog.2010.06.009
heal.language en
heal.access campus
heal.recordProvider Τ.Ε.Ι. Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Βιοϊατρικής Τεχνολογίας Τ.Ε. el
heal.publicationDate 2010
heal.bibliographicCitation Delibasis, K., Asvestas, P. and Matsopoulos, G. (December 2010). Multimodal genetic algorithms-based algorithm for automatic point correspondence. Pattern Recognition. 43(12). pp. 4011-4027. Elsevier Science Ltd: 2010. Available from: http://www.sciencedirect.com [Accessed 20/06/2010] en
heal.abstract In this paper, the problem of automatic determination of point correspondence between two images is formulated as a multimodal function optimization and the usefulness of genetic algorithms (GAs) as a multimodal optimizer is explored. Initially, a number of variations of GAs, capable of simultaneously discovering multiple extremes of an objective function are evaluated on a mathematical benchmark objective function with multiple unequal maxima. The variation of the GAs that performs best on the benchmark function, in terms of the number of maxima discovered, is selected for the determination of automatic point correspondence between two images. The selected variation of the GAs involves an iterative procedure for the formation of a genetic population of individuals (or chromosomes). Each individual encodes the position of a point of interest on one of the available images as well as parameters of a local transformation that generates the position of the corresponding point on the other image. The proposed algorithm aims to discover individuals that corresponds to local maxima of an objective function that measures the similarity between patches of the two images. When the GAs-based multimodal optimization algorithm terminates, pairs of corresponding points between the two images are obtained that can be used for the generation of a dense deformation field by means of the thin plate splines model. The proposed algorithm is applied to 2D medical images (dental and retinal images) under known transformations (similarity and elastic transformation) and is also assessed on medical images with unknown transformations (computer tomography transverse slices). The proposed algorithm is compared against the iterative closest point (ICP) algorithm, and a well-known non-rigid registration algorithm, based on free-form deformations (FFD) using various quantitative criteria. The obtained results indicate that in case of known similarity transformations, the proposed multimodal GAs-based algorithm and the ICP algorithm present equivalent performance, whereas the FFD algorithm is clearly outperformed. In the case of known sinousoidal deformations, the proposed multimodal GAs-based and the FFD algorithm achieve equivalent performance and clearly outperform the ICP algorithm. Finally, in the case of unknown elastic deformations, the proposed GAs-based algorithm appears to perform marginally better than the FFD algorithm, whereas it clearly outperforms the ICP algorithm. en
heal.publisher Elsevier Science Ltd en
heal.journalName Pattern Recognition en
heal.journalType peer-reviewed
heal.fullTextAvailability true


Αρχεία σε αυτό το τεκμήριο

Οι παρακάτω άδειες σχετίζονται με αυτό το τεκμήριο:

Εμφάνιση απλής εγγραφής

Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες Εκτός από όπου ορίζεται κάτι διαφορετικό, αυτή η άδεια περιγράφεται ως Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες