车牌定位是车牌自动识别系统中关键的第一步,传统的最大梯度差算法按图像像素矩阵的顺序进行扫描和运算,存在运算量大,耗时长的缺点。
The traditional MGD (maximum gradient difference) algorithm based on the order of the image pixels matrix has the shortcomings of the large operation measure and long-time running.
这避免了后剪枝策略所需的高昂代价,减少了扫描磁盘数据的次数和大量的CPU时间,进一步提高了算法的效率。
This avoid high cost by using post-pruning measure which require many times for scanning disk data and amount of CPU time. So we gain a high efficiency.
这避免了后剪枝策略所需的高昂代价,减少了扫描磁盘数据的次数和大量的CPU时间,进一步提高了算法的效率。
This avoid high cost by using post-pruning measure which require many times for scanning disk data and amount of CPU time. So we gain a high efficiency.
应用推荐