Research Article
Sparse Matrix based Computational Overhead Reduction in UMRT for N a power of 2
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 75 - Issue 8 |
| Published: August 2013 |
| Authors: Preetha Basu, R. Gopikakumari |
10.5120/13133-0502
|
Preetha Basu, R. Gopikakumari . Sparse Matrix based Computational Overhead Reduction in UMRT for N a power of 2. International Journal of Computer Applications. 75, 8 (August 2013), 32-38. DOI=10.5120/13133-0502
@article{ 10.5120/13133-0502,
author = { Preetha Basu,R. Gopikakumari },
title = { Sparse Matrix based Computational Overhead Reduction in UMRT for N a power of 2 },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 75 },
number = { 8 },
pages = { 32-38 },
doi = { 10.5120/13133-0502 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A Preetha Basu
%A R. Gopikakumari
%T Sparse Matrix based Computational Overhead Reduction in UMRT for N a power of 2%T
%J International Journal of Computer Applications
%V 75
%N 8
%P 32-38
%R 10.5120/13133-0502
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Unique Mapped Real Transform (UMRT) is a transform which helps in frequency domain analysis of signals in the real domain. Different algorithms are developed for the computation of the unique MRT coefficients for N a power of 2 and for N an even number. They identify and place the UMRT coefficients in the form of an UMRT matrix. The basis matrices of this transform are observed to be sparse in nature. In this paper a new technique is proposed to reduce the computational overhead in UMRT, the size N being a power of two, exploiting the sparse nature of the basis matrices.
References
- A K Jain, "Fundamentals of digital image processing", Prentice Hall New Delhi, India, 2003.
- Alexander D. Poularikas, "Transforms and Applications Handbook", Third Edition,CRC press, 2010.
- Rajesh Cherian Roy and R. Gopikakumari "A new transform for 2-D signal representation (MRT) and some of its properties", 2004 IEEE International Conference on Signal Processing and Communications.
- Bhadran. V, R. C. Roy, R. Gopikakumari, "Algorithm to identify basic coefficients of 2-D DFT for any even N". in proc. ICVCOM, Saintgits college of engineering,Kottayam,Apr 16-18,2009.
- M. S. Anish Kumar, Rajesh Cherian Roy and R. Gopikakumari, "A new image compression and decompression technique based on 8x8 MRT", International Journal on Graphics, Vision and Image Processing, Volume 6, July 2006, pp. 51-53 .
- Meenakshy K. , "Development & Implementation of a CAD System to predict the Fragmentation of Renal Stones Based on Texture Analysis of CT Images", Ph. D Dissertation, Cochin University of Science & Technology, Kochi, 2010.
- Preetha Basu, Bhadran. v. , Gopikakumari. R, "A new algorithm to compute forward and inverse 2-D UMRT for N — A power of 2",IEEE International Conference on Power, Signals, Controls and Computation (EPSCICON), 2012 .
- Rajesh Cherian Roy and R. Gopikakumari "Relationship between the Haar transform and the MRT", 8th International Conference on Information, Communication and Signal processing(ICICS), 2011.
- Rajesh Cherian Roy and R. Gopikakumari, "A Transform(MRT) naturally suited for Directional Pattern Analysis", Proc. SPIE8760, January 28, 2013.
- Bhadran. V, R. C. Roy, R. Gopikakumari, "Visual Representation of 2-D DFT in terms of 2x2 data, A pattern analysis", proceedings of international conference on computing, communication and Networking (ICCCN '08), Chettinad college of engineering and technology, karur, India, dec 18-20, 2008 .
- Jaya. V. L, Preetha Basu, Gopikakumari. R, "A new Placement approach of 2-D unique MRT Coefficients for N a power of 2", Annual IEEE India Conference (INDICON), 2012.
Index Terms
Keywords