{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:35Z","timestamp":1750306595002,"version":"3.41.0"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T00:00:00Z","timestamp":1446508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology of Taiwan","doi-asserted-by":"crossref","award":["NSC100-2221-E-155-078, NSC101-2221-E-155-065, and MOST103-2221-E-155-031"],"award-info":[{"award-number":["NSC100-2221-E-155-078, NSC101-2221-E-155-065, and MOST103-2221-E-155-031"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2015,11,3]]},"abstract":"<jats:p>\n            This article presents a generalized sparse multilinear model, namely\n            <jats:italic>multiway K-clustered tensor approximation<\/jats:italic>\n            (MK-CTA), for synthesizing photorealistic 3D images from large-scale multidimensional visual datasets. MK-CTA extends previous tensor approximation algorithms, particularly\n            <jats:italic>K-clustered tensor approximation<\/jats:italic>\n            (K-CTA) [Tsai and Shih 2012], to partition a multidimensional dataset along more than one dimension into overlapped clusters. On the contrary, K-CTA only sparsely clusters a dataset along just one dimension and often fails to efficiently approximate other unclustered dimensions. By generalizing K-CTA with multiway sparse clustering, MK-CTA can be regarded as a novel sparse tensor-based model that simultaneously exploits the intra- and inter-cluster coherence among different dimensions of an input dataset. Our experiments demonstrate that MK-CTA can accurately and compactly represent various multidimensional datasets with complex and sharp visual features, including\n            <jats:italic>bidirectional texture functions<\/jats:italic>\n            (BTFs) [Dana et al. 1999],\n            <jats:italic>time-varying light fields<\/jats:italic>\n            (TVLFs) [Bando et al. 2013], and\n            <jats:italic>time-varying volume data<\/jats:italic>\n            (TVVD) [Wang et al. 2010], while easily achieving high rendering rates in practical graphics applications.\n          <\/jats:p>","DOI":"10.1145\/2753756","type":"journal-article","created":{"date-parts":[[2015,11,5]],"date-time":"2015-11-05T16:19:01Z","timestamp":1446740341000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Multiway K-Clustered Tensor Approximation"],"prefix":"10.1145","volume":"34","author":[{"given":"Yu-Ting","family":"Tsai","sequence":"first","affiliation":[{"name":"Yuan Ze University, Taoyuan City, Taiwan, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.881199"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1857907.1857911"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12280"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2451236.2451239"},{"volume-title":"Proceedings of the 7th SIAM International Conference on Data Mining (SDM'07)","year":"2007","author":"Banerjee Arindam","key":"e_1_2_2_5_1"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102357"},{"key":"e_1_2_2_7_1","unstructured":"Thomas Blumensath and Mike E. Davies. 2007. On the difference between orthogonal matching pursuit and orthogonal least squares. http:\/\/eprints.soton.ac.uk\/142469\/1\/BDOMPvsOLS07.pdf.  Thomas Blumensath and Mike E. Davies. 2007. On the difference between orthogonal matching pursuit and orthogonal least squares. http:\/\/eprints.soton.ac.uk\/142469\/1\/BDOMPvsOLS07.pdf."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/300776.300778"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02678430"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898346995"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/280814.280864"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2037655"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/383507.383515"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.246"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.70516"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03124.x"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/237170.237200"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/601671.601726"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2008.01248.x"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01585.x"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"volume-title":"Proceedings of the 3rd International Workshop on Texture Analysis and Synthesis (Texture'03)","year":"2003","author":"Koudelka Melissa Linae","key":"e_1_2_2_22_1"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1081432.1081482"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.270"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/237170.237199"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2002.1021580"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1477926.1477929"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1561\/0600000021"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01495.x"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/VISUAL.2003.1250385"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.46"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11744085_46"},{"key":"e_1_2_2_33_1","unstructured":"Heung-Yeung Shum Shing-Chow Chan and Sing Bing Kang. 2007. Image Based Rendering. Springer.   Heung-Yeung Shum Shing-Chow Chan and Sing Bing Kang. 2007. Image Based Rendering. Springer."},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2238606"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2025663"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.58"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276411"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.214"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12102"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.211"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141981"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2167076.2167077"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015725"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.2010.3"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073224"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964990"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185576"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2044470"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.70406"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2753756","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2753756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:39Z","timestamp":1750227399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2753756"}},"subtitle":["Toward High-Performance Photorealistic Data-Driven Rendering"],"short-title":[],"issued":{"date-parts":[[2015,11,3]]},"references-count":49,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,11,3]]}},"alternative-id":["10.1145\/2753756"],"URL":"https:\/\/doi.org\/10.1145\/2753756","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"type":"print","value":"0730-0301"},{"type":"electronic","value":"1557-7368"}],"subject":[],"published":{"date-parts":[[2015,11,3]]},"assertion":[{"value":"2014-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}