![]() ![]() In addition, the two-stage search strategy of coarse–fine proposed in this paper can further reduce the calculation and improve matching efficiency. Generally, to get the highest cross-correlation score, the sub-image has to traverse through the whole image. In this way, it is possible to quickly eliminate matching points that cannot provide a better cross-correlation score regarding the current best candidate. According to the principle of continuous rows, the template and the sub-image under matching are divided into three subregions to obtain two upper boundary terms of NCC and get two checking conditions then. In this paper, a fast template matching algorithm of two-stage and dual-check bounded partial correlation (TDBPC) based on normalized cross-correlation (NCC) of single-check bounded partial correlation is proposed. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |