Title: | Optimal design of filter banks for texture discrimination |
Authors: | Chaudhry, M. Ali Jafri, M. Noman Mufti, Muid |
Citation: | WSCG '2005: Posters: The 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2005 in co-operation with EUROGRAPHICS, University of West Bohemia, Plzen, Czech Republic, p. 27-28. |
Issue Date: | 2005 |
Publisher: | Václav Skala - UNION Agency |
Document type: | konferenční příspěvek conferenceObject |
URI: | http://wscg.zcu.cz/WSCG2005/Papers_2005/Poster/!WSCG2005_Poster_Proceedings_Final.pdf http://hdl.handle.net/11025/895 |
ISBN: | 80-903100-8-7 |
Keywords: | kvadraturní zrcadlové filtry;texturní analýza |
Keywords in different language: | quadrature mirror filters;texture analysis |
Abstract: | In this paper, we present an optimum design of two-band Finite Impulse Response (FIR) Quadrature Mirror Filter bank (QMF) for maximum possible discrimination between textured images. There are several applications, which may not require reconstruction of signal from its transformed coefficients e.g. texture analysis, remote sensing etc. For such applications, features are extracted at different frequency resolution scales. Hence, it is extremely important that transformed image coefficients should be distortion less, which is not possible in practice. Therefore, we present an optimal design method for maximum possible discrimination between any particular classes of textures with minimum possible coefficient error. In order to obtain the desired results, the optimization routine adjusts relative error weighting along with passband and stopband edges for the design of symmetric response FIR filter. |
Rights: | © Václav Skala - UNION Agency |
Appears in Collections: | WSCG '2005: Posters |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Chaudhry.pdf | Plný text | 25,79 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/895
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.