{"id":"W2952084543","doi":"10.48550/arxiv.1407.6251","title":"FollowMe: Efficient Online Min-Cost Flow Tracking with Bounded Memory and Computation","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computation; Computer science; Bounded function; Online algorithm; Tracking (education); Inference; Minimum-cost flow problem; Algorithm; Sequence (biology); Mathematical optimization; Flow network; Mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001393139,0.001802172,0.001653257,0.00113225,0.0007426221,0.001621775,0.003331652,0.002214896,0.008057649],"category_scores_gemma":[0.006244022,0.0008353697,0.0007964528,0.001767061,0.0008335269,0.003399828,0.002054841,0.002117266,0.002057018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001265422,"about_ca_system_score_gemma":0.002883527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01157785,"about_ca_topic_score_gemma":0.0112135,"domain_scores_codex":[0.9991048,0.0001538522,0.00004365547,0.0002949338,0.0002772629,0.0001254376],"domain_scores_gemma":[0.9985297,0.0007978863,0.0001115264,0.0002875818,0.000204098,0.00006920557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005237436,0.0002846432,0.001066921,0.0002204544,0.00007308896,0.0001112847,0.0001084978,0.5516708,0.003913077,0.0226654,0.02446805,0.3948942],"study_design_scores_gemma":[0.0000278996,0.00002270888,0.000088457,0.000006417099,0.000004464844,0.00002303401,0.000007420603,0.9897292,0.0007256774,0.008115955,0.00124303,0.00000572362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006916028,0.0003439792,0.9861094,0.0002779822,0.00009933658,0.00008241074,0.00034374,0.003689922,0.002137282],"genre_scores_gemma":[0.1650654,0.0003256533,0.8236161,0.0002840624,0.0001978641,0.0003165824,0.002306099,0.0005756155,0.00731256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01157785,"threshold_uncertainty_score":0.02695554,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07850547832486682,"score_gpt":0.229777016911832,"score_spread":0.1512715385869652,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}