From da31031b66d366239c878cb0202b3288ac360ab6 Mon Sep 17 00:00:00 2001
From: PSupriya12 <90033745+PSupriya12@users.noreply.github.com>
Date: Tue, 9 Aug 2022 11:26:54 +0530
Subject: [PATCH 1/3] Create CA2

---
 CA2 | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 CA2

diff --git a/CA2 b/CA2
new file mode 100644
index 0000000..8b13789
--- /dev/null
+++ b/CA2
@@ -0,0 +1 @@
+

From 3551dc951d9d8f808837bf3179d39081883e9770 Mon Sep 17 00:00:00 2001
From: PSupriya12 <90033745+PSupriya12@users.noreply.github.com>
Date: Tue, 9 Aug 2022 11:40:36 +0530
Subject: [PATCH 2/3] Add files via upload

---
 Assignment 2/HuffmanEncoding.py    | 131 +++++++++++++++++++++++++++++
 Assignment 2/Observation.txt       |  33 ++++++++
 Assignment 2/OriginalGreyImage.png | Bin 0 -> 1968 bytes
 Assignment 2/ReconstructedImg.png  | Bin 0 -> 467 bytes
 Assignment 2/VectorQuantization.py |  54 ++++++++++++
 5 files changed, 218 insertions(+)
 create mode 100644 Assignment 2/HuffmanEncoding.py
 create mode 100644 Assignment 2/Observation.txt
 create mode 100644 Assignment 2/OriginalGreyImage.png
 create mode 100644 Assignment 2/ReconstructedImg.png
 create mode 100644 Assignment 2/VectorQuantization.py

