{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:N4NLPL273EHV6QSXLU4NSKPNV7","short_pith_number":"pith:N4NLPL27","schema_version":"1.0","canonical_sha256":"6f1ab7af5fd90f5f42575d38d929edaff6763bd62ac21c80121943d4b3b22ed5","source":{"kind":"arxiv","id":"1605.06215","version":2},"attestation_state":"computed","paper":{"title":"Efficient Feature-based Image Registration by Mapping Sparsified Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV"],"primary_cat":"cs.GR","authors_text":"Chun Pang Yung, Gary P. T. Choi, Ke Chen, Lok Ming Lui","submitted_at":"2016-05-20T05:42:12Z","abstract_excerpt":"With the advancement in the digital camera technology, the use of high resolution images and videos has been widespread in the modern society. In particular, image and video frame registration is frequently applied in computer graphics and film production. However, conventional registration approaches usually require long computational time for high resolution images and video frames. This hinders the application of the registration approaches in the modern industries. In this work, we first propose a new image representation method to accelerate the registration process by triangulating the i"},"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":"1605.06215","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2016-05-20T05:42:12Z","cross_cats_sorted":["cs.CG","cs.CV"],"title_canon_sha256":"60e6be3dd1bbc4616257176e2dc7e6378c58816f54b0a543b2b900238044119c","abstract_canon_sha256":"2697ec4228aee05383d51b3fe6838e8924fedfb19a9906f7db3cfc6a656a1bad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:57:31.984069Z","signature_b64":"V9prHWNeoX4fCyU41uP6qcoTRyyPE3EbH0lGPDx61mRul5RuvSZ2CP2WAyYzjdMbhykL2ewV89lY55CvtjzbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1ab7af5fd90f5f42575d38d929edaff6763bd62ac21c80121943d4b3b22ed5","last_reissued_at":"2026-07-05T00:57:31.983590Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:57:31.983590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Feature-based Image Registration by Mapping Sparsified Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV"],"primary_cat":"cs.GR","authors_text":"Chun Pang Yung, Gary P. T. Choi, Ke Chen, Lok Ming Lui","submitted_at":"2016-05-20T05:42:12Z","abstract_excerpt":"With the advancement in the digital camera technology, the use of high resolution images and videos has been widespread in the modern society. In particular, image and video frame registration is frequently applied in computer graphics and film production. However, conventional registration approaches usually require long computational time for high resolution images and video frames. This hinders the application of the registration approaches in the modern industries. In this work, we first propose a new image representation method to accelerate the registration process by triangulating the i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06215","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1605.06215/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1605.06215","created_at":"2026-07-05T00:57:31.983649+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06215v2","created_at":"2026-07-05T00:57:31.983649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06215","created_at":"2026-07-05T00:57:31.983649+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4NLPL273EHV","created_at":"2026-07-05T00:57:31.983649+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4NLPL273EHV6QSX","created_at":"2026-07-05T00:57:31.983649+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4NLPL27","created_at":"2026-07-05T00:57:31.983649+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.14941","citing_title":"Text2Arch: A Dataset for Generating Scientific Architecture Diagrams from Natural Language Descriptions","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N4NLPL273EHV6QSXLU4NSKPNV7","json":"https://pith.science/pith/N4NLPL273EHV6QSXLU4NSKPNV7.json","graph_json":"https://pith.science/api/pith-number/N4NLPL273EHV6QSXLU4NSKPNV7/graph.json","events_json":"https://pith.science/api/pith-number/N4NLPL273EHV6QSXLU4NSKPNV7/events.json","paper":"https://pith.science/paper/N4NLPL27"},"agent_actions":{"view_html":"https://pith.science/pith/N4NLPL273EHV6QSXLU4NSKPNV7","download_json":"https://pith.science/pith/N4NLPL273EHV6QSXLU4NSKPNV7.json","view_paper":"https://pith.science/paper/N4NLPL27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06215&json=true","fetch_graph":"https://pith.science/api/pith-number/N4NLPL273EHV6QSXLU4NSKPNV7/graph.json","fetch_events":"https://pith.science/api/pith-number/N4NLPL273EHV6QSXLU4NSKPNV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4NLPL273EHV6QSXLU4NSKPNV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4NLPL273EHV6QSXLU4NSKPNV7/action/storage_attestation","attest_author":"https://pith.science/pith/N4NLPL273EHV6QSXLU4NSKPNV7/action/author_attestation","sign_citation":"https://pith.science/pith/N4NLPL273EHV6QSXLU4NSKPNV7/action/citation_signature","submit_replication":"https://pith.science/pith/N4NLPL273EHV6QSXLU4NSKPNV7/action/replication_record"}},"created_at":"2026-07-05T00:57:31.983649+00:00","updated_at":"2026-07-05T00:57:31.983649+00:00"}