首页 > 最新文献

Computational Visual Media最新文献

英文 中文
A survey of urban visual analytics: Advances and future directions. 城市视觉分析调查:进展与未来方向。
IF 17.3 3区 计算机科学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-01-01 Epub Date: 2022-10-18 DOI: 10.1007/s41095-022-0275-7
Zikun Deng, Di Weng, Shuhan Liu, Yuan Tian, Mingliang Xu, Yingcai Wu

Developing effective visual analytics systems demands care in characterization of domain problems and integration of visualization techniques and computational models. Urban visual analytics has already achieved remarkable success in tackling urban problems and providing fundamental services for smart cities. To promote further academic research and assist the development of industrial urban analytics systems, we comprehensively review urban visual analytics studies from four perspectives. In particular, we identify 8 urban domains and 22 types of popular visualization, analyze 7 types of computational method, and categorize existing systems into 4 types based on their integration of visualization techniques and computational models. We conclude with potential research directions and opportunities.

开发有效的可视化分析系统需要对领域问题的特征进行仔细分析,并将可视化技术与计算模型相结合。城市可视化分析在解决城市问题和为智慧城市提供基础服务方面已经取得了显著成就。为了进一步推动学术研究,帮助开发工业化城市分析系统,我们从四个方面对城市可视化分析研究进行了全面回顾。其中,我们确定了 8 个城市领域和 22 种流行可视化类型,分析了 7 种计算方法,并根据可视化技术和计算模型的整合情况将现有系统分为 4 类。最后,我们提出了潜在的研究方向和机遇。
{"title":"A survey of urban visual analytics: Advances and future directions.","authors":"Zikun Deng, Di Weng, Shuhan Liu, Yuan Tian, Mingliang Xu, Yingcai Wu","doi":"10.1007/s41095-022-0275-7","DOIUrl":"10.1007/s41095-022-0275-7","url":null,"abstract":"<p><p>Developing effective visual analytics systems demands care in characterization of domain problems and integration of visualization techniques and computational models. Urban visual analytics has already achieved remarkable success in tackling urban problems and providing fundamental services for smart cities. To promote further academic research and assist the development of industrial urban analytics systems, we comprehensively review urban visual analytics studies from four perspectives. In particular, we identify 8 urban domains and 22 types of popular visualization, analyze 7 types of computational method, and categorize existing systems into 4 types based on their integration of visualization techniques and computational models. We conclude with potential research directions and opportunities.</p>","PeriodicalId":37301,"journal":{"name":"Computational Visual Media","volume":"9 1","pages":"3-39"},"PeriodicalIF":17.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9579670/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40655032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Unsupervised random forest for affinity estimation. 用于亲和性估计的无监督随机森林。
IF 6.9 3区 计算机科学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2022-01-01 Epub Date: 2021-12-06 DOI: 10.1007/s41095-021-0241-9
Yunai Yi, Diya Sun, Peixin Li, Tae-Kyun Kim, Tianmin Xu, Yuru Pei

This paper presents an unsupervised clustering random-forest-based metric for affinity estimation in large and high-dimensional data. The criterion used for node splitting during forest construction can handle rank-deficiency when measuring cluster compactness. The binary forest-based metric is extended to continuous metrics by exploiting both the common traversal path and the smallest shared parent node. The proposed forest-based metric efficiently estimates affinity by passing down data pairs in the forest using a limited number of decision trees. A pseudo-leaf-splitting (PLS) algorithm is introduced to account for spatial relationships, which regularizes affinity measures and overcomes inconsistent leaf assign-ments. The random-forest-based metric with PLS facilitates the establishment of consistent and point-wise correspondences. The proposed method has been applied to automatic phrase recognition using color and depth videos and point-wise correspondence. Extensive experiments demonstrate the effectiveness of the proposed method in affinity estimation in a comparison with the state-of-the-art.

本文提出了一种基于无监督聚类随机森林的度量方法,用于大型高维数据的亲和性估计。在森林构建过程中,用于节点拆分的标准可以在测量聚类紧凑性时处理秩缺陷。通过利用共同遍历路径和最小共享父节点,基于森林的二元度量被扩展到连续度量。通过使用数量有限的决策树在森林中向下传递数据对,所提出的基于森林的度量方法能有效地估计亲和性。为了考虑空间关系,引入了一种伪树叶分割(PLS)算法,该算法对亲和度度量进行了正则化处理,并克服了树叶分配不一致的问题。带有 PLS 的基于随机森林的度量有助于建立一致的点对点对应关系。所提出的方法已被应用于利用彩色和深度视频以及点对应关系进行短语自动识别。通过与最先进的方法进行比较,大量的实验证明了所提出的方法在亲和性估计方面的有效性。
{"title":"Unsupervised random forest for affinity estimation.","authors":"Yunai Yi, Diya Sun, Peixin Li, Tae-Kyun Kim, Tianmin Xu, Yuru Pei","doi":"10.1007/s41095-021-0241-9","DOIUrl":"10.1007/s41095-021-0241-9","url":null,"abstract":"<p><p>This paper presents an unsupervised clustering random-forest-based metric for affinity estimation in large and high-dimensional data. The criterion used for node splitting during forest construction can handle rank-deficiency when measuring cluster compactness. The binary forest-based metric is extended to continuous metrics by exploiting both the common traversal path and the smallest shared parent node. The proposed forest-based metric efficiently estimates affinity by passing down data pairs in the forest using a limited number of decision trees. A pseudo-leaf-splitting (PLS) algorithm is introduced to account for spatial relationships, which regularizes affinity measures and overcomes inconsistent leaf assign-ments. The random-forest-based metric with PLS facilitates the establishment of consistent and point-wise correspondences. The proposed method has been applied to automatic phrase recognition using color and depth videos and point-wise correspondence. Extensive experiments demonstrate the effectiveness of the proposed method in affinity estimation in a comparison with the state-of-the-art.</p>","PeriodicalId":37301,"journal":{"name":"Computational Visual Media","volume":"8 2","pages":"257-272"},"PeriodicalIF":6.9,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8645415/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39720010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Smoothness preserving layout for dynamic labels by hybrid optimization. 基于混合优化的动态标签保持平滑布局。
IF 6.9 3区 计算机科学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2022-01-01 Epub Date: 2021-10-27 DOI: 10.1007/s41095-021-0231-y
Yu He, Guo-Dong Zhao, Song-Hai Zhang

Stable label movement and smooth label trajectory are critical for effective information understanding. Sudden label changes cannot be avoided by whatever forced directed methods due to the unreliability of resultant force or global optimization methods due to the complex trade-off on the different aspects. To solve this problem, we proposed a hybrid optimization method by taking advantages of the merits of both approaches. We first detect the spatial-temporal intersection regions from whole trajectories of the features, and initialize the layout by optimization in decreasing order by the number of the involved features. The label movements between the spatial-temporal intersection regions are determined by force directed methods. To cope with some features with high speed relative to neighbors, we introduced a force from future, called temporal force, so that the labels of related features can elude ahead of time and retain smooth movements. We also proposed a strategy by optimizing the label layout to predict the trajectories of features so that such global optimization method can be applied to streaming data.

Electronic supplementary material: Supplementary material is available in the online version of this article at 10.1007/s41095-021-0231-y.

稳定的标签运动和平滑的标签轨迹对于有效的信息理解至关重要。由于合力的不可靠性,任何强制定向方法都无法避免标签的突然变化,而全局优化方法由于不同方面的复杂权衡而无法避免。为了解决这一问题,我们提出了一种综合两种方法优点的混合优化方法。首先从特征的整个轨迹中检测出时空交点区域,并根据特征个数从小到大进行优化初始化布局。在时空交点区域之间的标签移动由力导向方法确定。为了应对一些相对于相邻特征速度较快的特征,我们引入了一种来自未来的力,称为时间力,使相关特征的标签能够提前避开时间而保持平滑运动。我们还提出了一种通过优化标签布局来预测特征轨迹的策略,使这种全局优化方法可以应用于流数据。电子补充材料:本文的在线版本为10.1007/s41095-021-0231-y。
{"title":"Smoothness preserving layout for dynamic labels by hybrid optimization.","authors":"Yu He,&nbsp;Guo-Dong Zhao,&nbsp;Song-Hai Zhang","doi":"10.1007/s41095-021-0231-y","DOIUrl":"https://doi.org/10.1007/s41095-021-0231-y","url":null,"abstract":"<p><p>Stable label movement and smooth label trajectory are critical for effective information understanding. Sudden label changes cannot be avoided by whatever forced directed methods due to the unreliability of resultant force or global optimization methods due to the complex trade-off on the different aspects. To solve this problem, we proposed a hybrid optimization method by taking advantages of the merits of both approaches. We first detect the spatial-temporal intersection regions from whole trajectories of the features, and initialize the layout by optimization in decreasing order by the number of the involved features. The label movements between the spatial-temporal intersection regions are determined by force directed methods. To cope with some features with high speed relative to neighbors, we introduced a force from future, called temporal force, so that the labels of related features can elude ahead of time and retain smooth movements. We also proposed a strategy by optimizing the label layout to predict the trajectories of features so that such global optimization method can be applied to streaming data.</p><p><strong>Electronic supplementary material: </strong>Supplementary material is available in the online version of this article at 10.1007/s41095-021-0231-y.</p>","PeriodicalId":37301,"journal":{"name":"Computational Visual Media","volume":"8 1","pages":"149-163"},"PeriodicalIF":6.9,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8549603/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39579548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
RGB-D salient object detection: A survey. RGB-D 突出物体检测:调查
IF 17.3 3区 计算机科学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2021-01-01 Epub Date: 2021-01-07 DOI: 10.1007/s41095-020-0199-z
Tao Zhou, Deng-Ping Fan, Ming-Ming Cheng, Jianbing Shen, Ling Shao

Salient object detection, which simulates human visual perception in locating the most significant object(s) in a scene, has been widely applied to various computer vision tasks. Now, the advent of depth sensors means that depth maps can easily be captured; this additional spatial information can boost the performance of salient object detection. Although various RGB-D based salient object detection models with promising performance have been proposed over the past several years, an in-depth understanding of these models and the challenges in this field remains lacking. In this paper, we provide a comprehensive survey of RGB-D based salient object detection models from various perspectives, and review related benchmark datasets in detail. Further, as light fields can also provide depth maps, we review salient object detection models and popular benchmark datasets from this domain too. Moreover, to investigate the ability of existing models to detect salient objects, we have carried out a comprehensive attribute-based evaluation of several representative RGB-D based salient object detection models. Finally, we discuss several challenges and open directions of RGB-D based salient object detection for future research. All collected models, benchmark datasets, datasets constructed for attribute-based evaluation, and related code are publicly available at https://github.com/taozh2017/RGBD-SODsurvey.

突出物体检测是模拟人类视觉感知来定位场景中最重要的物体,已被广泛应用于各种计算机视觉任务中。现在,深度传感器的出现意味着可以轻松捕捉深度图;这种额外的空间信息可以提高突出物体检测的性能。尽管在过去几年中提出了各种基于 RGB-D 的突出物体检测模型,并取得了可喜的性能,但对这些模型的深入理解以及该领域所面临的挑战仍然缺乏。在本文中,我们从不同角度对基于 RGB-D 的突出物体检测模型进行了全面研究,并详细回顾了相关的基准数据集。此外,由于光场也能提供深度图,我们也回顾了这一领域的突出物体检测模型和流行的基准数据集。此外,为了研究现有模型检测突出物体的能力,我们对几个具有代表性的基于 RGB-D 的突出物体检测模型进行了基于属性的综合评估。最后,我们讨论了基于 RGB-D 的突出物体检测的几个挑战和未来研究的开放方向。所有收集的模型、基准数据集、为基于属性的评估而构建的数据集以及相关代码均可在 https://github.com/taozh2017/RGBD-SODsurvey 上公开获取。
{"title":"RGB-D salient object detection: A survey.","authors":"Tao Zhou, Deng-Ping Fan, Ming-Ming Cheng, Jianbing Shen, Ling Shao","doi":"10.1007/s41095-020-0199-z","DOIUrl":"10.1007/s41095-020-0199-z","url":null,"abstract":"<p><p>Salient object detection, which simulates human visual perception in locating the most significant object(s) in a scene, has been widely applied to various computer vision tasks. Now, the advent of depth sensors means that depth maps can easily be captured; this additional spatial information can boost the performance of salient object detection. Although various RGB-D based salient object detection models with promising performance have been proposed over the past several years, an in-depth understanding of these models and the challenges in this field remains lacking. In this paper, we provide a comprehensive survey of RGB-D based salient object detection models from various perspectives, and review related benchmark datasets in detail. Further, as light fields can also provide depth maps, we review salient object detection models and popular benchmark datasets from this domain too. Moreover, to investigate the ability of existing models to detect salient objects, we have carried out a comprehensive attribute-based evaluation of several representative RGB-D based salient object detection models. Finally, we discuss several challenges and open directions of RGB-D based salient object detection for future research. All collected models, benchmark datasets, datasets constructed for attribute-based evaluation, and related code are publicly available at https://github.com/taozh2017/RGBD-SODsurvey.</p>","PeriodicalId":37301,"journal":{"name":"Computational Visual Media","volume":"7 1","pages":"37-69"},"PeriodicalIF":17.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7788385/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10683664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Temporal scatterplots. 时间散点图。
IF 6.9 3区 计算机科学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2020-01-01 Epub Date: 2020-11-07 DOI: 10.1007/s41095-020-0197-1
Or Patashnik, Min Lu, Amit H Bermano, Daniel Cohen-Or

Visualizing high-dimensional data on a 2D canvas is generally challenging. It becomes significantly more difficult when multiple time-steps are to be presented, as the visual clutter quickly increases. Moreover, the challenge to perceive the significant temporal evolution is even greater. In this paper, we present a method to plot temporal high-dimensional data in a static scatterplot; it uses the established PCA technique to project data from multiple time-steps. The key idea is to extend each individual displacement prior to applying PCA, so as to skew the projection process, and to set a projection plane that balances the directions of temporal change and spatial variance. We present numerous examples and various visual cues to highlight the data trajectories, and demonstrate the effectiveness of the method for visualizing temporal data.

在2D画布上可视化高维数据通常具有挑战性。当要呈现多个时间步长时,这会变得非常困难,因为视觉混乱会迅速增加。此外,感知重要的时间演变的挑战甚至更大。本文提出了一种在静态散点图中绘制时间高维数据的方法;它使用已建立的PCA技术从多个时间步长投影数据。关键思想是在应用PCA之前对每个个体位移进行扩展,从而使投影过程倾斜,并设置一个平衡时间变化方向和空间方差方向的投影平面。我们提供了许多例子和各种视觉线索来突出数据轨迹,并展示了可视化时间数据方法的有效性。
{"title":"Temporal scatterplots.","authors":"Or Patashnik,&nbsp;Min Lu,&nbsp;Amit H Bermano,&nbsp;Daniel Cohen-Or","doi":"10.1007/s41095-020-0197-1","DOIUrl":"https://doi.org/10.1007/s41095-020-0197-1","url":null,"abstract":"<p><p>Visualizing high-dimensional data on a 2D canvas is generally challenging. It becomes significantly more difficult when multiple time-steps are to be presented, as the visual clutter quickly increases. Moreover, the challenge to perceive the significant temporal evolution is even greater. In this paper, we present a method to plot temporal high-dimensional data in a static scatterplot; it uses the established PCA technique to project data from multiple time-steps. The key idea is to extend each individual displacement prior to applying PCA, so as to skew the projection process, and to set a projection plane that balances the directions of temporal change and spatial variance. We present numerous examples and various visual cues to highlight the data trajectories, and demonstrate the effectiveness of the method for visualizing temporal data.</p>","PeriodicalId":37301,"journal":{"name":"Computational Visual Media","volume":"6 4","pages":"385-400"},"PeriodicalIF":6.9,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s41095-020-0197-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"38604606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
期刊
Computational Visual Media
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1