Polynomial-time solutions to image segmentation

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 104-113

  Asano, Tetsuo ^a   Chen, Danny Z ^b   Katoh, Naoki ^c   Tokuyama, Takeshi ^d  

^a OSAKA ELECTRO COMMUNICATION UNIVERSITY   (Japan)

^b University of Notre Dame   (United States)

^c UNIVERSITY OF HYOGO   (Japan)

^d IBM RESEARCH TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CURVE FITTING; DISCRIMINANT ANALYSIS; DYNAMIC PROGRAMMING; IMAGE PROCESSING; IMAGE SEGMENTATION; PATTERN RECOGNITION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SEPARATION;

APPROXIMATE SOLUTION; APPROXIMATION SCHEME; CONNECTED REGION; INTENSITY IMAGES; OPTIMAL SEGMENTATION; OPTIMIZATION PROBLEMS; PARAMETRIC OPTIMIZATION; POLYNOMIAL-TIME ALGORITHMS;

OPTIMIZATION;

EID: 0006539122     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. A. Aggarwal, M.M. Klawe, S. Moran, P.W. Shor, and R. Wilber: "Geometric applications of a matrix-searching algorithm," Algorithmica, Vol. 2, pp.195-208, 1987.
2. A. Aggarwal, B. Schieber, and T. Tokuyaina: "Finding a minimum-weight k-link path in graphs with the concave Monge property and applications," Discrete & Comput. Geom., Vol. 12, pp.263-280, 1994.
3. T. Asano and N. Yokoya: "Image segmentation schema for low-level computer vision," Pattern Recognition, Vol.14, nos.1-6, pp.267-173, 1981.
4. P.J. Besl and R.C. Jain: "Segmentation through variable-order surface fitting," IEEE Trans. Pattern and Machine Intell., Vol. 10, pp.167-192, 1988.
5. F. Cheevasuvit, H. Maitre, and D. Vidal-Madjar: "A robust method for picture segmentation based on split-and-merge procedure," Comput. Vis., Graph. Image Process., Vol. 34, pp.268-281, 1986.
6. L.S. Davis: "A survey of edge detection techniques," Comput. Graph. Image Process., Vol. 4, pp.248-270, 1975.
7. D. Dobkin, H. Edelsbrunuer, and C. K. Yap: "Probing convex polytopes," Proc. 18th ACM STOC, pp.387-392, 1986.
8. M. J. Eisner and D. G. Severence: "Mathematical techniques for efficient record segmentation in large shared databases," J. ACM, 23, pp.619-635, 1976.
9. T. Fukuda, S. Morishita, Y. Morimoto, and T. Tokuyama: "Data Mining Using Two-Dimensional Optimized Association Rules - Scheme, Algorithms, and Visualization" Working paper, IBM Tokyo Research Laboratory, 1995.
10. M. R. Garey and D. S. Johnson: "The rectilinear Steiner tree problem is NP complete," SIAM J. Appl. Math., 32, pp.826-834, 1977.
11. D.J. Hand, Discrimination and Classification, John Wiley & Sons, 1981.
12. S. L. Horowitz and T. Pavlidis: "Picture segmentation by a directed split-and-merge procedure," Proc. 2nd Int. Joint Conf. Pattern Recognition, pp.424-433, 1974.
13. M. Inaba, N. Katoh, and H. Imai: "Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering," Proc. 12th Symp. on Computational Geometry, pp.332-339, 1994.
14. M. Kass, A. Witkin, and D. Terzopoulos: "Snakes: Active contour models," Int. J. of Comput. Vision, Vol. 1, pp.321-331, 1988.
15. N. Katoh and T. Ibaraki: "A parametric characterization and an ϵ-approximation scheme for the minimization of a quasiconcave program," Discrete Applied Mathematics, Vol.17 (1987), pp.39-66.
16. L. Maisel, Probability, Statistics, and Random Processes, Simon & Schuster, NY, (1971).
17. F. Meyer and S. Buecher: "Morphological segmentation," J. Vis. Commun. Image Represent., Vol. 1, pp.21-46, 1990.
18. N. Ohtsu: "Discriminant and least squares threshold selection," Proc. 4th IJCPR, pp.592-596, 1978.
19. T. Pavlidis and Y.-T. Liow: "Integrating region growing and edge detection," IEEE Trans. Pattern and Machine Intell., Vol. 12, pp.225-233, 1990.
20. P.K. Sahoo, S. Soltani, and A.K.C. Wong: "A survey of thresholding techniques," Comput. Vis., Graph. Image Process., Vol. 41, pp.233-260, 1988.
21. G.J. Woeginger: "Computing maximum valued region," Acta Cybernetica, Vol. 10, pp.303-315, 1992.
22. S.W. Zucker: "Region growing: Childhood and adolescence," Comput. Graph. Image Process., Vol. 5, pp.382-399, 1976.