Abstract: Most graph-based skeleton matching algorithms consider the topological structure of skeleton graph，which affects matching accuracy.An improved algorithm is proposed for skeleton matching.This algorithm constructs the skeleton tree with root node based on the center of skeleton at first，then describes leaf nodes with information of geodesic path from the skeleton center to endpoints.An Improved Optimal Subsequence Bijection（IOSB） time series matching algorithm is proposed to determine the relations between the leaf nodes of two skeleton trees.It does not consider the topological structure of skeleton tree.It only matches leaf nodes.The experimental results show that this method can improve the matching accuracy.