针对不完整目标的查找，提出一种基于分块统计的快速模板匹配算法。
A novel fast template matching algorithm for incomplete target searching based on block statistics was presented.
分析了传统的模板匹配算法，提出了一种新的基于投影的快速模板匹配算法。
A new algorithm of fast template matching based on the projection was proposed.
快速模板匹配(FTM)是一种非常实用高效的实时语音识别算法，尤其适用于命令识别系统。
Fast Template Matching (FTM) is a very practical, effective realtime speech recognition algorithm, especially suitable for command recognition system.
提出了一种基于模板匹配的快速人脸定位算法。
This paper presents a fast and reliable face location algorithm based on template matching.
使用一种新的假面变换和模板匹配的人脸检测算法，能够对复杂环境中大小不等的人脸进行快速、准确的检测。
A novel algorithm of face detection based on mask transform and template match makes face detection more accurate and faster in different face sizes with complex condition.
提出了一种用差影法与多模板匹配快速实现人脸检测的方法。
In this paper, a fast human face detection method based on difference image and multi-templates matching is proposed.
该算法利用积分投影法预测人脸可能的范围与位置，然后在限定的范围内采用模板匹配的方法定位人脸，从而实现了快速且可靠的人脸定位。
The algorithm firstly detects the sphere and possible location of a face through integration projection and then realizes the precise location of the face within the sphere.
通过细化处理后，再采用模板匹配法可以快速准确地识别出车牌字符等。
After refinement processing, USES the template match method to be possible distinguish the car license character fast and accurately and so on.
针对目前图像处理中模板匹配方法一般具有较大计算量的不足，提出使用遗传算法进行快速的搜索。
Many template matching approaches in current image processing literatures are not practical because of their time consuming and complicated computation.
系统采用了图像处理和模式识别等技术，提出了一种基于模板匹配的快速人脸定位算法。
The system combines image processing and pattern recognition techniques. We present a fast and reliable face location algorithm based on template matching.
该方法不但利用了小波的快速匹配的特点，而且克服了由于抽取引起信息丢失而造成的匹配的错误，充分利用模板结构信息。
This method not only USES the feature of wavelets fast matching, but also overcomes the matching error from decimating and takes good use of the structure unit information.
陷入局部最优是快速块匹配算法的固有缺陷，为了减少陷入局部最优的概率，详细讲述了块像素匹配的搜索模板与搜索步骤。
Local minimum is one of the inherent problems of block based matching. In order to reduce the chance of falling into this problem, the improved search templates and searching steps are introduced.
陷入局部最优是快速块匹配算法的固有缺陷，为了减少陷入局部最优的概率，详细讲述了块像素匹配的搜索模板与搜索步骤。
Local minimum is one of the inherent problems of block based matching. In order to reduce the chance of falling into this problem, the improved search templates and searching steps are introduced.
应用推荐