Abstract book (pdf) - ICPR 2010
Abstract book (pdf) - ICPR 2010
Abstract book (pdf) - ICPR 2010
- TAGS
- abstract
- icpr
- icpr2010.org
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
called 22q11.2 Deletion Syndrome. Genetic programming (GP) is used to learn the different 3D shape quantifications.<br />
Experimental results show that the GP method achieves a higher classification rate than those of human experts and existing<br />
computer algorithms.<br />
09:00-11:10, Paper WeAT9.3<br />
Identification of Ancestry Informative Markers from Chromosome-Wide Single Nucleotide Polymorphisms using Symmetrical<br />
Uncertainty Ranking<br />
Piroonratana, Theera, King Mongkut’s Univ. of Tech.<br />
Wongseree, Waranyu, King Mongkut’s Univ. of Tech.<br />
Usavanarong, Touchpong, King Mongkut’s Univ. of Tech.<br />
Assawamakin, Anunchai, Mahidol Univ.<br />
Limwongse, Chanin, Mahidol Univ.<br />
Chaiyaratana, Nachol, King Mongkut’s Univ. of Tech.<br />
Ancestry informative markers (AIMs) have been proven to contain necessary information for population classification. In<br />
this article, round robin symmetrical uncertainty ranking for preliminary AIM screening is proposed. Each single nucleotide<br />
polymorphism (SNP) is assigned a rank based on its ability to separate two populations from each other. In a multi-population<br />
scenario, all possible population pairs are considered and the screened SNP set incorporates top-ranked SNPs from<br />
every pair-wise comparison. After the preliminary screening, SNPs are further screened by a wrapper which is embedded<br />
with a naive Bayes classifier. A classification model is subsequently constructed from the finally screened SNPs via a<br />
naive Bayes classifier. The application of the proposed procedure to the Hap Map data indicates that AIM panels can be<br />
found on all chromosomes. Each panel consists of 11 to 24 SNPs and can be used to completely classify the CEU, CHB,<br />
JPT and YRI populations. Moreover, all panels are smaller than the AIM panels reported in previous studies.<br />
09:00-11:10, Paper WeAT9.4<br />
Evaluation of a New Point Clouds Registration Method based on Group Averaging Features<br />
Temerinac-Ott, Maja, Univ. of Freiburg<br />
Keuper, Margret, Univ. of Freiburg<br />
Burkhardt, Hans, Univ. of Freiburg<br />
Registration of point clouds is required in the processing of large biological data sets. The trade off between computation<br />
time and accuracy of the registration is the main challenge in this task. We present a novel method for registering point<br />
clouds in two and three dimensional space based on Group Averaging on the Euclidean transformation group. It is applied<br />
on a set of neighboring points whose size directly controls computing time and accuracy. The method is evaluated regarding<br />
dependencies of the computing time and the registration accuracy versus the point density assuming their random distribution.<br />
Results are verified in two biological applications on 2D and 3D images.<br />
09:00-11:10, Paper WeAT9.5<br />
Cell Tracking in Video Microscopy using Bipartite Graph Matching<br />
Chowdhury, Ananda, Jadavpur Univ.<br />
Chatterjee, Rohit, Jadavpur Univ.<br />
Ghosh, Mayukh, Jadavpur Univ.<br />
Ray, Nilanjan, Univ. of Alberta<br />
Automated visual tracking of cells from video microscopy has many important biomedical applications. In this paper, we<br />
model the problem of cell tracking over pairs of video microscopy image frames as a minimum weight matching problem in<br />
bipartite graphs. The bipartite matching essentially establishes one-to-one correspondences between the cells in different<br />
frames. A key advantage of using bipartite matching is the inherent scalability, which arises from its polynomial time-complexity.<br />
We propose two different tracking methods based on bipartite graph matching and properties of Gaussian distributions.<br />
In both the methods, i) the centers of the cells appearing in two frames are treated as vertices of a bipartite graph and ii) the<br />
weight matrix contains information about distance between the cells (in two frames) and cell velocity. In the first method,<br />
we identify fast-moving cells based on distance and filter them out using Gaussian distributions before the matching is<br />
applied. In the second method, we remove false matches using Gaussian distributions after the bipartite graph matching is<br />
employed. Experimental results indicate that both the methods are promising while the second method has higher accuracy.<br />
- 183 -