Earticle

초록

영어

In this paper, a new algorithm to efficiently compute the two-dimensional wavelet transform is presented. This algorithm aims at low memory consumption and reduced complexity, meeting these requirements by means of line-by-line processing. In this proposal, we use recursion to automatically place the order in which the wavelet transform is computed. This way, we solve some synchronization problems that have not been tackled by previous proposals. Furthermore, unlike other similar proposals, our proposal can be straightforwardly implemented from the algorithm description. To this end, a general algorithm is given which is further detailed to allow its implementation with a simple filter bank or using the more efficient lifting scheme. We also include a new fast run-length encoder to be used along with the proposed wavelet transform for fast image compression and reduced memory consumption.

목차

Abstract
 1. Introduction
 2. Previous Method
  2.1. The JPEG-Standard
  2.2. Wavelet transform
 3. Proposed Method
  3.1. Related Work
  3.2. The Line-Based Approach
  3.3. Proposed Algorithm
 4. Experimental Results
 5. Conclusion
 6. References

키워드

저자

• Maya Babuji [ Electronics and Communication Department Amrita School of Engineering Coimbatore, India ]
• Vidhya Lavanya.R [ Electronics and Communication Department Amrita School of Engineering Coimbatore, India ]
• Sumesh E.P [ Electronics and Communication Department Amrita School of Engineering Coimbatore, India ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Signal Processing, Image Processing and Pattern Recognition

• 간기

  격월간

• pISSN

  2005-4254

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605