{"id":"https://openalex.org/W2049398522","doi":"https://doi.org/10.1109/isbi.2008.4540986","title":"Multiframe estimation of contour evolution in medical images","display_name":"Multiframe estimation of contour evolution in medical images","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2049398522","doi":"https://doi.org/10.1109/isbi.2008.4540986","mag":"2049398522"},"language":"en","primary_location":{"id":"doi:10.1109/isbi.2008.4540986","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isbi.2008.4540986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 5th IEEE International Symposium on Biomedical Imaging: From Nano to Macro","raw_type":"proceedings-article"},"type":"conference-paper","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/A5084663630","display_name":"\u00c2ngela Vilhena Dias","orcid":null},"institutions":[{"id":"https://openalex.org/I211891151","display_name":"Universidade do Estado do Par\u00e1","ror":"https://ror.org/042r36z33","country_code":"BR","type":"education","lineage":["https://openalex.org/I211891151"]},{"id":"https://openalex.org/I59606676","display_name":"Universidade Federal do Par\u00e1","ror":"https://ror.org/03q9sr818","country_code":"BR","type":"education","lineage":["https://openalex.org/I59606676"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Angela Vilhena Dias","raw_affiliation_strings":["Department of Information Systems, Federal University of Para (UFPA), Santarem, Brazil","Dept. of Inf. Syst., Fed. Univ. of Para, Santarem"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Systems, Federal University of Para (UFPA), Santarem, Brazil","institution_ids":["https://openalex.org/I59606676"]},{"raw_affiliation_string":"Dept. of Inf. Syst., Fed. Univ. of Para, Santarem","institution_ids":["https://openalex.org/I211891151"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028702960","display_name":"S.S. Furuie","orcid":"https://orcid.org/0000-0002-1557-3018"},"institutions":[{"id":"https://openalex.org/I211891151","display_name":"Universidade do Estado do Par\u00e1","ror":"https://ror.org/042r36z33","country_code":"BR","type":"education","lineage":["https://openalex.org/I211891151"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Sergio Shiguemi Furuie","raw_affiliation_strings":["HC FMUSP, Sao Paulo Heart Institute, Sao Paulo, Brazil","Dept. of Inf. Syst., Fed. Univ. of Para, Santarem"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"HC FMUSP, Sao Paulo Heart Institute, Sao Paulo, Brazil","institution_ids":[]},{"raw_affiliation_string":"Dept. of Inf. Syst., Fed. Univ. of Para, Santarem","institution_ids":["https://openalex.org/I211891151"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09193777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"276","last_page":"279"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9980000257492065,"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.9980000257492065,"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/T10531","display_name":"Advanced Vision and Imaging","score":0.9951000213623047,"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/T11105","display_name":"Advanced Image Processing Techniques","score":0.9699000120162964,"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/initialization","display_name":"Initialization","score":0.8029085993766785},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.7063654661178589},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.6842312216758728},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6560314297676086},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.653840184211731},{"id":"https://openalex.org/keywords/tracking","display_name":"Tracking (education)","score":0.5513786673545837},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.5426729917526245},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.47240203619003296},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4405451714992523},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4309086501598358},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38516393303871155},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3263247013092041},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27708160877227783}],"concepts":[{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.8029085993766785},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.7063654661178589},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6842312216758728},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6560314297676086},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.653840184211731},{"id":"https://openalex.org/C2775936607","wikidata":"https://www.wikidata.org/wiki/Q466845","display_name":"Tracking (education)","level":2,"score":0.5513786673545837},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.5426729917526245},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.47240203619003296},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4405451714992523},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4309086501598358},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38516393303871155},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3263247013092041},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27708160877227783},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"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/C19417346","wikidata":"https://www.wikidata.org/wiki/Q7922","display_name":"Pedagogy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isbi.2008.4540986","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isbi.2008.4540986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 5th IEEE International Symposium on Biomedical Imaging: From Nano to Macro","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2015020273","https://openalex.org/W2042645152","https://openalex.org/W2059894202","https://openalex.org/W2098979973","https://openalex.org/W2120106394","https://openalex.org/W2127158139","https://openalex.org/W2129830726","https://openalex.org/W2134072319","https://openalex.org/W2136706845","https://openalex.org/W2159617609","https://openalex.org/W2946046356"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600","https://openalex.org/W2761711678"],"abstract_inverted_index":{"A":[0],"framework":[1],"for":[2,17,21],"temporal":[3],"estimation":[4],"of":[5,67,125],"contour":[6],"deformation":[7],"in":[8,30,143],"image":[9,120],"sequences":[10],"has":[11],"been":[12],"developed.":[13],"The":[14,36,80,94,106,123,134],"proposed":[15],"solution":[16,82],"point-wise":[18],"tracking":[19,34,128],"finds,":[20],"a":[22,86,116],"point,":[23],"one":[24],"optimum":[25],"trajectory":[26,46],"across":[27],"multiple":[28,56],"frames,":[29],"contrast":[31],"with":[32,55,140],"frame-to-frame":[33],"(2-frame).":[35],"multiframe":[37,81,127],"approach":[38],"aims":[39],"(i)":[40],"to":[41,101,137],"find":[42,102],"the":[43,48,53,91,97,103,126,144],"complete":[44],"point":[45],"as":[47,60,85],"global":[49,104],"optimal":[50,61],"track":[51],"over":[52,64],"space":[54],"contours,":[57],"and":[58,69,89,119],"not":[59],"sub-tracks":[62],"concatenated":[63],"this":[65],"set":[66],"contours;":[68],"(ii)":[70],"take":[71],"into":[72],"account":[73],"information":[74],"from":[75],"an":[76],"extended":[77],"time":[78],"interval.":[79],"is":[83,115,129],"framed":[84],"shortest-path":[87],"problem":[88],"uses":[90],"Dijkstra's":[92],"algorithm.":[93],"method":[95,118,135],"applies":[96],"dynamic":[98],"programming":[99],"technique":[100],"trajectory.":[105],"algorithm":[107],"requires":[108],"no":[109],"special":[110],"initialization":[111],"or":[112],"markers.":[113],"It":[114],"non-invasive":[117],"modality":[121],"independent.":[122],"usefulness":[124],"illustrated":[130],"using":[131],"synthetic":[132],"images.":[133],"demonstrated":[136],"be":[138],"consistent":[139],"methods":[141],"published":[142],"literature.":[145]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}