Question

c++

solve each task please

O https//maryash.github.io/135/labs/lab 08 html Since the program should work for all input images that fit into the array, don't Thard-code" the cat picture dimensions into the program, use variables w and h instead Task D. One-pixethick frame Program frame.cpp Same as the previous task, but it should be a frame exactly one pixel thick Example: Task E. Scale 200% Program scale.cpp Scale the original picture to 200% of its size. It can be done by increasing the ere to search Dll dx d) Prt Scn,, 18 Home End O hmps//maryash github 1o/135/labs/lab 08 html Task E. Scale 200% Program scale.cpp Scale the ongnal picture to 200% of its size. It can be done by increasing the sze of the picture by the factor of 2, and copying each pixel of the input as a small 2x2 square in the output. (We don't do any interpolation of colors as more advanced scaling procedures would do.) 11 22 33 44 11 11 22 22 11 11 22 22 33 33 44 44 33 33 44 44 Example O Type here to search di do Prt Scn Home p EndPg 5 6 С Ohttps://maryash githubionasatsab08 html -) Task F. Pixelate Program pixelate.cpp wil be pixelating the input image Example 0 Type here to search 4 PrtScn Home EndPgUp 5 6 e С https://mtaryashgthuba135Aabuab.08html Task F. Pixelate Program pixelate.cpp will be pixelating the input image Example way to pixelate an image is to eflectively make every 2x2 non-overlapping window same value (averaged over all the pixels in that window ot the input) For example, the following contain the 18 28 38 40 11 21 31 41 12 22 32 42 13 23 33 43 should be transformed to 16 16 36 36 O Type here to search Prt Scn Home End PUp w 6 0 WE TY U IOP C htts/maryash.github io/135/ labs/ab 08.hml 12 22 32 42 13 23 33 43 should be transformed to 16 16 36 36 16 16 36 36 18 18 37 37 18 18 37 37 where the 16 was computed by averaging 10, 20, 11, and 21 (after rounding), and so on For simplicity, assume that the width and the height of the image are even numbers, so the picture is divisible into small 2x2 squares, like in the example above. Task o (eonus) Kamal mothod image fitorng A siliding window operator replaces each pixel with some function of its 8 neighbors (and itselt) Consider pixel and its 8 neighbors (labeled a i ) that form a 3x3 window around it. abe O Type here to search Prt Scns End vo 4 6 8 WE R (--) С http://maryashgthub iar sabsab08 html Task G (Bonus). Kernel method image fitering A siding window operator replaces each pixel with some function of its 8 neighbors (and itsei) Consider prel e and its 8 neighbors (labeled a-i ) that form a 3x3 window around it ts neighbors (abeledyhat form a bc .def. 8 hi. The operation replaces pixele (in the middle of the 3x:3 window) with some function of its neighbors fa,b,c,d,e,f.g.h,1) It is possible to implement blur, edge detection, and many other image processing operations using this technique References Lode's Computer Grarhics Tiaerial image Filtering For this task, winite a program kerne1.cpp which implements a horizontal edge detection operation. One way to detect horizontal edges is to use the function Type here to search Prt Scn Home 2 6 8 WIE > С https://maryash.gthubio/13sabsab,08 html For this task, write a program kernel.cpp which implements a horizontal edge detection operation. One way to detect horizontal edges is to use the function f(a,b,c,d,e,f,g,h,i)(8+2h+1)-(a+2b+c) (This is one component of the so called Sobel operator, if you want to read more aboutis Remark 1 Note that this is a sliding window operator unlike the non-overlapping window pixelization operator in the previous task. That is, the considered window is always a window whose value is being computed around the pixel 2 You shouldn't overwnite the original array. Make a new array for the output, and write the resulting pixel color into the new array Remark 3: There are Type here to search Prt Scn Home End Pak 5 6 9 W I

Answer 1

Task F

#include <iostream>

#include <cassert>

#include <cstdlib>

#include <fstream>

using namespace std;

const int MAX_H = 512;

const int MAX_W = 512;

// Reads a PGM file.

// Notice that: height and width are passed by reference!

void readImage(int image[MAX_H][MAX_W], int &height, int &width) {

char c;

int x;

ifstream instr;

instr.open("inImage.pgm");

// read the header P2

instr >> c;

assert(c == 'P');

instr >> c;

assert(c == '2');

// skip the comments (if any)

while ((instr>>ws).peek() == '#') {

instr.ignore(4096, '\n');

}

instr >> width;

instr >> height;

assert(width <= MAX_W);

assert(height <= MAX_H);

int max;

instr >> max;

assert(max == 255);

for (int row = 0; row < height; row++)

for (int col = 0; col < width; col++)

instr >> image[row][col];

instr.close();

return;

}

// Writes a PGM file

// Need to provide the array data and the image dimensions

void writeImage(int image[MAX_H][MAX_W], int height, int width) {

ofstream ostr;

ostr.open("outImage.pgm");

if (ostr.fail()) {

cout << "Unable to write file\n";

exit(1);

};

// print the header

ostr << "P2" << endl;

// width, height

ostr << width << ' ';

ostr << height << endl;

ostr << 255 << endl;

for (int row = 0; row < height; row++) {

for (int col = 0; col < width; col++) {

assert(image[row][col] < 256);

assert(image[row][col] >= 0);

ostr << image[row][col] << ' ';

ostr << endl;

}

}

ostr.close();

return;

}

int main() {

int img[MAX_H][MAX_W];

int h, w;

int avg = 0;

readImage(img, h, w); // read it from the file "inImage.pgm"

// h and w were passed by reference and

// now contain the dimensions of the picture

// and the 2-dimesional array img contains the image data

// Now we can manipulate the image the way we like

// for example we copy its contents into a new array

int out[MAX_H][MAX_W];

for(int row = 0; row < h; row++) {

for(int col = 0; col < w; col ++) {

avg = (out[row][col] + out[row][col + 1] + out[row + 1][col] + out[row + 1][col + 1])/4; // find ave

out[row][col] = out[row][col + 1] = out[row + 1][col] = out[row + 1][col + 1] = avg;

col += 2; // skip a col

row += 2; // skip a row

}

}

// and save this new image to file "outImage.pgm"

writeImage(out, h, w);

}