Binary Morphology With Image Compression And Cryptography

Ponshankar B*, Swaranambigai R.**
* ME (Applied Electronics), Jay shriram group of institutions, Anna University, Coimbatore
** Assistant Professor (ECE), Jay shriram group of institutions, Anna University, Coimbatore
Periodicity:September - November'2013
DOI : https://doi.org/10.26634/jele.4.1.2509

Abstract

Binary Image processing is extremely useful in various areas, such as object recognition, tracking, motion detection, machine intelligence, image analysis, understanding video processing, computer vision, and identification and authentication systems. Binary image processing (BIP) has been commonly implemented using processors such as CPU or DSP. However, it is inefficient and difficult to use such processors for binary image processing. High-speed implementation of binary image processing operations can be efficiently realized by using chips specialized for binary image processing. Mathematical morphology(MM) is a nonlinear image processing framework used to manipulate or analyze the shape of functions or objects. Mathematical morphology(MM) is set theory-based methods of image analysis and plays an important role in many digital image processing algorithms and applications, e.g., noise filtering, object extraction, analysis or pattern recognition. The methods, originally developed for binary images, were soon extended and now apply to many different image representations. Real-time image processing systems have constraints on speed or hardware resources. In addition, in embedded or mobile applications, this system consumes low power and low memory. The cryptography involves efficient algorithms related to encryption and decryption.

Keywords

Binary image processing (BIP), Mathematical morphology (MM), encryption and decryption

How to Cite this Article?

Ponshankar, B., and Swaranambigai, R. (2013). Binary Morphology with Image Compression and Cryptography. i-manager’s Journal on Electronics Engineering, 4(1), 11-17. https://doi.org/10.26634/jele.4.1.2509

References

[1]. Bin Zhang, Kuizhi Mei and Nanning Zheng, (2013). “Reconfigurable Processor for Binary Image Processing”, in IEEE transactions on circuits and systems for video technology, Vol. 23, No. 5,
[2]. P. Dokladal, H. Hedberg, and V. Owall, (2009). “Binary morphology with spatially variant structuring elements algorithm and architecture,” IEEE Trans. Image Process., Vol. 18, No. 3, pp. 562–572, Mar.
[3]. Hugo Hedberg, Fredrik Kristensen, Viktor Öwall, (2008). “Low-Complexity Binary Morphology Architectures With Flat Rectangular Structuring Elements,” in IEEE transactions on circuits and systems—i: regular papers, Vol. 55, No. 8, september.
[4]. Huijuan Yang and Alex C. Kot, (2006). “Image authentication with tampering localization by embedding cr yptographic signature and block identifier,” in IEEE signal processing letters, Vol. 13, No. 12, december.
[5]. Min Wu, and Bede Liu, (2004). “Data Hiding in Binary Image for Authentication and Annotation”, in IEEE Transactions On Multimedia, Vol. 6, No. 4, August.
[6]. E. C. Pedrino, O. Morandin, Jr., and V. O. Roda, (2011). “Intelligent FPGA based system for shape recognition,” in Proc. 7th Southern Conf. Programmable Logic, pp. 197–202.
[7]. E. C. Pedrino, J. H. Saito, and V. O. Roda, (2010). “Architecture for binary mathematical morphology reconfigurable by genetic programming,” in Proc. 6th Southern Programmable Logic Conf., pp. 93–98.
[8]. E. N. Malamas, A. G. Malamos, and T. A. Varvarigou, (2000). “Fast implementation of binary morphological operations on hardware-efficient systolic architectures,” J. VLSI Signal Process., Vol. 25, No. 1, pp. 79–93.
[9]. S. Chien and L. Chen, (2011). “Reconfigurable morphological image processing accelerator for video object segmentation,” J. Signal Process. Syst., vol. 62, no. 1, pp. 77–96,
[10]. N. Bouaynaya, M. Charif-Chefchaouni, and D. Schonfeld, (2006). “Spatiallyvariant morphological restoration and skeleton representation,” IEEE Trans. Image Process., Vol. 15, pp. 3579–3591,
[11]. Ganesh Chandra, D.L. Gupta, Dr. A.K. Malviya, Satyendra Singh, Vinod Kumar Yadav, (2012). “Public Key Cryptosystem Technique Elliptic Curve Cryptography with Generator g for Image Encryption”, Int. J. Computer Technology & Applications, Vol 3 (1), 298-302.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.