{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QKYCRSJKD6VI4B3T3VRPJZTRBZ","short_pith_number":"pith:QKYCRSJK","schema_version":"1.0","canonical_sha256":"82b028c92a1faa8e0773dd62f4e6710e502a887af8198e50b8ccaa9b388663d0","source":{"kind":"arxiv","id":"1901.09971","version":2},"attestation_state":"computed","paper":{"title":"DeGraF-Flow: Extending DeGraF Features for accurate and efficient sparse-to-dense optical flow estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Felix Stephenson, Ioannis Katramados, Toby Breckon","submitted_at":"2019-01-28T19:55:40Z","abstract_excerpt":"Modern optical flow methods make use of salient scene feature points detected and matched within the scene as a basis for sparse-to-dense optical flow estimation. Current feature detectors however either give sparse, non uniform point clouds (resulting in flow inaccuracies) or lack the efficiency for frame-rate real-time applications. In this work we use the novel Dense Gradient Based Features (DeGraF) as the input to a sparse-to-dense optical flow scheme. This consists of three stages: 1) efficient detection of uniformly distributed Dense Gradient Based Features (DeGraF); 2) feature tracking "},"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":"1901.09971","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-28T19:55:40Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5b98942e6f72d388ca036d1ba8f4562ea1b60788c6834e7f601604c5c0094a5f","abstract_canon_sha256":"72c8edb08afd76762560634bd844fc76d30351c52b39612b533bcdcf57985363"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:52.211951Z","signature_b64":"a3r1Qu1goQjF9cmSb6L2oBQv5P3/QL1hGzRAbWpm3lrhe7VNA7xiDXc+IrRa5OMGhFnS1IdvlaRcx2oscQ7sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82b028c92a1faa8e0773dd62f4e6710e502a887af8198e50b8ccaa9b388663d0","last_reissued_at":"2026-05-17T23:45:52.211492Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:52.211492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeGraF-Flow: Extending DeGraF Features for accurate and efficient sparse-to-dense optical flow estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Felix Stephenson, Ioannis Katramados, Toby Breckon","submitted_at":"2019-01-28T19:55:40Z","abstract_excerpt":"Modern optical flow methods make use of salient scene feature points detected and matched within the scene as a basis for sparse-to-dense optical flow estimation. Current feature detectors however either give sparse, non uniform point clouds (resulting in flow inaccuracies) or lack the efficiency for frame-rate real-time applications. In this work we use the novel Dense Gradient Based Features (DeGraF) as the input to a sparse-to-dense optical flow scheme. This consists of three stages: 1) efficient detection of uniformly distributed Dense Gradient Based Features (DeGraF); 2) feature tracking "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09971","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":""},"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":"1901.09971","created_at":"2026-05-17T23:45:52.211576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09971v2","created_at":"2026-05-17T23:45:52.211576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09971","created_at":"2026-05-17T23:45:52.211576+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKYCRSJKD6VI","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKYCRSJKD6VI4B3T","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKYCRSJK","created_at":"2026-05-18T12:33:27.125529+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/QKYCRSJKD6VI4B3T3VRPJZTRBZ","json":"https://pith.science/pith/QKYCRSJKD6VI4B3T3VRPJZTRBZ.json","graph_json":"https://pith.science/api/pith-number/QKYCRSJKD6VI4B3T3VRPJZTRBZ/graph.json","events_json":"https://pith.science/api/pith-number/QKYCRSJKD6VI4B3T3VRPJZTRBZ/events.json","paper":"https://pith.science/paper/QKYCRSJK"},"agent_actions":{"view_html":"https://pith.science/pith/QKYCRSJKD6VI4B3T3VRPJZTRBZ","download_json":"https://pith.science/pith/QKYCRSJKD6VI4B3T3VRPJZTRBZ.json","view_paper":"https://pith.science/paper/QKYCRSJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09971&json=true","fetch_graph":"https://pith.science/api/pith-number/QKYCRSJKD6VI4B3T3VRPJZTRBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/QKYCRSJKD6VI4B3T3VRPJZTRBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKYCRSJKD6VI4B3T3VRPJZTRBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKYCRSJKD6VI4B3T3VRPJZTRBZ/action/storage_attestation","attest_author":"https://pith.science/pith/QKYCRSJKD6VI4B3T3VRPJZTRBZ/action/author_attestation","sign_citation":"https://pith.science/pith/QKYCRSJKD6VI4B3T3VRPJZTRBZ/action/citation_signature","submit_replication":"https://pith.science/pith/QKYCRSJKD6VI4B3T3VRPJZTRBZ/action/replication_record"}},"created_at":"2026-05-17T23:45:52.211576+00:00","updated_at":"2026-05-17T23:45:52.211576+00:00"}