- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes DAWSON, a framework for multi-view unique counting that uses a limited number of shared-count queries to correct unreliable overlap estimates. It combines per-view counts with pairwise overlap proxies to estimate the total number of distinct people. The EER strategy uses a surrogate for the possible query responses and selects the camera pair expected to reduce the calibration residual the most.The paper evaluates this approach under both clean and degraded proxy conditions.
Critical strengths
The unique-count estimator in Eq. (2) is interesting. It provides a simple and intuitive way to estimate the number of unique individuals across multiple views.
Critical weaknesses
-
The experiments allow human queries in every evaluation window. Would this become too costly in continuous use? In the Mild setting in Table 2, the best querying policy improves about 4.4 people. It is unclear whether this gain is worth the human effort, especially since answering a shared-count query may require checking identities across views.
-
Similarly, The paper should also report end-to-end runtime, hardware, and the extra cost of EER query selection. It would be useful to see how these costs grow with the number of cameras and people.
Questions for authors
Refer to weaknesses.
Response to Reviewer b9jL
1.Comment: The experiments allow human queries in every evaluation window. Would this become too costly in continuous use? In the Mild setting in Table 2, the best querying policy improves about 4.4 people. It is unclear whether this gain is worth the human effort, especially since answering a shared-count query may require checking identities across views. 1.Reply: The submitted manuscript already reported the Mild ablation with two annotation-simulated answers per window. We add the matched zero-query Max reference and an offline human-answer pilot to make the effort--accuracy trade-off explicit. EER reduces MAE from 17.18 for No-query to 12.76, a 4.41-person difference; against the matched two-query Largest policy at 13.78, the improvement is 1.01 MAE. Zero-query Max reaches 0.67.
We evaluated the human effort in a separate strict-box OT pilot. One author answered all 42 pair-query tasks offline across two development windows before policy replay. Of 41 certain answers, 5 were exact and the answer MAE was 2.488. In windows 168 and 180, the selected answers required 55.574 and 39.149 seconds of recorded active work, respectively. EER and Largest selected the same pair set in each window, with reverse order in window 180; each had absolute count errors of 1.639 and 3.828 in the respective windows, while Max had error 1 in both.
These observations quantify recorded offline effort and answer accuracy,therefore they support a direct workload comparison without establishing that continuous querying is economically worthwhile in deployment.
2.Comment: Similarly, The paper should also report end-to-end runtime, hardware, and the extra cost of EER query selection. It would be useful to see how these costs grow with the number of cameras and people. 2.Reply: The submitted manuscript did not provide this runtime breakdown; we add a strict-box F0/OT measurement on an RTX 4090 D over 20 held-out windows (200--390) and three system repeats. Each four-policy group shared one model load; each policy used independent warm-up windows. Direct timing runs from the first image read to the strategy output, includes the simulated evaluator, and excludes model loading, warm-up, and final persistence. EER wall-clock medians for 2/3/5/7 views are 0.325/0.503/0.780/1.139 s. At matched inputs, EER minus Largest policy-time medians are 0.163/0.760/2.572/7.126 ms across these view counts.
The selector increment grows with candidate pairs (1, 3, 10, and 21 pairs for 2, 3, 5, and 7 views), while the full wall-clock increase is driven mainly by image and OT processing. The machine measurement uses strict-box F0/OT annotation-simulated answers and is separate from the Mild greedy protocol. The retained synthetic matrix spans 2/3/5/7/10/14 cameras, 5/20/50/100 people per view, two load modes, ten seeds, and three system repeats; it uses self-consistent sets and 128-dimensional artificial unit vectors, so it reports operator-scale behavior.