There is an image A (5x5) 3bit depth and filter operator matrix (3x3) and (padding fill "O"). Do computation for b) till f): a) Image matrix A (5x5) b) Mean filter c) Midpoint filter d) Negative filter e) Low pass filter with threshold = 4 f) Weighted average 3 6 3 2 0 1 10 N 6 7 2 Nin N N N (d) 2 1 7 5 2 (a) Image A 5 NON 2 7 1 0 (b) (e) (c) (f)

There is an image A (5x5) 3bit depth and filter operator matrix (3x3) and (padding fill "O"). Do computation for b) till f): a) Image matrix A (5x5) b) Mean filter c) Midpoint filter d) Negative filter e) Low pass filter with threshold = 4 f) Weighted average 3 6 3 2 0 1 10 N 6 7 2 Nin N N N (d) 2 1 7 5 2 (a) Image A 5 NON 2 7 1 0 (b) (e) (c) (f)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Laplacian Image Pyramid A Laplacian image pyramid is a multi-scale representation of a single image that highlights intensity discontinuities at multiple scales. It is obtained by convolving an image with a Gaussian mask and subtracting the smoothed image from the original one. The next level of the pyramid is obtain by repeating this process on the smoothed image after it is down-sampled. Create a 3 level Laplacian image pyramid of the woods image (after conversion from uint8 to double format), using a Gaussian with a standard deviation of 1.5, using "same" as the shape parameter for the conv2 function, and resizing by a scale factor of 0.5 using nearest-neighbour interpolation. Display the images in the pyramid as subplots in the same window. EXERCISE: For the last level of the pyramid report the values at the following locations (correct to at least 2 decimal places): row=3, column=5 row=1, column=2
Perform histogram equalization on the following 6*6 image the gray scalelevel distribution of the image is given below
With examples, explain sampling and quantization methods used in Image Processing. The number sampling methods and quantization methods need to be a minimum 3.
1) Obtain the gray level transformation function that stretches gray scale range (0, 10) into (0, 15) shifts range (10,20) to (15,25) and compress range (20,30) into (25,30). 2) Grey level histogram of an image is given below, Compute histogram equalization. Draw the histogram of input & output image. GREY LEVEL 0 1 2 3 4 5 FREQUENCY 790 1023 850 656 329 245 122 81 3) For the 3 bit 4x4 size image perform following operations: (a) Negetion (b) Thresholding with T-4 (c) Intensity leve! slicing with hackground with r1-2 and r2= 5 (d) Plot the image histogram, and find probability density function (PDF)? 2 1 3 4 7 4 2 3 5 5 1 4 6. 4 2 2 1 4
Given a 2D point (x, y) in screen space with an associated z-buffer value (zbuf), write out psuedocode for determining whether or not to draw that point.
For an image of size 32x32 and a filter of size 5x5, if you want the convolution result to keep the original image size, what's the padding size in pixels? a) 5 b) 2 c)10 d) 3 explain.
Q3: Apply the Mean-Filter to the following image 3 1 10 14 7 13 7 7 mO77 27744 159 66
For the medical image given apply the smoothing for 3x3sized image matrix x with the kernel h of size 3x3, shown below in Figure 1. and compute the pixel value of the output image applying padding Original 1 2 3 4 5 6 7 8 9 IMAGE 3*3 -1 1. -1 -1 -2 -1 1 1 2 1. KERNAL 3*3
A point in 3D space has coordinates [20,-20,500] mm relative to the camera reference frame. If the camera has an image plane at distance f'=31 mm from its optical centre, the CCD array is 17 mm by 14 mm and is divided into 320 by 220 pixels, and the image principal point is at coordinates [160,110] pixels, then determine the coordindates (in pixels) where the point will appear in the image using the pinhole camera model of image formation. ANSWER: Coordinates of point in image: (
(a) An image with 8 gray levels is shown in the following figure. Hand calculates histogram equalization to the image. Show how you compute the mappings and the histogram equalized image. [2 0 1 1 01 155 5 1 4 5 4 4 5 4 5 5 5 7 Lo 1 5 6 1- (b) Hand calculates the Sobel edge detection on the image below. Step: (1) apply X operator (convolution) to obtain GX, (2) apply Y operator to obtain GY, (3) combine GX and GY using the "sum of absolute values" to obtain G. Show your GX, GY and G. 0 0 0 0 100 0 100 0 0 0 0 0 0 100 100 100 100 0 0 100 100 100 Image: 0 0 100 100 100 100 100 100 0 0 0 0 100 0 0 100 100 100 100 0 0 0 0 Lo 0 -1 0 11 0 2 -1 0 11 -2 X operator: -2 Y operator: 1 1
2. [Vector Quantization] Please consider the 4 pixel by 4 pixel image below: 202,118,148 237,141,151 250,172,164 239, 166, 169 122,36,41 175,53,18 228,43,118 233, 134,60 70,49,62 86,49,35 150,39,43 169,56,58 151, 132, 233 169, 135,244 179,135,244 174,139,244 The table contains the RGB values of the sixteen pixels. All RGB values are in 8-bit, i.e. from 0 to 255. We intend to quantize the image into 4 levels of color via K-means clustering. a) Assuming we have initial quantization levels of (70,70,70), (120,120,120), (155,155,155), (255,255,255) and use Euclidean distance as a measurement of error calculate the result of the first step of the K-means clustering operation. This includes which quantization level each of the pixels will be quantized to, and what the modified quantization vector would be after the first adjustment. b) Compute a reasonable final set of quantization levels for the image. You can use any programming language you are familiar with.
Which spatial filters do you use to reduce the noise if an image is corrupted by(i) salt and pepper noise only,(ii) Gaussian noise only,(iii) both salt and pepper noise and Gaussian noise.Give a single filter name as answer to each cases asked above.