{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2UJJ3D2H62VDGYKD2EIW4OCVXO","short_pith_number":"pith:2UJJ3D2H","schema_version":"1.0","canonical_sha256":"d5129d8f47f6aa336143d1116e3855bb9e3a74f65b23bc6944998c6b65300329","source":{"kind":"arxiv","id":"1501.00630","version":3},"attestation_state":"computed","paper":{"title":"Non-iterative rigid 2D/3D point-set registration using semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Ankur Kapoor, YueHaw Khoo","submitted_at":"2015-01-04T04:01:25Z","abstract_excerpt":"We describe a convex programming framework for pose estimation in 2D/3D point-set registration with unknown point correspondences. We give two mixed-integer nonlinear program (MINP) formulations of the 2D/3D registration problem when there are multiple 2D images, and propose convex relaxations for both of the MINPs to semidefinite programs (SDP) that can be solved efficiently by interior point methods. Our approach to the 2D/3D registration problem is non-iterative in nature as we jointly solve for pose and correspondence. Furthermore, these convex programs can readily incorporate feature desc"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1501.00630","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-01-04T04:01:25Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c97979461542230662de905d003ab1afdc18631e01e01892b67c1d9f4225a690","abstract_canon_sha256":"a5b48cbcaca3d0c927248173a87e3c67244ec82a8d51ddf8ff5b1e7e5d84b3b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:51.817600Z","signature_b64":"4If8tsUpQNmwOYq+47jMXm6LZcXnnyKgXuWglPs03JX/5jc6jkrrRsovYQTA0/nc7cFeftIde2XfNFL6yIUWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5129d8f47f6aa336143d1116e3855bb9e3a74f65b23bc6944998c6b65300329","last_reissued_at":"2026-05-18T01:11:51.817259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:51.817259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-iterative rigid 2D/3D point-set registration using semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Ankur Kapoor, YueHaw Khoo","submitted_at":"2015-01-04T04:01:25Z","abstract_excerpt":"We describe a convex programming framework for pose estimation in 2D/3D point-set registration with unknown point correspondences. We give two mixed-integer nonlinear program (MINP) formulations of the 2D/3D registration problem when there are multiple 2D images, and propose convex relaxations for both of the MINPs to semidefinite programs (SDP) that can be solved efficiently by interior point methods. Our approach to the 2D/3D registration problem is non-iterative in nature as we jointly solve for pose and correspondence. Furthermore, these convex programs can readily incorporate feature desc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00630","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.00630","created_at":"2026-05-18T01:11:51.817313+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00630v3","created_at":"2026-05-18T01:11:51.817313+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00630","created_at":"2026-05-18T01:11:51.817313+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UJJ3D2H62VD","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UJJ3D2H62VDGYKD","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UJJ3D2H","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2UJJ3D2H62VDGYKD2EIW4OCVXO","json":"https://pith.science/pith/2UJJ3D2H62VDGYKD2EIW4OCVXO.json","graph_json":"https://pith.science/api/pith-number/2UJJ3D2H62VDGYKD2EIW4OCVXO/graph.json","events_json":"https://pith.science/api/pith-number/2UJJ3D2H62VDGYKD2EIW4OCVXO/events.json","paper":"https://pith.science/paper/2UJJ3D2H"},"agent_actions":{"view_html":"https://pith.science/pith/2UJJ3D2H62VDGYKD2EIW4OCVXO","download_json":"https://pith.science/pith/2UJJ3D2H62VDGYKD2EIW4OCVXO.json","view_paper":"https://pith.science/paper/2UJJ3D2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00630&json=true","fetch_graph":"https://pith.science/api/pith-number/2UJJ3D2H62VDGYKD2EIW4OCVXO/graph.json","fetch_events":"https://pith.science/api/pith-number/2UJJ3D2H62VDGYKD2EIW4OCVXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UJJ3D2H62VDGYKD2EIW4OCVXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UJJ3D2H62VDGYKD2EIW4OCVXO/action/storage_attestation","attest_author":"https://pith.science/pith/2UJJ3D2H62VDGYKD2EIW4OCVXO/action/author_attestation","sign_citation":"https://pith.science/pith/2UJJ3D2H62VDGYKD2EIW4OCVXO/action/citation_signature","submit_replication":"https://pith.science/pith/2UJJ3D2H62VDGYKD2EIW4OCVXO/action/replication_record"}},"created_at":"2026-05-18T01:11:51.817313+00:00","updated_at":"2026-05-18T01:11:51.817313+00:00"}