A Fast Construction of the Distance Graph Used for the Classification of Heterogeneous Electron Microscopic Projections

  • Miroslaw Kalinowski
  • Alain Daurat
  • Gabor T. Herman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4538)


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.


Neighbor Search Projection Image Distance Graph Near Neighbor Search Fast Construction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Frank, J.: Three-Dimensional Electron Microscopy Of Macromolecular Assemblies: Visualization of Biological Molecules in Their Native State. Oxford University Press, New-York (2006)Google Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Herman, G.T., Kalinowski, M.: Classification of heterogeneous electron microscopic projections into homogeneous subsets (submitted to Ultramicroscopy)Google Scholar
  5. 5.
    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)
  6. 6.
    Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer Verlag, Berlin Heidelberg (2003)zbMATHGoogle Scholar
  7. 7.
    Papadopoulos, A.N., Manolopoulos, Y.: Nearest Neighbor Search: A Database Perspective. Springer, New-York, NY, USA (2005)zbMATHGoogle Scholar
  8. 8.
    Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273–321 (2001)CrossRefGoogle Scholar
  9. 9.
    Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. of SODA 1993, pp. 311–321 (1993)Google Scholar
  10. 10.
    Vidal, E.: An algorithm for finding nearest neighbours in (approximately) constant time. Pattern Recogn. Lett. 4(3), 145–157 (1986)CrossRefMathSciNetGoogle Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    Heckbert, P.: Color image quantization for frame buffer display. In: Proc. of SIGGRAPH 1982, pp. 297–307 ( 1982)Google Scholar
  13. 13.
    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)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Miroslaw Kalinowski
    • 1
  • Alain Daurat
    • 2
  • Gabor T. Herman
    • 1
  1. 1.Department of Computer Science, The Graduate Center City University of New York, 365 Fifth Avenue New York, NY 10016USA
  2. 2.LSIIT CNRS UMR 7005, Université Louis Pasteur (Strasbourg 1), Pôle API, Boulevard Sébastien Brant, 67400 Illkirch-GraffenstadenFrance

Personalised recommendations