An efficient transportation algorithm for automatic chromosome karyotyping

Pattern Recognition Letters

Volumn 12, Issue 2, 1991, Pages 117-126

  Tso, Michael ^a   Kleinschmidt, Peter ^b   Mitterreiter, Ilse ^b   Graham, Jim ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b UNIVERSITY OF PASSAU   (Germany)

Author keywords

Bayesian methods; Chromosome classification; context constrained classification; image processing; karyotyping; maximum likelihood; transportation algorithm

Indexed keywords

EID: 0000265276     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8655(91)90057-S     Document Type: Article

References (12)

1. Signature methods for the assignment problem
2. Application of statistical and syntactical methods of analysis and classification to chromosome data
3. On the use of automatically inferred Markov networks for chromosome analysis
4. Human chromosome classification based on local band descriptors
5. Transportation problems which can be solved by the use of Hirsch-paths for the dual problem
6. Classification of chromosomes constrained by expected class size
7. On fully automatic feature measurement for banded chromosome classification
8. Chromosome classification and segmentation as exercises in knowing what to expect
9. On the profit of taking into account the known number of objects per class in classification methods
10. The transportation algorithm as an aid to chromosome classification
11. Network flow models in image processing
12. Automated homologue matching of human G-banded chromosomes