A fast construction of the distance graph used for the classification of heterogeneous electron microscopic projections

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4538 LNCS, Issue , 2007, Pages 263-272

  Kalinowski, Miroslaw ^a   Daurat, Alain ^b   Herman, Gabor T ^a  

^a City College of the City University of New York   (United States)

^b UNIVERSITÉ DE STRASBOURG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; EDGE DETECTION; ELECTRON MICROSCOPES; IMAGE CLASSIFICATION; THREE DIMENSIONAL;

BRUTE-FORCE APPROACH; HETEROGENEOUS PROJECTION IMAGES; PROJECTION SETS;

GRAPH THEORY;

EID: 38149033643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72903-7_24     Document Type: Conference Paper

References (13)

1. Frank, J.: Three-Dimensional Electron Microscopy Of Macromolecular Assemblies: Visualization of Biological Molecules in Their Native State. Oxford University Press, New-York, NY, USA (2006)
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)
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)
4. Herman, G.T., Kalinowski, M.: Classification of heterogeneous electron microscopic projections into homogeneous subsets (submitted to Ultramicroscopy)
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) http://cjtcs.cs.uchicago.edu/articles/1997/2/contents.html
6. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer Verlag, Berlin Heidelberg (2003)
7. Papadopoulos, A.N., Manolopoulos, Y.: Nearest Neighbor Search: A Database Perspective. Springer, New-York, NY, USA (2005)
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)
9. Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. of SODA '93, pp. 311-321 (1993)
10. Vidal, E.: An algorithm for finding nearest neighbours in (approximately) constant time. Pattern Recogn. Lett. 4(3), 145 157 (1986)
11. Bey, CD., Gray, R.M.: An improvement of the minimum distortion encoding algorithm for vector quantization. IEEE Trans. Commun. 33(10), 1132-1133 (1985)
12. Heckbert, P.: Color image quantization for frame buffer display. In: Proc. of SIGGRAPH '82, pp. 297-307 (1982)
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)