Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Kumar, Rajiv
- Performance Evaluation and Comparative Analysis of Proposed Image Segmentation Algorithm
Abstract Views :350 |
PDF Views:0
Authors
Affiliations
1 Research and Development Centre, Bharathiar University, Coimbatore (Tamil Nadu), IN
2 Department of Science and Humanities, Nehru Institute of Technology, Coimbatore, IN
1 Research and Development Centre, Bharathiar University, Coimbatore (Tamil Nadu), IN
2 Department of Science and Humanities, Nehru Institute of Technology, Coimbatore, IN
Source
Indian Journal of Science and Technology, Vol 7, No 1 (2014), Pagination: 39-47Abstract
In this paper, a novel approach of K-Region based Clustering image segmentation algorithm has been proposed. The proposed algorithm divides an image of size N × N into K number of regions. The K and N are multiples of 2. The value of K must be less than N. Authors divided the image into 4, 16, 64, 256, 1024, 4096 and 16384 regions, based on the value of K. The adjacent pixels having similar intensity value in each region are grouped into same clusters. Further, the clusters of similar values in each adjacent region are grouped together to form the bigger clusters. The different segmented images have been obtained based on the K number of regions. The four parameters, namely, Probabilistic Rand Index (PRI), Variation of Information (VOI), Global Consistency Error (GCE) and Boundary Displacement Error (BDE) have been used to evaluate the performance of the proposed algorithm. The performance of proposed algorithm was evaluated using 100 images taken from Berkeley image database. The time-complexity of the proposed algorithm has also been calculated. The comparative analysis of proposed algorithm was made with existing image segmentation algorithm, namely, K-mean clustering and Region-growing algorithm. Significant results were obtained in case of proposed algorithm when\the PRI, VOI, GCE and BDE values were compared with those of existing algorithms. MATLAB 7.4 has been used to implement the proposed algorithm.Keywords
Image Segmentation, Clusters, Regions, K-mean Clustering, Region-growing, MATLAB 7.4References
- Tianhua C. digital image processing. Beijing: Tsinghua University Press; 2007.
- Udupa JK, Leblanc VR, Zhuge Y, Imielinska C, Schmidt H, Currie LM, Hirsch BE, Woodburn J. A framework for evaluating image segmentation algorithms. Comput Med Imag Grap. 2006; 30(2):75–87.
- Kaur J, Agrawal S, Vig R. A methodology for the performance analysis of cluster based image segmentation. Int J Eng Res Appl. 2012; 2(2):664–67.
- Raja SVK, Abdul Khadir AS, Ahamed S SR. Moving toward Region-Based Image Segmentation Techniques: A Study. J Theor Appl Inf Technol. 2009; 5(1):81–7.
- Sathya B, Manavalan R. Image Segmentation by Clustering Methods: Performance Analysis. Int J Comput Appl. 2011; 29(11):27–32.
- Kanungo T, Mount, DM, Piatko CD, Silverman, R, Wu, AY. An Efficient k-Means Clustering Algorithm: Analysis and Implementation. IEEE Trans Pattern Anal Mach Intell. 2002; 24(7):881–92.
- Bin Samma AS, Abdul Salam R. Adaptation of K-means algorithm for image segmentation. Int J Eng Res Appl. 2009; 5(4):58–62.
- Chitade AZ, Katiyar SK. Colour based image segmentation using K-means clustering. Int J Eng Res Appl. 2010; 2(10):5319–25.
- Arbelaez P, Maire M, Fowlkes C, Malik J. Contour Detection and Hierarchical Image Segmentation. IEEE TPAMI, 2011; 33(5):898–916.
- Audio Steganography using QR Decomposition and Fast Fourier Transform
Abstract Views :219 |
PDF Views:0
Authors
Ifra Bilal
1,
Rajiv Kumar
1
Affiliations
1 Department of Computer Science and Engineering, Sharda University, Greater Noida - 201306, Uttar Pradesh, IN
1 Department of Computer Science and Engineering, Sharda University, Greater Noida - 201306, Uttar Pradesh, IN
Source
Indian Journal of Science and Technology, Vol 8, No 34 (2015), Pagination:Abstract
Large demand of internet services requires our data to be transmitted in a secure manner. Data can be transmitted secretly using three security methods: Steganography, cryptography and watermarking. Among these, steganography provides better confidentiality. It is the art and science of hiding information in ways that prevents the detection of the hidden message. We focus in this paper on audio steganography where the carrier to hold the secret image is a digital audio file. The novelty of this paper lies on the implementation of QR decomposition technique in audio steganography. To the best of our knowledge no QR technique has been implemented in audio steganography. The paper embeds the bits of the secret image in the lower diagonal elements of the carrier audio file using QR decomposition technique. Three different formats have been specified for input secret image: .jpg, .bmp, .png. The paper also embeds the secret image along the frequency distribution of the carrier audio using Fast Fourier Transform. Another contribution of this paper is comparison between Fast Fourier Transform and QR decomposition technique. The quality of the image is measured using PSNR. The result shows that QR decomposition technique is better than existing Fast Fourier Transform as the calculated PSNR is above 40 dB for all the input images. Further, the paper compares the results obtained from QR technique with other existing methods like SVD. It can be noted that the accuracy of the QR decomposition technique is more than the existing methods and has proven to be very efficient. The system can be used for covert communication or tamper proofing.Keywords
Audio Signal, Confidentiality,Fast Fourier Transform, Steganography, QR Decomposition Technique- Method to Estimate Size of Multimedia Software
Abstract Views :180 |
PDF Views:0
Authors
Sushil Kumar
1,
Rajiv Kumar
1
Affiliations
1 Department of CS&E, Sharda University, Greater Noida − 201306, Uttar Pradesh, IN
1 Department of CS&E, Sharda University, Greater Noida − 201306, Uttar Pradesh, IN