DocumentCode
2042002
Title
A study of shortest path algorithms in maze images
Author
Murata, Yoshitaka ; Mitani, Yoshihiro
Author_Institution
Ube Nat. Coll. of Technol., Ube, Japan
fYear
2011
fDate
13-18 Sept. 2011
Firstpage
32
Lastpage
33
Abstract
There are a lot of studies about shortest path algorithms. They are usually applied to graphs. However, there is little study of maze images by image processing techniques. In this paper, the shortest path algorithms, Dijkstra´s and A* search algorithms, have been examined in maze images in terms of a search time. Furthermore, we have proposed a method to apply a thinning technique to maze images in order to solve a maze more quickly.
Keywords
graph theory; image thinning; search problems; A* search algorithm; Dijkstra algorithm; image processing techniques; maze images; shortest path algorithms; thinning technique; Cost function; Games; Image color analysis; Round robin; Streaming media; Time measurement; Image Processing Techniques; Maze Images; Search Time; Shortest Path Algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
SICE Annual Conference (SICE), 2011 Proceedings of
Conference_Location
Tokyo
ISSN
pending
Print_ISBN
978-1-4577-0714-8
Type
conf
Filename
6060570
Link To Document