{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:E5X5ZO432XS26PE2DADPTOT4MI","short_pith_number":"pith:E5X5ZO43","schema_version":"1.0","canonical_sha256":"276fdcbb9bd5e5af3c9a1806f9ba7c621cff8596d79af73ea4fd471cb76d2bed","source":{"kind":"arxiv","id":"2007.03200","version":3},"attestation_state":"computed","paper":{"title":"ReMOTS: Self-Supervised Refining Multi-Object Tracking and Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chenyu Dang, Fan Yang, Sakriani Sakti, Satoshi Nakamura, Xin Chang, Yang Wu, Ziqiang Zheng","submitted_at":"2020-07-07T04:49:10Z","abstract_excerpt":"We aim to improve the performance of Multiple Object Tracking and Segmentation (MOTS) by refinement. However, it remains challenging for refining MOTS results, which could be attributed to that appearance features are not adapted to target videos and it is also difficult to find proper thresholds to discriminate them. To tackle this issue, we propose a self-supervised refining MOTS (i.e., ReMOTS) framework. ReMOTS mainly takes four steps to refine MOTS results from the data association perspective. (1) Training the appearance encoder using predicted masks. (2) Associating observations across a"},"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":"2007.03200","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-07-07T04:49:10Z","cross_cats_sorted":[],"title_canon_sha256":"21af0176c116decdca908d8e522c5cfc120fb8bbb5bfd8efadca5c5343599bb6","abstract_canon_sha256":"4b58a4ba39298e226423bd7a0097c60e62c45f4368a0997fd7391de2adc4daf6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:06:31.655810Z","signature_b64":"pnhhZumSF5638jpvV1cntNeOLzQysTgUk3C97Dz8PTALQf2RjZ8BJYOFV6wlbbNAOvDXP8x4uM8D74q2SynoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"276fdcbb9bd5e5af3c9a1806f9ba7c621cff8596d79af73ea4fd471cb76d2bed","last_reissued_at":"2026-07-05T02:06:31.655397Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:06:31.655397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReMOTS: Self-Supervised Refining Multi-Object Tracking and Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chenyu Dang, Fan Yang, Sakriani Sakti, Satoshi Nakamura, Xin Chang, Yang Wu, Ziqiang Zheng","submitted_at":"2020-07-07T04:49:10Z","abstract_excerpt":"We aim to improve the performance of Multiple Object Tracking and Segmentation (MOTS) by refinement. However, it remains challenging for refining MOTS results, which could be attributed to that appearance features are not adapted to target videos and it is also difficult to find proper thresholds to discriminate them. To tackle this issue, we propose a self-supervised refining MOTS (i.e., ReMOTS) framework. ReMOTS mainly takes four steps to refine MOTS results from the data association perspective. (1) Training the appearance encoder using predicted masks. (2) Associating observations across a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03200","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.03200/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":"2007.03200","created_at":"2026-07-05T02:06:31.655463+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03200v3","created_at":"2026-07-05T02:06:31.655463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03200","created_at":"2026-07-05T02:06:31.655463+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5X5ZO432XS2","created_at":"2026-07-05T02:06:31.655463+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5X5ZO432XS26PE2","created_at":"2026-07-05T02:06:31.655463+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5X5ZO43","created_at":"2026-07-05T02:06:31.655463+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03875","citing_title":"Seg2Track++: Probabilistic Track Validation and Data Association for Multi-Object Tracking and Segmentation","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E5X5ZO432XS26PE2DADPTOT4MI","json":"https://pith.science/pith/E5X5ZO432XS26PE2DADPTOT4MI.json","graph_json":"https://pith.science/api/pith-number/E5X5ZO432XS26PE2DADPTOT4MI/graph.json","events_json":"https://pith.science/api/pith-number/E5X5ZO432XS26PE2DADPTOT4MI/events.json","paper":"https://pith.science/paper/E5X5ZO43"},"agent_actions":{"view_html":"https://pith.science/pith/E5X5ZO432XS26PE2DADPTOT4MI","download_json":"https://pith.science/pith/E5X5ZO432XS26PE2DADPTOT4MI.json","view_paper":"https://pith.science/paper/E5X5ZO43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03200&json=true","fetch_graph":"https://pith.science/api/pith-number/E5X5ZO432XS26PE2DADPTOT4MI/graph.json","fetch_events":"https://pith.science/api/pith-number/E5X5ZO432XS26PE2DADPTOT4MI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5X5ZO432XS26PE2DADPTOT4MI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5X5ZO432XS26PE2DADPTOT4MI/action/storage_attestation","attest_author":"https://pith.science/pith/E5X5ZO432XS26PE2DADPTOT4MI/action/author_attestation","sign_citation":"https://pith.science/pith/E5X5ZO432XS26PE2DADPTOT4MI/action/citation_signature","submit_replication":"https://pith.science/pith/E5X5ZO432XS26PE2DADPTOT4MI/action/replication_record"}},"created_at":"2026-07-05T02:06:31.655463+00:00","updated_at":"2026-07-05T02:06:31.655463+00:00"}