{"id":"https://openalex.org/W2891974982","doi":"https://doi.org/10.1109/icip.2018.8451208","title":"Path Coding on Geometric Planar Graph for 2D / 3D Visual Data Partitioning","display_name":"Path Coding on Geometric Planar Graph for 2D / 3D Visual Data Partitioning","publication_year":2018,"publication_date":"2018-09-07","ids":{"openalex":"https://openalex.org/W2891974982","doi":"https://doi.org/10.1109/icip.2018.8451208","mag":"2891974982"},"language":"en","primary_location":{"id":"doi:10.1109/icip.2018.8451208","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icip.2018.8451208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 25th IEEE International Conference on Image Processing (ICIP)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5028282864","display_name":"Weihang Liao","orcid":"https://orcid.org/0000-0001-9314-5433"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Weihang Liao","raw_affiliation_strings":["National Institute of Informatics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038897476","display_name":"Gene Cheung","orcid":"https://orcid.org/0000-0002-5571-4137"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Gene Cheung","raw_affiliation_strings":["National Institute of Informatics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059045087","display_name":"Wei Hu","orcid":"https://orcid.org/0000-0002-9860-0922"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wei Hu","raw_affiliation_strings":["Peking University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Peking University","institution_ids":["https://openalex.org/I20231570"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09016288,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":null,"first_page":"116","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10741","display_name":"Video Coding and Compression Technologies","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10741","display_name":"Video Coding and Compression Technologies","score":0.9988999962806702,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9988999962806702,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9983999729156494,"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.5767172574996948},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.512344479560852},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4974663555622101},{"id":"https://openalex.org/keywords/geometric-graph-theory","display_name":"Geometric graph theory","score":0.48917272686958313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47082263231277466},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.46055424213409424},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.457274466753006},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.44492438435554504},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4331586956977844},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.4159245789051056},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3587768077850342},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3527393937110901},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2989356815814972},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.21410226821899414},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.18143990635871887},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16742005944252014}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.5767172574996948},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.512344479560852},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4974663555622101},{"id":"https://openalex.org/C173547177","wikidata":"https://www.wikidata.org/wiki/Q1503271","display_name":"Geometric graph theory","level":5,"score":0.48917272686958313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47082263231277466},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.46055424213409424},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.457274466753006},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.44492438435554504},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4331586956977844},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.4159245789051056},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3587768077850342},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3527393937110901},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2989356815814972},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.21410226821899414},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.18143990635871887},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16742005944252014},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icip.2018.8451208","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icip.2018.8451208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 25th IEEE International Conference on Image Processing (ICIP)","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":24,"referenced_works":["https://openalex.org/W1489959051","https://openalex.org/W1566428659","https://openalex.org/W1592611806","https://openalex.org/W1634005169","https://openalex.org/W1980811840","https://openalex.org/W1998419211","https://openalex.org/W2001905250","https://openalex.org/W2021168822","https://openalex.org/W2024496749","https://openalex.org/W2060108852","https://openalex.org/W2101491865","https://openalex.org/W2113997006","https://openalex.org/W2121535648","https://openalex.org/W2129652681","https://openalex.org/W2136504711","https://openalex.org/W2147675160","https://openalex.org/W2157516187","https://openalex.org/W2166235716","https://openalex.org/W2170633497","https://openalex.org/W2295037606","https://openalex.org/W2296548800","https://openalex.org/W2462174551","https://openalex.org/W2951413051","https://openalex.org/W6697384664"],"related_works":["https://openalex.org/W3020555194","https://openalex.org/W4384447576","https://openalex.org/W4380905810","https://openalex.org/W4248954595","https://openalex.org/W4324131307","https://openalex.org/W2127275321","https://openalex.org/W4380994101","https://openalex.org/W2161510538","https://openalex.org/W2177466741","https://openalex.org/W2990949849"],"abstract_inverted_index":{"New":[0],"visual":[1],"media":[2],"types":[3],"like":[4,39],"light":[5],"field":[6],"images":[7],"and":[8,42,55,232,245,286],"point":[9],"clouds":[10],"are":[11],"often":[12],"irregularly":[13,24,138],"sampled":[14,25,139],"data":[15,26],"in":[16,84,91,157,191,205,266,290],"2D":[17,86,92,123,161,193,284],"or":[18],"3D":[19,94,165,173,292],"space.":[20,95],"While":[21],"coding":[22,37,58,257,282],"of":[23,35,46,60,81,108,154,172,208,221,241,264],"has":[27],"enjoyed":[28],"recent":[29],"progress":[30],"due":[31],"to":[32,71,104,228,260],"the":[33,44,53,57,113,122,137,144,149,158,164,192,202,206,209,218,267,291],"advent":[34],"graph-based":[36,118],"tools":[38],"graph":[40,129,183],"transforms":[41],"wavelets,":[43],"absence":[45],"efficiently":[47],"coded":[48,210],"side":[49],"information":[50],"(SI)":[51],"limits":[52],"adaptivity":[54],"hence":[56],"efficiency":[59],"these":[61],"tools.":[62],"In":[63],"this":[64],"paper,":[65],"we":[66,125,167,224],"present":[67],"a":[68,73,76,82,85,128,132,169,176,181,186,213,234,262,270],"general":[69],"methodology":[70],"code":[72],"path":[74,243],"through":[75],"geometric":[77],"planar":[78,182],"graph-a":[79],"generalization":[80],"contour":[83,281],"image-to":[87],"partition":[88,98],"irregular":[89],"samples":[90,111],"/":[93],"The":[96,195],"encoded":[97],"boundary":[99,114],"can":[100],"subsequently":[101],"be":[102],"used":[103,259],"assign":[105,233],"appropriate":[106],"weights":[107],"edges":[109,231],"connecting":[110],"across":[112],"for":[115,121,201,236],"more":[116],"efficient":[117],"coding.":[119],"Specifically,":[120],"case,":[124,166],"first":[126],"construct":[127,180],"based":[130,184],"on":[131,185,283],"Voronoi":[133,145,187],"map":[134,146,188],"computed":[135],"from":[136],"locations.":[140],"We":[141],"show":[142,274],"that":[143,275],"boundaries":[147],"represent":[148],"best":[150],"local":[151,170,196],"unbiased":[152],"estimator":[153],"edge":[155],"directions":[156],"original":[159],"continuous":[160],"signal.":[162],"For":[163,212],"project":[168],"window":[171,197],"points":[174],"onto":[175],"best-fitted":[177],"plane,":[178],"then":[179,199],"as":[189],"done":[190],"case.":[194,293],"is":[198,258],"shifted":[200],"next":[203],"iteration":[204],"direction":[207],"path.":[211],"given":[214],"constructed":[215],"graph,":[216],"knowing":[217],"maximum":[219],"degree":[220],"each":[222,237],"node,":[223],"design":[225],"an":[226],"alphabet":[227,268],"designate":[229],"outgoing":[230],"probability":[235,288],"using":[238],"linear":[239],"regression":[240],"past":[242],"segment":[244],"Von":[246],"Mises":[247],"distribution":[248],"with":[249],"locally":[250],"optimized":[251],"parameters.":[252],"Given":[253],"assigned":[254],"probabilities,":[255],"arithmetic":[256],"encode":[261],"sequence":[263],"symbols":[265],"into":[269],"bitstream.":[271],"Experimental":[272],"results":[273],"our":[276],"proposed":[277],"method":[278],"outperforms":[279],"state-of-the-art":[280],"grid,":[285],"uniform":[287],"assignment":[289]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}