{"id":"https://openalex.org/W2169678402","doi":"https://doi.org/10.1109/icme.2003.1221599","title":"Minmax optimal shape coding using skeleton decomposition","display_name":"Minmax optimal shape coding using skeleton decomposition","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2169678402","doi":"https://doi.org/10.1109/icme.2003.1221599","mag":"2169678402"},"language":"en","primary_location":{"id":"doi:10.1109/icme.2003.1221599","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icme.2003.1221599","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)","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 (IVPL), Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL, USA"],"affiliations":[{"raw_affiliation_string":"Image and Video Processing Laboratory (IVPL), 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/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":"G.M. Schuster","raw_affiliation_strings":["Image and Video Processing Laboratory (IVPL), Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL, USA"],"affiliations":[{"raw_affiliation_string":"Image and Video Processing Laboratory (IVPL), 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/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 (IVPL), Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL, USA"],"affiliations":[{"raw_affiliation_string":"Image and Video Processing Laboratory (IVPL), Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071499106"],"corresponding_institution_ids":["https://openalex.org/I111979921"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22893641,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"II","last_page":"245"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10531","display_name":"Advanced Vision and Imaging","score":0.991100013256073,"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.991100013256073,"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.9848999977111816,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9805999994277954,"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/minimax","display_name":"Minimax","score":0.8386969566345215},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6177542805671692},{"id":"https://openalex.org/keywords/distortion","display_name":"Distortion (music)","score":0.6131089925765991},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5307737588882446},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5225086808204651},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5061630606651306},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4964526295661926},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4266773462295532},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4142109751701355},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40452054142951965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37928590178489685},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2513118386268616}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.8386969566345215},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6177542805671692},{"id":"https://openalex.org/C126780896","wikidata":"https://www.wikidata.org/wiki/Q899871","display_name":"Distortion (music)","level":4,"score":0.6131089925765991},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5307737588882446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5225086808204651},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5061630606651306},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4964526295661926},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4266773462295532},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4142109751701355},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40452054142951965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37928590178489685},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2513118386268616},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/icme.2003.1221599","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icme.2003.1221599","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.88.9785","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.9785","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/icme03a.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.961.9551","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.961.9551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.icom.hsr.ch/fileadmin/user_upload/icom.hsr.ch/publikationen/icme03_minmax_final_version.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.978.9032","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.978.9032","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mirlab.org/conference_papers/International_Conference/ICME%202003/pdfs/0200245.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1480351644","https://openalex.org/W1554729164","https://openalex.org/W2070020316","https://openalex.org/W2099340003","https://openalex.org/W2136504711","https://openalex.org/W2150037806","https://openalex.org/W6681990916"],"related_works":["https://openalex.org/W2016058626","https://openalex.org/W2474724840","https://openalex.org/W2895916002","https://openalex.org/W1530911128","https://openalex.org/W1814049089","https://openalex.org/W1570812264","https://openalex.org/W2369683208","https://openalex.org/W2731094954","https://openalex.org/W2084836983","https://openalex.org/W3013845525"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"consider":[4],"the":[5,17,43,47,67,77],"rate-distortion":[6],"optimal":[7],"encoding":[8],"of":[9],"shape":[10],"information":[11],"using":[12],"a":[13,52,74],"skeleton":[14],"decomposition":[15],"and":[16,71],"minimum":[18,68,79],"maximum":[19],"(minmax)":[20],"distortion":[21,80],"criterion.":[22],"For":[23],"bit":[24],"budget":[25],"constrained":[26],"video":[27],"communication":[28],"applications,":[29],"whose":[30],"goal":[31],"is":[32,46],"to":[33,65],"achieve":[34],"as":[35,37],"low":[36],"possible":[38],"but":[39],"almost":[40],"constant":[41],"distortion,":[42],"minmax":[44],"criterion":[45],"natural":[48],"choice.":[49],"We":[50],"propose":[51],"4D":[53],"DAG":[54],"(directed":[55],"acyclic":[56],"graph)":[57],"shortest":[58],"path":[59],"algorithm":[60,87],"implemented":[61],"by":[62],"dynamic":[63],"programming":[64],"solve":[66],"rate":[69],"problem,":[70],"also":[72],"provide":[73],"solution":[75],"for":[76],"dual":[78],"problem.":[81],"Experimental":[82],"results":[83],"indicate":[84],"that":[85],"our":[86],"has":[88],"an":[89],"outstanding":[90],"performance":[91],"compared":[92],"with":[93],"existing":[94],"methods.":[95]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}