{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7BL42FH6JQAHAEZ6LHRTZRCNCG","short_pith_number":"pith:7BL42FH6","schema_version":"1.0","canonical_sha256":"f857cd14fe4c0070133e59e33cc44d118255c50237fe0481fe818adccdaebce8","source":{"kind":"arxiv","id":"1410.6126","version":1},"attestation_state":"computed","paper":{"title":"Motion Estimation via Robust Decomposition with Constrained Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"German Ros, Jose Alvarez, Julio Guerrero","submitted_at":"2014-10-22T18:15:27Z","abstract_excerpt":"In this work, we address the problem of outlier detection for robust motion estimation by using modern sparse-low-rank decompositions, i.e., Robust PCA-like methods, to impose global rank constraints. Robust decompositions have shown to be good at splitting a corrupted matrix into an uncorrupted low-rank matrix and a sparse matrix, containing outliers. However, this process only works when matrices have relatively low rank with respect to their ambient space, a property not met in motion estimation problems. As a solution, we propose to exploit the partial information present in the decomposit"},"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":"1410.6126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-10-22T18:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"d0f639390529e2f804bcf8278477a1cba5ea91e92e3bca2bfd144e167f2070f2","abstract_canon_sha256":"a7611d9ce25966962234a74e6857e301bfaa0a5f422a234add99ac60ff75a309"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:32.553938Z","signature_b64":"aCPnklqpq5EB/cQ2+QfaAzrOv8oVVuJVQPWQnZK3WoP57+aNBSRJRU8kjXwcnQ2sJEq38uOOdON0U9/Lql8fAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f857cd14fe4c0070133e59e33cc44d118255c50237fe0481fe818adccdaebce8","last_reissued_at":"2026-05-18T02:39:32.553361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:32.553361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Motion Estimation via Robust Decomposition with Constrained Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"German Ros, Jose Alvarez, Julio Guerrero","submitted_at":"2014-10-22T18:15:27Z","abstract_excerpt":"In this work, we address the problem of outlier detection for robust motion estimation by using modern sparse-low-rank decompositions, i.e., Robust PCA-like methods, to impose global rank constraints. Robust decompositions have shown to be good at splitting a corrupted matrix into an uncorrupted low-rank matrix and a sparse matrix, containing outliers. However, this process only works when matrices have relatively low rank with respect to their ambient space, a property not met in motion estimation problems. As a solution, we propose to exploit the partial information present in the decomposit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6126","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":"1410.6126","created_at":"2026-05-18T02:39:32.553432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6126v1","created_at":"2026-05-18T02:39:32.553432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6126","created_at":"2026-05-18T02:39:32.553432+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BL42FH6JQAH","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BL42FH6JQAHAEZ6","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BL42FH6","created_at":"2026-05-18T12:28:16.859392+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/7BL42FH6JQAHAEZ6LHRTZRCNCG","json":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG.json","graph_json":"https://pith.science/api/pith-number/7BL42FH6JQAHAEZ6LHRTZRCNCG/graph.json","events_json":"https://pith.science/api/pith-number/7BL42FH6JQAHAEZ6LHRTZRCNCG/events.json","paper":"https://pith.science/paper/7BL42FH6"},"agent_actions":{"view_html":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG","download_json":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG.json","view_paper":"https://pith.science/paper/7BL42FH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6126&json=true","fetch_graph":"https://pith.science/api/pith-number/7BL42FH6JQAHAEZ6LHRTZRCNCG/graph.json","fetch_events":"https://pith.science/api/pith-number/7BL42FH6JQAHAEZ6LHRTZRCNCG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG/action/storage_attestation","attest_author":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG/action/author_attestation","sign_citation":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG/action/citation_signature","submit_replication":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG/action/replication_record"}},"created_at":"2026-05-18T02:39:32.553432+00:00","updated_at":"2026-05-18T02:39:32.553432+00:00"}