Abstract
It has been demonstrated that the difficult problem of classifying heterogeneous projection images, similar to those found in 3D electron microscopy (3D-EM) of macromolecules, can be successfully solved by finding an approximate Max k-Cut of an appropriately constructed weighted graph. Despite of the large size (thousands of nodes) of the graph and the theoretical computational complexity of finding even an approximate Max k-Cut, an algorithm has been proposed that finds a good (from the classification perspective) approximate solution within several minutes (running on a standard PC). However, the task of constructing the complete weighted graph (that represents an instance of the projection image classification problems) is computationally expensive. Due to the large number of edges, the computation of edge weights can take tens of hours for graphs containing several thousand nodes. We propose a method, which utilizes an early termination technique, to significantly reduce the computational cost of constructing such graphs. We compare, on synthetic data sets that resemble projection sets encountered in 3D-EM, the performance of our method with that of a brute-force approach and a method based on nearest neighbor search.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Frank, J.: Three-Dimensional Electron Microscopy Of Macromolecular Assemblies: Visualization of Biological Molecules in Their Native State. Oxford University Press, New-York (2006)
Scheres, S.H.W., Gao, H., Valle, M., Herman, G.T., Eggermont, P.P.B., Frank, J., Carazo, J.M.: Disentangling conformational states of macromolecules in 3D-EM through likelihood optimization. Nature Methods 4, 27–29 (2007)
Fu, J., Gao, H., Frank, J.: Unsupervised classification of single particles by cluster tracking in multi-dimensional space. J. Struct. Biol. 157, 226–239 (2007)
Herman, G.T., Kalinowski, M.: Classification of heterogeneous electron microscopic projections into homogeneous subsets (submitted to Ultramicroscopy)
Kann, V., Khanna, S., Lagergren, J., Panconesi, A.: On the hardness of approximating Max k-Cut and its dual. Chicago J. Theoret. Comp. Sci ( 1997) http://cjtcs.cs.uchicago.edu/articles/1997/2/contents.html
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer Verlag, Berlin Heidelberg (2003)
Papadopoulos, A.N., Manolopoulos, Y.: Nearest Neighbor Search: A Database Perspective. Springer, New-York, NY, USA (2005)
Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273–321 (2001)
Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. of SODA 1993, pp. 311–321 (1993)
Vidal, E.: An algorithm for finding nearest neighbours in (approximately) constant time. Pattern Recogn. Lett. 4(3), 145–157 (1986)
Bey, C.D., Gray, R.M.: An improvement of the minimum distortion encoding algorithm for vector quantization. IEEE Trans. Commun. 33(10), 1132–1133 (1985)
Heckbert, P.: Color image quantization for frame buffer display. In: Proc. of SIGGRAPH 1982, pp. 297–307 ( 1982)
Lai, J.Z.C., Liaw, Y.C., Liu, J.: Fast k-nearest-neighbor search based on projection and triangular inequality. Pattern Recogn 40(2), 351–359 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kalinowski, M., Daurat, A., Herman, G.T. (2007). A Fast Construction of the Distance Graph Used for the Classification of Heterogeneous Electron Microscopic Projections. In: Escolano, F., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2007. Lecture Notes in Computer Science, vol 4538. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72903-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-72903-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72902-0
Online ISBN: 978-3-540-72903-7
eBook Packages: Computer ScienceComputer Science (R0)