메뉴 건너뛰기




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

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

Author keywords

[No Author keywords available]

Indexed keywords

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

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

References (13)
  • 3
    • 33845340157 scopus 로고    scopus 로고
    • Unsupervised classification of single particles by cluster tracking in multi-dimensional space
    • 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)
    • (2007) J. Struct. Biol , vol.157 , pp. 226-239
    • Fu, J.1    Gao, H.2    Frank, J.3
  • 5
    • 38149070939 scopus 로고    scopus 로고
    • 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
    • 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
  • 9
    • 0027188633 scopus 로고
    • Data structures and algorithms for nearest neighbor search in general metric spaces
    • 93, pp
    • Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. of SODA '93, pp. 311-321 (1993)
    • (1993) Proc. of SODA , pp. 311-321
    • Yianilos, P.N.1
  • 10
    • 0022858293 scopus 로고
    • An algorithm for finding nearest neighbours in (approximately) constant time
    • Vidal, E.: An algorithm for finding nearest neighbours in (approximately) constant time. Pattern Recogn. Lett. 4(3), 145 157 (1986)
    • (1986) Pattern Recogn. Lett , vol.4 , Issue.3 , pp. 145-157
    • Vidal, E.1
  • 11
    • 0022136084 scopus 로고
    • An improvement of the minimum distortion encoding algorithm for vector quantization
    • Bey, CD., Gray, R.M.: An improvement of the minimum distortion encoding algorithm for vector quantization. IEEE Trans. Commun. 33(10), 1132-1133 (1985)
    • (1985) IEEE Trans. Commun , vol.33 , Issue.10 , pp. 1132-1133
    • Bey, C.D.1    Gray, R.M.2
  • 12
    • 0020153694 scopus 로고
    • Color image quantization for frame buffer display
    • 82, pp
    • Heckbert, P.: Color image quantization for frame buffer display. In: Proc. of SIGGRAPH '82, pp. 297-307 (1982)
    • (1982) Proc. of SIGGRAPH , pp. 297-307
    • Heckbert, P.1
  • 13
    • 33750367810 scopus 로고    scopus 로고
    • Fast k-nearest-neighbor search based on projection and triangular inequality
    • 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)
    • (2007) Pattern Recogn , vol.40 , Issue.2 , pp. 351-359
    • Lai, J.Z.C.1    Liaw, Y.C.2    Liu, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.