图 书 馆
用于分类的距离图的快速构造A Fast Construction of the Distance Graph Used for the Classification |
|
| 课程网址: | http://videolectures.net/gbr07_kalinowski_afc/ |
| 主讲教师: | Miroslaw Kalinowski |
| 开课单位: | 纽约城市大学 |
| 开课时间: | 2007-07-12 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | It has been demonstrated that the diffcult 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. |
| 关 键 词: | 投影图像; 边缘权重; 邻搜索方法 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-11-30：lxf |
| 阅读次数: | 42 |