{"id":"https://openalex.org/W2126464992","doi":"https://doi.org/10.1109/icpr.2008.4760981","title":"Efficient triangulation based on 3D Euclidean optimization","display_name":"Efficient triangulation based on 3D Euclidean optimization","publication_year":2008,"publication_date":"2008-12-01","ids":{"openalex":"https://openalex.org/W2126464992","doi":"https://doi.org/10.1109/icpr.2008.4760981","mag":"2126464992"},"language":"en","primary_location":{"id":"doi:10.1109/icpr.2008.4760981","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2008.4760981","pdf_url":null,"source":{"id":"https://openalex.org/S4393916651","display_name":"Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition","issn_l":"1041-3278","issn":["1041-3278","1051-4651"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 19th International Conference on Pattern Recognition","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075929754","display_name":"Klas Nordberg","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Klas Nordberg","raw_affiliation_strings":["Computer Vision Laboratory, Link\u00f6ping University","Comput. Vision Lab., Linkoping Univ., Linkoping, Sweden"],"affiliations":[{"raw_affiliation_string":"Computer Vision Laboratory, Link\u00f6ping University","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Comput. Vision Lab., Linkoping Univ., Linkoping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5075929754"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":1.2946,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74357602,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4522","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10638","display_name":"Optical measurement and interference techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10638","display_name":"Optical measurement and interference techniques","score":0.9998999834060669,"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/T10531","display_name":"Advanced Vision and Imaging","score":0.9998000264167786,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"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/triangulation","display_name":"Triangulation","score":0.8207629919052124},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.5925784111022949},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.5569362044334412},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5257150530815125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49595174193382263},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4858219623565674},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.4747905135154724},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.46524202823638916},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4563257694244385},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44727662205696106},{"id":"https://openalex.org/keywords/epipolar-geometry","display_name":"Epipolar geometry","score":0.4464457035064697},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4249117970466614},{"id":"https://openalex.org/keywords/calibration","display_name":"Calibration","score":0.41188734769821167},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4084758460521698},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.2342683970928192},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23278534412384033},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.20820173621177673},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1254388988018036}],"concepts":[{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.8207629919052124},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.5925784111022949},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.5569362044334412},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5257150530815125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49595174193382263},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4858219623565674},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.4747905135154724},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.46524202823638916},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4563257694244385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44727662205696106},{"id":"https://openalex.org/C23379248","wikidata":"https://www.wikidata.org/wiki/Q200904","display_name":"Epipolar geometry","level":3,"score":0.4464457035064697},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4249117970466614},{"id":"https://openalex.org/C165838908","wikidata":"https://www.wikidata.org/wiki/Q736777","display_name":"Calibration","level":2,"score":0.41188734769821167},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4084758460521698},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.2342683970928192},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23278534412384033},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.20820173621177673},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1254388988018036},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icpr.2008.4760981","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2008.4760981","pdf_url":null,"source":{"id":"https://openalex.org/S4393916651","display_name":"Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition","issn_l":"1041-3278","issn":["1041-3278","1051-4651"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 19th International Conference on Pattern Recognition","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.214.5430","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.5430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://figment.cse.usf.edu/~sfefilat/data/papers/MoBT2.3.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W36923225","https://openalex.org/W1518157085","https://openalex.org/W2102481828","https://openalex.org/W2138620157","https://openalex.org/W2167911154","https://openalex.org/W2209124607","https://openalex.org/W4250666038","https://openalex.org/W6631134095"],"related_works":["https://openalex.org/W113718658","https://openalex.org/W2350914983","https://openalex.org/W4302417997","https://openalex.org/W2375623303","https://openalex.org/W2348486108","https://openalex.org/W2380307509","https://openalex.org/W2374493932","https://openalex.org/W2381084059","https://openalex.org/W2094100801","https://openalex.org/W2001351033"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,27,43,60,75,127,149],"method":[4],"for":[5,82,148,165,188],"triangulation":[6,21,44,117,166],"of":[7,36,45,129,167,194],"3D":[8,105,139,168,204],"points":[9,157,169],"given":[10],"their":[11],"projections":[12],"in":[13,137,170,175,202],"two":[14],"images.":[15],"Recent":[16],"results":[17],"show":[18,66],"that":[19,68,91,142,214],"the":[20,33,55,98,111,115,133,138,155,181,189,203],"mapping":[22],"can":[23,51,70,93,162],"be":[24,52,71,94,163,185],"represented":[25],"as":[26,114],"linear":[28],"operator":[29],"K":[30,50,92,124,161,195],"applied":[31],"to":[32,42,78,96,110,220],"outer":[34],"product":[35],"corresponding":[37],"homogeneous":[38],"image":[39],"coordinates,":[40],"leading":[41],"very":[46,178,215],"low":[47],"computational":[48],"complexity.":[49],"determined":[53],"from":[54],"camera":[56,83],"matrices,":[57],"together":[58],"with":[59],"so-called":[61],"blind":[62],"plane,":[63],"but":[64],"we":[65],"here":[67],"it":[69,88,108],"further":[72],"refined":[73],"by":[74,118,198],"process":[76],"similar":[77],"gold":[79],"standard":[80],"methods":[81],"matrix":[84],"estimation.":[85],"In":[86],"particular,":[87],"is":[89,135,146,177,196],"demonstrated":[90],"adjusted":[95],"minimize":[97],"Euclidean":[99],"L":[100],"<sub":[101],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[102],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[103],"residual":[104],"error,":[106],"bringing":[107],"down":[109],"same":[112],"level":[113],"optimal":[116,172],"Hartley":[119],"and":[120,205],"Sturm.":[121],"The":[122,192],"resulting":[123],"optimally":[125],"fits":[126],"set":[128,145],"2D+2D+3D":[130],"data":[131,212],"where":[132,152],"error":[134],"measured":[136],"space.":[140],"Assuming":[141],"this":[143,160],"calibration":[144],"representative":[147],"particular":[150],"application,":[151],"later":[153],"only":[154,184],"2D":[156,206],"are":[158,218],"known,":[159],"used":[164],"an":[171],"way,":[173],"which":[174],"addition":[176],"efficient":[179],"since":[180],"optimization":[182],"need":[183],"made":[186,197],"once":[187],"point":[190],"set.":[191],"refinement":[193],"iteratively":[199],"reducing":[200],"errors":[201],"domains,":[207],"respectively.":[208],"Experiments":[209],"on":[210],"real":[211],"suggests":[213],"few":[216],"iterations":[217],"needed":[219],"accomplish":[221],"useful":[222],"results.":[223]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
