Classification of image pixels based on minimum distance and hypothesis testing
In this article, we introduce a new method of image pixel classification. Our method is a nonparametric classification method which uses combined evidence from the multiple hypothesis testings and minimum distance to carry out the classification. Our work is motivated by the test-based classification introduced by Liao and Akritas (2007). We focus on binary and multiclass classification of image pixels taking into account both equal and unequal prior probability of classes. Experiments show that our method works better in classifying image pixels in comparison with some of the standard classification methods such as linear discriminant analysis, quadratic discriminant analysis, classification tree, the polyclass method, and the Liao and Akritas method. We apply our classifier to perform image segmentation. Experiments show that our test-based segmentation has excellent edge detection and texture preservation property for both gray scale and color images.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 56 (2012)
Issue (Month): 7 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/locate/csda|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Liao, Shu-Min & Akritas, Michael, 2007. "Test-based classification: A linkage between classification and statistical testing," Statistics & Probability Letters, Elsevier, vol. 77(12), pages 1269-1281, July.
When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:56:y:2012:i:7:p:2273-2287. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.