{"id":"https://openalex.org/W2074995260","doi":"https://doi.org/10.1109/ipta.2014.7001914","title":"Geodesic methods for biomedical image segmentation","display_name":"Geodesic methods for biomedical image segmentation","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2074995260","doi":"https://doi.org/10.1109/ipta.2014.7001914","mag":"2074995260"},"language":"en","primary_location":{"id":"doi:10.1109/ipta.2014.7001914","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipta.2014.7001914","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 4th International Conference on Image Processing Theory, Tools and Applications (IPTA)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101875134","display_name":"Laurent D. Cohen","orcid":"https://orcid.org/0000-0002-3940-645X"},"institutions":[{"id":"https://openalex.org/I171048554","display_name":"Centre de Recherche en Math\u00e9matiques de la D\u00e9cision","ror":"https://ror.org/03s0gj002","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I171048554","https://openalex.org/I2746051580","https://openalex.org/I4210141950","https://openalex.org/I56435720"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Laurent D. Cohen","raw_affiliation_strings":["CEREMADE, UMR CNRS 7534, University Paris Dauphine PSL&#x2217;, France"],"affiliations":[{"raw_affiliation_string":"CEREMADE, UMR CNRS 7534, University Paris Dauphine PSL&#x2217;, France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I171048554","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101875134"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I171048554","https://openalex.org/I56435720"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13663591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9735000133514404,"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/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9735000133514404,"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/T10719","display_name":"3D Shape Modeling and Analysis","score":0.9372000098228455,"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/T12417","display_name":"Morphological variations and asymmetry","score":0.9164000153541565,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.8798454999923706},{"id":"https://openalex.org/keywords/fast-marching-method","display_name":"Fast marching method","score":0.8404322862625122},{"id":"https://openalex.org/keywords/eikonal-equation","display_name":"Eikonal equation","score":0.5395888686180115},{"id":"https://openalex.org/keywords/solving-the-geodesic-equations","display_name":"Solving the geodesic equations","score":0.5217683911323547},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5167397856712341},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48440343141555786},{"id":"https://openalex.org/keywords/level-set","display_name":"Level set (data structures)","score":0.4691939055919647},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4658580422401428},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.46108099818229675},{"id":"https://openalex.org/keywords/segmentation","display_name":"Segmentation","score":0.45505788922309875},{"id":"https://openalex.org/keywords/image-segmentation","display_name":"Image segmentation","score":0.45299670100212097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4455231726169586},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.417819082736969},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41329723596572876},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4103870093822479},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.3338817358016968},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31685972213745117},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26447245478630066},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.22750908136367798},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18559983372688293},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.17883682250976562}],"concepts":[{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.8798454999923706},{"id":"https://openalex.org/C17866373","wikidata":"https://www.wikidata.org/wiki/Q5437042","display_name":"Fast marching method","level":2,"score":0.8404322862625122},{"id":"https://openalex.org/C40375134","wikidata":"https://www.wikidata.org/wiki/Q1303846","display_name":"Eikonal equation","level":2,"score":0.5395888686180115},{"id":"https://openalex.org/C161773026","wikidata":"https://www.wikidata.org/wiki/Q7559041","display_name":"Solving the geodesic equations","level":3,"score":0.5217683911323547},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5167397856712341},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48440343141555786},{"id":"https://openalex.org/C153008295","wikidata":"https://www.wikidata.org/wiki/Q6535093","display_name":"Level set (data structures)","level":2,"score":0.4691939055919647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4658580422401428},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.46108099818229675},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.45505788922309875},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.45299670100212097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4455231726169586},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.417819082736969},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41329723596572876},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4103870093822479},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.3338817358016968},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31685972213745117},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26447245478630066},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.22750908136367798},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18559983372688293},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.17883682250976562},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ipta.2014.7001914","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipta.2014.7001914","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 4th International Conference on Image Processing Theory, Tools and Applications (IPTA)","raw_type":"proceedings-article"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/17224","is_oa":false,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/17224","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2474675250","https://openalex.org/W2200845428","https://openalex.org/W1970732967","https://openalex.org/W176770976","https://openalex.org/W2415867404","https://openalex.org/W2050394778","https://openalex.org/W2052629386","https://openalex.org/W3083851338","https://openalex.org/W4287605116","https://openalex.org/W2963642352"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2,232],"given.":[3],"Tubular":[4],"and":[5,44,50,100,137,210,263,326],"tree":[6,228],"structures":[7,34,206],"appear":[8],"very":[9],"commonly":[10],"in":[11,150,207,255,269],"biomedical":[12],"images":[13],"like":[14],"vessels,":[15],"microtubules":[16],"or":[17,124,153,249],"neuron":[18],"cells.":[19],"Minimal":[20],"paths":[21,59,117,194],"have":[22,110],"been":[23],"used":[24],"for":[25,174],"long":[26],"as":[27,35,55,283,320],"an":[28,146],"interactive":[29,122],"tool":[30],"to":[31,61,65,73,144,176,204,218,297],"segment":[32],"these":[33,115],"cost":[36],"minimizing":[37,80],"curves.":[38],"The":[39,186,252,272,293,314],"user":[40,161],"usually":[41],"provides":[42],"start":[43],"end":[45,224],"points":[46,225,267,299],"on":[47],"the":[48,52,81,94,98,106,121,125,129,140,160,172,270,281,284],"image":[49,282,298],"gets":[51],"minimal":[53,58,62,116,148,193],"path":[54,149],"output.":[56],"These":[57],"correspond":[60],"geodesics":[63,257,287],"according":[64],"some":[66],"adapted":[67],"metric.":[68],"They":[69],"are":[70],"a":[71,75,87,151,157,178,182,190,221,227,240,259,264,301],"way":[72],"find":[74],"(set":[76],"of)":[77],"curve(s)":[78],"globally":[79],"geodesic":[82,88,273,303],"active":[83],"contours":[84],"energy.":[85],"Finding":[86],"distance":[89],"can":[90,131,163,200],"be":[91,164,202],"solved":[92],"by":[93,166,230],"Eikonal":[95],"equation":[96],"using":[97],"fast":[99],"efficient":[101],"Fast":[102],"Marching":[103],"method.":[104],"In":[105],"past":[107],"years":[108],"we":[109,170,238,245,316],"introduced":[111,239],"different":[112,158,216,308],"extensions":[113],"of":[114,139,192,197,223,226,266,280,286,311],"that":[118,244,288],"improve":[119],"either":[120],"aspects":[123],"results.":[126],"For":[127],"example,":[128],"metric":[130],"take":[132],"into":[133],"account":[134],"both":[135,208],"scale":[136],"orientation":[138],"path.":[141],"This":[142,199],"leads":[143],"solving":[145],"anisotropic":[147],"2D":[152,209],"3D+radius":[154],"space.":[155],"On":[156],"level,":[159],"interaction":[162],"minimized":[165],"adding":[167],"iteratively":[168],"what":[169],"called":[171,246],"keypoints,":[173],"example":[175],"obtain":[177,219],"closed":[179],"curve":[180],"from":[181],"single":[183],"initial":[184],"point.":[185,235],"result":[187],"is":[188,275],"then":[189],"set":[191,222,265],"between":[195,258],"pairs":[196],"keypoints.":[198],"also":[201,214],"applied":[203],"branching":[205],"3D":[211],"images.":[212],"We":[213,305],"proposed":[215],"criteria":[217],"automatically":[220],"structure":[229,295],"giving":[231],"one":[233],"starting":[234],"More":[236],"recently,":[237],"new":[241],"general":[242],"idea":[243],"Geodesic":[247,250],"Voting":[248],"Density.":[251],"approach":[253],"consists":[254],"computing":[256],"given":[260],"source":[261],"point":[262],"scattered":[268],"image.":[271],"density":[274],"defined":[276],"at":[277,329],"each":[278],"pixel":[279],"number":[285],"pass":[289],"over":[290],"this":[291,312],"pixel.":[292],"target":[294],"corresponds":[296],"with":[300],"high":[302],"density.":[304],"will":[306,317],"illustrate":[307],"possible":[309],"applications":[310],"approach.":[313],"work":[315],"present":[318],"involved":[319],"well":[321],"F.":[322],"Benmansour,":[323],"Y.":[324],"Rouchdy":[325],"J.":[327],"Mille":[328],"CEREMADE.":[330]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}
