Abstract—There are a lot of studies about shortest path algorithms. In the previous study, we showed that an A* search algorithm outperformed Dijkstra's to solve maze in terms of a search time. In this paper, to solve maze more quickly, we propose a fast and shorter path finding method based on the image processing techniques and graph theory. The experimental results show that the proposed method is superior to an A* search algorithm. In particular, the proposed method is more effective when the maze image size is large.

Index Terms—image processing techniques, maze images, shortest path algorithms, A* search algorithm, graph theory, maze image size

Cite: Yoshitaka Murata and Yoshihiro Mitani, "A Fast and Shorter Path Finding Method for Maze Images by Image Processing Techniques and Graph Theory," Journal of Image and Graphics, Vol. 2, No. 1, pp. 89-93, June 2014. doi: 10.12720/joig.2.1.89-93