{"id":"https://openalex.org/W7113900410","doi":"https://doi.org/10.1145/3757376.3771401","title":"Markov Chain Monte Carlo-Guided Compact 3D Gaussian Splatting for Relightable Rendering","display_name":"Markov Chain Monte Carlo-Guided Compact 3D Gaussian Splatting for Relightable Rendering","publication_year":2025,"publication_date":"2025-12-10","ids":{"openalex":"https://openalex.org/W7113900410","doi":"https://doi.org/10.1145/3757376.3771401"},"language":null,"primary_location":{"id":"doi:10.1145/3757376.3771401","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3757376.3771401","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the SIGGRAPH Asia 2025 Technical Communications","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3757376.3771401","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yoonsung Jung","orcid":"https://orcid.org/0009-0004-7807-4701"},"institutions":[{"id":"https://openalex.org/I4575257","display_name":"Hanyang University","ror":"https://ror.org/046865y68","country_code":"KR","type":"education","lineage":["https://openalex.org/I4575257"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Yoonsung Jung","raw_affiliation_strings":["Hanyang University ERICA, Ansan, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Hanyang University ERICA, Ansan, Republic of Korea","institution_ids":["https://openalex.org/I4575257"]}]},{"author_position":"last","author":{"id":null,"display_name":"Q Youn Hong","orcid":"https://orcid.org/0000-0002-3411-049X"},"institutions":[{"id":"https://openalex.org/I4575257","display_name":"Hanyang University","ror":"https://ror.org/046865y68","country_code":"KR","type":"education","lineage":["https://openalex.org/I4575257"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Q Youn Hong","raw_affiliation_strings":["Hanyang University ERICA, Ansan, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Hanyang University ERICA, Ansan, Republic of Korea","institution_ids":["https://openalex.org/I4575257"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4575257"],"apc_list":null,"apc_paid":null,"fwci":3.5437,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.94774072,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9729999899864197,"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"}},"topics":[{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9729999899864197,"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"}},{"id":"https://openalex.org/T11019","display_name":"Image Enhancement Techniques","score":0.009100000374019146,"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/T10719","display_name":"3D Shape Modeling and Analysis","score":0.008700000122189522,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.5929999947547913},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5881999731063843},{"id":"https://openalex.org/keywords/rendering","display_name":"Rendering (computer graphics)","score":0.5640000104904175},{"id":"https://openalex.org/keywords/importance-sampling","display_name":"Importance sampling","score":0.5430999994277954},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.5333999991416931},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5065000057220459},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.4984000027179718},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.40720000863075256}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8058000206947327},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.5929999947547913},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5881999731063843},{"id":"https://openalex.org/C205711294","wikidata":"https://www.wikidata.org/wiki/Q176953","display_name":"Rendering (computer graphics)","level":2,"score":0.5640000104904175},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.5430999994277954},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.5333999991416931},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5065000057220459},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5001000165939331},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.4984000027179718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4844000041484833},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.4499000012874603},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.40720000863075256},{"id":"https://openalex.org/C89720835","wikidata":"https://www.wikidata.org/wiki/Q1531701","display_name":"Global illumination","level":3,"score":0.3970000147819519},{"id":"https://openalex.org/C2781395549","wikidata":"https://www.wikidata.org/wiki/Q4680762","display_name":"Adaptive sampling","level":3,"score":0.3847000002861023},{"id":"https://openalex.org/C61326573","wikidata":"https://www.wikidata.org/wiki/Q1496376","display_name":"Gaussian process","level":3,"score":0.36090001463890076},{"id":"https://openalex.org/C187192777","wikidata":"https://www.wikidata.org/wiki/Q381699","display_name":"Rejection sampling","level":5,"score":0.3188999891281128},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.3183000087738037},{"id":"https://openalex.org/C61224824","wikidata":"https://www.wikidata.org/wiki/Q2260434","display_name":"Mixture model","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.2818000018596649},{"id":"https://openalex.org/C2778045648","wikidata":"https://www.wikidata.org/wiki/Q176827","display_name":"Markov random field","level":4,"score":0.2809999883174896},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.2621000111103058},{"id":"https://openalex.org/C116921373","wikidata":"https://www.wikidata.org/wiki/Q2816483","display_name":"Real-time rendering","level":3,"score":0.2572000026702881}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3757376.3771401","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3757376.3771401","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the SIGGRAPH Asia 2025 Technical Communications","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3757376.3771401","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3757376.3771401","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the SIGGRAPH Asia 2025 Technical Communications","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6660698652267456,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1555683961","https://openalex.org/W1983452151","https://openalex.org/W2056760934","https://openalex.org/W2103607478","https://openalex.org/W2738551266","https://openalex.org/W4200150166","https://openalex.org/W4312950208","https://openalex.org/W4385318467","https://openalex.org/W4402716145","https://openalex.org/W4403843633","https://openalex.org/W4404965819","https://openalex.org/W4413157556","https://openalex.org/W4415796646"],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,52],"novel":[3],"framework":[4],"that":[5,59,96],"enhances":[6],"3D":[7],"Gaussian":[8,112],"Splatting":[9],"(3DGS)":[10],"with":[11,110],"improved":[12],"computational":[13],"efficiency":[14],"and":[15,28,37,83,104],"relighting":[16,109],"capabilities":[17],"through":[18],"probabilistic":[19],"optimization.":[20],"While":[21],"3DGS":[22],"enables":[23],"real-time,":[24],"high-quality":[25],"scene":[26],"reconstruction":[27],"rendering,":[29],"it":[30],"remains":[31],"limited":[32],"to":[33,42],"static":[34],"lighting":[35],"environments":[36],"suffers":[38],"from":[39],"redundancy":[40],"due":[41],"millions":[43],"of":[44],"Gaussians.":[45],"To":[46],"address":[47],"these":[48],"limitations,":[49],"we":[50],"introduce":[51],"Markov":[53],"Chain":[54],"Monte":[55],"Carlo":[56],"(MCMC)-based":[57],"approach":[58],"adaptively":[60],"prunes":[61],"redundant":[62],"Gaussians":[63],"while":[64],"preserving":[65],"critical":[66],"details.":[67],"Our":[68],"contributions":[69],"include":[70],"MCMC-based":[71],"adaptive":[72],"thresholding,":[73],"surface":[74],"normal":[75],"learning":[76],"for":[77],"realistic":[78],"shading":[79],"under":[80],"dynamic":[81],"lighting,":[82],"gradient-guided":[84],"light":[85],"sampling":[86],"via":[87],"the":[88],"Metropolis-Adjusted":[89],"Langevin":[90],"Algorithm":[91],"(MALA).":[92],"Experimental":[93],"results":[94],"demonstrate":[95],"our":[97],"proposed":[98],"method":[99],"achieves":[100],"significant":[101],"memory":[102],"reduction":[103],"faster":[105],"convergence,":[106],"enabling":[107],"real-time":[108],"fewer":[111],"primitives.":[113]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-12-11T00:00:00"}