CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Design and Development of a Secured Data Coding and Compression Method for 2D Digital Images

by B. A. Weyori, P. N. Amponsah, P. Yeboah
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 33 - Number 7
Year of Publication: 2011
Authors: B. A. Weyori, P. N. Amponsah, P. Yeboah
10.5120/4148-4873

B. A. Weyori, P. N. Amponsah, P. Yeboah . Design and Development of a Secured Data Coding and Compression Method for 2D Digital Images. International Journal of Computer Applications. 33, 7 ( November 2011), 50-58. DOI=10.5120/4148-4873

@article{ 10.5120/4148-4873,
author = { B. A. Weyori, P. N. Amponsah, P. Yeboah },
title = { Design and Development of a Secured Data Coding and Compression Method for 2D Digital Images },
journal = { International Journal of Computer Applications },
issue_date = { November 2011 },
volume = { 33 },
number = { 7 },
month = { November },
year = { 2011 },
issn = { 0975-8887 },
pages = { 50-58 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume33/number7/4148-4873/ },
doi = { 10.5120/4148-4873 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:19:36.795747+05:30
%A B. A. Weyori
%A P. N. Amponsah
%A P. Yeboah
%T Design and Development of a Secured Data Coding and Compression Method for 2D Digital Images
%J International Journal of Computer Applications
%@ 0975-8887
%V 33
%N 7
%P 50-58
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Image compression addresses the problem of reducing the amount of data required to represent a digital image. The underlying basis of the reduction process is the removal of redundant data. In this paper, we carry out a study on the digital image coding and compression, and proposed a digital image coding scheme which is a development of the Huffman’s data coding algorithm. The proposed coding algorithm is an efficient data coding and compression method that offers high-speed bit data transmission and a secured image processing. We demonstrate the efficiency of the proposed coding algorithm by showing that it generates optimal prefix that is simpler and generates shorter code length per character and less average code length compared to the Traditional Huffman’s coding algorithm. The design of an encoder and a decoder pair is carried out in MATLAB programming language and the results of the MATLAB simulation demonstrate the security ability of the proposed image coding scheme.

References
  1. P. Pirch and H-J. Stolberg, “VLSI Implementations on Image and Video Multimedia Processing Systems”, IEEE Transaction on Circuits and Systems for Video Technology, Vol. 8, No. 7, Nov., 1998.
  2. K. Konstantinides and V. Bhaskaram, “Monolithic architectures for image processing and compression”, IEEE Computer Graphicsand Application, pp.75-86, Nov. 1996.
  3. Wei Wang, M.N.S. Swamy and M.O. Ahmad, “RNS Application for Digital Image Processing”, 4th IEEE international workshop on System-on-chip for Real-time Application, pp. 77-80, July 2004.
  4. Geoff Dougherty, Digital Image Processing for Medical Applications, Cambridge University Press, 2007.
  5. C.Gonzalez and R.E. Wood, Digital Image Processing, Prentice-Hall, India, Second Edition, 2007.
  6. R.C.Gonzalez, R.E. Wood and Steven L. Edwin, Digital Image Processing Using MATLAB, Prentice-Hall, India, Second Edition, 2008.
  7. Willian K. Pratt, Digital Image Processing; Third Edition, Wiley-intersecience Publication, New York, U.S.A., Copyright 2001.
  8. Faller, N., “An Adaptive System for Data Compression”, Record of the 7th Asilomar Conference on Circuits, Systems and Computers (Parcific Grove, Ca., Nov.), pp. 593-597, 1973.
  9. Cormack, G. V., “Data Compression on Database System”, Commum. ACM 28, 12(Dec.), pp. 1336-1342, 1985.
  10. Cormack, G. V. 1985. Data Compression on Database System. Commum. ACM 28, 12(Dec.), pp. 1336-1342.
  11. Connell, J.B., “Huffman-Shannon-Fano Code. Proceedings”, IEEE 61, pp. 1046-1047, July 1973.
  12. Fano, R. M., Transmission of Information. M.~I.~T. Press, Cambridge, Mass, 1949
  13. Y. C. Hu, C. C. Chang*, "A New Lossless Compression Scheme Based on Huffman Coding for Image Compression," Signal Processing: Image Communication, Vol. 16, No. 4, pp. 367-372, Nov. 2000.
  14. David A. Huffman, “A Method for the Construction of Minimum-Redundancy Codes”, Proc. IRE, 40, 1952.
Index Terms

Computer Science
Information Sciences

Keywords

Coding Compression Redundant Prefix Huffman’s Algorithm Code length Encoder Decoder

Powered by PhDFocusTM