Abstract
The contourlet transform has emerged recently as an efficient directional multiresolution image decomposition. In order to enhance its distinguishing power for texture images, the high frequency band is split by half and results in the multiscale directional filter bank (MDFB). However, this raises the computational complexity considerably because an extra set of scale and directional decomposition is required to perform on the full image size. In this paper, we develop a new framework for the MDFB, in which directional decomposition is performed prior to the scale decomposition in the first two scales. Experiments show that 30.6%-33.2% saving in computational time can be achieved. Meanwhile, it has the same flexibility in frequency partitioning and similar texture retrieval performance as the original algorithm of the MDFB.
Original language | English |
---|---|
Title of host publication | Fourth International Conference on Information Technology and Applications, ICITA 2007 |
Pages | 236-241 |
Number of pages | 6 |
Publication status | Published - 3 Dec 2007 |
Event | 4th International Conference on Information Technology and Applications, ICITA 2007 - Harbin, China Duration: 15 Jan 2007 → 18 Jan 2007 |
Conference
Conference | 4th International Conference on Information Technology and Applications, ICITA 2007 |
---|---|
Country | China |
City | Harbin |
Period | 15/01/07 → 18/01/07 |
Keywords
- Fast algorithm
- Multiscale directional Alter bank
- Texture retrieval
ASJC Scopus subject areas
- Computer Science(all)