一种新的近似Radon变换计算结构
A Novel Architecture for Computing Approximate Radon Transform
摘要：
Radon变换是一种用于图像处理的变换，它将图像转换到截距-斜率坐标系。它的对角特性使它适合于一些需要不同程度处理的应用。Radon变换计算需要大量的算术运算，这使得它成为一种计算密集型算法。文献中介绍了一种计算Radon变换的近似算法，它降低了计算的复杂性。但该算法复杂，需要对内存进行任意访问.本文提出了一种顺序访问存储器的算法。在下面的架构中，介绍了使用流水线来降低算法的时间复杂度。
英文摘要：
Radon transform is a type of transform which is used in image processing to transfer the image into intercept-slope coordinate. Its diagonal properties made it appropriate for some applications which need processes in different degrees. Radon transform computation needs a lot of arithmetic operations which makes it a compute-intensive algorithm. In literature an approximate algorithm for computing Radon transform is introduces which reduces the complexity of computations. But this algorithm is complex and need arbitrary accesses to memory. In this paper we proposed an algorithm which accesses to memory sequentially. In the following an architecture is introduced which uses pipeline to reduce the time complexity of algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
