关于图形旋转矩阵原理的探究

电子科技大学格拉斯哥学院-2017200505016-苑正达

Abstract

In this paper, we will introduce the relationship between graphic processing and linear algebra. For example, we will show how to translate a graph into a matrix, and introduce some typical algorithm to give the digital graph some operations. How to do some basic transition like rotating a graph, and how to sharpen a picture is included in our discussion. We finish this paper by searching some information about our topic, and do some experiment utilizing “Matlab” to confirm the information we got.

Introduction

In our daily life，the computer graphics operation with the use the linear transformations is commonly applied and can be seen everywhere. For example, when we are taking photos by mobile phone, some might have the needs of dealing with the pictures or change some parameters of it, so it can be more colorful and beautiful. What is more, some functions such as deblurring operation and image restoration techniques also have positive effect on the professional regions such as criminal investigation and remote-control technology.
image rotation

Question
We are confused about how the computer construct the graphics by using linear transformations and how the linear transformations work when giving the computer graphics some operations.

Solution
To answer the first question, we have to know about the knowledge of rotate the picture with the operation in digital. Above all, it is common to think that the origin is at the center of the picture and it rotates with regard to this point, but the truth is that in the region of computer picture, the origin is at the top-left corner of it, so before the compute, we have to move the origin at the top-left corner to the center of the picture, and reversal the y-axis. We assume a point the width of the picture is W, and the height of it is H. After the transition, the coordinate of this point is The formula of transition is shown later.

The rotate angle is , we assume that the coordinate of the point which has rotate with the angle is the formula is shown later.

After the rotation, the width of the picture is W’’, and the height of it is H’’, so the formula of the origin in the center that changed to the top-left corner is

According to the matrixes that cited above, a point in the original picture could be rotated to according to the formula shown later.
*
Simultaneously, the point after rotation could be transformed to the point in the original picture according to the formula shown later.
*
The first method is forward mapping, which calculate the coordinate after rotating by using the coordinate from the original picture, and give the corresponding grey level to the picture after rotating. The most significant drawback is that there exist some regular noise in this after-rotating picture, the example is below.

The original picture

To solve the problem shown above, it is safe to use reverse mapping, which is starting from the picture after rotating, and find the point which is corresponding. Then transfer the grey-level value of the original picture back. Then after the rotating, every pixel of the picture could correspond with a point in the original picture, which could be more accurate by using different strategies.

After the reverse mapping, we could get this result, which could better solve the problem of regular noise. The example is below.
I introduce some methods in terms of rotating images and some relevant solutions in order to deal with the regular noise, and it finally have a good result about rotating pictures perfectly.