Design and implement a C version of the color match program. As a starting point, use the file HW2-1-shell.c. The program should employ a reasonable algorithm that compares all pairings of colors in the palette exactly once. A color should not be compared to itself. Nor should two colors be compared

---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

/* Color Matcher

This program finds the two closest colors in an array of packed RGB values, based on the total component difference (computed as a sum of absolute difference.) It prints the total component difference of the two closest colors.

Date: Your Name: */

#include #include

int main(int argc, char *argv[]) { /* you may change and add to these declarations and initializations */ unsigned Pixels[8]; int NumPixels, MinDelta=-55; // temporary initial value int Load_Mem(char *, unsigned *);

if (argc != 2) { printf("usage: ./HW2-1 valuefile "); exit(1); } NumPixels = Load_Mem(argv[1], Pixels); if (NumPixels != 8) { printf("valuefiles must contain 8 entries "); exit(1); }

/* Your code goes here */ printf("The two closest colors have a total component difference of %d ", MinDelta); exit(0); }

/* This routine loads in up to 8 newline delimited unsigned integers from a named file in the local directory. The values are placed in the passed unsigned integer array. The number of input integers is returned. */

int Load_Mem(char *InputFileName, unsigned PixelArray[]) { int N, Addr, NumVals; unsigned Value; FILE *FP; FP = fopen(InputFileName, "r"); if (FP == NULL) { printf("%s could not be opened; check the filename ", InputFileName); return 0; } else { for (N=0; N

--------------------------------------------------------------------------------------------------------------------------

Summary: Many computer vision applications require the comparison of the color of image pixels, for example, in tracking based on object appearance. This assignment explores the function and implementation of several basic conditional execution, nested iteration, and memory access mechanisms to realize a color matching program. RGB representation and selects the two that most closely match (as measured in total component difference). The total difference of the closest colors is also determined. The program compares eight colors stored in memory in a packed Background: Digital imaging devices often represent color pixel data as a triple of typically eight bit integers representing the intensity of its red, green, and blue components (RGB foa). Since most of today's computers employ 32-bit words, the color of a single pixel is encoded in a packed representation, shown below. 31 unused red component n component blue component 31 24 23 16 15 In this assignment, eight such values are created and stored in memory. There are several commonly used metrics to assess color difference. In this case, color differences are measured as the total component difference, also known as the sum of absolute difference (SAD), defined as: ColorDifferencA-A,-B A,-B where the subscript indicates the red (r), green (g), or blue (b) component of color A or B. To compute the minimum color difference, all combinations of different colors must be compared. . Color Match 1.0 (58.86, 167) 22, 170. 25) (239, 171, 138) (25, 51, 27) 187, 39, 73) [S8, 150. 206) [38, 159, 72) 247, 24, 233) 5012 5016 5020 5024 5028 5032 5036 5040 Figure 1: Color Palette generated by swi 500, with (R, G, B) values listed above, memory addresses below. Objective: For this assignment, you will write two programs, one in C and one in MIPS. There are three key tasks each color matching program needs to be able to do: 1. Unpack a color by pulling the individual unsigned 8-bit red, green, and blue component values from the lower 24 bits of a 32-bit integer. Hint: in C, the shift (>) and mask (&) operators may be useful; in MIPS, the load byte instructions may be helpful //www.ece.gatech.edu/academic/courses/ece2035/assi oad-Store- Note that the Misasim memory at the word address is little endian: the least significant byte is located Objective: For this assignment, you will write two programs, one in C and one in MIPS. There are three key tasks each color matching program needs to be able to do: 1. Unpack a color by pulling the individual unsigned 8-bit red, green, and blue component values from the lower 24 bits of a 32-bit integer. Hint: in C, the shift (>) and mask (&) operators may be useful; in MIPS, the load byte instructions may be helpful (http://www.ece.gatech edu/academic/courses/ece2035/assignments/Load-Store-Byte-Insts.pdf Note that the Misasim memory implementation is little endian: the least significant byte is located at the word address. 2. Compute the color difference (SAD) between two given unpacked colors using the formula given above. 3. Use nested loops and conditionals to orchestrate the comparison of all pairs of unpacked colors to find the pair with the minimum SAD. Project Deliverables 1. Design and implement a C version of the color match program. As a starting point, use the file Hw2-1-shell.c. The program should employ a reasonable algorithm that compares all pairings of colors in the palette exactly once. Acolor should not be compared to itself. Nor should two colors be compared to each other more than once. Your C program should print out the total component color difference for the closest pair using the print string provided in the shell code Name the file HW2-1.C and upload it to Canvas by the scheduled due date. The shell program HW2-1-shell.c includes a reader function Load_Mem() that loads the values from a text file. You should use gcc under Ubuntu to develop your program. Sample test files (test119.txt, test30.txt, test111.txt) are provided - the number in the name of each file indicates the correct answer for the min component difference. You should compile and run your program using the Linux command lines: >gcc HW2-1.c -g -Wall -o HW2-1 /HW2-1 test119.txt You can create additional test files using MiSaSiM to run HW2-2-shell.asm, go to the end of the trace, and use the "Dump" memory menu button to save the memory to a text file with the correct answer (the value in $13) in the name of the file. 2. Design and implement a MIPS version of the color match program. A description of the MIPS library routines you need is given below. Use the file HW2-2-shell.asm as a starting point. The results should be returned by your program in $10 (minimum total component difference), $11 (memory address of closest color A), and $12 (memory address of closest color B). You must use these register conventions or the automated grader will score your program incorrectly Memory should only be used for input to your program. Your program must return to the operating system via the jr instruction Programs that include infinite loops or produce simulator warnings or errors will receive zero credit. Name the file HW2-2.asm and upload it to Canvas by the scheduled due date