Rank: 179 based on 395 downloads (last 30 days) and 5 files submitted
photo

Vinay Kumar Tadepalli

E-mail
Company/University
Bits-Pilani

Personal Profile:
Professional Interests:
Image Processing, compression techniques

 

Watch this Author's files

 

Files Posted by Vinay Kumar View all
  • 1 - 5 of
  • 5
Updated   File Tags Downloads
(last 30 days) 		Comments Rating
22 Apr 2013 K means clustering for Image Compression K-means clustering is a popular vector quantization method for data compression. Author: Vinay Kumar Tadepalli image processing, demo, mathematics, simulation, signal processing, matrix 151 7
25 Apr 2012 Arithmetic Encoding & Decoding Arithmetic coding is a popular encoding technique in compression engines. Author: Vinay Kumar Tadepalli data import, simulation, signal processing, mathematics 47 7
17 Apr 2012 Panning Effect on a Mono-Audio Input Panning effect is implemented for both an audio file and any audio input device such as microphone. Author: Vinay Kumar Tadepalli communications, data import, signal processing, simulation, matrix 2 0
07 Feb 2012 Compression Techniques Huffman, Extended Huffman, Arithmetic, LZ78, Run Length Encoding, Run Length Decoding, DCT Author: Vinay Kumar Tadepalli image processing, communications, statistics, mathematics 30 0
07 Feb 2012 Screenshot JPEG Compression (DCT) JPEG compression using Discrete Cosine Transform Technique Author: Vinay Kumar Tadepalli but when i run it i h..., communications, signal processing, simulation, thanks for code, image processing 165 13
  • 3.25
3.2 | 4 ratings
Comments and Ratings by Vinay Kumar View all
  • 1 - 5 of
  • 11
Updated File Comments Rating
06 Mar 2013 GetFullPath Full path name for partial or relative path Author: Jan Simon

04 Mar 2013 Arithmetic Encoding & Decoding Arithmetic coding is a popular encoding technique in compression engines. Author: Vinay Kumar Tadepalli

Dear Le Hung,

Its working fine. I have checked after you commented. Please tell me your issue with the execution of code!!
23 Feb 2013 JPEG Compression (DCT) JPEG compression using Discrete Cosine Transform Technique Author: Vinay Kumar Tadepalli

Dear Andrew,

The n indicate the pixel depth of the input image. So, for an RGB Color image, it is 24, and for a monochrome image (gray scale image), it is 8 bits. And m indicates the amount of compression that you can afford. The range of m should be [1, n]. For example, when you are computing DCT for an 8-bit image, the DCT coefficients you obtain are normalized with normalization matrix and then rounded off (normalization+rounding off = quantization). And then these Quantized coefficients are converted to binary form and NOW you have a choice whether to retain all the bits of each DCT coefficient or only some. That will be specified by the user as m.

Note that both m and n are positive integers.

Hope it cleared your doubts.
12 Jan 2013 JPEG Compression (DCT) JPEG compression using Discrete Cosine Transform Technique Author: Vinay Kumar Tadepalli

Dear Mehdi, the code is not generalized for Images of arbitrary sizes. So, you have to include a code for padding additional rows and columns to make row number and column number a multiple of 2. That should solve the problem. If you have any other issues, let me know.
08 Jan 2013 JPEG Compression (DCT) JPEG compression using Discrete Cosine Transform Technique Author: Vinay Kumar Tadepalli

Hi tonyk, M and N represent the non-overlapping block size in the entire image. That means, the digital image is divided into a number of blocks of dimension M X N. Typical values are M=N=8.
Comments and Ratings on Vinay Kumar's Files View all
  • 1 - 5 of
  • 28
Updated File Comment by Comments Rating
14 Mar 2013 K means clustering for Image Compression K-means clustering is a popular vector quantization method for data compression. Author: Vinay Kumar Tadepalli Edwin

Hello, thanks for your sharing.

However, when I tried to test this code, i got some errors pposted below...my input image is a 181*217 png image...would you please help me to solve this problem?

Thanks for your help in advanced!

Attempted to access I1(1,2.41421); index must be a positive integer or logical.

Error in ==> K_MEANS_PREPROCESSING at 18
s((L^0.5*size(I1,2))*(i-1)+L*(j-1)+(L^0.5)*(k-1)+l)=I1(sqrt(L)*(i-1)+k, sqrt(L)*(j-1)+l);

Error in ==> Image_kmeans_main at 72
I_re=K_MEANS_PREPROCESSING(Img1,L,K);

04 Mar 2013 Arithmetic Encoding & Decoding Arithmetic coding is a popular encoding technique in compression engines. Author: Vinay Kumar Tadepalli Tadepalli, Vinay Kumar

Dear Le Hung,

Its working fine. I have checked after you commented. Please tell me your issue with the execution of code!!
04 Mar 2013 Arithmetic Encoding & Decoding Arithmetic coding is a popular encoding technique in compression engines. Author: Vinay Kumar Tadepalli Le Hung

It doesn't work
24 Feb 2013 JPEG Compression (DCT) JPEG compression using Discrete Cosine Transform Technique Author: Vinay Kumar Tadepalli Andrew

Thank you Vinay for the explanation. But for lower values of m,say 4, where bpp would then be 0.5, there appears a lot more block noise than expected at that bitrate. any adjustments you might suggest?
23 Feb 2013 JPEG Compression (DCT) JPEG compression using Discrete Cosine Transform Technique Author: Vinay Kumar Tadepalli Tadepalli, Vinay Kumar

Dear Andrew,

The n indicate the pixel depth of the input image. So, for an RGB Color image, it is 24, and for a monochrome image (gray scale image), it is 8 bits. And m indicates the amount of compression that you can afford. The range of m should be [1, n]. For example, when you are computing DCT for an 8-bit image, the DCT coefficients you obtain are normalized with normalization matrix and then rounded off (normalization+rounding off = quantization). And then these Quantized coefficients are converted to binary form and NOW you have a choice whether to retain all the bits of each DCT coefficient or only some. That will be specified by the user as m.

Note that both m and n are positive integers.

Hope it cleared your doubts.
Top Tags Applied by Vinay Kumar
  • 1 - 5 of
  • 9
signal processing, simulation, communications, image processing, mathematics
Files Tagged by Vinay Kumar View all
  • 1 - 5 of
  • 5
Updated   File Tags Downloads
(last 30 days) 		Comments Rating
22 Apr 2013 K means clustering for Image Compression K-means clustering is a popular vector quantization method for data compression. Author: Vinay Kumar Tadepalli image processing, demo, mathematics, simulation, signal processing, matrix 151 7
25 Apr 2012 Arithmetic Encoding & Decoding Arithmetic coding is a popular encoding technique in compression engines. Author: Vinay Kumar Tadepalli data import, simulation, signal processing, mathematics 47 7
17 Apr 2012 Panning Effect on a Mono-Audio Input Panning effect is implemented for both an audio file and any audio input device such as microphone. Author: Vinay Kumar Tadepalli communications, data import, signal processing, simulation, matrix 2 0
07 Feb 2012 Compression Techniques Huffman, Extended Huffman, Arithmetic, LZ78, Run Length Encoding, Run Length Decoding, DCT Author: Vinay Kumar Tadepalli image processing, communications, statistics, mathematics 30 0
07 Feb 2012 Screenshot JPEG Compression (DCT) JPEG compression using Discrete Cosine Transform Technique Author: Vinay Kumar Tadepalli but when i run it i h..., communications, signal processing, simulation, thanks for code, image processing 165 13
  • 3.25
3.2 | 4 ratings

Contact us