{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:20:20Z","timestamp":1759335620166,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031200700"},{"type":"electronic","value":"9783031200717"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20071-7_25","type":"book-chapter","created":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T05:15:09Z","timestamp":1668230109000},"page":"418-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Neural Space-Filling Curves"],"prefix":"10.1007","author":[{"given":"Hanyu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Kamal","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Larry","family":"Davis","sequence":"additional","affiliation":[]},{"given":"Abhinav","family":"Shrivastava","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,13]]},"reference":[{"key":"25_CR1","unstructured":"Alexandrov, V., Alexeev, A., Gorsky, N.: A recursive algorithm for pattern recognition. In: Proceedings of IEEE International Conference Pattern Recognition, pp. 431\u2013433 (1982)"},{"issue":"3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/30.156720","volume":"38","author":"A Ansari","year":"1992","unstructured":"Ansari, A., Fineberg, A.: Image data compression and ordering using Peano scan and lot. IEEE Trans. Consumer Electron. 38(3), 436\u2013445 (1992)","journal-title":"IEEE Trans. Consumer Electron."},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"Bader, M.: Space-filling curves: an introduction with applications in scientific computing, vol. 9. Springer Science & Business Media (2012). https:\/\/doi.org\/10.1007\/978-3-642-31046-1","DOI":"10.1007\/978-3-642-31046-1"},{"key":"25_CR4","first-page":"21557","volume":"34","author":"H Chen","year":"2021","unstructured":"Chen, H., He, B., Wang, H., Ren, Y., Lim, S.N., Shrivastava, A.: NeRV: neural representations for videos. Adv. Neural Inf. Process. Syst. 34, 21557\u201321568 (2021)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Dafner, R., Cohen-Or, D., Matias, Y.: Context-based space filling curves. In: Computer Graphics Forum, vol. 19, pp. 209\u2013218. Wiley Online Library (2000)","DOI":"10.1111\/1467-8659.00413"},{"key":"25_CR6","unstructured":"Dai, H., Khalil, E.B., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. NIPS (2017)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-93031-2_12","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"M Deudon","year":"2018","unstructured":"Deudon, M., Cournut, P., Lacoste, A., Adulyasak, Y., Rousseau, L.-M.: Learning heuristics for the TSP by policy gradient. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 170\u2013181. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_12"},{"key":"25_CR8","doi-asserted-by":"publisher","unstructured":"Drozdowski, M.: Scheduling for parallel processing, vol. 18. Springer (2009). https:\/\/doi.org\/10.1007\/978-1-84882-310-5","DOI":"10.1007\/978-1-84882-310-5"},{"key":"25_CR9","unstructured":"Ehrlich, M., et al.: Leveraging bitstream metadata for fast and accurate video compression correction. arXiv preprint arXiv:2202.00011 (2022)"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF02854581","volume":"9","author":"F Harary","year":"1960","unstructured":"Harary, F., Norman, R.Z.: Some properties of line digraphs. Rendiconti del Circolo Matematico di Palermo 9(2), 161\u2013168 (1960)","journal-title":"Rendiconti del Circolo Matematico di Palermo"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Hilbert, D.: \u00dcber die stetige abbildung einer linie auf ein fl\u00e4chenst\u00fcck. In: Dritter Band: Analysis$$\\cdot $$ Grundlagen der Mathematik$$\\cdot $$ Physik Verschiedenes, pp. 1\u20132. Springer (1935). https:\/\/doi.org\/10.1007\/978-3-662-38452-7_1","DOI":"10.1007\/978-3-662-38452-7_1"},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Hopfield, J.J., Tank, D.W.: \u201cneural\u201d computation of decisions in optimization problems. Biol. Cybern. 52(3), 141\u2013152 (1985). https:\/\/doi.org\/10.1007\/BF00339943","DOI":"10.1007\/BF00339943"},{"issue":"9","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. IRE 40(9), 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"issue":"4","key":"25_CR14","first-page":"420","volume":"76","author":"S Kamata","year":"1993","unstructured":"Kamata, S., Eason, R.O., Kawaguchi, E.: An implementation of the Hilbert scanning algorithm and its application to data compression. IEICE Trans. Inf. Syst. 76(4), 420\u2013428 (1993)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 4401\u20134410 (2019)","DOI":"10.1109\/CVPR.2019.00453"},{"key":"25_CR16","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. ICLR (2016)"},{"key":"25_CR17","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, learn to solve routing problems! ICLR (2019)"},{"key":"25_CR18","unstructured":"Lawder, J.K.: Calculation of mappings between one and n-dimensional values using the Hilbert space-filling curve. School of Computer Science and Information Systems, Birkbeck College, University of London, London Research Report BBKCS-00-01 August (2000)"},{"issue":"11","key":"25_CR19","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"issue":"12","key":"25_CR20","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1016\/0167-8655(94)90114-7","volume":"15","author":"JH Lee","year":"1994","unstructured":"Lee, J.H., Hsueh, Y.C.: Texture classification method using multiple space filling curves. Patt. Recogn. Lett. 15(12), 1241\u20131244 (1994)","journal-title":"Patt. Recogn. Lett."},{"issue":"1","key":"25_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TIT.1986.1057132","volume":"32","author":"A Lempel","year":"1986","unstructured":"Lempel, A., Ziv, J.: Compression of two-dimensional data. IEEE Trans. Inf. Theory 32(1), 2\u20138 (1986)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Li, Y., et al.: TGIF: a new dataset and benchmark on animated gif description. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4641\u20134650 (2016)","DOI":"10.1109\/CVPR.2016.502"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Lieberman-Aiden, E., et al.: Comprehensive mapping of long-range interactions reveals folding principles of the human genome. Science 326(5950), 289\u2013293 (2009)","DOI":"10.1126\/science.1181369"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Liu, Z., Luo, P., Wang, X., Tang, X.: Deep learning face attributes in the wild. In: Proceedings of International Conference on Computer Vision (ICCV) (December 2015)","DOI":"10.1109\/ICCV.2015.425"},{"key":"25_CR25","doi-asserted-by":"publisher","unstructured":"Matias, Y., Shamir, A.: A video scrambling technique based on space filling curves. In: Conference on the Theory and Application of Cryptographic Techniques, pp. 398\u2013417. Springer (1987). https:\/\/doi.org\/10.1007\/3-540-48184-2_35","DOI":"10.1007\/3-540-48184-2_35"},{"issue":"1","key":"25_CR26","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/69.908985","volume":"13","author":"B Moon","year":"2001","unstructured":"Moon, B., Jagadish, H.V., Faloutsos, C., Saltz, J.H.: Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Trans. knowl. Data Eng. 13(1), 124\u2013141 (2001)","journal-title":"IEEE Trans. knowl. Data Eng."},{"issue":"1","key":"25_CR27","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1090\/S0002-9947-1900-1500526-4","volume":"1","author":"EH Moore","year":"1900","unstructured":"Moore, E.H.: On certain crinkly curves. Trans. Am. Math. Soc. 1(1), 72\u201390 (1900)","journal-title":"Trans. Am. Math. Soc."},{"key":"25_CR28","unstructured":"Munroe, R.: xkcd: Map of the internet. https:\/\/xkcd.com\/195 (2006-12-11). Accessed 16 Nov 2021"},{"key":"25_CR29","unstructured":"Oord, A.V.D., Vinyals, O., Kavukcuoglu, K.: Neural discrete representation learning. NIPS (2017)"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Ouni, T., Lassoued, A., Abid, M.: Gradient-based space filling curves: application to lossless image compression. In: 2011 IEEE International Conference on Computer Applications and Industrial Electronics (ICCAIE), pp. 437\u2013442. IEEE (2011)","DOI":"10.1109\/ICCAIE.2011.6162175"},{"issue":"1","key":"25_CR31","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01199438","volume":"36","author":"G Peano","year":"1890","unstructured":"Peano, G.: Sur une courbe, qui remplit toute une aire plane. Mathematische Annalen 36(1), 157\u2013160 (1890)","journal-title":"Mathematische Annalen"},{"issue":"6","key":"25_CR32","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"25_CR33","unstructured":"Ramesh, A., et al.: Zero-shot text-to-image generation. ICML (2021)"},{"key":"25_CR34","unstructured":"Razavi, A., Oord, A.V.D., Vinyals, O.: Generating diverse high-fidelity images with VQ-VAE-2. NeurIPS (2019)"},{"issue":"3","key":"25_CR35","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"25_CR36","unstructured":"Sierp\u00ednski, W.: Sur une nouvelle courbe continue qui remplit toute une aire plane. Bull. Acad. Sci. Cracovie (Sci. math. et nat. Serie A), pp. 462\u2013478 (1912)"},{"key":"25_CR37","doi-asserted-by":"crossref","unstructured":"Thyagarajan, K., Chatterjee, S.: Fractal scanning for image compression. In: Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers, pp. 467\u2013468. IEEE Computer Society (1991)","DOI":"10.1109\/ACSSC.1991.186493"},{"key":"25_CR38","unstructured":"Veli\u010dkovi\u010d, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f3, P., Bengio, Y.: Graph attention networks. In: International Conference on Learning Representations (2018). https:\/\/openreview.net\/forum?id=rJXMpikCZ"},{"key":"25_CR39","unstructured":"Vinyals, O., Bengio, S., Kudlur, M.: Order matters: sequence to sequence for sets. ICLR (2015)"},{"key":"25_CR40","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. NIPS (2015)"},{"key":"25_CR41","doi-asserted-by":"crossref","unstructured":"Welch, T.A.: Technique for high-performance data compression. Computer (1984)","DOI":"10.1109\/MC.1984.1659158"},{"issue":"6","key":"25_CR42","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"IH Witten","year":"1987","unstructured":"Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. Commun. ACM 30(6), 520\u2013540 (1987)","journal-title":"Commun. ACM"},{"key":"25_CR43","unstructured":"Xiao, H., Rasul, K., Vollgraf, R.: Fashion-MNIST: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747 (2017)"},{"key":"25_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/10968987_3","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"AB Yoo","year":"2003","unstructured":"Yoo, A.B., Jette, M.A., Grondona, M.: SLURM: simple Linux utility for resource management. In: Feitelson, D., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 44\u201360. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/10968987_3"},{"issue":"2","key":"25_CR45","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1109\/TVCG.2020.3030473","volume":"27","author":"L Zhou","year":"2020","unstructured":"Zhou, L., Johnson, C.R., Weiskopf, D.: Data-driven space-filling curves. IEEE Trans. Visual. Comput. Graph. 27(2), 1591\u20131600 (2020)","journal-title":"IEEE Trans. Visual. Comput. Graph."},{"key":"25_CR46","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/LAWP.2003.810765","volume":"2","author":"J Zhu","year":"2003","unstructured":"Zhu, J., Hoorfar, A., Engheta, N.: Bandwidth, cross-polarization, and feed-point characteristics of matched Hilbert antennas. IEEE Antennas Wireless Propag. Lett. 2, 2\u20135 (2003)","journal-title":"IEEE Antennas Wireless Propag. Lett."},{"issue":"5","key":"25_CR47","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory 24(5), 530\u2013536 (1978)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20071-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T01:26:55Z","timestamp":1728350815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20071-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031200700","9783031200717"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20071-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tel Aviv","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eccv2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eccv2022.ecva.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5804","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1645","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.21","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.91","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}