The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On the optimal detection of curves in noisy pictures
Open accessAbstract
A technique for recognizing systems of lines is presented.In this technique the heuristic of the problem is not embedded in the recognition algorithm but is expressed in a figure of merit.A multistage decision process is then able to recognize in the input picture the optimal system of lines according to the given figure of merit.Due to the global approach, greater flexibility and adequacy in the particular problem is achieved.The relation between the structure of the figure of merit and the complexity of the optimization process is then discussed.The method described is suitable for parallel processing because the operations relative to each state can be computed in parallel, and the number of stages is equal to the length N of the curves (or to log2 (N) if the approximate method is used).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Freimer, M., Bellman, R. E., & Dreyfus, S. E. (1964) · Journal of the American Statistical Association · doi:10.2307/2282884 · Cited by 2,153
Sequential optimization in pattern recognition and pattern description.
Kovalevsky, V. (1968) · IFIP Congress · Cited by 32
Cited by
The Representation and Matching of Pictorial Structures
Fischler, M. A., & Elschlager, R. A. (1973) · IEEE Transactions on Computers · doi:10.1109/t-c.1973.223602 · Cited by 1,322
A survey on image segmentation
Fu, K. S., & Mui, J. K. (1981) · Pattern Recognition · doi:10.1016/0031-3203(81)90028-5 · Cited by 1,203
Contour and Texture Analysis for Image Segmentation
Malik, J., Belongie, S., Leung, T., & Shi, J. (2001) · International Journal of Computer Vision · doi:10.1023/a:1011174803800 · Cited by 1,089
Intelligent scissors for image composition
Mortensen, E. N., & Barrett, W. A. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218442 · Cited by 778
Boundary finding with parametrically deformable models
Staib, L. H., & Duncan, J. S. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.166621 · Cited by 756
Metadata
- Authors
- Montanari, U.
- Venue
- Communications of the ACM
- Published
- 1971-05
- Volume
- 14
- Issue
- 5
- Pages
- 335-345
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2133138342
- Cited by
- 295
- References
- 2
- FWCI
- 5.01
- Type
- journal article
- Language
- en
- Open access
- bronze
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.