|
|
|
|
LEADER |
01000naa a22002652 4500 |
001 |
NLM256573042 |
003 |
DE-627 |
005 |
20231224180937.0 |
007 |
cr uuu---uuuuu |
008 |
231224s2016 xx |||||o 00| ||eng c |
028 |
5 |
2 |
|a pubmed24n0855.xml
|
035 |
|
|
|a (DE-627)NLM256573042
|
035 |
|
|
|a (NLM)26780796
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a May, Victor
|e verfasserin
|4 aut
|
245 |
1 |
3 |
|a An Algorithm for Improving Non-Local Means Operators via Low-Rank Approximation
|
264 |
|
1 |
|c 2016
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
500 |
|
|
|a Date Completed 01.07.2016
|
500 |
|
|
|a Date Revised 30.06.2016
|
500 |
|
|
|a published: Print
|
500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
520 |
|
|
|a We present a method for improving a non-local means (NLM) operator by computing its low-rank approximation. The low-rank operator is constructed by applying a filter to the spectrum of the original NLM operator. This results in an operator, which is less sensitive to noise while preserving important properties of the original operator. The method is efficiently implemented based on Chebyshev polynomials and is demonstrated on the application of natural images denoising. For this application, we provide a comparison of our method with other denoising methods
|
650 |
|
4 |
|a Journal Article
|
700 |
1 |
|
|a Keller, Yosi
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Sharon, Nir
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Shkolnisky, Yoel
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 25(2016), 3 vom: 09. März, Seite 1340-53
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
773 |
1 |
8 |
|g volume:25
|g year:2016
|g number:3
|g day:09
|g month:03
|g pages:1340-53
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 25
|j 2016
|e 3
|b 09
|c 03
|h 1340-53
|