• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Image Processing pt.3; Progress in Biomedical Optics and Imaging; vol.8,no.31; Proceedings of SPIE-The International Society for Optical Engineering; vol.6512 pt.3 >C×C×C: Compressed Connected Components labeling algorithm
【24h】

C×C×C: Compressed Connected Components labeling algorithm

机译：C×C×C：压缩连接组件标记算法

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We propose Compressed Connected Components (C×C×C), a new fast algorithm for labeling connected components in binary images making use of compression. We break the given 3D image into non-overlapping 2×2×2 cube of voxels (2×2 square of pixels for 2D) and encode these binary values as the bits of a single decimal integer. We perform the connected component labeling on the resulting compressed data set. A recursive labeling approach by the use of smart-masks on the encoded decimal values is performed. The output is finally decompressed back to the original size by decimal-to-binary conversion of the cubes to retrieve the connected components in a lossless fashion. We demonstrate the efficacy of such encoding and labeling for large data sets (up to 1392×1040 for 2D and 512×512×336 for 3D). C×C×C reports a speed gain of 4x for 2D and 12x for 3D with memory savings of 75% for 2D and 88% for 3D over conventional (recursive growing of component labels) connected components algorithm. We also compare our method with VTK's "< vtkImageConnectMeasure >" filter and ITK's "< itk::ConnectedComponentImageFilter >" and find that we outperform both with speed gains of 3x and 6x for 3D. These features make C×C×C highly suitable for medical imaging and multi-media applications where the size of data sets and the number of connected components can be very large.
机译：我们提出了压缩连通分量（C×C×C），这是一种利用压缩来标记二进制图像中的连通分量的新的快速算法。我们将给定的3D图像分解为不重叠的2×2×2体素立方体（2D为2×2像素正方形），并将这些二进制值编码为单个十进制整数的位。我们对生成的压缩数据集执行连接的组件标记。通过对编码的十进制值使用智能掩码来执行递归标记方法。最后，通过多维数据集的十进制到二进制转换，将输出解压缩回原始大小，以无损方式检索连接的组件。我们证明了这种编码和标记对于大型数据集（对于2D高达1392×1040，对于3D高达512×512×336）的功效。 C×C×C报告说，与传统的（组件标签的递归增长）连接的组件算法相比，2D的速度提高了4倍，3D的速度提高了12倍，2D的内存节省了7％，3D的内存节省了88％。我们还将我们的方法与VTK的“ ”过滤器和ITK的“ ”进行比较，发现在3D方面我们的速度增益分别是3倍和6倍。这些功能使C×C×C非常适合于医学成像和多媒体应用，在这些应用中数据集的大小和所连接组件的数量可能非常大。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号