DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/355

Full metadata record

DC FieldValueLanguage
contributor.authorKanungo, P-
contributor.authorNanda, P K-
identifier.citationProceedings of the National Seminar on IT and Softcomputing ITSC06, Nov 17-18 IMT, Nagpur, Indiaen
descriptionCopyright for this article belongs to the publisher of the proceedingsen
description.abstractThreshold plays a vital role in classification of objects and background in a given scene and hence segmentation. Determination of optimal threshold is hard for images exhibiting overlapping histogram distributions. In this paper, we propose a novel strategy of determining the threshold from histogram distributions. A feature image is generated from the given image and the optimal threshold is determined using the histogram of the featured pixels. The featured pixels are generated by considering a fixed window around a pixel. The histogram distributions are discrete in nature and hence Genetic Algorithm (GA) and Parallel Genetic Algorithm (PGA) based clustering algorithms are proposed to determine the optimal thresholds for two and three class problems. The optimal thresholds, thus determined could segment the noisy image. The efficacy of the proposed scheme is compared with that of the Otsu’s approach. Results obtained by the proposed scheme was comparable to that Otsu’s and in some noisy cases our method could be better than the latter one. Satisfactory results could also be obtained even for histograms with overlapping class distributions.en
format.extent618487 bytes-
publisherIMT, Nagpur, Indiaen
subjectObject Background Classificationen
subjectGenetic Algorithmen
titleParallel Genetic Algorithm Based Thresholding for Image Segmentationen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
kanungo2.pdf603KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.


Powered by DSpace Feedback