{"id":"https://openalex.org/W1493561453","doi":"https://doi.org/10.1109/icip.2004.1419514","title":"Corridor scissors: a semi-automatic segmentation tool employing minimum-cost circular paths","display_name":"Corridor scissors: a semi-automatic segmentation tool employing minimum-cost circular paths","publication_year":2005,"publication_date":"2005-04-19","ids":{"openalex":"https://openalex.org/W1493561453","doi":"https://doi.org/10.1109/icip.2004.1419514","mag":"1493561453"},"language":"en","primary_location":{"id":"doi:10.1109/icip.2004.1419514","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icip.2004.1419514","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 International Conference on Image Processing, 2004. ICIP '04.","raw_type":"proceedings-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/A5108521756","display_name":"D. Farin","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"D. Farin","raw_affiliation_strings":["University of Technology, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028255121","display_name":"Markus Pfeffer","orcid":null},"institutions":[{"id":"https://openalex.org/I177802217","display_name":"University of Mannheim","ror":"https://ror.org/031bsb921","country_code":"DE","type":"education","lineage":["https://openalex.org/I177802217"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M. Pfeffer","raw_affiliation_strings":["University of Mannheim, Mannheim, Germany"],"affiliations":[{"raw_affiliation_string":"University of Mannheim, Mannheim, Germany","institution_ids":["https://openalex.org/I177802217"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029008213","display_name":"Peter H. N. de With","orcid":"https://orcid.org/0000-0002-7639-7716"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"P.H.N. de With","raw_affiliation_strings":["LogicaCMG, University of Technology, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"LogicaCMG, University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029245466","display_name":"W. Effelsberg","orcid":null},"institutions":[{"id":"https://openalex.org/I177802217","display_name":"University of Mannheim","ror":"https://ror.org/031bsb921","country_code":"DE","type":"education","lineage":["https://openalex.org/I177802217"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"W. Effelsberg","raw_affiliation_strings":["University of Mannheim, Mannheim, Germany"],"affiliations":[{"raw_affiliation_string":"University of Mannheim, Mannheim, Germany","institution_ids":["https://openalex.org/I177802217"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5108521756"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.8954,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.74781422,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"1177","last_page":"1180"},"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.9977999925613403,"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.9977999925613403,"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/T11106","display_name":"Data Management and Algorithms","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9912999868392944,"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/segmentation","display_name":"Segmentation","score":0.8085552453994751},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.676115095615387},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6376323699951172},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.60106360912323},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5473175644874573},{"id":"https://openalex.org/keywords/scale-space-segmentation","display_name":"Scale-space segmentation","score":0.5227206349372864},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.5135295987129211},{"id":"https://openalex.org/keywords/minimum-spanning-tree-based-segmentation","display_name":"Minimum spanning tree-based segmentation","score":0.5076850652694702},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4985833168029785},{"id":"https://openalex.org/keywords/image-segmentation","display_name":"Image segmentation","score":0.4932219386100769},{"id":"https://openalex.org/keywords/segmentation-based-object-categorization","display_name":"Segmentation-based object categorization","score":0.4818907380104065},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.4627087116241455},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3388165831565857},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2265930473804474},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2227931022644043}],"concepts":[{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.8085552453994751},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.676115095615387},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6376323699951172},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.60106360912323},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5473175644874573},{"id":"https://openalex.org/C65885262","wikidata":"https://www.wikidata.org/wiki/Q7429708","display_name":"Scale-space segmentation","level":4,"score":0.5227206349372864},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.5135295987129211},{"id":"https://openalex.org/C42314347","wikidata":"https://www.wikidata.org/wiki/Q6865488","display_name":"Minimum spanning tree-based segmentation","level":5,"score":0.5076850652694702},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4985833168029785},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.4932219386100769},{"id":"https://openalex.org/C25694479","wikidata":"https://www.wikidata.org/wiki/Q7446278","display_name":"Segmentation-based object categorization","level":5,"score":0.4818907380104065},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.4627087116241455},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3388165831565857},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2265930473804474},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2227931022644043},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icip.2004.1419514","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icip.2004.1419514","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 International Conference on Image Processing, 2004. ICIP '04.","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/55375f3d-f856-4784-89e0-c939c91c570d","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/55375f3d-f856-4784-89e0-c939c91c570d","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Farin, D S, Pfeffer, M, With, de, P H N & Effelsberg, W W J 2004, Corridor Scissors: A Semi-Automatic Segmentation Tool Employing Minimum-Cost Circular Paths. in Proceedings International Conference on Image Processing (ICIP). pp. 1177-1180, 11th IEEE International Conference on Image Processing (ICIP 2004), Singapore, Singapore, 24/10/04.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/55375f3d-f856-4784-89e0-c939c91c570d","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/55375f3d-f856-4784-89e0-c939c91c570d","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings International Conference on Image Processing (ICIP), 1177 - 1180","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W76411454","https://openalex.org/W1491236491","https://openalex.org/W1987983010","https://openalex.org/W2136706845","https://openalex.org/W2752885492","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W3144569342","https://openalex.org/W2185902295","https://openalex.org/W2551987074","https://openalex.org/W2945274617","https://openalex.org/W2055202857","https://openalex.org/W2103507220","https://openalex.org/W1543922489","https://openalex.org/W2559983475","https://openalex.org/W2353364291","https://openalex.org/W2531745538"],"abstract_inverted_index":{"We":[0],"present":[1,80],"a":[2,18,58,64,81,102],"new":[3,24,38,82],"semiautomatic":[4],"segmentation":[5,32,53],"tool,":[6],"which":[7,16],"is":[8,40,55,67,92],"motivated":[9],"by":[10,69],"the":[11,37,47,50,70,73,86,99],"intelligent":[12],"scissors":[13],"algorithm,":[14],"but":[15],"uses":[17],"modified":[19],"concept":[20],"of":[21,36,49,101],"user-interaction.":[22],"This":[23],"interface":[25],"provides":[26],"better":[27],"capabilities":[28],"for":[29,84],"modifying":[30],"previous":[31],"results.":[33],"The":[34,52],"advantage":[35],"approach":[39],"that":[41,66,95],"it":[42,96],"enables":[43],"to":[44],"gradually":[45],"increase":[46],"quality":[48],"segmentation.":[51],"tool":[54],"based":[56],"on":[57],"shortest":[59,87,105],"circular":[60,88],"path":[61,106],"search":[62],"within":[63],"corridor":[65],"drawn":[68],"user":[71],"along":[72],"object":[74],"boundary.":[75],"For":[76],"this":[77],"purpose,":[78],"we":[79],"algorithm":[83,91],"computing":[85],"paths.":[89],"Our":[90],"so":[93],"fast":[94],"almost":[97],"achieves":[98],"speed":[100],"regular":[103],"noncircular":[104],"search,":[107],"while":[108],"still":[109],"ensuring":[110],"an":[111],"optimal":[112],"solution.":[113]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}