{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T08:15:40Z","timestamp":1770884140591,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319105987","type":"print"},{"value":"9783319105994","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10599-4_3","type":"book-chapter","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T03:37:13Z","timestamp":1407987433000},"page":"32-46","source":"Crossref","is-referenced-by-count":35,"title":["Solving Square Jigsaw Puzzles with Loop Constraints"],"prefix":"10.1007","author":[{"given":"Kilho","family":"Son","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Hays","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David B.","family":"Cooper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"http:\/\/cdb.paradice-insight.us\/"},{"issue":"11","key":"3_CR2","first-page":"1941","volume":"5","author":"N. Alajlan","year":"2009","unstructured":"Alajlan, N.: Solving square jigsaw puzzles using dynamic programming and the hungarian procedure. American Journal of Applied Science\u00a05(11), 1941\u20131947 (2009)","journal-title":"American Journal of Applied Science"},{"key":"3_CR3","unstructured":"Cho, T.S., Avidan, S., Freeman, W.T.: The patch transform. PAMI (2010)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Cho, T.S., Avidan, S., Freeman, W.T.: A probabilistic image jigsaw puzzle solver. In: CVPR (2010)","DOI":"10.1109\/CVPR.2010.5540212"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity. Graphs and Combinatorics\u00a023(suppl.) (June 2007)","DOI":"10.1007\/s00373-007-0713-4"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Andal, F.A., Taubin, G., Goldenstein, S.: Solving image puzzles with a simple quadratic programming formulation. In: Conference on Graphics, Patterns and Images (2012)","DOI":"10.1109\/SIBGRAPI.2012.18"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Freeman, H., Garder, L.: Apictorial jigsaw puzzles: the computer solution of a problem in pattern recognition. Electronic Computers\u00a013, 118\u2013127 (1964)","DOI":"10.1109\/PGEC.1964.263781"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Gallagher, A.C.: Jigsaw puzzles with pieces of unknown orientation. In: CVPR (2012)","DOI":"10.1109\/CVPR.2012.6247699"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Garfinkel, S.L.: Digital forensics research: The next 10 years. Digit. Investig.\u00a07, S64\u2013S73 (2010), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.diin.2010.05.009","DOI":"10.1016\/j.diin.2010.05.009"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Joseph, B., Kruskal, J.: On the shortest spanning subtree of a graph and the traveling salesman problem. American Mathematical Society (1956)","DOI":"10.2307\/2033241"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Liu, H., Cao, S., Yan, S.: Automated assembly of shredded pieces from multiple photos. In: ICME (2010)","DOI":"10.1109\/TMM.2011.2160845"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Olmos, A., Kingdom, F.A.A.: A biologically inspired algorithm for the recovery of shading and reflectance images (2004)","DOI":"10.1068\/p5321"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Pomeranz, D., Shemesh, M., Ben-Shahar, O.: A fully automated greedy square jigsaw puzzle solver. In: CVPR (2011)","DOI":"10.1109\/CVPR.2011.5995331"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Sharp, G.C., Lee, S.W., Wehe, D.K.: Multiview registration of 3D scenes by minimizing error between coordinate frames. PAMI\u00a026(8), 1037\u20131050 (2004)","DOI":"10.1109\/TPAMI.2004.49"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Sholomon, D., David, O., Netanyahu, N.: A genetic algorithm-based solver for very large jigsaw puzzles. In: CVPR (2013)","DOI":"10.1109\/CVPR.2013.231"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Son, K., Almeida, E.B., Cooper, D.B.: Axially symmetric 3D pots configuration system using axis of symmetry and break curve. In: CVPR (2013)","DOI":"10.1109\/CVPR.2013.40"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Williams, B., Cummins, M., Neira, J., Newman, P., Reid, I., Tard\u00f3s, J.: A comparison of loop closing techniques in monocular slam. Robotics and Autonomous Systems (2009)","DOI":"10.1016\/j.robot.2009.06.010"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Willis, A., Cooper, D.B.: Computational reconstruction of ancient artifacts. IEEE Signal Processing Magazine, 65\u201383 (2008)","DOI":"10.1109\/MSP.2008.923101"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Yang, X., Adluru, N., Latecki, L.J.: Particle filter with state permutations for solving image jigsaw puzzles. In: CVPR (2011)","DOI":"10.1109\/CVPR.2011.5995535"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Zach, C., Klopschitz, M., Pollefeys, M.: Disambiguating visual relations using loop constraints. In: CVPR (2010)","DOI":"10.1109\/CVPR.2010.5539801"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Zhu, L., Zhou, Z., Hu, D.: Globally consistent reconstruction of ripped-up documents. PAMI\u00a030(1), 1\u201313 (2008)","DOI":"10.1109\/TPAMI.2007.1163"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10599-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T09:30:46Z","timestamp":1575279046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10599-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319105987","9783319105994"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10599-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}