{"id":"https://openalex.org/W2169580846","doi":"https://doi.org/10.1109/icip.2008.4711929","title":"Fast algorithm for ISE-bounded polygonal approximation","display_name":"Fast algorithm for ISE-bounded polygonal approximation","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2169580846","doi":"https://doi.org/10.1109/icip.2008.4711929","mag":"2169580846"},"language":"en","primary_location":{"id":"doi:10.1109/icip.2008.4711929","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icip.2008.4711929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 15th IEEE International Conference on Image Processing","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/A5000026575","display_name":"Alexander Kolesnikov","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexander Kolesnikov","raw_affiliation_strings":["Department of Computer Science and Statistics, University of Joensuu, Joensuu, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Statistics, University of Joensuu, Joensuu, Finland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000026575"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0536,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81441347,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1013","last_page":"1016"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9972000122070312,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9972000122070312,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9944999814033508,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/vectorization","display_name":"Vectorization (mathematics)","score":0.7016569375991821},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6113429665565491},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6057582497596741},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5547166466712952},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5172865390777588},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.5144801139831543},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5097643733024597},{"id":"https://openalex.org/keywords/distortion","display_name":"Distortion (music)","score":0.5062517523765564},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4917469322681427},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48749208450317383},{"id":"https://openalex.org/keywords/polygonal-chain","display_name":"Polygonal chain","score":0.424085408449173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38257095217704773},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2928024232387543},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1925797164440155},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.11048471927642822},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.07397902011871338}],"concepts":[{"id":"https://openalex.org/C41681595","wikidata":"https://www.wikidata.org/wiki/Q7917855","display_name":"Vectorization (mathematics)","level":2,"score":0.7016569375991821},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6113429665565491},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6057582497596741},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5547166466712952},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5172865390777588},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.5144801139831543},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5097643733024597},{"id":"https://openalex.org/C126780896","wikidata":"https://www.wikidata.org/wiki/Q899871","display_name":"Distortion (music)","level":4,"score":0.5062517523765564},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4917469322681427},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48749208450317383},{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.424085408449173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38257095217704773},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2928024232387543},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1925797164440155},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.11048471927642822},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.07397902011871338},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C194257627","wikidata":"https://www.wikidata.org/wiki/Q211554","display_name":"Amplifier","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icip.2008.4711929","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icip.2008.4711929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 15th IEEE International Conference on Image Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1561671573","https://openalex.org/W1983579396","https://openalex.org/W1990580779","https://openalex.org/W2006609100","https://openalex.org/W2076627497","https://openalex.org/W2079280466","https://openalex.org/W2121602604","https://openalex.org/W2123630097","https://openalex.org/W2132517649","https://openalex.org/W2155239911"],"related_works":["https://openalex.org/W2762467749","https://openalex.org/W2374048355","https://openalex.org/W2161584192","https://openalex.org/W3024308452","https://openalex.org/W2359910081","https://openalex.org/W2381929598","https://openalex.org/W2383797864","https://openalex.org/W2364351544","https://openalex.org/W2141882063","https://openalex.org/W1643233150"],"abstract_inverted_index":{"In":[0,39],"this":[1,46],"paper":[2],"we":[3],"consider":[4],"a":[5,12,20,54],"problem":[6,36],"of":[7,15,76],"optimal":[8],"polygonal":[9],"approximation":[10],"with":[11,27,53,61],"minimum":[13],"number":[14],"the":[16,24,35,43,62,77,81],"line":[17],"segments":[18],"for":[19,34,80],"given":[21],"constraint":[22],"on":[23],"total":[25],"distortion":[26],"L2":[28],"measure.":[29],"A":[30],"fast":[31],"suboptimal":[32],"algorithm":[33,47],"is":[37],"proposed.":[38],"order":[40],"to":[41],"improve":[42],"solution":[44],"obtained,":[45],"can":[48],"be":[49],"used":[50],"in":[51],"combination":[52],"Reduced-Search":[55],"Dynamic":[56],"Programming":[57],"algorithm.":[58],"The":[59],"experiments":[60],"large":[63],"size":[64],"vector":[65,89,92],"data":[66,93],"have":[67],"demonstrated":[68],"both":[69],"high":[70,73],"efficiency":[71],"and":[72,87],"time":[74],"performance":[75],"proposed":[78],"algorithms":[79],"following":[82],"practical":[83],"applications:":[84],"image":[85],"vectorization":[86],"segmentation,":[88],"maps":[90],"simplification,":[91],"compression,":[94],"digital":[95],"shapes":[96],"encoding,":[97],"etc.":[98]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}