Please use this identifier to cite or link to this item:
https://idr.l2.nitk.ac.in/jspui/handle/123456789/7269
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Parameshwari, D.S. | |
dc.contributor.author | Aparna, P. | |
dc.date.accessioned | 2020-03-30T09:58:44Z | - |
dc.date.available | 2020-03-30T09:58:44Z | - |
dc.date.issued | 2014 | |
dc.identifier.citation | International Conference on Digital Signal Processing, DSP, 2014, Vol.2014-January, , pp.339-344 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7269 | - |
dc.description.abstract | In this paper, we propose an efficient textural feature extraction algorithm (TFEA) based on higher order statistical cumulant namely Kurtosis for a class of brain MR imaging applications. Using a model that represents the wavelet coefficient energies of the sub-bands of multi-level decomposition of the image as a basis, a feature set involving three parameters for each band corresponding to probability density function (PDF) of generalized Gaussian type is derived. The logical correctness and working of the proposed TFEA are first verified based on MATLAB ver.2010a tool. The algorithm is applied in conjunction with one of the popularly used canny edge detection algorithm for segmenting a class of real and synthetic magnetic resonance (MR) images to detect the region of a tumor if present. The use of the proposed approach results in reduced feature set size thus obviating the need for employing specialized feature selection/ reduction algorithms. A detailed look at the experimental results clearly show an improvement in the segmentation quality compared with conventional method. � 2014 IEEE. | en_US |
dc.title | An efficient algorithm for textural feature extraction and detection of tumors for a class of brain MR imaging applications | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.