{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:32Z","timestamp":1750306352705,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T00:00:00Z","timestamp":1467072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003335","name":"Ministry of Education, Youth and Science","doi-asserted-by":"publisher","award":["LH12181"],"award-info":[{"award-number":["LH12181"]}],"id":[{"id":"10.13039\/501100003335","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,28]]},"DOI":"10.1145\/2949035.2949036","type":"proceedings-article","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T13:43:49Z","timestamp":1467035029000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Total Least Square Error Computation in E2"],"prefix":"10.1145","author":[{"given":"Vaclav","family":"Skala","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of West Bohemia, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1987.1169438"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Alciatore D. Miranda R. 1995. The Best Least-Square Line Fit Graphics Gems V (Ed.Paeth A.W.) 91--97 Academic Press.  Alciatore D. Miranda R. 1995. The Best Least-Square Line Fit Graphics Gems V (Ed.Paeth A.W.) 91--97 Academic Press.","DOI":"10.1016\/B978-0-12-543457-7.50022-X"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2478\/v10156-011-0036-5"},{"key":"e_1_3_2_1_4_1","unstructured":"Charpa S. Canale R. 1988: Numerical methods for Engineers McGraw-Hill.  Charpa S. Canale R. 1988: Numerical methods for Engineers McGraw-Hill."},{"key":"e_1_3_2_1_5_1","unstructured":"Chatfield C. 1970. Statistics for Technology Penguin Book.  Chatfield C. 1970. Statistics for Technology Penguin Book."},{"key":"e_1_3_2_1_6_1","unstructured":"de Groen P. 1996 An introduction to total least squares Nieuw Archief voor Wiskunde Vierde serie deel 14 237--253  de Groen P. 1996 An introduction to total least squares Nieuw Archief voor Wiskunde Vierde serie deel 14 237--253"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.1993.193165"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0717073"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.847845"},{"key":"e_1_3_2_1_10_1","unstructured":"Kryszig V. 1983. Advanced Engineering Mathematics John Wiley & Sons.  Kryszig V. 1983. Advanced Engineering Mathematics John Wiley & Sons."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Lee S. L. 1994. A note on the Total Least Square Fit to coplanar points Tech.Rep. ORNL-TM-12852 Oak Ridge National Laboratory.  Lee S. L. 1994. A note on the Total Least Square Fit to coplanar points Tech.Rep. ORNL-TM-12852 Oak Ridge National Laboratory.","DOI":"10.2172\/10109767"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1036055"},{"key":"e_1_3_2_1_13_1","unstructured":"Nixon M. S. Aguado A. S. 2012. Feature Extraction & Image processing for Computer Vision Academic Press.   Nixon M. S. Aguado A. S. 2012. Feature Extraction & Image processing for Computer Vision Academic Press."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2007.04.004"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786440109462720"},{"volume-title":"ICNAAM 2015 conference, accepted for publication AIP Conf. Proceedings","year":"2015","author":"Skala V.","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2407783.2407793"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Van Huffel S. Vandewalle J. 1991. The Total Least Squares Problems: Computational Aspects and Analysis. SIAM Publications Philadelphia PA.  Van Huffel S. Vandewalle J. 1991. The Total Least Squares Problems: Computational Aspects and Analysis. SIAM Publications Philadelphia PA.","DOI":"10.1137\/1.9781611971002"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Van Huffel S. Lemmerling P. 2002. Total Least Squares and Errors-in-Variables Modeling: Analysis Algorithms and Applications. Dordrecht The Netherlands: Kluwer Academic Publishers  Van Huffel S. Lemmerling P. 2002. Total Least Squares and Errors-in-Variables Modeling: Analysis Algorithms and Applications. Dordrecht The Netherlands: Kluwer Academic Publishers","DOI":"10.1007\/978-94-017-3552-0"},{"key":"e_1_3_2_1_20_1","unstructured":"Perpendicular Regression of a Line (download 2015-12-20) http:\/\/www.mathpages.com\/home\/kmath110.htm  Perpendicular Regression of a Line (download 2015-12-20) http:\/\/www.mathpages.com\/home\/kmath110.htm"}],"event":{"name":"CGI '16: Computer Graphics International","sponsor":["FORTH Foundation for Research and Technology - Hellas"],"location":"Heraklion Greece","acronym":"CGI '16"},"container-title":["Proceedings of the 33rd Computer Graphics International"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2949035.2949036","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2949035.2949036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:59Z","timestamp":1750222559000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2949035.2949036"}},"subtitle":["A New Simple, Fast and Robust Algorithm"],"short-title":[],"issued":{"date-parts":[[2016,6,28]]},"references-count":20,"alternative-id":["10.1145\/2949035.2949036","10.1145\/2949035"],"URL":"https:\/\/doi.org\/10.1145\/2949035.2949036","relation":{},"subject":[],"published":{"date-parts":[[2016,6,28]]},"assertion":[{"value":"2016-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}