The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
An active testing model for tracking roads in satellite images
Abstract
We present a new approach for tracking roads from satellite images, and thereby illustrate a general computational strategy ("active testing") for tracking 1D structures and other recognition tasks in computer vision. Our approach is related to recent work in active vision on "where to look next" and motivated by the "divide-and-conquer" strategy of parlour games. We choose "tests" (matched filters for short road segments) one at a time in order to remove as much uncertainty as possible about the "true hypothesis" (road position) given the results of the previous tests. The tests are chosen online based on a statistical model for the joint distribution of tests and hypotheses. The problem of minimizing uncertainty (measured by entropy) is formulated in simple and explicit analytical terms. At each iteration new image data are examined and a new entropy minimization problem is solved (exactly), resulting in a new image location to inspect, and so forth. We report experiments using panchromatic SPOT satellite imagery with a ground resolution of ten meters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Classification and regression trees
Praagman, J. (1985) · European Journal of Operational Research · doi:10.1016/0377-2217(85)90321-2 · Cited by 10,053
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
Ballard, D. H., & Brown, C. M. (1982) · Cited by 5,303
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
Haralock, R. M., & Shapiro, L. G. (1991) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 3,933
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
Multi-Armed Bandit Allocation Indices.
Bather, J. A., & Gittins, J. C. (1990) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2982809 · Cited by 998
Constructing optimal binary decision trees is NP-complete
Hyafil, L., & Rivest, R. L. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90095-8 · Cited by 959
Fischler, M. A., Tenenbaum, J. M., & Wolf, H. C. (1981) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(81)90056-3 · Cited by 354
Sequential Analysis and Optimal Design
Chernoff, H. (1972) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970593 · Cited by 321
Multi-armed Bandit Allocation Indices
Jones, P. W. (1989) · Journal of the Operational Research Society · doi:10.1057/jors.1989.200 · Cited by 280
Optimal partitioning for classification and regression trees
Chou, P. A. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.88569 · Cited by 248
A Survey of Some Results in Stochastic Adaptive Control
Kumar, P. R. (1985) · SIAM Journal on Control and Optimization · doi:10.1137/0323023 · Cited by 217
Promising directions in active vision
Swain, M. J., & Stricker, M. A. (1993) · International Journal of Computer Vision · doi:10.1007/bf01469224 · Cited by 199
Control of selective perception using bayes nets and decision theory
Rimey, R. D., & Brown, C. M. (1994) · International Journal of Computer Vision · doi:10.1007/bf01421202 · Cited by 178
Optimal Binary Identification Procedures
Garey, M. R. (1972) · SIAM Journal on Applied Mathematics · doi:10.1137/0123019 · Cited by 154
Application of information theory to the construction of efficient decision trees
Hartmann, C. R. P., Varshney, P. K., Mehrotra, K., & Gerberich, C. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056522 · Cited by 105
Pattern recognition as a quest for minimum entropy
Watanabé, S. (1981) · Pattern Recognition · doi:10.1016/0031-3203(81)90094-7 · Cited by 103
Decision trees for geometric models
Arkin, E. M., Meijer, H., Mitchell, J. S. B., Rappaport, D. D., & Skiena, S. (1993) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/160985.161167 · Cited by 33
Performance bounds for binary testing with arbitrary weights
Loveland, D. W. (1985) · Acta Informatica · doi:10.1007/bf00290148 · Cited by 31
Criteria for selecting a variable in the construction of efficient decision trees
Miyakawa, M. (1989) · IEEE Transactions on Computers · doi:10.1109/12.8736 · Cited by 31
Shape Recognition and Twenty Questions
Geman, D., Jedynak, B., & Institut National de Recherche en Informatique et en Automatique (INRIA), 7. R. (. U. D. R. D. R. (1993) · Cited by 12
Self-citation
Cited by
An unbiased detector of curvilinear structures
Steger, C. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.659930 · Cited by 1,392
Optimal eye movement strategies in visual search
Najemnik, J., & Geisler, W. S. (2005) · Nature · doi:10.1038/nature03390 · Cited by 848
Information-driven dynamic sensor collaboration
Zhao, F., Shin, J., & Reich, J. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.985685 · Cited by 803
Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks
Chu, M., Haussecker, H., & Zhao, F. (2002) · The International Journal of High Performance Computing Applications · doi:10.1177/10943420020160030901 · Cited by 634
Global Minimum for Active Contour Models: A Minimal Path Approach
Cohen, L. D., & Kimmel, R. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007922224810 · Cited by 625
Metadata
- Authors
- Geman, D., & Jedynak, B.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1996
- Volume
- 18
- Issue
- 1
- Pages
- 1-14
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2128439793
- Cited by
- 498
- References
- 25
- FWCI
- 44.51
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.