Difference between revisions of "Team Z"
(→Project Image Spitfire) |
(→Assignment 2) |
||
Line 68: | Line 68: | ||
= Assignment 2 = | = Assignment 2 = | ||
+ | By the end of the semester, I have realized that picking up this source code was more or less a mistake. I have finally come to the understanding of how concurrent programming works. As I noted in assignment 1, the current code has lots of few openings where we can make use of concurrent programming using GPU. | ||
+ | |||
+ | The current structure of the image process holds an image object. The data structure is as follows: | ||
+ | class Image | ||
+ | { | ||
+ | public: | ||
+ | //various methods | ||
+ | public: | ||
+ | int N; // number of rows | ||
+ | int M; // number of columns | ||
+ | int Q; // number of gray levels | ||
+ | int **pixelVal; | ||
+ | }; | ||
+ | extern Image img; | ||
= Assignment 3 = | = Assignment 3 = |
Revision as of 16:02, 12 April 2013
Contents
Team Z
Team Members
Assignment 1
Project Image Spitfire
I am using the Image Processor code that Natalia found as the source code to find the CUDA optimization possibilities. The image processor includes various functions like displaying image, getting sub image, enlarge image, shrink image, reflect image, translate image, image rotation and image negative. The application uses lots of for looping to achieve its goal and this provide an opportunity to use the GPU to achieve output much faster and hence enhancing the application performance. Most of the code follows O(n2) notation with nested loops that can be paralleled using GPU and CUDA code.
Some of the source code that can be enhanced is as follows.
Image::Image(int numRows, int numCols, int grayLevels)
/* Creates an Image of numRows x numCols and creates the arrays for it*/ {
N = numRows; M = numCols; Q = grayLevels; pixelVal = new int *[N]; for(int i = 0; i < N; i++) { pixelVal[i] = new int [M]; for(int j = 0; j < M; j++) pixelVal[i][j] = 0; }
}
// Convert the unsigned characters to integers
int val;
for(i=0; i<N; i++)
for(j=0; j<M; j++) { val = (int)charImage[i*M+j]; image.setPixelVal(i, j, val); }
IMAGE Rotation
// goes through the array of the oldImage, uses the formulas to find where the pixel should go // then puts the old pixel value into the new pixel position on the tempImage for(int r = 0; r < rows; r++) { for(int c = 0; c < cols; c++) { r1 = (int) (r0 + ((r - r0) * cos(rads)) - ((c - c0) * sin(rads))); c1 = (int) (c0 + ((r - r0) * sin(rads)) + ((c - c0) * cos(rads))); if(inBounds(r1,c1)) // makes sure the new pixel location is in bounds, { tempImage.pixelVal[r1][c1] = oldImage.pixelVal[r][c]; } } } for(int i = 0; i < rows; i++) { for(int j = 0; j < cols; j++) { if(tempImage.pixelVal[i][j] == 0) tempImage.pixelVal[i][j] = tempImage.pixelVal[i][j+1]; } }
Assignment 2
By the end of the semester, I have realized that picking up this source code was more or less a mistake. I have finally come to the understanding of how concurrent programming works. As I noted in assignment 1, the current code has lots of few openings where we can make use of concurrent programming using GPU.
The current structure of the image process holds an image object. The data structure is as follows: class Image {
public: //various methods public: int N; // number of rows int M; // number of columns int Q; // number of gray levels int **pixelVal;
}; extern Image img;