{"id":"https://openalex.org/W2145407935","doi":null,"title":"Minimal weights covered tree on Level Set segmentation using local curvature constraints","display_name":"Minimal weights covered tree on Level Set segmentation using local curvature constraints","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2145407935","mag":"2145407935"},"language":"en","primary_location":{"id":"mag:2145407935","doi":null,"is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org/iel5/4658782/4747417/04747450.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5076015858","display_name":"Fahima Djabelkhir","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I116970179","display_name":"University of Jijel","ror":"https://ror.org/03kkfk814","country_code":"DZ","type":"education","lineage":["https://openalex.org/I116970179"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Fahima Djabelkhir","raw_affiliation_strings":["Electron. Dept., Univ. of Jijel, Jijel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electron. Dept., Univ. of Jijel, Jijel","institution_ids":["https://openalex.org/I116970179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001823890","display_name":"Karim Mokrani","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I187560010","display_name":"University of B\u00e9ja\u00efa","ror":"https://ror.org/03yb2hp88","country_code":"DZ","type":"education","lineage":["https://openalex.org/I187560010"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Karim Mokrani","raw_affiliation_strings":["Electron. Dept., Univ. of Bejaia, Bejaia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electron. Dept., Univ. of Bejaia, Bejaia","institution_ids":["https://openalex.org/I187560010"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035165947","display_name":"Mohammed Khamadja","orcid":"https://orcid.org/0000-0002-8325-7041","observed_orcids":["https://orcid.org/0000-0002-8325-7041"]},"institutions":[{"id":"https://openalex.org/I125485651","display_name":"University Fr\u00e8res Mentouri Constantine 1","ror":"https://ror.org/017wv6808","country_code":"DZ","type":"education","lineage":["https://openalex.org/I125485651"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Mohammed Khamadja","raw_affiliation_strings":["Electron. Dept., Univ. of Constantine, Constantine"],"raw_orcid":"https://orcid.org/0000-0002-8325-7041","affiliations":[{"raw_affiliation_string":"Electron. Dept., Univ. of Constantine, Constantine","institution_ids":["https://openalex.org/I125485651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"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.15440596,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"113","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9994999766349792,"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.9994999766349792,"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/T10688","display_name":"Image and Signal Denoising Methods","score":9.999999747378752e-05,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.0,"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/level-set-segmentation","display_name":"level set segmentation","score":0.9399999976158142},{"id":"https://openalex.org/keywords/kruskal-s-algorithm","display_name":"Kruskal's algorithm","score":0.8809999823570251},{"id":"https://openalex.org/keywords/boundary-curvature","display_name":"boundary curvature","score":0.7789999842643738},{"id":"https://openalex.org/keywords/prior-knowledge-integration","display_name":"prior knowledge incorporation","score":0.8109999895095825},{"id":"https://openalex.org/keywords/image-segmentation","display_name":"image segmentation","score":0.5759999752044678},{"id":"https://openalex.org/keywords/contour-propagation","display_name":"contour propagation","score":0.6069999933242798}],"concepts":[{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.7428644299507141},{"id":"https://openalex.org/C153008295","wikidata":"https://www.wikidata.org/wiki/Q6535093","display_name":"Level set (data structures)","level":2,"score":0.7229978442192078},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.6972663998603821},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.6318691968917847},{"id":"https://openalex.org/C112353826","wikidata":"https://www.wikidata.org/wiki/Q127313","display_name":"Active contour model","level":4,"score":0.5605984926223755},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5516230463981628},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5094736218452454},{"id":"https://openalex.org/C125269122","wikidata":"https://www.wikidata.org/wiki/Q1751397","display_name":"Level set method","level":4,"score":0.5037631392478943},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4960061013698578},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.48975586891174316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4853612184524536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4758048951625824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4617704451084137},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4462001323699951},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39324894547462463},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.24384477734565735},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13429629802703857},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1297922432422638},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11295419931411743},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07579353451728821}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2145407935","doi":null,"is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org/iel5/4658782/4747417/04747450.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1991113069","https://openalex.org/W2104095591","https://openalex.org/W2114192693","https://openalex.org/W2121947440","https://openalex.org/W2134737843","https://openalex.org/W2149184914","https://openalex.org/W2155106612","https://openalex.org/W2155343350","https://openalex.org/W2493402454"],"related_works":["https://openalex.org/W44141161","https://openalex.org/W2114192693","https://openalex.org/W7098240490","https://openalex.org/W2140717750","https://openalex.org/W2112068145","https://openalex.org/W1592568697","https://openalex.org/W783872783","https://openalex.org/W3196078627","https://openalex.org/W2092851779","https://openalex.org/W2772795500"],"abstract_inverted_index":{"Owing":[0],"to":[1,39,86,105,119],"the":[2,11,41,44,49,57,61,75,81,111,120],"inhomogeneity":[3],"and":[4,108,115],"ill":[5],"defined":[6],"edges":[7],"present":[8],"in":[9,20,65],"images,":[10],"incorporation":[12],"of":[13,26,35,43,59,80,95],"prior":[14,37],"knowledge":[15],"into":[16],"level":[17,45,122],"set":[18,46,123],"models,":[19],"image":[21,67],"segmentation,":[22],"is":[23,51],"a":[24,32],"field":[25],"active":[27],"researches.":[28],"In":[29],"this":[30],"paper,":[31],"new":[33],"way":[34],"incorporating":[36],"information":[38],"constrain":[40],"evolution":[42],"model":[47],"during":[48],"segmentation":[50],"presented.":[52],"This":[53],"technique":[54],"allows":[55],"resolving":[56],"problem":[58],"applying":[60],"same":[62],"curvature":[63],"coefficient":[64],"all":[66],"regions.":[68],"We":[69],"construct,":[70],"based":[71],"on":[72],"Kruskal":[73],"algorithm,":[74],"minimal":[76],"weights":[77],"covered":[78],"tree":[79],"initial":[82],"density":[83],"graph":[84],"due":[85],"boundary":[87],"curvature.":[88],"The":[89],"simulation":[90],"results":[91,102],"using":[92],"different":[93],"kind":[94],"images":[96],"show":[97],"that":[98],"we":[99],"get":[100],"better":[101],"with":[103],"respect":[104],"propagation,":[106],"precision":[107],"homogeneity":[109],"between":[110],"final":[112],"propagating":[113],"contour":[114],"local":[116],"regions,":[117],"compared":[118],"classical":[121],"method.":[124]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}