{"id":"https://openalex.org/W4318564260","doi":"https://doi.org/10.1142/s0218001423540058","title":"A Novel Interactive Image Segmentation Algorithm Based on Maximization of Submodular Function","display_name":"A Novel Interactive Image Segmentation Algorithm Based on Maximization of Submodular Function","publication_year":2023,"publication_date":"2023-01-31","ids":{"openalex":"https://openalex.org/W4318564260","doi":"https://doi.org/10.1142/s0218001423540058"},"language":"en","primary_location":{"id":"doi:10.1142/s0218001423540058","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0218001423540058","pdf_url":null,"source":{"id":"https://openalex.org/S41486457","display_name":"International Journal of Pattern Recognition and Artificial Intelligence","issn_l":"0218-0014","issn":["0218-0014","1793-6381"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Pattern Recognition and Artificial Intelligence","raw_type":"journal-article"},"type":"article","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/A5101793848","display_name":"Huang Tan","orcid":"https://orcid.org/0000-0002-9739-0003"},"institutions":[{"id":"https://openalex.org/I173759888","display_name":"Hunan Normal University","ror":"https://ror.org/053w1zy07","country_code":"CN","type":"education","lineage":["https://openalex.org/I173759888"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Huang Tan","raw_affiliation_strings":["Key Laboratory of Computing and Stochastic Mathematics (Ministry of Education), School of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P.\u00a0R.\u00a0China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Computing and Stochastic Mathematics (Ministry of Education), School of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P.\u00a0R.\u00a0China","institution_ids":["https://openalex.org/I173759888"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111986265","display_name":"Qiaoliang Li","orcid":null},"institutions":[{"id":"https://openalex.org/I173759888","display_name":"Hunan Normal University","ror":"https://ror.org/053w1zy07","country_code":"CN","type":"education","lineage":["https://openalex.org/I173759888"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiaoliang Li","raw_affiliation_strings":["Key Laboratory of Computing and Stochastic Mathematics (Ministry of Education), School of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P.\u00a0R.\u00a0China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Computing and Stochastic Mathematics (Ministry of Education), School of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P.\u00a0R.\u00a0China","institution_ids":["https://openalex.org/I173759888"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072533571","display_name":"Zili Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156400","display_name":"Hunan Provincial Science and Technology Department","ror":"https://ror.org/04qgr7x96","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210156400"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zili Peng","raw_affiliation_strings":["Hunan Youmei Science and Technology Development Co., Ltd., No. 568 Queyuan Road, Changsha, Hunan 410000, P.\u00a0R.\u00a0China"],"affiliations":[{"raw_affiliation_string":"Hunan Youmei Science and Technology Development Co., Ltd., No. 568 Queyuan Road, Changsha, Hunan 410000, P.\u00a0R.\u00a0China","institution_ids":["https://openalex.org/I4210156400"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101793848"],"corresponding_institution_ids":["https://openalex.org/I173759888"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00572618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"03","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval 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/T10627","display_name":"Advanced Image and Video Retrieval 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/T11605","display_name":"Visual Attention and Saliency Detection","score":0.9994000196456909,"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/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9991000294685364,"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/submodular-set-function","display_name":"Submodular set function","score":0.9416530132293701},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6264380216598511},{"id":"https://openalex.org/keywords/image-segmentation","display_name":"Image segmentation","score":0.5855541229248047},{"id":"https://openalex.org/keywords/segmentation","display_name":"Segmentation","score":0.5714809894561768},{"id":"https://openalex.org/keywords/pixel","display_name":"Pixel","score":0.5693939328193665},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5527441501617432},{"id":"https://openalex.org/keywords/entropy-maximization","display_name":"Entropy maximization","score":0.5284350514411926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5165049433708191},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4982783794403076},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4889122545719147},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4634105861186981},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4328271448612213},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.41966700553894043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4125814735889435},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3942588269710541},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3729678988456726},{"id":"https://openalex.org/keywords/principle-of-maximum-entropy","display_name":"Principle of maximum entropy","score":0.3709532618522644},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3408525586128235}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9416530132293701},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6264380216598511},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.5855541229248047},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.5714809894561768},{"id":"https://openalex.org/C160633673","wikidata":"https://www.wikidata.org/wiki/Q355198","display_name":"Pixel","level":2,"score":0.5693939328193665},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5527441501617432},{"id":"https://openalex.org/C127233936","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Entropy maximization","level":3,"score":0.5284350514411926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5165049433708191},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4982783794403076},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4889122545719147},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4634105861186981},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4328271448612213},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.41966700553894043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4125814735889435},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3942588269710541},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3729678988456726},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.3709532618522644},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3408525586128235},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218001423540058","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0218001423540058","pdf_url":null,"source":{"id":"https://openalex.org/S41486457","display_name":"International Journal of Pattern Recognition and Artificial Intelligence","issn_l":"0218-0014","issn":["0218-0014","1793-6381"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Pattern Recognition and Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2736543057","display_name":null,"funder_award_id":"12071126","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1693210201","https://openalex.org/W1904325426","https://openalex.org/W1910566948","https://openalex.org/W1979503164","https://openalex.org/W1999478155","https://openalex.org/W2056596322","https://openalex.org/W2067191022","https://openalex.org/W2110158442","https://openalex.org/W2113137767","https://openalex.org/W2118246710","https://openalex.org/W2119531662","https://openalex.org/W2121947440","https://openalex.org/W2124260943","https://openalex.org/W2124351162","https://openalex.org/W2125637308","https://openalex.org/W2162681317","https://openalex.org/W2220312492","https://openalex.org/W2328822572","https://openalex.org/W2732931556","https://openalex.org/W2749439257","https://openalex.org/W2788352579","https://openalex.org/W2789523586","https://openalex.org/W2890143105","https://openalex.org/W2909506380","https://openalex.org/W2955243330","https://openalex.org/W3008838497","https://openalex.org/W3080514906","https://openalex.org/W4205641374","https://openalex.org/W4239147634","https://openalex.org/W4243761991","https://openalex.org/W4292027170","https://openalex.org/W4300672471"],"related_works":["https://openalex.org/W2402949237","https://openalex.org/W2594118609","https://openalex.org/W2765425000","https://openalex.org/W3204684126","https://openalex.org/W4389478405","https://openalex.org/W2735578456","https://openalex.org/W2944632132","https://openalex.org/W2901206941","https://openalex.org/W2968699064","https://openalex.org/W2354484762"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"an":[3],"efficient":[4],"interactive":[5,24],"image":[6,25],"segmentation":[7,26,113],"method":[8,133,138,149],"based":[9],"on":[10,126],"maximization":[11,49],"of":[12,23,67,93,147,160],"submodular":[13,47],"function":[14,39,48],"under":[15,34],"user\u2019s":[16,35],"scribble":[17,167],"constraint":[18],"is":[19,27,40,115,139,150],"presented.":[20],"The":[21,37,64,122],"problem":[22],"formulated":[28],"as":[29,71,83],"the":[30,45,61,74,78,91,101,107,112,118,144,158],"maximum":[31],"entropy":[32],"rate":[33],"constraints.":[36],"objective":[38],"submodular,":[41],"and":[42,56,86,124,141,143,153,163],"we":[43,156],"solve":[44],"constrained":[46],"by":[50,77,117],"incorporating":[51],"a":[52],"new":[53],"data":[54],"structure":[55],"some":[57,165],"aggregating":[58,109],"rules":[59],"into":[60],"greedy":[62,94],"algorithm.":[63],"main":[65],"steps":[66],"our":[68,132,148],"algorithm":[69],"are":[70,80,98],"follows.":[72],"First,":[73],"pixels":[75,97],"scribbled":[76],"user":[79],"clustered":[81],"separately":[82],"target":[84,103,120],"foreground":[85],"background":[87],"clusters.":[88,121],"Second,":[89],"in":[90],"process":[92],"algorithm,":[95],"unscribbled":[96],"aggregated":[99],"to":[100,106],"corresponding":[102],"cluster":[104],"according":[105],"proposed":[108],"rules.":[110],"Finally,":[111],"result":[114],"presented":[116],"two":[119],"experiments":[123],"comparisons":[125],"three":[127],"standard":[128],"benchmarks":[129],"show":[130],"that":[131],"has":[134],"good":[135],"performance.":[136],"Our":[137],"straightforward":[140],"efficient,":[142],"time":[145],"complexity":[146],"between":[151],"linear":[152],"polynomial.":[154],"Furthermore,":[155],"analyze":[157],"influence":[159],"different":[161],"scribbles,":[162],"propose":[164],"optimal":[166],"strategies.":[168]},"counts_by_year":[],"updated_date":"2025-12-19T19:40:27.379048","created_date":"2025-10-10T00:00:00"}