Interactive data-centric viewpoint selection

Han Suk Kim, D. Unat, S. Baden, J. Schulze
{"title":"Interactive data-centric viewpoint selection","authors":"Han Suk Kim, D. Unat, S. Baden, J. Schulze","doi":"10.1117/12.907480","DOIUrl":null,"url":null,"abstract":"We propose a new algorithm for automatic viewpoint selection for volume data sets. While most previous algorithms \ndepend on information theoretic frameworks, our algorithm solely focuses on the data itself without off-line rendering \nsteps, and finds a view direction which shows the data set's features well. The algorithm consists of two main steps: \nfeature selection and viewpoint selection. The feature selection step is an extension of the 2D Harris interest point detection \nalgorithm. This step selects corner and/or high-intensity points as features, which captures the overall structures and local \ndetails. The second step, viewpoint selection, takes this set and finds a direction that lays out those points in a way \nthat the variance of projected points is maximized, which can be formulated as a Principal Component Analysis (PCA) \nproblem. The PCA solution guarantees that surfaces with detected corner points are less likely to be degenerative, and it \nminimizes occlusion between them. Our entire algorithm takes less than a second, which allows it to be integrated into \nreal-time volume rendering applications where users can modify the volume with transfer functions, because the optimized \nviewpoint depends on the transfer function.","PeriodicalId":89305,"journal":{"name":"Visualization and data analysis","volume":"27 1","pages":"829405"},"PeriodicalIF":0.0000,"publicationDate":"2012-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Visualization and data analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.907480","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

We propose a new algorithm for automatic viewpoint selection for volume data sets. While most previous algorithms depend on information theoretic frameworks, our algorithm solely focuses on the data itself without off-line rendering steps, and finds a view direction which shows the data set's features well. The algorithm consists of two main steps: feature selection and viewpoint selection. The feature selection step is an extension of the 2D Harris interest point detection algorithm. This step selects corner and/or high-intensity points as features, which captures the overall structures and local details. The second step, viewpoint selection, takes this set and finds a direction that lays out those points in a way that the variance of projected points is maximized, which can be formulated as a Principal Component Analysis (PCA) problem. The PCA solution guarantees that surfaces with detected corner points are less likely to be degenerative, and it minimizes occlusion between them. Our entire algorithm takes less than a second, which allows it to be integrated into real-time volume rendering applications where users can modify the volume with transfer functions, because the optimized viewpoint depends on the transfer function.
交互式以数据为中心的视点选择
提出了一种基于体数据集的自动视点选择算法。以往大多数算法依赖于信息理论框架,而我们的算法只关注数据本身,没有离线渲染步骤,并找到一个能很好地显示数据集特征的视图方向。该算法主要包括两个步骤:特征选择和视点选择。特征选择步骤是对二维Harris兴趣点检测算法的扩展。这一步选择角和/或高强度点作为特征,捕捉整体结构和局部细节。第二步,视点选择,取这个集合并找到一个方向,以最大化投影点方差的方式布置这些点,这可以表述为主成分分析(PCA)问题。PCA解决方案保证检测到角点的表面不太可能退化,并最大限度地减少它们之间的遮挡。我们的整个算法耗时不到一秒,这使得它可以集成到实时体渲染应用程序中,用户可以使用传递函数修改体,因为优化的视点依赖于传递函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信