{"id":649,"date":"2014-05-26T14:36:56","date_gmt":"2014-05-26T14:36:56","guid":{"rendered":"http:\/\/image.math.u-bordeaux.fr\/?p=649&#038;lang=fr"},"modified":"2016-01-08T12:32:13","modified_gmt":"2016-01-08T12:32:13","slug":"regularisation-adaptative-des-moyennes-non-locales-r-nl","status":"publish","type":"post","link":"https:\/\/image.math.u-bordeaux.fr\/?p=649","title":{"rendered":"Adaptive regularization of NL-means"},"content":{"rendered":"<p><\/p>\n<p>The denoising algorithm that has been developed is based on an adaptive regularization of the NL-means [1]. The proposed model is the following:<br \/>\n<a name=\"id502034073\"><\/a><\/p>\n<p class=\"ql-center-displayed-equation\" style=\"line-height: 104px;\"><span class=\"ql-right-eqno\"> (1) <\/span><span class=\"ql-left-eqno\"> &nbsp; <\/span><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/image.math.u-bordeaux.fr\/wp-content\/ql-cache\/quicklatex.com-e84cae7d19b2c3696677430cb633b2c2_l3.png\" height=\"104\" width=\"364\" class=\"ql-img-displayed-equation quicklatex-auto-format\" alt=\"&#92;&#98;&#101;&#103;&#105;&#110;&#123;&#97;&#108;&#105;&#103;&#110;&#42;&#125; &#117;&#95;&#123;&#92;&#116;&#101;&#120;&#116;&#123;&#84;&#86;&#78;&#76;&#125;&#125;&#32;&#38;&#61;&#32;&#92;&#117;&#110;&#100;&#101;&#114;&#115;&#101;&#116;&#123;&#117;&#32;&#92;&#105;&#110;&#32;&#92;&#109;&#97;&#116;&#104;&#98;&#98;&#123;&#82;&#125;&#94;&#78;&#125;&#123;&#92;&#111;&#112;&#101;&#114;&#97;&#116;&#111;&#114;&#110;&#97;&#109;&#101;&#123;&#97;&#114;&#103;&#109;&#105;&#110;&#125;&#125; &#92;&#115;&#117;&#109;&#95;&#123;&#105;&#32;&#92;&#105;&#110;&#32;&#92;&#79;&#109;&#101;&#103;&#97;&#125; &#92;&#108;&#97;&#109;&#98;&#100;&#97;&#95;&#105; &#92;&#108;&#101;&#102;&#116;&#40;&#117;&#95;&#105;&#45;&#117;&#94;&#123;&#92;&#116;&#101;&#120;&#116;&#123;&#78;&#76;&#125;&#125;&#95;&#105;&#92;&#114;&#105;&#103;&#104;&#116;&#41;&#94;&#50; &#43;&#32;&#92;&#116;&#101;&#120;&#116;&#123;&#84;&#86;&#125;&#40;&#117;&#41;&#44;&#92;&#92; &#92;&#108;&#97;&#109;&#98;&#100;&#97;&#95;&#105;&#32;&#38;&#61;&#32;&#92;&#103;&#97;&#109;&#109;&#97;&#32;&#92;&#108;&#101;&#102;&#116;&#40;&#92;&#102;&#114;&#97;&#99;&#123;&#92;&#115;&#105;&#103;&#109;&#97;&#95;&#123;&#92;&#116;&#101;&#120;&#116;&#123;&#114;&#101;&#115;&#105;&#100;&#117;&#97;&#108;&#125;&#125;&#40;&#105;&#41;&#125;&#123;&#92;&#115;&#105;&#103;&#109;&#97;&#95;&#123;&#92;&#116;&#101;&#120;&#116;&#123;&#110;&#111;&#105;&#115;&#101;&#125;&#125;&#40;&#105;&#41;&#125;&#92;&#114;&#105;&#103;&#104;&#116;&#41;&#94;&#123;&#45;&#49;&#125; &#61;&#32;&#92;&#103;&#97;&#109;&#109;&#97;&#32;&#92;&#66;&#105;&#103;&#40;&#92;&#115;&#117;&#109;&#95;&#106;&#32;&#119;&#95;&#123;&#105;&#44;&#106;&#125;&#94;&#50;&#92;&#66;&#105;&#103;&#41;&#94;&#123;&#45;&#49;&#47;&#50;&#125;&#46; &#92;&#101;&#110;&#100;&#123;&#97;&#108;&#105;&#103;&#110;&#42;&#125;\" title=\"Rendered by QuickLaTeX.com\"\/><\/p>\n<p>where <img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/image.math.u-bordeaux.fr\/wp-content\/ql-cache\/quicklatex.com-9515fb7cb3f77d91eee1211837985cc4_l3.png\" class=\"ql-img-inline-formula quicklatex-auto-format\" alt=\"&#117;&#95;&#123;&#92;&#78;&#76;&#125;\" title=\"Rendered by QuickLaTeX.com\" height=\"8\" width=\"10\" style=\"vertical-align: 0px;\"\/> is the solution obtained with the NL-means algorithm, TV refers to the total variation of the image and <img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/image.math.u-bordeaux.fr\/wp-content\/ql-cache\/quicklatex.com-4142c5deb563715526792d00ec0bfab3_l3.png\" class=\"ql-img-inline-formula quicklatex-auto-format\" alt=\"&#119;&#95;&#123;&#105;&#44;&#106;&#125;\" title=\"Rendered by QuickLaTeX.com\" height=\"14\" width=\"28\" style=\"vertical-align: -6px;\"\/> is the weight that measures the similarity between the patch of index <img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/image.math.u-bordeaux.fr\/wp-content\/ql-cache\/quicklatex.com-695d9d59bd04859c6c99e7feb11daab6_l3.png\" class=\"ql-img-inline-formula quicklatex-auto-format\" alt=\"&#105;\" title=\"Rendered by QuickLaTeX.com\" height=\"12\" width=\"6\" style=\"vertical-align: 0px;\"\/> and the patch of index <img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/image.math.u-bordeaux.fr\/wp-content\/ql-cache\/quicklatex.com-43c82d5bb00a7568d935a12e3bd969dd_l3.png\" class=\"ql-img-inline-formula quicklatex-auto-format\" alt=\"&#106;\" title=\"Rendered by QuickLaTeX.com\" height=\"16\" width=\"9\" style=\"vertical-align: -4px;\"\/> in the NL-means algorithm. The ratio <img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/image.math.u-bordeaux.fr\/wp-content\/ql-cache\/quicklatex.com-d97616d7d8fa519eb1639f369bd1e29b_l3.png\" class=\"ql-img-inline-formula quicklatex-auto-format\" alt=\"&#92;&#108;&#101;&#102;&#116;&#40;&#92;&#102;&#114;&#97;&#99;&#123;&#92;&#115;&#105;&#103;&#109;&#97;&#95;&#123;&#92;&#116;&#101;&#120;&#116;&#123;&#114;&#101;&#115;&#105;&#100;&#117;&#97;&#108;&#125;&#125;&#40;&#105;&#41;&#125;&#123;&#92;&#115;&#105;&#103;&#109;&#97;&#95;&#123;&#92;&#116;&#101;&#120;&#116;&#123;&#110;&#111;&#105;&#115;&#101;&#125;&#125;&#40;&#105;&#41;&#125;&#92;&#114;&#105;&#103;&#104;&#116;&#41;&#94;&#123;&#45;&#49;&#125;\" title=\"Rendered by QuickLaTeX.com\" height=\"36\" width=\"104\" style=\"vertical-align: -12px;\"\/> reflects the noise variance reduction performed by the NL-means. This formulation allows locally adaptive regularization of the NL-means solution <img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/image.math.u-bordeaux.fr\/wp-content\/ql-cache\/quicklatex.com-9515fb7cb3f77d91eee1211837985cc4_l3.png\" class=\"ql-img-inline-formula quicklatex-auto-format\" alt=\"&#117;&#95;&#123;&#92;&#78;&#76;&#125;\" title=\"Rendered by QuickLaTeX.com\" height=\"8\" width=\"10\" style=\"vertical-align: 0px;\"\/>, thanks to a confidence index <img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/image.math.u-bordeaux.fr\/wp-content\/ql-cache\/quicklatex.com-130188abd4690d701177358e4ad96950_l3.png\" class=\"ql-img-inline-formula quicklatex-auto-format\" alt=\"&#92;&#108;&#97;&#109;&#98;&#100;&#97;&#95;&#105;\" title=\"Rendered by QuickLaTeX.com\" height=\"16\" width=\"15\" style=\"vertical-align: -3px;\"\/> that reflects the quality of the denoising performed by the NL-means.<\/p>\n<p>This model can be adapted to the different noise statistics belonging to the exponential family (Gaussian, Poisson, multiplicative&#8230;). It can also be adapted to video denoising thanks to the use of 3D patches combined to a spatio-temporal TV regularization.<\/p>\n<p><a href=\"https:\/\/github.com\/csutour\/RNLF\" title=\"Matlab implementation of the noise estimation algorithm \">Matlab implementation of RNL<\/a><\/p>\n<p><a title=\"Video denoising with R-NL and comparisons \" href=\"http:\/\/www.math.u-bordeaux1.fr\/~sutou001\/R-NL\/\">Results of video denoising with R-NL and comparisons<\/a><\/p>\n<p><strong>Related papers:<\/strong><br \/>\n1. C. Sutour, C.-A. Deledalle et J.-F. Aujol. <a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-00854830v3\/document\">Adaptive regularization of the NL-means : Application to image and video denoising.<\/a> <em>IEEE Transactions on image processing, vol. 23(8) : 3506-3521, 2014.<\/em><\/p>\n<p>2. C. Sutour, J.-F. Aujol, C.-A. Deledalle et J.-P. Domenger. <a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01016610\/document\">Adaptive regularization of the NL-means for video denoising.<\/a> <em>International Conference on Image Processing (ICIP), pages 2704\u20132708. IEEE, 2014.<\/em><\/p>\n<p>3. C. Sutour, J.-F. Aujol et C.-A. Deledalle. <a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01016616\/document\">TV-NL : Une coop\u00e9ration entre les NL-means et les m\u00e9thodes variationnelles.<\/a> <em>Gretsi, 2013.<\/em><\/p>\n<p><\/p>\n<p><\/p>\n<h2>References<\/h2>\n<p><\/p>\n<p>[1] Buades, A., Coll, B., and Morel, J.-M. (2005). A review of image denoising algorithms, with a new one. Multiscale Modeling and Simulation, 4(2): 490\u2013530.<\/p>","protected":false},"excerpt":{"rendered":"<p>The denoising algorithm that has been developed is based on an adaptive regularization of the NL-means [1]. The proposed model is the following: (1) &nbsp; where is the solution obtained with the NL-means algorithm, TV refers to the total variation of the image and is the weight that measures the similarity between the patch of [&hellip;]<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[18,27,17,16],"tags":[],"class_list":["post-649","post","type-post","status-publish","format-standard","hentry","category-algorithms","category-software","category-debruitage","category-traitement-dimages"],"_links":{"self":[{"href":"https:\/\/image.math.u-bordeaux.fr\/index.php?rest_route=\/wp\/v2\/posts\/649","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/image.math.u-bordeaux.fr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/image.math.u-bordeaux.fr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/image.math.u-bordeaux.fr\/index.php?rest_route=\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/image.math.u-bordeaux.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=649"}],"version-history":[{"count":14,"href":"https:\/\/image.math.u-bordeaux.fr\/index.php?rest_route=\/wp\/v2\/posts\/649\/revisions"}],"predecessor-version":[{"id":767,"href":"https:\/\/image.math.u-bordeaux.fr\/index.php?rest_route=\/wp\/v2\/posts\/649\/revisions\/767"}],"wp:attachment":[{"href":"https:\/\/image.math.u-bordeaux.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=649"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/image.math.u-bordeaux.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=649"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/image.math.u-bordeaux.fr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=649"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}