Presentation 2002/1/23
Improvement of a Search Algorithm Using a Genetic Algorithm and Simulated Annealing for a Correspondence Problem
Kenji SUZUKI, Miki HASEYAMA, Hideo KITAJIMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes a method which improves a search algorithm using a genetic algorithm and simulated annealing for a correspondence problem. The previous method may get caught in a local minimum. Due to an improvement in the search algorithm the proposed method detects good genes of each locus in search process of the previous method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) genetic algorithm / simulated annealing / feature point / correspondence problem / elastic model
Paper # ITS2001-73, IE2001-212
Date of Issue

Conference Information
Committee ITS
Conference Date 2002/1/23(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Intelligent Transport Systems Technology (ITS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Improvement of a Search Algorithm Using a Genetic Algorithm and Simulated Annealing for a Correspondence Problem
Sub Title (in English)
Keyword(1) genetic algorithm
Keyword(2) simulated annealing
Keyword(3) feature point
Keyword(4) correspondence problem
Keyword(5) elastic model
1st Author's Name Kenji SUZUKI
1st Author's Affiliation School of Engineering, Hokkaido University()
2nd Author's Name Miki HASEYAMA
2nd Author's Affiliation School of Engineering, Hokkaido University
3rd Author's Name Hideo KITAJIMA
3rd Author's Affiliation School of Engineering, Hokkaido University
Date 2002/1/23
Paper # ITS2001-73, IE2001-212
Volume (vol) vol.101
Number (no) 625
Page pp.pp.-
#Pages 6
Date of Issue