{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EGGOH4LQAMEC56VFWFGH7CFS3H","short_pith_number":"pith:EGGOH4LQ","schema_version":"1.0","canonical_sha256":"218ce3f17003082efaa5b14c7f88b2d9fe10d84777ec238f82d675d441e0b621","source":{"kind":"arxiv","id":"1603.03590","version":1},"attestation_state":"computed","paper":{"title":"Fast Optical Flow using Dense Inverse Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Dengxin Dai, Luc Van Gool, Radu Timofte, Till Kroeger","submitted_at":"2016-03-11T10:55:07Z","abstract_excerpt":"Most recent works in optical flow extraction focus on the accuracy and neglect the time complexity. However, in real-life visual applications, such as tracking, activity detection and recognition, the time complexity is critical.\n  We propose a solution with very low time complexity and competitive accuracy for the computation of dense optical flow. It consists of three parts: 1) inverse search for patch correspondences; 2) dense displacement field creation through patch aggregation along multiple scales; 3) variational refinement. At the core of our Dense Inverse Search-based method (DIS) is "},"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":"1603.03590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-11T10:55:07Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"d9a3afc9e08e5a2d1322091308a8ba092de252beb7aff6500c21f93033231ae2","abstract_canon_sha256":"1102827fdf3125b28160101d3c4ebb6fc9cae73eca726e72659db32cd5d114a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:15.234708Z","signature_b64":"jI85KCqbH5g0AkU4zB5S8FPSpVrMz/5DP4NuoDueI5C7W3o2ndYg0YN0si+q/T2St+nCrY4ncf+XpQWvzPJmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"218ce3f17003082efaa5b14c7f88b2d9fe10d84777ec238f82d675d441e0b621","last_reissued_at":"2026-05-18T01:19:15.234250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:15.234250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Optical Flow using Dense Inverse Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Dengxin Dai, Luc Van Gool, Radu Timofte, Till Kroeger","submitted_at":"2016-03-11T10:55:07Z","abstract_excerpt":"Most recent works in optical flow extraction focus on the accuracy and neglect the time complexity. However, in real-life visual applications, such as tracking, activity detection and recognition, the time complexity is critical.\n  We propose a solution with very low time complexity and competitive accuracy for the computation of dense optical flow. It consists of three parts: 1) inverse search for patch correspondences; 2) dense displacement field creation through patch aggregation along multiple scales; 3) variational refinement. At the core of our Dense Inverse Search-based method (DIS) is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03590","kind":"arxiv","version":1},"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":"1603.03590","created_at":"2026-05-18T01:19:15.234331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.03590v1","created_at":"2026-05-18T01:19:15.234331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03590","created_at":"2026-05-18T01:19:15.234331+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGGOH4LQAMEC","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGGOH4LQAMEC56VF","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGGOH4LQ","created_at":"2026-05-18T12:30:12.583610+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/EGGOH4LQAMEC56VFWFGH7CFS3H","json":"https://pith.science/pith/EGGOH4LQAMEC56VFWFGH7CFS3H.json","graph_json":"https://pith.science/api/pith-number/EGGOH4LQAMEC56VFWFGH7CFS3H/graph.json","events_json":"https://pith.science/api/pith-number/EGGOH4LQAMEC56VFWFGH7CFS3H/events.json","paper":"https://pith.science/paper/EGGOH4LQ"},"agent_actions":{"view_html":"https://pith.science/pith/EGGOH4LQAMEC56VFWFGH7CFS3H","download_json":"https://pith.science/pith/EGGOH4LQAMEC56VFWFGH7CFS3H.json","view_paper":"https://pith.science/paper/EGGOH4LQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.03590&json=true","fetch_graph":"https://pith.science/api/pith-number/EGGOH4LQAMEC56VFWFGH7CFS3H/graph.json","fetch_events":"https://pith.science/api/pith-number/EGGOH4LQAMEC56VFWFGH7CFS3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGGOH4LQAMEC56VFWFGH7CFS3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGGOH4LQAMEC56VFWFGH7CFS3H/action/storage_attestation","attest_author":"https://pith.science/pith/EGGOH4LQAMEC56VFWFGH7CFS3H/action/author_attestation","sign_citation":"https://pith.science/pith/EGGOH4LQAMEC56VFWFGH7CFS3H/action/citation_signature","submit_replication":"https://pith.science/pith/EGGOH4LQAMEC56VFWFGH7CFS3H/action/replication_record"}},"created_at":"2026-05-18T01:19:15.234331+00:00","updated_at":"2026-05-18T01:19:15.234331+00:00"}