Automatic segmentation of metaphase cells based on global context and variant analysis

Pattern Recognition

Volumn 41, Issue 1, 2008, Pages 38-55

  Ritter, Gunter ^a   Gao, Le ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

Automatic chromosome segmentation; Context; Diagnostic classification; Karyotyping; Shape analysis; Variant analysis

Indexed keywords

DISCRIMINANT ANALYSIS; PROBLEM SOLVING;

AUTOMATIC CHROMOSOME SEGMENTATION; DIAGNOSTIC CLASSIFICATION; KARYOTYPING; SHAPE ANALYSIS; VARIANT ANALYSIS;

CHROMOSOMES;

EID: 34548119868     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2007.05.013     Document Type: Article

References (53)

1. Griffiths A.J.F., Miller J.H., Suzuki D.T., Lewontin R.C., and Gelbart W.M. An Introduction to Genetic Analysis (1993), Freeman and Company, New York
2. Ledley R.S., and Ruddle F.H. Chromosome analysis by computer. Sci. Ame. 214 4 (1966) 40-46
3. R.S. Ledley, F.H. Ruddle, J.B. Wilson, M. Belson, J. Albarran, The case of the touching and overlapping chromosomes, in: G.C. Cheng, R.S. Ledley, D.K. Pollock, A. Rosenfeld (Eds.), Pictorial Pattern Recognition, Thompson Book Company, Washington DC, 1968, pp. 87-97.
4. Piper J., and Granum E. On fully automatic feature measurement for banded chromosome classification. Cytometry 10 (1989) 242-255
5. G. Ritter, Classification and clustering of objects with variants, in: W. Gaul, O. Opitz, M. Schader (Eds.), Data Analysis, Scientific Modeling and Practical Application, Studies in Classification, Data Analysis, and Knowledge Organization, Springer, Berlin, Heidelberg, 2000, pp. 41-50.
6. Ritter G., and Gallegos M.T. Bayesian object identification: variants. J. Multivar. Anal. 81 (2002) 301-334
7. Gallegos M.T., and Ritter G. Parameter estimation under ambiguity and contamination with the spurious model. J. Multivar. Anal. 97 (2006) 1221-1250
8. Ritter G., and Pesch C. Polarity-free automatic classification of chromosomes. Comput. Stat. Data Anal. 35 (2001) 351-372
9. Ritter G., and Schreib G. Using dominant points and variants for profile extraction from chromosomes. Pattern Recognition 34 (2001) 923-938
10. G. Ritter, M. T. Gallegos, A Bayesian approach to object identification in pattern recognition, in: A. Sanfeliu et al. (Eds.), Proceedings of the 15th International Conference on Pattern Recognition, vol. 2, Barcelona, 2000, pp. 418-421.
11. G. Ritter, Quadratically asymmetric distributions and their application to chromosome classification, in: A. Prat, E. Ripoll (Eds.), COMPSTAT 1996 Proceedings in Computational Statistics, 12th Symposium, Short Communications, Barcelona, 1996, pp. 99-100.
12. Ritter G., and Gaggermeier K. Automatic classification of chromosomes by means of quadratically asymmetric statistical distributions. Pattern Recognition 32 (1999) 997-1008
13. M.T. Gallegos, G. Ritter, Outlier treatment: a new statistical method for automatic chromosome classification, in: A. Prat, E. Ripoll (Eds.), COMPSTAT Proceedings in Computational Statistics, 12th Symposium, Barcelona, 1996, pp. 55-56.
14. Ritter G., and Gallegos M.T. Outliers in statistical pattern recognition and an application to automatic chromosome classification. Pattern Recognition Lett. 18 (1997) 525-539
15. Tso M.K.S., and Graham J. The transportation algorithm as an aid to chromosome classification. Pattern Recognition Lett. 1 (1983) 489-496
16. Tso M.K.S., Kleinschmidt P., Mitterreiter I., and Graham J. An efficient transportation algorithm for automatic chromosome karyotyping. Pattern Recognition Lett. 12 (1991) 117-126
17. A. Torralba, Contextual modulation of target saliency, in: Advances in Neural Information Processing Systems, 2001. 〈http://books.nips.cc/nips14.html〉 .
18. Hilditch J., and Rutovitz D. Some algorithms for chromosome recognition. Ann. N.Y. Acad. Sci. 157 1 (1969) 339-364
19. Guillemin V., and Pollack A. Differential Geometry (1974), Prentice-Hall, Englewood Cliffs, NJ
20. Loncaric S. A survey of shape analysis techniques. Pattern Recognition 31 (1998) 983-1001
21. Ji L. Intelligent splitting in the chromosome domain. Pattern Recognition 22 (1989) 519-532
22. Ji L. Fully automatic chromosome segmentation. Cytometry 17 (1994) 196-208
23. Agam G., and Dinstein I. Geometric separation of partially overlapping nonrigid objects applied to automatic chromosome classification. IEEE Trans. Pattern Anal. Mach. Intell. 19 (1997) 1212-1222
24. Lerner B., Guterman H., and Dinstein I. A classification-driven partially occluded object segmentation (CPOOS) method with application to chromosome analysis. IEEE Trans. Signal Process. 46 (1998) 2841-2847
25. Lerner B. Toward a completely automatic neural-network-based human chromosome analysis. IEEE Trans. System Man Cybern. Part B: Cybern. 28 (1998) 544-552
26. Shi H., Gader P., and Li H. Parallel mesh algorithms for grid graph shortest paths with application to separation of touching chromosomes. J. Supercomput. 12 (1998) 69-83
27. García C.U., Rubio A.B., Pérez F.A., and Hernández F.S. A curvature-based multiresolution automatic karyotyping system. Mach. Vision. Appl. 14 (2003) 145-156
28. Charters G.C., and Graham J. Trainable grey-level models for disentangling overlapping chromosomes. Pattern Recognition 32 (1999) 1335-1349
29. Piper J., Granum E., Rutovitz D., and Ruttledge H. Automation of chromosome analysis. Signal Process. 2 (1980) 203-221
30. Casey R.G., and Lecolinet E. A survey of methods and strategies in character segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 18 (1996) 690-706
31. Serra J. Image Analysis and Mathematical Morphology. third ed. (1989), Academic Press, London, San Diego, New York, Berkeley, Boston, Sydney, Tokyo, Toronto
32. Rosenfeld A. Connectivity in digital pictures. J. ACM 17 (1970) 146-160
33. Yokoi S., Toriwaki J.I., and Fukumura T. An analysis of topological properties of digital binary pictures using local features. Comput. Graph. Image Process. 4 (1975) 63-73
34. Bresenham J.E. Algorithm for computer control of a digital plotter. IBM Systems J. 4 1 (1965) 25-30
35. Vanderheydt L., Dom F., Oosterlinck A., and Van Den Berghe H. Two-dimensional shape decomposition using fuzzy subset theory applied to automated chromosome analysis. Pattern Recognition 13 (1981) 147-157
36. Shih F.Y.-C., and Mitchell O.R. A mathematical morphology approach to euclidean distance transformation. IEEE Trans. Image Process. 1 (1992) 197-204
37. G. Ritter, G. Schreib, Profile and feature extraction from chromosomes, in: A. Sanfeliu et al. (Eds.), Proceedings of the 15th International Conference on Pattern Recognition, vol. 2, Barcelona, 2000, pp. 287-290.
38. Hilditch C.J. Linear skeletons from square cupboards. Mach. Intell. 4 (1969) 403-420
39. Pavlidis T. A thinning algorithm for discrete binary images. Comput. Graphics Image Process. 13 (1980) 142-157
40. Naccache N.J., and Shinghal R. An investigation into the skeletonization approach of Hilditch. Pattern Recognition 17 (1984) 279-284
41. A. Rosenfeld, A.C. Kak, Digital Picture Processing, second ed., vol. 2, Academic Press, Orlando, San Diego, New York, Austin, Boston, London, Sydney, Tokyo, Toronto, 1982.
42. Chen Y.-S., and Hsu W.-H. A systematic approach for designing 2-subcycle and pseudo 1-subcycle parallel thinning algorithms. Pattern Recognition 22 (1989) 267-282 (Comments in Pattern Recognition 25 (1992) 1545-1546.)
43. Ji L., and Piper J. Fast homotopy-preserving skeletons using mathematical morphology. IEEE Trans. Pattern Anal. Mach. Intell. 14 1 (1992) 653-664
44. Suzuki S., Ueda N., and Sklansky J. Graph-based thinning for binary images. Int. J. Pattern Recognition Artif. Intell. 7 (1993) 1009-1030
45. Lee C.L., and Wang P.S.P. A simple and robust thinning algorithm. Int. J. Pattern Recognition Artif. Intell. 13 (1999) 357-366
46. Rosin P.L. Techniques for assessing polygonal approximations of curves. IEEE Trans. Pattern Anal. Mach. Intell. 19 (1997) 659-666
47. Rosin P.L. Assessing the behaviour of polygonal approximation algorithms. Pattern Recognition 36 (2003) 505-518
48. Marji M., and Siy P. A new algorithm for dominant points detection and polygonization of digital curves. Pattern Recognition 36 (2003) 2239-2251
49. Yin P.-Y. Ant colony search algorithms for optimal polygonal approximation of plane curves. Pattern Recognition 36 (2003) 1783-1797
50. Bellman R. On the approximation of curves by line segments using dynamic programming. Commun. ACM 4 (1961) 284
51. Dunham J.G. Optimum uniform piecewise linear approximation of planar curves. IEEE Trans. Pattern Anal. Mach. Intell. 8 (1986) 67-75
52. Sato Y. Piecewise linear approximation of plane curves by perimeter optimization. Pattern Recognition 25 (1992) 1535-1543
53. Papadimitriou C.H., and Steiglitz K. Combinatorial Optimization (1982), Prentice-Hall, Englewood Cliffs, NJ