Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/74859
Title: Fast bead detection and inexact microarray pattern matching for in-situ encoded bead-based array
Authors: Ghosh, S.
Schmidt, A.
Trau, D. 
Keywords: Fast inexact graph matching
Graph spectra
In-situ encoded bead-based array
Microarray bead detection
Sequence alignment
Issue Date: 2012
Citation: Ghosh, S.,Schmidt, A.,Trau, D. (2012). Fast bead detection and inexact microarray pattern matching for in-situ encoded bead-based array. VISAPP 2012 - Proceedings of the International Conference on Computer Vision Theory and Applications 2 : 5-14. ScholarBank@NUS Repository.
Abstract: This paper presents an automatic bead detection and bead array pattern matching technique developed for the In-situ Encoded Bead-based Array (IEBA) technology. A supervised learning based bead detection technique robust to irregular illumination variations and noise is developed. An efficient and effective graph matching technique that combines graph spectral analysis and sequence alignment is used to match bead array patterns. The matching algorithm proposed is rotation and scale-invariant. The pattern matching algorithm performs in-exact matching and is capable of handling very large numbers of outliers in the target graph as well as large number of occlusions in the template graph. The matching algorithm uses dynamic programming and can give good time performances dependent only on the number of nodes in the template and target graphs, irrespective of the number of outliers and occlusions. The algorithm can detect and match large number of beads in a few seconds.
Source Title: VISAPP 2012 - Proceedings of the International Conference on Computer Vision Theory and Applications
URI: http://scholarbank.nus.edu.sg/handle/10635/74859
ISBN: 9789898565044
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.