{"id":"https://openalex.org/W2150037806","doi":"https://doi.org/10.1109/mmsp.2002.1203254","title":"An optimal shape encoding scheme using skeleton decomposition","display_name":"An optimal shape encoding scheme using skeleton decomposition","publication_year":2004,"publication_date":"2004-01-23","ids":{"openalex":"https://openalex.org/W2150037806","doi":"https://doi.org/10.1109/mmsp.2002.1203254","mag":"2150037806"},"language":"en","primary_location":{"id":"doi:10.1109/mmsp.2002.1203254","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmsp.2002.1203254","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2002 IEEE Workshop on Multimedia Signal 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/A5071499106","display_name":"Haohong Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haohong Wang","raw_affiliation_strings":["Image and Video Processing Laboratory, Department of Electrical and Computer Engineering, NorthWestern University, Evanston, IL, USA"],"affiliations":[{"raw_affiliation_string":"Image and Video Processing Laboratory, Department of Electrical and Computer Engineering, NorthWestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072131187","display_name":"G.M. Schuster","orcid":null},"institutions":[{"id":"https://openalex.org/I4210127453","display_name":"University of Applied Sciences Rapperswil","ror":"https://ror.org/02g821610","country_code":"CH","type":"education","lineage":["https://openalex.org/I4210127453","https://openalex.org/I4210129390"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"G.M. Schuster","raw_affiliation_strings":["Abteilung Elektrotechnik, Hochschnle f\u00fcr Technik und Wirtschaft, Rapperswil, Switzerland"],"affiliations":[{"raw_affiliation_string":"Abteilung Elektrotechnik, Hochschnle f\u00fcr Technik und Wirtschaft, Rapperswil, Switzerland","institution_ids":["https://openalex.org/I4210127453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048650003","display_name":"Aggelos K. Katsaggelos","orcid":"https://orcid.org/0000-0003-4554-0070"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A.K. Katsaggelos","raw_affiliation_strings":["Image and Video Processing Laboratory, Department of Electrical and Computer Engineering, NorthWestern University, Evanston, IL, USA"],"affiliations":[{"raw_affiliation_string":"Image and Video Processing Laboratory, Department of Electrical and Computer Engineering, NorthWestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033881432","display_name":"Thrasyvoulos N. Pappas","orcid":"https://orcid.org/0000-0002-4598-2197"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T.N. Pappas","raw_affiliation_strings":["Image and Video Processing Laboratory, Department of Electrical and Computer Engineering, NorthWestern University, Evanston, IL, USA"],"affiliations":[{"raw_affiliation_string":"Image and Video Processing Laboratory, Department of Electrical and Computer Engineering, NorthWestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5071499106"],"corresponding_institution_ids":["https://openalex.org/I111979921"],"apc_list":null,"apc_paid":null,"fwci":0.5517,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71094869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"85","last_page":"88"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10531","display_name":"Advanced Vision and Imaging","score":0.9969000220298767,"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/T10531","display_name":"Advanced Vision and Imaging","score":0.9969000220298767,"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/T10741","display_name":"Video Coding and Compression Technologies","score":0.9930999875068665,"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/T10638","display_name":"Optical measurement and interference techniques","score":0.9901000261306763,"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/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5879673361778259},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5798133611679077},{"id":"https://openalex.org/keywords/skeleton","display_name":"Skeleton (computer programming)","score":0.5725136399269104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5296604037284851},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4993855953216553},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.489581435918808},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4733331799507141},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4643082916736603},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4512348771095276},{"id":"https://openalex.org/keywords/distortion","display_name":"Distortion (music)","score":0.4153043031692505},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.413519024848938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39790964126586914},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36122435331344604},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32253599166870117},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26869645714759827},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13647976517677307}],"concepts":[{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5879673361778259},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5798133611679077},{"id":"https://openalex.org/C18969341","wikidata":"https://www.wikidata.org/wiki/Q1169129","display_name":"Skeleton (computer programming)","level":2,"score":0.5725136399269104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5296604037284851},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4993855953216553},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.489581435918808},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4733331799507141},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4643082916736603},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4512348771095276},{"id":"https://openalex.org/C126780896","wikidata":"https://www.wikidata.org/wiki/Q899871","display_name":"Distortion (music)","level":4,"score":0.4153043031692505},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.413519024848938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39790964126586914},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36122435331344604},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32253599166870117},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26869645714759827},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13647976517677307},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"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/C194257627","wikidata":"https://www.wikidata.org/wiki/Q211554","display_name":"Amplifier","level":3,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/mmsp.2002.1203254","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmsp.2002.1203254","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2002 IEEE Workshop on Multimedia Signal Processing.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.1045","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.1045","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.northwestern.edu/~haohong/mmsp02.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.489.8340","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.489.8340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ivpl.ece.northwestern.edu/system/files/01203254a.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1480351644","https://openalex.org/W2024459049","https://openalex.org/W2070020316","https://openalex.org/W2126957869","https://openalex.org/W2132517649","https://openalex.org/W2136504711","https://openalex.org/W2140638739","https://openalex.org/W2164741953","https://openalex.org/W4230982142"],"related_works":["https://openalex.org/W4302345037","https://openalex.org/W2731094954","https://openalex.org/W2789273959","https://openalex.org/W2952978498","https://openalex.org/W1998712144","https://openalex.org/W4292730466","https://openalex.org/W2951616510","https://openalex.org/W3122467582","https://openalex.org/W2728444714","https://openalex.org/W2354764436"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"operational":[4],"rate-distortion":[5],"(ORD)":[6],"optimal":[7],"approach":[8],"for":[9,41,53,71,78,148,157],"skeleton-based":[10],"boundary":[11,14,33],"encoding.":[12],"The":[13,91,169],"information":[15],"is":[16,89,93,141,154],"first":[17],"decomposed":[18],"into":[19],"skeleton":[20,44,73],"and":[21,45,65,74,77,101],"distance":[22,46,75],"signals,":[23],"by":[24],"which":[25],"a":[26,49,54,82,102,107,117,149],"more":[27],"efficient":[28],"representation":[29],"of":[30,36,61,67,98,126,144,163],"the":[31,43,59,63,68,86,96,123,127,142,160,164],"original":[32],"results.":[34],"Curves":[35],"arbitrary":[37],"order":[38],"are":[39],"utilized":[40],"approximating":[42],"signals.":[47],"For":[48],"given":[50],"bit":[51],"budget":[52],"video":[55],"frame,":[56,83],"we":[57,113,121],"solve":[58],"problem":[60,92],"choosing":[62],"number":[64,143],"location":[66],"control":[69,146],"points":[70,147],"all":[72,79],"signals":[76],"boundaries":[80],"within":[81],"so":[84],"that":[85],"overall":[87],"distortion":[88],"minimized.":[90],"solved":[94],"with":[95],"use":[97],"Lagrangian":[99],"relaxation":[100],"shortest":[103,130],"path":[104,118,131],"algorithm":[105,132,165,171],"in":[106],"4D":[108,128],"directed":[109],"acyclic":[110],"graph":[111],"(DAG)":[112],"propose.":[114],"By":[115],"defining":[116],"selection":[119],"pattern,":[120],"reduce":[122],"computational":[124,161],"complexity":[125,162],"DAG":[129],"from":[133],"O(N/sup":[134,137,167],"-5/)":[135],"to":[136,166],"-4/),":[138],"where":[139],"N":[140],"admissible":[145],"skeleton.":[150],"A":[151],"suboptimal":[152],"solution":[153],"also":[155],"presented":[156],"further":[158],"reducing":[159],"-2/).":[168],"proposed":[170],"outperforms":[172],"experimentally":[173],"other":[174],"competing":[175],"algorithms.":[176]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}