Open AccessJournal Article
A Speed-up Algorithm Based on SSDA
1
TL;DR: A speed-up algorithm is proposed to improve the conventional image matching and has a improvement in the speed compared to SSDA.
read more
Abstract: The sequential similarity detection algorithm(SSDA) is studied to improve the conventional image matching,which is an efficient image matching algorithm.A threshold is given in the algorithm,which means the upper bound of distance between the template and the corresponding window in the image.A speed-up algorithm is proposed.The lower bound of distance between the template and the corresponding window is calculated and if the value exceeds the threshold,this window can be skipped.Experiments show that the proposed algorithm has a improvement in the speed compared to SSDA.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Fast template matching with partial skipping using sub-template
Qiao Zhang,Huijie Gao,Zhen Kang +2 more
- 16 Jul 2012
TL;DR: A new fast template matching method with partial skipping using sub-template, where template size subtracts the subtemplate size and the next threshold equal to the current optimization SAD value is set.
7
Related Papers (5)
[...]
Lie Kang,Sheng Zhong,Zuoqian Du,Zhangfa Ren +3 more
- 20 Nov 2011
Chang Liu,Yongqiang Bai +1 more
- 01 May 2017