Connect the dots: How many random points can a regular curve pass through?

Advances in Applied Probability

Volumn 37, Issue 3, 2005, Pages 571-603

  Arias Castro, Ery ^a   Donoho, David L ^a   Huo, Xiaoming ^b   Tovey, Craig A ^b  

^a STANFORD UNIVERSITY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

entropy; Concentration of measure; Configuration function; Curve detection; Filament detection; Longest increasing subsequence; Pattern recognition; Traveling salesman problem

Indexed keywords

FUNCTION EVALUATION; GRAPH THEORY; IMAGE PROCESSING; PATTERN RECOGNITION; PROBABILITY; RANDOM NUMBER GENERATION; SET THEORY; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

CONCENTRATION OF MEASURE; CONFIGURATION FUNCTION; CURVE DETECTION; FILAMENT DETECTION; LONGEST INCREASING SUBSEQUENCE;

RANDOM PROCESSES;

EID: 27144475603     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1127483737     Document Type: Article

References (35)

1. Abramowicz, H., Horn, D., Naftali, U. and Sahar-Pikielny, C. (1996). An orientation-selective neural network and its application to cosmic muon identification. Nucl. Instr. Meth. Phys. Res. A 378, 305-311.
2. Arias-Castro, E., Donoho, D.L. and Huo, X. (2005). Adaptive multiscale detection of filamentary structures embedded in a background of uniform random points. To appear in Ann. Statist.
3. Arias-Castro, E., Donoho, D. L. and Huo, X. (2005). Near-optimal detection of geometric objects by fast multiscale methods. IEEE Trans. Inf. Theory 51, 2402-2425.
4. Baik, J. (2003). Limiting distribution of last passage percolation models. In Proc. 14th Internat. Congr. Math. Phys. Available at http://www.math.1sa.umich.edu/~baik/.
5. Baik, J., Deift, P. and JoHansson, K. (1999). On the distribution of the length of the longest increasing subsequence of random permutations. J. Amer. Math. Soc. 12, 1119-1178.
6. Beck, J. and Chen W. W. L. (1987). Irregularities of Distribution (Cambridge Tracts Math. 89). Cambridge University Press.
7. Bronšteǐn, E. M. (1976). ε-entropy of convex sets and functions. Sibirsk. Mat. Ž. 17, 508-514, 715.
8. Clements, G. F. (1963). Entropies of sets of functions of bounded variation. Canad. J. Math. 15, 422-432.
9. Devore, R. A. and Lorentz, G. G. (1993). Constructive Approximation. Springer, New York.
10. Diamond, J. and Kiely, K. (2002). Administration, agencies failed to connect the dots. USA Today, 17 May 2002. Available at http://www. usatoday.com/news/washington/2002/05/17/failure-usatcov.htm.
11. Donoho, D. L. (1999). Wedgelets: nearly minimax estimation of edges. Ann. Statist. 27, 859-897.
12. Donoho, D.L. and Huo, X. (2002). Beamlets and multiscale image analysis. In Multiscale and Multiresolution Methods (Lecture Notes Comput. Sci. Eng. 20), eds T. Barth, T. Chan and R. Haimes, Springer, Berlin, pp. 149-196.
13. Edmunds, D. E. and Triebel, H. (1996). Function Spaces, Entropy Numbers, and Differential Operators. Cambridge University Press.
14. Federer, H. (1969). Geometric Measure Theory. Springer, New York.
15. Few, L. (1955). The shortest path and the shortest road through n points. Mathematika 2, 141-144.
16. Field, D. J., Hayes, A. and Hess, R. F. (I993). Contour integration by the human visual system: evidence for a local 'association field'. Vision Res. 33, 173-193.
17. Frieze, A. M. (1991). On the length of the longest monotone subsequence in a random permutation. Ann. Appl. Prob. 1, 301-305.
18. Groeneboom, P. (2001). Ulam's problem and Hammersley's process. Ann. Prob. 29, 683-690.
19. Huo, X., Donoho, D. L., Tovey, C. A. And Arias-Castro, E. (2004). Dynamic programming methods for 'connecting the dots'. Submitted.
20. Johnson, D. S., McGeoch, L. A. And Rothberg, E. E. (1996). Asymptotic experimental analysis for the Held-Karp traveling salesman bound. In Proc. 7th Annual ACM/SIAM Symp. Discrete Algorithms (Atlanta, GA), ACM, New York, pp. 341-350.
21. Kahn, J. M., Katz, R. H. and Pister, K. S. J. (2000). Emerging challenges: mobile networking for smart dust. J. Commun. Networks 2, 188-196.
22. Kolmogorov, A. N. and Tikhomirov, V. M. (1959). e-entropy and ε-capacity of sets in function spaces. Uspekhi Mat. Nauk 14, 3-86 (in Russian). English translation: Trans. Amer. Math. Soc. 17, 277-364.
23. Kovacs, I. and Julesz, B. (1993). A closed curve is much more than an incomplete one - effect of closure in figure-ground segmentation. Proc. Nat. Acad. Sci. USA 90, 7495-7497.
24. Lan, E. (2003). Board not ready to connect the dots. Probe into shuttle tragedy still working out the details. New York Newsday.
25. Logan, B. F. and Shepp, L. A. (1977). A variational problem for random Young tableaux. Adv. Math. 26, 206-222.
26. Matoušek, J. (1999). Geometric Discrepancy. An Illustrated Guide (Algorithms and Combinatorics 18). Springer, Berlin.
27. Meyer, Y. (1992). Wavelets and Operators. Cambridge University Press.
28. Odlyzko, A. M. and Rains, E. M. (2000). On longest increasing subsequences in random permutations. In Analysis, Geometry, Number Theory: The Mathematics of Leon Ehrenpreis (Philadelphia, PA, 1998; Contemp. Math. 251), American Mathematical Society, Providence, RI, pp. 439-451.
29. Schmidt, W. M. (1969). Irregularities of distribution. III. Pacific J. Math. 29, 225-234.
30. Schneider, B. (2002). Connecting the dots. CNN.com, Inside Politics, 17 May 2002. Available at http://www.cnn.com/2002/ALLPOLITICS/05/17/ pol.play.dots/.
31. Shorack, G. R. and Wellner, J. A. (1986). Empirical Processes with Applications to Statistics. John Wiley, New York.
32. Soshnikov, A. (1999). Universality at the edge of the spectrum in Wigner random matrices. Commun. Math. Phys. 207, 697-733.
33. Talagrand M. (1995).Concentration of measure and isoperimetric inequalities in product spaces. Inst. Études Sci. Pub. Math. 81, 73-205.
34. Tracy C. A. and Widom, H. (2001). On the distributions of the lengths of the longest monotone subsequences in random words. Prob. Theory Relat. Fields 119, 350-380.
35. Vershik, A. M. and Kerov, S. V. (1977). Asymptotic behavior of the Plancherel measure of the symmetric group and the limit form of Young tableaux. Dokl. Akad. Nauk. SSSR 233, 1024-1027 (in Russia). English translation: Soviet Math. Dokl. 18, 527-531.