ONLINE CLASS ASSESSMENT 4 Course Code? CSE- 40% Course Title $ Digital Image Processing Submitted Bys Musfika Jahan Id¢ 345 Bsc CHons.) 4th Yeore 1st Semester Department of Computer stience 8 Engineercing | Subraiteeailei Dru Liton dude fozartio Professor Department of Computerc Science »8 Engineering Jahanginnagat Universi ty : Date of submission’ 10.01.2021 Scanned with CamScanner® [rssinage 0% Prone: Grayscale images anbe transformed into % Sequence of binary images by breaking them up inte thein bik planes. Tf we consider , the array value of each pixel) bf an gbit image 95 An g-bit binary word > then the Oth bit plane Consists of the last bit of eachgry value .Since the Oth bit has the least effect in terms of mgr magnitude of tne value, it is called the least significant bit andthe plane censisting of those bits the least significant b consists of the First bit in each in terms af the magnitude of e most significant btt it plane. Similarly 7th bit plane value. This bit has tne greatest effect tne value,so it is called th and the plane consisting of those bits the most signifi cant vit plane. let, | o ot + Ze , i Ro 9000111 —> binary image J L, LSB = Least Significant bit ms Corost Significant bit) Scanned with CamScanner® Image Histogram ¢ 8 8) : ream 16 a graph indicating the number Image histog 1 oceures in the image. In of Hmes each grray leve a grayscale Tmage its histogram consists of the histogram of its Grey levels - she appearance of an image from its histogram’ 3 Inadank tmage the gry levels Chence Lhe histegum) would be clustered at the. breight fmage, the grag levels would lowen end. aIna uniformly be cluskenel clustered at the upperc énd. ca Well contrasted. Image, the gray levels In reomuch, of the image. would be. well spread out Ovel Example A’ images * lécreay level (7)} Of 2 Numberc of | 15/0 level Cnj) 2/3|4 FPF PPP? Tp | 57 O}o}a lo jo | 0] 0} Ole as fal reg level(i) Figure: Vistegream of the given Imoge Th Gaussian Filters? Gaussion filters arce a class of low pass filter. The Gaussian probability distribution function is- | | a 20~ $cx) | where OD jg the Standard deviation. lA large value of D Produces a, flatter curve a | | Small value of a Prtoduces a “pointer “Curve - Larcge value of 0 Small value of D &g Figs One- dimensional gaussians Scanned with CamScanner® fore 1D Gaussian yfunction is, f(x) - e2 yy aa for, 2paaussion function 15 » f@y)= eae she reasons fore the inportance of Graussian filter is given below @ythey are marhemasically verey well behaved. In partic ularc the Fourtier treansferem of a gaussian frltere is mother Graussion @® they ame reek rotationally symmetric ond S50 ane very good starting points fore some edge detection algorithms @ “they are Sepercable , tis can lead to very fast implememtetions @ we convolution of two Gaussian is anothen Gaussian - (eh Ror Processing OLE often we may not want to apely a filtere to an entine fmage, but only te a small region within ik- Anon — linear. filter, fort example» my be +tco compution computationally expensive to apply +e the entine imoge 9 or we MAY only be : region Such srtall regions cobs wi 5 of mterest om ROIs, intertested in the small thin an image ame ana thetre called region Scanned with CamScanner® Preocessing is called region of interest processing Ror mask will be a binary image of, 2inall Size as the orcginal ivnage. with 4’s fore ROI and 0% for elsewhere. Suppose, the matrix, fore image is M, the matrix forr Rot is ® Result of OF ma'image matrix after filterting is MF, “hen the result we want 15% MpR +m(1-R) Th Colon Models (RGBy NSW) L¥a#E) + Color Wied ele CEE 2 ercienaemene RGB * En this model » each color & is mepresented as Lime values Ry Grand B, indicating the amount s Of red, green ona blue which moxke up the Colon: snis model 1S used for displays on computert Sermeens >a monitor fem has three imdependent | for. the med, green and blue e@omponent of eoch eolert. | +8 oe 4) « casio Coad) : Garten @ney TA (00/0) (41070) Black Gee Figure {RAB Model Scanned with CamScanner© AHSVt Hsv stands fon Hue, Saturation » value . These terems have the following meanings; ‘Huet the. true colore arttrei bute Cited, green , blue, Orange, yellow and so on). Satcation! the amount by which the Coler has been diluted usith white. The more white in the colores the, lowere the secturcation. Values The degree of breightness 2 a well lit colore has high intensity ; adank color. has low intensity | Wwe, can visualize this modes 25 & cone, as shown jn re Figure below * - Figure + The colour space HSV Os aA cone: Scanned with CamScanner®@ LY¥a%*b! The CIELAB colon space also itefercenced to =. as Leatb ts a colon space.tt express, colon as Ancee values? L ya,b LD Luminosity / iMumination/ intensity /lightness Ad qreen- ned ba blue —yetlou By Image +hreesholding ¢ Thrcesholding: 1S vital part in image segmentation, Where we wish to isslate objects from the bockground. Tt is also an impor tomt Component in ttobot vision. Threeshold ing» Can be done in the follecoing -me-thods > imoge Single thresholding? A greay. scale, is turened into binary. Cblack and white) image by choosing gray level T im the orciginal Image . if a vel is 2 A pixel pices vif its gray level is © Jif its greay, level Is &T 4 2 white © 2 Black Scanned with CamScanner® Double Hicesholding Here we choose two values.Tr Qnd Ta and apply a -thicesholding opertation as i if reay, leve i tween A pixel uae if ths greag. te ee Black if 145 gray level 5 otherwise (Qh Fouiert Treansform of an images The fourier transform fs an tmporetant image Preocessing tool tnat ts used to decompose an fmage into THs sine and cosine components. the output of the treansforemation represents the image in the Fourtien 5 on frequence, demain and the input image ig the spatial domain equivalent .In the fourier domain image» each pemt rreprcesents a partic two-dimensional frequency component - “the DEFT is the Sampled Fourderc tronsferm and bhereforre does net contain alll frequencies forming an images but only % set of samples bat is large emough to Fully deserctbe the Spetial domain image. fourier. transform is Visually analysed through DFT. The number of frequencies corcnesponds to tne number of Pixels in the spatial and fourier domain are of the Same Size. For an image of the f{wo-dimentional DFT is given by > size MXNy Scanned with CamScanner® FUv)= ae 2 mn) o SUCH HB) wieo Reo tohere mn) ts the image in the spatial domain and the exponential terem is the basis function Corresponding to each Point FLY) In the fourcier Space. An inverse treansferemation is also Possible And js given by> Samm) = 45 ZS come CRS “the ordinary one-dimentional DFT has MN com plexity this can be, redueed to Mlog,N on Nleg mM if we employ the fast fourier, -transferen (PFT) +0 Compute the. one-dimentional DFTs. [py Wavelet Treansforem of an images Discrete wavelet analysis is usually computed using the concept of filters banks. Tf a signal is put threough bighpass filter and Lowpass filters then the signal ts decomposed into to pants —a detailed Pat parct (high-frequency )» and an approximation part (low-frequency ). Scanned with CamScannerApproximate] Troge (LD Horizorat Approximation Vertical Detail (LH) Horcizental etailCBL) Horizontal detail 7 7 [Diagonal Detail(un) Figure: Basie: Principle of wavelet transformation . The approximation subsignal can be pul Uveough a filtert banks and this is epeated Until the reequirced level of decomposition has been reached. “hese ideas ame shown In the figure above. At level , fourt Submages Oe obtained %4 The the verctical detail, the horizonta) every a pprcozimation > detail 9 and the diagonal detail The process cay be further tepeated until a certain set of anitenia is met. With each decomposition, a meco APP RoZimation 'S ebtained thot iS Much Scanned with CamScanner® smaller. in stze.The decomposition pattern fore images is shown in the figurce below! Figure ¢ Multilevel decomposition with wavelet transfores, Scanned with CamScanner