Fingerprint matching algorithm is a key issue of the fingerprint recognition, and there already exist many fingerprint matching algorithms, According to the dependence of the core point, fingerprint matching algorithms are divided into two groups, core-based match algorithms and noncore-based match algorithms. Most of the noncore-based matching algorithm is time consuming, therefore, they are not suitable for online application; meanwhile, the core-based matching algorithm is efficient than the noncore-based matching algorithm, but it highly depends on the core detection precision. In this paper, we present a new core-based structure matching algorithm which considers both efficient and precision. Firstly we used core detection algorithm to get the core position, then we define some local structure of the core area. Used these local structure, we can find some correspondent points of the two fingerprint image. Secondly, we use the correspondent points in the first stage to match the global feature of the fingerprint. Experimental results show that the performance of the proposed algorithm is good.