diff --git a/Assignment 2/HuffmanEncoding.py b/Assignment 2/HuffmanEncoding.py
new file mode 100644
index 0000000..f8f2aa4
--- /dev/null
+++ b/Assignment 2/HuffmanEncoding.py	
@@ -0,0 +1,131 @@
+import re
+import numpy as np
+from PIL import Image
+print("Huffman Compression Program")
+
+file = "output.png"
+my_string = np.asarray(Image.open(file), np.uint8)
+shape = my_string.shape
+a = my_string
+
+my_string = str(my_string.tolist())
+
+
+letters = []
+only_letters = []
+for letter in my_string:
+    if letter not in letters:
+        frequency = my_string.count(letter)
+        letters.append(frequency)
+        letters.append(letter)
+        only_letters.append(letter)
+
+nodes = []
+while len(letters) > 0:
+    nodes.append(letters[0:2])
+    letters = letters[2:]
+nodes.sort()
+huffman_tree = []
+huffman_tree.append(nodes)
+
+
+def combine_nodes(nodes):
+    pos = 0
+    newnode = []
+    if len(nodes) > 1:
+        nodes.sort()
+        nodes[pos].append("1")
+        nodes[pos+1].append("0")
+        combined_node1 = (nodes[pos][0] + nodes[pos+1][0])
+        combined_node2 = (nodes[pos][1] + nodes[pos+1][1])
+        newnode.append(combined_node1)
+        newnode.append(combined_node2)
+        newnodes = []
+        newnodes.append(newnode)
+        newnodes = newnodes + nodes[2:]
+        nodes = newnodes
+        huffman_tree.append(nodes)
+        combine_nodes(nodes)
+    return huffman_tree
+
+
+newnodes = combine_nodes(nodes)
+
+huffman_tree.sort(reverse=True)
+print("Huffman tree with merged pathways:")
+
+checklist = []
+for level in huffman_tree:
+    for node in level:
+        if node not in checklist:
+            checklist.append(node)
+        else:
+            level.remove(node)
+count = 0
+for level in huffman_tree:
+    print("Level", count, ":", level)
+    count += 1
+print()
+
+letter_binary = []
+if len(only_letters) == 1:
+    lettercode = [only_letters[0], "0"]
+    letter_binary.append(letter_code*len(my_string))
+else:
+    for letter in only_letters:
+        code = ""
+        for node in checklist:
+            if len(node) > 2 and letter in node[1]:
+                code = code + node[2]
+        lettercode = [letter, code]
+        letter_binary.append(lettercode)
+print(letter_binary)
+print("Binary code generated:")
+for letter in letter_binary:
+    print(letter[0], letter[1])
+
+bitstring = ""
+for character in my_string:
+    for item in letter_binary:
+        if character in item:
+            bitstring = bitstring + item[1]
+binary = "0b"+bitstring
+print("Your message as binary is:")
+
+
+uncompressed_file_size = len(my_string)*7
+compressed_file_size = len(binary)-2
+print("Your original file size was", uncompressed_file_size,
+      "bits. The compressed size is:", compressed_file_size)
+print("This is a saving of ", uncompressed_file_size-compressed_file_size, "bits")
+output = open("compressed.txt", "w+")
+print("Compressed file generated as compressed.txt")
+output = open("compressed.txt", "w+")
+print("Decoding.......")
+output.write(bitstring)
+
+bitstring = str(binary[2:])
+uncompressed_string = ""
+code = ""
+for digit in bitstring:
+    code = code+digit
+    pos = 0
+    for letter in letter_binary:
+        if code == letter[1]:
+            uncompressed_string = uncompressed_string+letter_binary[pos][0]
+            code = ""
+        pos += 1
+
+temp = re.findall(r'\d+', uncompressed_string)
+res = list(map(int, temp))
+res = np.array(res)
+res = res.astype(np.uint8)
+res = np.reshape(res, shape)
+print(res)
+print("Observe the shapes and input and output arrays are matching or not")
+print("Input image dimensions:", shape)
+print("Output image dimensions:", res.shape)
+data = Image.fromarray(res)
+data.save('previous.png')
+if a.all() == res.all():
+    print("Success")
\ No newline at end of file
diff --git a/Assignment 2/Observation.txt b/Assignment 2/Observation.txt
new file mode 100644
index 0000000..de2fbae
--- /dev/null
+++ b/Assignment 2/Observation.txt	
@@ -0,0 +1,33 @@
+Name    :   Supriya Manikrao Pawar
+PRN     :   2020BTEIT00052
+Batch   :   T5
+Course  :   Computer Algorithm
+
+Assignment No:2
+Vector Quantization and Huffman Encoding
+
+Problem Statement: To use the Vector Quantization Algorithm to compressed an image.
+                   Get the Huffman code of the input image using Huffman Encoding Algorithm.
+
+Quantization means approximation.
+Here for this I have chosen 240*240 pixels PNG image which of 2 kb originally.
+I have compressed this image using vector quantization and the reconstructed size is 1 kb.
+
+Files:
+    Images:
+    1.OriginalGreyImage.png is the image before compressing
+    2.ReconstructedImg.png is the image after compressing
+
+    Coding:
+    1.VectorQuatization is the file written in Python which contains the code for compressing image.
+    2.HuffmanEncoding is the file in Python.
+        I have created these files by referring on the google and youTube.
+
+    Observations:
+        File is reduced from 2 kb to 1 kb after compression.
+        Compression rate: Original image/Compressed image
+                        = 2kb /1 kb
+                        = 2
+
+        The time complexity for Huffman algorithm is O(nlogn).
+        n is the number of nodes of tree.
\ No newline at end of file
diff --git a/Assignment 2/OriginalGreyImage.png b/Assignment 2/OriginalGreyImage.png
new file mode 100644
index 0000000000000000000000000000000000000000..da394ace28860da54c36bf0bc68697335184cddd
GIT binary patch
literal 1968
zcmeH|iBr;99Kgkk^31H&bkS@HZ9K3wGgB-#lgK<aH#5AgJk}dEEzfGrF-%sNGSa|f
zMr%ei^F~ZE%UD^-+&~dTlS~D~8x_I*>EF@3dGGta^L@wnedqK2z9K&#q^_2UmWqms
zF6x5EWk4?M^gWuu=yqim4+zajFQkXc_D-wpt|O?ZfN!Ea-2cd|knnu#gKt9mC#A84
zwHjz0t4ia*y9Ka$-Q#Ukdf$3oLvT!S>7y~NlgIpTGmd&&qsr{|xbOYYS5W=C;q~fq
zU?tSz@Rx%Zjvm=(m6w>>xzbSy`;az0NObX6w6dBJ(%Y=0Wd^Y`m4yP_P*DlLM#ZK-
zXLBW}`3smJd^tY&vG5;kT25eXJAw9Cn8r!3YfBhgV-D3I$=;vg@?J0Pbs>Y$HCW-i
zya5Fh#J(8C>jsVO!qAILT@51Aj9eK_X>A_p_}HtKyYLpAG&(ZU;lwB-1UJtpswz1I
zSCX)b&0WUwG9y6dF1N&LB9W*cpY6yvh~*mDSxBK9p?Enu4i1leSD?;AceyZ%pd7o%
zGaY^1&xGS_ZcPwB#tTF~l@clAa=GtNZ(6>%PyD(<fQBVex=%_qQ^CL{XGSBQ=O#5f
zOY&KoWplNcD`*KM0y-{>u;uo(fWj>k>RVe|n-jka-)2m(xrNK2w035y`@}sToM(+o
z|I}jYIUkcWuv_ldx+5wVve;YAZ)s{;95A%>5u0H?SLU-w2swX!L}%c2QbK~H)WR~J
zoIbfhemHOHy5GL<jT%_bwTDXG6xv{;H}$f`BTXVUheP&WQrbS!WPbeu0UnOP2tS^2
z3OY56oLOC6oicz2+i)5h8ylIglZRavHUwGQ&u;Vw)Tu_T4aS_HrZ@LoWMRO{fIe-b
zv4f_jrn309m^nyCYnuZDiyCi#@iL$Ie6%^5^{7w}f-Y|f2W%qheFOMbqu4ohni*YZ
z`_v>^APWl=yVB2s>mU_BC6@^evClP(X9&clD;be=AR<`=-mBuGd}4?IUA|uVt}kDZ
zBje``5W&VXB`7dVlb6m9#yNqoj+FOBAX(1#+i%5cIzuu=Aq-N!hOBqTIfA?#n%>8P
z!dm}w&!21{rG=yEsoja-z>Xr@hX=F_?GM1htuE31p5|BCgU&^$KIm1~DcEcL!|)>{
zJ22F0WY1T7gD&kd)U(Ubc*PDwNj4Gt!U2YSwAZCx#_Gl|L{vc00TA~eI0Vo+x<e-|
zVXQ6siG#Mihd`D`N~<r&gmTbX#~Hd<^Sw`pyeO@vgcYOHrz9@P<QwUS3_%WZZ&+V>
zyb|~GnGmrJeP0L%aa^))1L|q(NXZ9<3c9mo@Y<cUiIc?R&27@4;Q=_v>9m*x?mh2q
zqdO-|ax58}y`HL3i$I2+?i{W5Rx`u(=XotD&R<ezic1$Ww|G(5s5>UH{Us12o<{pt
zntzRk7mhXCR2-Z51z7^j7Xo0aQN!tcr=U0ozI{83Iy*NvM_!W(^5XEgLByd~MDtd5
z$sjfJlbWLImSoctUkApiGrzusX6QRd_|XgX&2z7xFyTMGF%0L>55tQ+YgjF8n43Jy
z;(pjm2Q!>+lHiS^0m{-x7<E*B$7j!N!QJjNSAFVhkT}vsOmud|1InF0ffGj2@&Q*%
zmf~_3P%w9{3dEZac7cPZb7`sH2XVOmso~{Bdr3+!5wSp53lqteRZx!YZea$>0zxLp
z+rAFe=4o<i?X{4Q9L%;-frE9zqzY!s-#L@}n@Pe+XjnW&kz!zKC)C>_qvM<`JDnI;
zmqI@!cV^i#rfP;}s%|U&9RKZAQ?|3YgHW;;#-4FEvl(1gmIvKP;H3Mm<ZLf5`>xsY
zKC3FFqWb!JF(PB02SFtQ-qb>`T6QiS2{C^%D}g563dx{K<^CvAEX6z90J8hn{kH(8
W%vrstjEkb}=&18P9u2>R-}@iD{(Q~=

literal 0
HcmV?d00001

diff --git a/Assignment 2/ReconstructedImg.png b/Assignment 2/ReconstructedImg.png
new file mode 100644
index 0000000000000000000000000000000000000000..fd1cbc4ea63580e8d5d0efca5708f8d8c6f233be
GIT binary patch
literal 467
zcmeAS@N?(olHy`uVBq!ia0vp^A3&Ie8AzU~{<08Ai3a$DxHiB*V`C$P>0aQI_4-&O
zPyu^MkYDisRqH&T^)i&sdAEgufica~#WAGf*4w)q`<enoS{^Q5WUAIyCEs|Y<=3r<
z%O1MjuYcP&-8{>?Y4x--GtS!Ue`s~~SdsQ9%Zq_I`@!E#>uA5<(?4wJjx5fYcQ{@%
z&F`XZ^KXGARW0pH8oHk`>N!t(8vjFRkxc#JS<e3bvX9v1<Sh?-vWo}r;7?q|8KeF1
zDofa|pVt)km+bq>UvuryY{9&(AF5h{U&Mbhw`sBPZL_~xF!f=#lwI16u*2HscUC>z
zDy?_*!y(@K6%SPns0}`3?+7{kt?fb>@9pS>Y}1_lUt6bYeb3raB%XeI)uGy_FVc1Q
z6pB75|9<MfO8wDy6Pa(XY0f=y$oy`iwD!icn@{|!7kh7faPiM2yUJ%pe&Y51xopb}
eZ{~mUA9$s@85wSb*tG*Afx*+&&t;ucLK6UM{KFpr

literal 0
HcmV?d00001

diff --git a/Assignment 2/VectorQuantization.py b/Assignment 2/VectorQuantization.py
new file mode 100644
index 0000000..0be843e
--- /dev/null
+++ b/Assignment 2/VectorQuantization.py	
@@ -0,0 +1,54 @@
+import argparse
+from PyQt4 import QtCore
+import numpy as np 
+from scipy import misc
+from sklearn import cluster
+import matplotlib.pyplot as plt 
+
+def build_arg_parser():s
+    parser=argparse.ArgumentParser(description='Compress the input image\using clustering')
+    parser.add_argument("--input-file",dest="input_file",required=True,help="Input image")
+    parser.add_argument("--num-bits",dest="num_bits",required=False,type=int,help="Number of bits used to represent each pixel")
+    return parser
+    
+def compress_image(img,num_cluster):
+    
+    x=img.reshape((-1,1))
+    
+    kmeans=cluster.KMeans(n_clusters=num_clusters,n_init=4,random_state=5)
+    kmeans.fit(X)
+    centroids = kmeans.cluseter_centers_squeeze()
+    labels = kmeans.labels_
+    
+    
+    input_image_compressed = np.choose(labels, centroids).reshape(img.shape)
+    return input_image_compressed
+    
+def plot_image(img, title):
+    vmin = img.min()
+    vmax=img.max()
+    plt.figure()
+    plt.title(title)
+    plt.imshow(img, cmap=plt.cm.gray, vmin=min, vmax=max)
+    
+if _name_=='_main_':
+    args = build_arg_parser().parse_args()
+    input_file = args.input_file
+    num_bits = args.num_bits
+    
+    if not 1 <= num_bits <= 8:
+        raise TypeError('Number of bits should be between 1 and 8')
+        
+        num_clusters = np.power(2,num_bits)
+        
+        compression_rate = round(100*(8.0 - args.num_bits)/8.0, 2)
+        print('\nThe size of the image will be reduced by a factor of', 8.0/args.num_bits)
+        print('\nCompression rate = '+ str(compression_rate)+'%')
+        input_image = misc.imread(input_file, True).astype(np.uint8)
+        
+        plot_image(input_image, 'Original image')
+        
+        input_image_compressed = compress_image(input_image, num_clusters)
+        plot_image(input_image_compressed, 'Compressed image; compression rate = '+ str(compression_rate)+'%')
+        
+        plt.show()
\ No newline at end of file

From 7f1d783c6b9824c8397d3482a74f91c25d5b8a45 Mon Sep 17 00:00:00 2001
From: PSupriya12 <90033745+PSupriya12@users.noreply.github.com>
Date: Tue, 9 Aug 2022 11:56:33 +0530
Subject: [PATCH 3/3] Delete CA2

---
 CA2 | 1 -
 1 file changed, 1 deletion(-)
 delete mode 100644 CA2

diff --git a/CA2 b/CA2
deleted file mode 100644
index 8b13789..0000000
--- a/CA2
+++ /dev/null
@@ -1 +0,0 @@
-