.png){kind=icon}
返回
Low-complexity maximum intensity projection
.png){kind=icon}
PRE
AI
DOI：10.1145/1095878.1095886.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many techniques have already been proposed to improve the efficiency of maximum intensity projection (MIP) volume rendering, but none of them considered the possible hypothesis of a better complexity than either O(n) for finding the maximum value of n samples along a ray or O(n(3)) for an object-order algorithm. Here, we fully model and analyze the use of octrees for MIP, and we mathematically show that the average MIP complexity can be reduced to O(n(2)) for an object-order algorithm, or to O(log(n)) per ray when using the image-order variant of our algorithm. Therefore, this improvement establishes a major advance for interactive MIP visualization of large-volume data. In parallel, we also present an object-order implementation of our algorithm, satisfying the theoretical O(n(2)) result. It is based on hierarchical occlusion maps that perform on-the-fly visibility of the data, and our results show that it is the most efficient solution for MIP available to date.
Keyword:
algorithms
theory
performance
maximum intensity projection
volume rendering
complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.5
论文数:
4.7K
被引数:
3.6W
机构
暂无机构信息
引用论文
Polychlorinated Biphenyls Affect Thyroid Function and Induce Autoimmunity in Sprague-Dawley Rats
PREAI
分享收藏Subnormothermic ex vivo lung perfusion attenuates ischemia reperfusion injury from donation after circulatory death donors.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏 没有更多内容
没有更多内容