一种用于图象旋转的快速算法

A FAST ALGORITHM OF IMAGE ROTATION

  • 摘要: 本文提出了一种易于硬件实现的图象旋转快速算法,通过对旋转矩阵的分解,将图象旋转分成三次相继的行(或列)伪平移(行—列—行).这种每次只按行或列的平移可以并行进行,也容易用硬件实现.利用这种算法在配有一片 Transputer 的 PC 机上旋转一幅256×256的图象仅需4s,大大提高了处理速度.文中对这种算法的计算复杂性及旋转过程引起的误差进行了分析,并与其他方法进行了比较.

     

    Abstract: This paper has described a new image rotation algorithm which can be easily implemented by hardware. The algorithm is executed by decomposing the image rotation transfomation into three sucessive sub-trans-formtion(row—col—row),each of them called pseudo-translation.As the pixels on one row (or column) is translated by a same offset,the translation between different rows or column can be accessed parallelly in every pseudo-translation.So the rotating time is shorter than conventional techniques.With this method,the processing time that it takes to rotate a gray scale image made up of 256×256 pixels is about 5s even performing in software.

     

/

返回文章
返回