Skip Navigation


The Computer Journal Advance Access originally published online on May 13, 2005
The Computer Journal 2005 48(4):466-479; doi:10.1093/comjnl/bxh098
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
48/4/466    most recent
bxh098v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by O'Neill, P.
Right arrow Articles by Liu, X.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oupjournals.org

Pyramidic Clustering of Large-Scale Microarray Images

Paul O'Neill1 §, Karl Fraser1 §, Zidong Wang1, Paul Kellam2, Joost N. Kok3 and Xiaohui Liu1,3 *

1 Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex UB8 3PH, UK, 2 Department of Infection, University College London, London W1T 4JF, UK, 3 Leiden Institute of Advanced Computer Science, Universiteit Leiden, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands

With ongoing research and development of imaging techniques such as those involved in brain MRIs, cDNA microarrays and satellite reconnaissance, the need for tools that can intelligently parse larger images is ever increasing. One group of such techniques often used is that of segmentation, an example of which is that of clustering algorithms. In order to deal with large data sets, current approaches require the data to be sampled or summarized before true analysis can take place. In this paper we propose a novel image analysis technique using pyramidic type grouping, namely copasetic clustering, which focuses on the problem of applying traditional clustering techniques to these large-scale image data sets with limited resources. A further benefit of the technique is the transparency of its intermediate clustering steps; when applied to spatial data sets this allows the capture and incorporation of contextual information to improve result accuracy. The algorithm achieves an ~1–3 dB w-to-noise ratio when compared with the conventional techniques described.


Received 11 July 2004. revised 10 February 2005.

* Email: xiaohui.liu{at}brunel.ac.uk

§ The authors wish it to be known that, in their opinion, the first two authors should be regarded as joint First Authors.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.