Journal of Visual Languages and Computing最新文献_第7页

A physiognomy based method for facial feature extraction and recognition 一种基于相学的人脸特征提取与识别方法

Journal of Visual Languages and Computing Pub Date : 2017-12-01 DOI: 10.1016/j.jvlc.2017.09.006

Liu Yujie , Mao Lin Huang , Weidong Huang , Jie Liang

引用次数: 13

Creating realistic map-like visualisations: Results from user studies 创建逼真的类似地图的可视化：用户研究的结果

Journal of Visual Languages and Computing Pub Date : 2017-12-01 DOI: 10.1016/j.jvlc.2017.09.002

Patrick Cheong-Iao Pang , Robert P. Biuk-Aghai , Muye Yang , Bin Pang

引用次数: 10

TMNVis: Visual analysis of evolution in temporal multivariate network at multiple granularities TMNVis：多粒度时间多元网络进化的可视化分析

Journal of Visual Languages and Computing Pub Date : 2017-12-01 DOI: 10.1016/j.jvlc.2017.03.003

B. Lu , M. Zhu , Q. He , M. Li , R. Jia

{"title":"TMNVis: Visual analysis of evolution in temporal multivariate network at multiple granularities","authors":"B. Lu , M. Zhu , Q. He , M. Li , R. Jia","doi":"10.1016/j.jvlc.2017.03.003","DOIUrl":"https://doi.org/10.1016/j.jvlc.2017.03.003","url":null,"abstract":"<div><p>Temporal (Dynamic) multivariate networks consist of objects and relationships with a variety of attributes, and the networks change over time. Exploring such kind of networks in visualization is of great significance and full of challenges as its time-varying and multivariate nature. Most of the existing dynamic network visualization techniques focus on the topological structure<span> evolution lacking of exploration on the multivariate data<span> (multiple attributes) thoroughly, and do not cover comprehensive analyses on multiple granularities. In this paper, we propose TMNVis, an interactive visualization system to explore the evolution of temporal multivariate network. Firstly we list a series of tasks on three granularities: global level, subgroup level and individual level. Secondly three main views, which rely mainly on timeline-based method while animation subsidiary, are designed to resolve the analysis tasks. Thirdly we design a series of flexible interactions and develop a prototype system. At last we verify the effectiveness and usefulness of TMNVis using a real-world academic collaboration data.</span></span></p></div>","PeriodicalId":54754,"journal":{"name":"Journal of Visual Languages and Computing","volume":"43 ","pages":"Pages 30-41"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jvlc.2017.03.003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72120845","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Convergent drawing for mutually connected directed graphs 互连通有向图的收敛图

Journal of Visual Languages and Computing Pub Date : 2017-12-01 DOI: 10.1016/j.jvlc.2017.09.004

Naoko Toeda , Rina Nakazawa , Takayuki Itoh , Takafumi Saito , Daniel Archambault

引用次数: 4

Behavioral segmentation for human motion capture data based on graph cut method 基于图割方法的人体运动捕捉数据的行为分割

Journal of Visual Languages and Computing Pub Date : 2017-12-01 DOI: 10.1016/j.jvlc.2017.09.001

Xiaomin Yu , Weibin Liu , Weiwei Xing

{"title":"Behavioral segmentation for human motion capture data based on graph cut method","authors":"Xiaomin Yu , Weibin Liu , Weiwei Xing","doi":"10.1016/j.jvlc.2017.09.001","DOIUrl":"https://doi.org/10.1016/j.jvlc.2017.09.001","url":null,"abstract":"<div><p><span>With the development of human motion<span> capture, realistic human motion capture data has been widely implemented to many fields. However, segmenting motion capture data sequences manually into distinct behavior is time-consuming and laborious. In this paper, we introduce an efficient unsupervised method<span> based on graph partition for automatically segmenting motion capture data. For N-Frame motion capture data sequence, we construct an undirected, weighted graph </span></span></span><span><math><mrow><mi>G</mi><mo>=</mo><mi>G</mi><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo><mo>,</mo></mrow></math></span><span> where the node set V represent frames of motion sequence and the weight of the edge set E describes similarity between frames. In this way, behavioral segmentation problem can be transformed into graph cut problem. However, traditional graph cut problem is NP hard. By analyzing the relationship between graph cut and spectral clustering, we apply spectral clustering to the NP hard problem of graph cut. In this paper, two methods of spectral clustering, t-nearest neighbors and the Nystrom method, are employed to cluster motion capture data for getting behavioral segmentation. In addition, we define an energy function to refine the results of behavioral segmentation. Extensive experiments are conducted on the dataset of multi-behavior motion capture data from CMU database. The experimental results prove that our novel method is robust and effective.</span></p></div>","PeriodicalId":54754,"journal":{"name":"Journal of Visual Languages and Computing","volume":"43 ","pages":"Pages 50-59"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jvlc.2017.09.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72090198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 12

Classification and visualization for symbolic people flow data 符号化人流数据的分类与可视化

Journal of Visual Languages and Computing Pub Date : 2017-12-01 DOI: 10.1016/j.jvlc.2017.09.005

Yuri Miyagi , Masaki Onishi , Chiemi Watanabe , Takayuki Itoh , Masahiro Takatsuka

{"title":"Classification and visualization for symbolic people flow data","authors":"Yuri Miyagi , Masaki Onishi , Chiemi Watanabe , Takayuki Itoh , Masahiro Takatsuka","doi":"10.1016/j.jvlc.2017.09.005","DOIUrl":"https://doi.org/10.1016/j.jvlc.2017.09.005","url":null,"abstract":"<div><p><span>People flow information brings us useful knowledge in various industrial and social fields including traffic, disaster prevention, and marketing. However, it is still an open problem to develop effective people flow analysis techniques. We considered compression and data mining techniques are especially important for analysis and visualization of large-scale people flow datasets. This paper presents a visualization method for large-scale people flow dataset featuring compression and data mining techniques. This method firstly compresses the people flow datasets using UniversalSAX, an extended method of SAX (Symbolic Aggregate Approximation). Next, we apply algorithms inspired by </span>natural language processing to extract movement patterns and classify walking routes. After this process, users can interactively observe trajectories and extracted features such as congestions and popular walking routes using a visualization tool. We had experiments of classifying and visualizing walking routes using two types of people flow dataset recorded at an exhibition and a corridor applying our method. The results allow us to discover characteristic movements such as stopping in front of particular exhibits, or persons who passed same places but walked at different speeds.</p></div>","PeriodicalId":54754,"journal":{"name":"Journal of Visual Languages and Computing","volume":"43 ","pages":"Pages 91-102"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jvlc.2017.09.005","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72120846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Visibility widgets for unveiling occluded data in 3D terrain visualization 用于在三维地形可视化中揭示遮挡数据的可见性小部件

Journal of Visual Languages and Computing Pub Date : 2017-10-01 DOI: 10.1016/j.jvlc.2017.08.008

Martin Röhlig, Martin Luboschik, Heidrun Schumann

引用次数: 5

Detecting and resolving deadlocks in mobile agent systems 移动代理系统中死锁的检测与解决

Journal of Visual Languages and Computing Pub Date : 2017-10-01 DOI: 10.1016/j.jvlc.2017.08.002

Yong Yang , Wei Lu , Weiwei Xing , Liqiang Wang , Xiaoping Che , Lei Chen

{"title":"Detecting and resolving deadlocks in mobile agent systems","authors":"Yong Yang , Wei Lu , Weiwei Xing , Liqiang Wang , Xiaoping Che , Lei Chen","doi":"10.1016/j.jvlc.2017.08.002","DOIUrl":"https://doi.org/10.1016/j.jvlc.2017.08.002","url":null,"abstract":"<div><p><span>Mobile agents environment is a new application paradigm with unique features such as mobility and autonomy. Traditional </span>deadlock<span> detection algorithms<span> in distributed computing systems do not work well in mobile agent systems due to the unique feature property of the mobile agent. Existing deadlock detection and resolution algorithms in mobile agent systems have limitations such as performance inefficiency and duplicate detection/resolution when multiple mobile agents simultaneously detect/resolve the same deadlock. To address these problems, we propose an improved deadlock detection and resolution algorithm that adopts priority-based technique and lazy reaction strategy. The priority-based technique aims to ensure that there is only one instance of deadlock detection and resolution, and it also helps reduce mobile agent movement and data traffic together with the lazy reaction strategy. The liveness and safety properties of the proposed algorithm are proved in this paper. Theoretical analysis and experimental results show that the proposed algorithm provides better performance in terms of agent movement, data traffic, and execution time.</span></span></p></div>","PeriodicalId":54754,"journal":{"name":"Journal of Visual Languages and Computing","volume":"42 ","pages":"Pages 23-30"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jvlc.2017.08.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72070732","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

ImAtHome: Making trigger-action programming easy and fun ImAtHome：让触发动作编程变得简单有趣

Journal of Visual Languages and Computing Pub Date : 2017-10-01 DOI: 10.1016/j.jvlc.2017.08.003

Daniela Fogli, Matteo Peroni, Claudia Stefini

引用次数: 20

An effective and efficient approximate two-dimensional dynamic programming algorithm for supporting advanced computer vision applications 一种支持高级计算机视觉应用的高效近似二维动态规划算法

Journal of Visual Languages and Computing Pub Date : 2017-10-01 DOI: 10.1016/j.jvlc.2017.07.002

Alfredo Cuzzocrea , Enzo Mumolo , Giorgio Mario Grasso , Gianni Vercelli

引用次数: 1