Open Access Open Access  Restricted Access Subscription Access

Digital Image Compresssion using SPARSE MATRIX


Affiliations
1 Department of Computer Science, Alagappa Govt. Arts College, Karaikudi, India
2 Department of Computer Science and Engineering, Alagappa University, Karaikudi, India
 

The multimedia applications are widely adopted in all the fields and in the day-to-day activities. All multimedia file storages are attempted to store in tiny devices with minimal memory area. The storage process and its functionalities differ with one another, but the logical processes are same. As per the file storage techniques, the file format differ with one another. The resource availability, utilizations become a challenging task to the multimedia user. Various research works are carried out in the field of file size minimization especially of images and video. Most of the file format presentation and minimization work are carried out in the wavelet algorithms. The same work has been done by the researchers by using mathematical approach in which the digital image is converted into sparse matrix. However, the video compression is not at the appreciated level of the researchers. There are many possible avenues for the researches to reduce the frame image into minimized level in terms of size, storage approach and retrieval process of the application presentations. This research work attempted to reduce the image storage size via the functional process of the reduction mathematical tool approach, such as sparse matrix. In the sparse matrix reduction approach, the video image is converted into frames according to the scaling standards. The frames converted from the original accessible file format into three-dimensional layer based mathematical set. Each frames sequences is named and generated and then compared with transactional mapping set. The transactional binary set, one represents the difference of the pixel value and the zero represents the equivalent pixels. From the transactional matrix, the sparse matrix is generated and compared with the converted three-dimensional matrix. If the sparse is combined with the first conventional sparse that could generate the sequence of next frame. The overall numerical representation of the image and its size after decompression is compared to the original image model and its size.

Keywords

Video Compression, Sparse Matrix, Image Compression
User
Notifications

  • Breiman, L (1996) Bagging Predictors. Machine Learning Vol. 26(2) 123–140.
  • Džeroski, S (2006) Using decision trees to predict forest stand height and canopy cover from LANSAT and LIDAR data. In: Managing environmental knowledge:EnviroInfo 2006: proceedings of the 20th InternationalConference on Informatics for En vironmental Protection,Aachen: Shaker Verlag, pg. 125-133.
  • Efron, B (1993). An Introduction to the Bootstrap. Chapman and Hall, New York, (1993)
  • Hyyppa, H (1992) Algorithms and Methods of Airborne Laser-Scanning for Forest Measurements. rnational Archives of Photo grammetry and Remote Sensing, Vol XXXVI, 8/W2, Freiburg, Germany, (2004)Quinlan, J. R.: Learning with continuous classes. In Proceedings of the 5th Australian Joint Conference on Artificial Intelligence, pages 343–348. World Scientific,Singapore.
  • Raymond, M. (1992) Measures. Laser remote sensing: fundamentals and applications. Malabar, Fla., Krieger Pub. Co. 510 p. G70.6.M4 (1992)
  • SFS Slovenian Forestry Service (1998) Slovenian forest and forestry. Zavod za gozdove RS, 24 pp (1998)
  • Witten, I. (2005) Data Mining: Practical machine learning tools and techniques with Java implementations. Second Edition, Morgan Kaufman, (2005)
  • Clementking, A, Angel Latha Mary, S (2009). Comparing and identifying common factors in frequent item set algorithms in asso ciation rule 18-20 Dec. 2008 ISBN: 978-1-4244-3594-4- 10.1109/ICCCNET.2008.4787769.
  • Clementking, A (2008) Angel Latha Mary, S Study on Frequent Item set algorithms in association rule in International Journal of Algorithms, Computing and Mathematics Vol-1, NA.ov-1 2008 by Eashwar Publications.

Abstract Views: 356

PDF Views: 61




  • Digital Image Compresssion using SPARSE MATRIX

Abstract Views: 356  |  PDF Views: 61

Authors

K. C. ChandraSekaran
Department of Computer Science, Alagappa Govt. Arts College, Karaikudi, India
K. Kuppusamy
Department of Computer Science and Engineering, Alagappa University, Karaikudi, India

Abstract


The multimedia applications are widely adopted in all the fields and in the day-to-day activities. All multimedia file storages are attempted to store in tiny devices with minimal memory area. The storage process and its functionalities differ with one another, but the logical processes are same. As per the file storage techniques, the file format differ with one another. The resource availability, utilizations become a challenging task to the multimedia user. Various research works are carried out in the field of file size minimization especially of images and video. Most of the file format presentation and minimization work are carried out in the wavelet algorithms. The same work has been done by the researchers by using mathematical approach in which the digital image is converted into sparse matrix. However, the video compression is not at the appreciated level of the researchers. There are many possible avenues for the researches to reduce the frame image into minimized level in terms of size, storage approach and retrieval process of the application presentations. This research work attempted to reduce the image storage size via the functional process of the reduction mathematical tool approach, such as sparse matrix. In the sparse matrix reduction approach, the video image is converted into frames according to the scaling standards. The frames converted from the original accessible file format into three-dimensional layer based mathematical set. Each frames sequences is named and generated and then compared with transactional mapping set. The transactional binary set, one represents the difference of the pixel value and the zero represents the equivalent pixels. From the transactional matrix, the sparse matrix is generated and compared with the converted three-dimensional matrix. If the sparse is combined with the first conventional sparse that could generate the sequence of next frame. The overall numerical representation of the image and its size after decompression is compared to the original image model and its size.

Keywords


Video Compression, Sparse Matrix, Image Compression

References