To refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1zx63
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chaudhury, Kunal N | - |
dc.contributor.author | Singer, Amit | - |
dc.date.accessioned | 2019-08-29T17:02:03Z | - |
dc.date.available | 2019-08-29T17:02:03Z | - |
dc.date.issued | 2012-11 | en_US |
dc.identifier.citation | Chaudhury, Kunal N, Singer, Amit. (2012). Non-Local Euclidean Medians. IEEE SIGNAL PROCESSING LETTERS, 19 (745 - 748. doi:10.1109/LSP.2012.2217329 | en_US |
dc.identifier.issn | 1070-9908 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr1zx63 | - |
dc.description.abstract | In this letter, we note that the denoising performance of Non-Local Means (NLM) can be improved at large noise levels by replacing the mean by the Euclidean median. We call this new denoising algorithm the Non-Local Euclidean Medians (NLEM). At the heart of NLEM is the observation that the median is more robust to outliers than the mean. In particular, we provide a simple geometric insight that explains why NLEM performs better than NLM in the vicinity of edges, particularly at large noise levels. NLEM can be efficiently implemented using iteratively reweighted least squares, and its computational complexity is comparable to that of NLM. We provide some preliminary results to study the proposed algorithm and to compare it with NLM. | en_US |
dc.format.extent | 745 - 748 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | IEEE SIGNAL PROCESSING LETTERS | en_US |
dc.rights | Author's manuscript | en_US |
dc.title | Non-Local Euclidean Medians | en_US |
dc.type | Journal Article | en_US |
dc.identifier.doi | doi:10.1109/LSP.2012.2217329 | - |
dc.date.eissued | 2012-09-07 | en_US |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
1207.3056v2.pdf | 965.22 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.