{"id":"https://openalex.org/W2083697763","doi":"https://doi.org/10.1080/00207160108805027","title":"An evolutionary tabu search approach to optimal structuring element extraction for mst-Based shapes description","display_name":"An evolutionary tabu search approach to optimal structuring element extraction for mst-Based shapes description","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2083697763","doi":"https://doi.org/10.1080/00207160108805027","mag":"2083697763"},"language":"en","primary_location":{"id":"doi:10.1080/00207160108805027","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160108805027","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5103429920","display_name":"Tianzi Jiang","orcid":"https://orcid.org/0009-0006-9180-5024"},"institutions":[{"id":"https://openalex.org/I4210130445","display_name":"Max Planck Institute for Human Cognitive and Brain Sciences","ror":"https://ror.org/0387jng26","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210130445"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Tianzi Jiang","raw_affiliation_strings":["Max-Planck Institute of Cognitive Neuroscience , Signal and Image Processing Group, 1 Stephanstrasse, Leipzig, D-04103, Germany","MPI of Cognitive Neuroscience (Leipzig, -2003), The Prior Institutes, MPI for Human Cognitive and Brain Sciences, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Max-Planck Institute of Cognitive Neuroscience , Signal and Image Processing Group, 1 Stephanstrasse, Leipzig, D-04103, Germany","institution_ids":["https://openalex.org/I4210130445"]},{"raw_affiliation_string":"MPI of Cognitive Neuroscience (Leipzig, -2003), The Prior Institutes, MPI for Human Cognitive and Brain Sciences, Max Planck Society","institution_ids":["https://openalex.org/I4210130445"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103429920"],"corresponding_institution_ids":["https://openalex.org/I4210130445"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17454697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"76","issue":"3","first_page":"307","last_page":"315"},"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.9990000128746033,"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.9990000128746033,"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/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9976999759674072,"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.987500011920929,"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/tabu-search","display_name":"Tabu search","score":0.9243170022964478},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7443296313285828},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6880995035171509},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.6473193764686584},{"id":"https://openalex.org/keywords/structuring-element","display_name":"Structuring element","score":0.581551194190979},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5523574352264404},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5366010665893555},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.495082288980484},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.48178812861442566},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.4749068021774292},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4553520977497101},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.44575783610343933},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36015671491622925},{"id":"https://openalex.org/keywords/image-processing","display_name":"Image processing","score":0.2309367060661316},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21142730116844177},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.18471404910087585},{"id":"https://openalex.org/keywords/mathematical-morphology","display_name":"Mathematical morphology","score":0.15533342957496643}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.9243170022964478},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7443296313285828},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6880995035171509},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.6473193764686584},{"id":"https://openalex.org/C74032544","wikidata":"https://www.wikidata.org/wiki/Q7625238","display_name":"Structuring element","level":5,"score":0.581551194190979},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5523574352264404},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5366010665893555},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.495082288980484},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.48178812861442566},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.4749068021774292},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4553520977497101},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.44575783610343933},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36015671491622925},{"id":"https://openalex.org/C9417928","wikidata":"https://www.wikidata.org/wiki/Q1070689","display_name":"Image processing","level":3,"score":0.2309367060661316},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21142730116844177},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.18471404910087585},{"id":"https://openalex.org/C185568154","wikidata":"https://www.wikidata.org/wiki/Q530242","display_name":"Mathematical morphology","level":4,"score":0.15533342957496643}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1080/00207160108805027","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160108805027","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:edoc.mpg.de:239181","is_oa":false,"landing_page_url":"http://edoc.mpg.de/239181","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"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":"International Journal of Computer Mathematics, v.76, 307-315 (2001)","raw_type":"Article"},{"id":"pmh:oai:escidoc.org:escidoc:719956","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0010-9CCB-4","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":[],"is_oa":false,"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":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W2001614595","https://openalex.org/W2004459837","https://openalex.org/W2014356520","https://openalex.org/W2024060531","https://openalex.org/W2035497910","https://openalex.org/W2093219091","https://openalex.org/W2103366601","https://openalex.org/W2109122428","https://openalex.org/W2152150600","https://openalex.org/W2154741421","https://openalex.org/W2164078355","https://openalex.org/W2164741953","https://openalex.org/W2972362192","https://openalex.org/W2976265969","https://openalex.org/W3023540311","https://openalex.org/W4230982142"],"related_works":["https://openalex.org/W2476121495","https://openalex.org/W2370323645","https://openalex.org/W2382688260","https://openalex.org/W1543589757","https://openalex.org/W4247343174","https://openalex.org/W2168643831","https://openalex.org/W1987877777","https://openalex.org/W1533229056","https://openalex.org/W2038822609","https://openalex.org/W2354628089"],"abstract_inverted_index":{"Optimal":[0],"structure":[1,43],"element":[2,44],"extraction":[3,45],"is":[4,121],"a":[5,31],"key":[6],"step":[7],"in":[8,23],"the":[9,69,73,80,101,119],"application":[10],"of":[11,56,59,82,92],"mathematical":[12],"morphology":[13],"to":[14,40,71],"various":[15],"image":[16],"processing":[17],"tasks":[18],"and":[19,85,113,124,132],"shape":[20,49],"description":[21],"problem":[22,46],"computer":[24],"vision.":[25],"In":[26],"this":[27],"paper,":[28],"we":[29,52,116],"propose":[30],"novel":[32],"optimization":[33,105],"technique":[34],"called":[35],"evolutionary":[36],"tabu":[37,63,83,114],"search":[38,84],"(ETS)":[39],"solve":[41],"optimal":[42],"for":[47],"MST-based":[48],"description.":[50],"Specifically,":[51,95],"incorporates":[53],"\u201cthe":[54],"survival":[55],"strongest\u201d":[57],"idea":[58],"evolution":[60],"algorithm":[61,99],"into":[62],"search.":[64],"This":[65],"new":[66],"method":[67],"has":[68,133],"ability":[70],"find":[72,117],"global":[74,104],"optimum,":[75],"which":[76,126],"not":[77],"only":[78],"keeps":[79],"advantages":[81],"Genetic":[86],"Algorithms,":[87],"but":[88],"also":[89,127],"overcomes":[90],"some":[91],"their":[93],"shortages.":[94],"by":[96],"comparing":[97],"our":[98],"with":[100],"existing":[102],"other":[103],"methods":[106],"(such":[107],"as":[108],"genetic":[109],"algorithm,":[110],"Simulated":[111],"annealing":[112],"search),":[115],"that":[118],"ETS":[120],"more":[122],"practical":[123],"effective,":[125],"yields":[128],"good":[129],"near-optimal":[130],"solutions":[131],"better":[134],"convergence":[135],"speed":[136]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}