{"id":"https://openalex.org/W2009928366","doi":"https://doi.org/10.1109/lsp.2013.2268248","title":"On the Convergence of the IRLS Algorithm in Non-Local Patch Regression","display_name":"On the Convergence of the IRLS Algorithm in Non-Local Patch Regression","publication_year":2013,"publication_date":"2013-06-12","ids":{"openalex":"https://openalex.org/W2009928366","doi":"https://doi.org/10.1109/lsp.2013.2268248","mag":"2009928366"},"language":"en","primary_location":{"id":"doi:10.1109/lsp.2013.2268248","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2013.2268248","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1303.0417","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"K. N. Chaudhury","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K. N. Chaudhury","raw_affiliation_strings":["Program in Applied and Computational Mathematics (PACM), Princeton University, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Program in Applied and Computational Mathematics (PACM), Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":1.6319,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85637143,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":"8","first_page":"815","last_page":"818"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10688","display_name":"Image and Signal Denoising Methods","score":0.8432000279426575,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10688","display_name":"Image and Signal Denoising Methods","score":0.8432000279426575,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.039500001817941666,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.029100000858306885,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7046999931335449},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6269999742507935},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5644000172615051},{"id":"https://openalex.org/keywords/regression","display_name":"Regression","score":0.5440999865531921},{"id":"https://openalex.org/keywords/regression-analysis","display_name":"Regression analysis","score":0.42669999599456787},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.38420000672340393},{"id":"https://openalex.org/keywords/robust-regression","display_name":"Robust regression","score":0.3765000104904175},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.37470000982284546},{"id":"https://openalex.org/keywords/image-denoising","display_name":"Image denoising","score":0.3596999943256378}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7046999931335449},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6269999742507935},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5942999720573425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5909000039100647},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5644000172615051},{"id":"https://openalex.org/C83546350","wikidata":"https://www.wikidata.org/wiki/Q1139051","display_name":"Regression","level":2,"score":0.5440999865531921},{"id":"https://openalex.org/C152877465","wikidata":"https://www.wikidata.org/wiki/Q208042","display_name":"Regression analysis","level":2,"score":0.42669999599456787},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40380001068115234},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.38420000672340393},{"id":"https://openalex.org/C70259352","wikidata":"https://www.wikidata.org/wiki/Q1847839","display_name":"Robust regression","level":3,"score":0.3765000104904175},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.37470000982284546},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3714999854564667},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3635999858379364},{"id":"https://openalex.org/C2983327147","wikidata":"https://www.wikidata.org/wiki/Q581861","display_name":"Image denoising","level":3,"score":0.3596999943256378},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.3456000089645386},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3433000147342682},{"id":"https://openalex.org/C48921125","wikidata":"https://www.wikidata.org/wiki/Q10861030","display_name":"Linear regression","level":2,"score":0.34279999136924744},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.33730000257492065},{"id":"https://openalex.org/C163294075","wikidata":"https://www.wikidata.org/wiki/Q581861","display_name":"Noise reduction","level":2,"score":0.3330000042915344},{"id":"https://openalex.org/C112633086","wikidata":"https://www.wikidata.org/wiki/Q381287","display_name":"White noise","level":2,"score":0.3228999972343445},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.30300000309944153},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29190000891685486},{"id":"https://openalex.org/C29265498","wikidata":"https://www.wikidata.org/wiki/Q7047719","display_name":"Noise measurement","level":3,"score":0.28839999437332153},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.2574999928474426},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2542000114917755},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.2522999942302704},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2517000138759613},{"id":"https://openalex.org/C9417928","wikidata":"https://www.wikidata.org/wiki/Q1070689","display_name":"Image processing","level":3,"score":0.25029999017715454}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lsp.2013.2268248","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2013.2268248","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1303.0417","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1303.0417","pdf_url":"https://arxiv.org/pdf/1303.0417","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1303.0417","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1303.0417","pdf_url":"https://arxiv.org/pdf/1303.0417","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W410724028","https://openalex.org/W1981607132","https://openalex.org/W1998419211","https://openalex.org/W2018322597","https://openalex.org/W2035425462","https://openalex.org/W2056370875","https://openalex.org/W2119883478","https://openalex.org/W2136396015","https://openalex.org/W2168745297"],"related_works":[],"abstract_inverted_index":{"Recently,":[0],"it":[1],"was":[2,88,101],"demonstrated":[3],"in":[4,95,124,144],",":[5],"that":[6,59,114],"the":[7,10,33,92,98,105,115,125,145,160,164,171,180,183],"robustness":[8],"of":[9,173,182],"classical":[11],"Non-Local":[12,41],"Means":[13],"(NLM)":[14],"algorithm":[15,87,117],"can":[16],"be":[17],"improved":[18],"by":[19],"incorporating":[20],"<i":[21,26,75,130,150],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[22,27,76,131,151],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">lp</i>":[23],"(0":[24],"<;":[25,149,153],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">p</i>":[28,77,132,152],"\u2264":[29,129,133],"2)":[30],"regression":[31,93],"into":[32],"NLM":[34,46,65,99,142],"framework.":[35],"This":[36],"general":[37],"optimization":[38],"framework,":[39],"called":[40],"Patch":[42],"Regression":[43],"(NLPR),":[44],"contains":[45],"as":[47],"a":[48,67],"special":[49],"case.":[50],"Denoising":[51],"results":[52],"on":[53,108],"synthetic":[54],"and":[55,71,135,167],"natural":[56],"images":[57],"show":[58],"NLPR":[60],"consistently":[61],"performs":[62],"better":[63],"than":[64],"beyond":[66],"moderate":[68],"noise":[69],"level,":[70],"significantly":[72],"so":[73],"when":[74],"is":[78,118,176],"close":[79],"to":[80,103,178],"zero.":[81],"An":[82],"iteratively":[83],"reweighted":[84],"least-squares":[85],"(IRLS)":[86],"proposed":[89],"for":[90],"solving":[91],"problem":[94],"NLPR,":[96],"where":[97],"output":[100],"used":[102,177],"initialize":[104],"iterations.":[106],"Based":[107],"exhaustive":[109],"numerical":[110],"experiments,":[111],"we":[112,158],"observe":[113],"IRLS":[116,165],"globally":[119],"convergent":[120,137],"(for":[121],"arbitrary":[122],"initialization)":[123,143],"convex":[126],"regime":[127,147],"1":[128],"2,":[134],"locally":[136],"(e.g.,":[138],"fails":[139],"rarely":[140],"using":[141],"non-convex":[146],"0":[148],"1.":[154],"In":[155],"this":[156],"letter,":[157],"study":[159],"cost":[161],"associated":[162],"with":[163,170],"updates,":[166],"this,":[168],"along":[169],"framework":[172],"bounded":[174],"optimization,":[175],"analyze":[179],"convergence":[181],"algorithm.":[184]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2016-06-24T00:00:00"}