Segmentation by Continuous Latent Semantic Analysis for Multi-structure Model Fitting

International Journal of Computer Vision - In this paper, we propose a novel continuous latent semantic analysis fitting method, to efficiently and effectively estimate the parameters of model...     

A frequency-aware and energy-saving strategy based on DVFS for Spark

The Journal of Supercomputing - With the fast growth of big data applications, it has brought about a huge increase in the energy consumption for big data processing in Cloud data centers. In this...     

Double Medical Images Zero-Watermarking Algorithm Based on the Chaotic System and Ternary Accurate Polar Complex Exponential Transform

Journal of Mathematical Imaging and Vision - Different from the traditional watermarking schemes, zero-watermarking schemes are lossless embedding methods, which are applicable to be used in...     

An online multiple object tracker based on structure keeper net

We propose a novel online multiple object tracker taking structure information into account. State-of-the-art multi-object tracking (MOT) approaches commonly focus on discriminative appearance features, while neglect in different levels structure information and the core of data association. Addressing this, we design a new tracker fully exploiting structure information and encoding such information into the cost function of the graph matching model. Firstly, a new measurement is proposed to compare the structure similarity of two graphs whose nodes are equal. With this measurement, we define a complete matching which performs association in high efficiency. Secondly, for incomplete matching scenarios, a structure keeper net (SKnet) is designed to adaptively establish the graph for matching. Finally, we conduct extensive experiments on benchmarks including MOT2015 and MOT17. The results demonstrate the competitiveness and practicability of our tracker.

     

SESF-Fuse: an unsupervised deep model for multi-focus image fusion

Neural Computing and Applications - Muti-focus image fusion is the extraction of focused regions from different images to create one all-in-focus fused image. The key point is that only objects...     

双目视觉系统在风洞伞摆角测量中的研究与应用

伞系统是飞行器的重要组成部分,其摆角参数是系统安全性的重要指标之一;针对目前风洞试验中伞摆角难以测量的问题,提出了一种基于双目视觉系统的试验方法,该系统主要由两部CCD相机、图像采集卡和控制计算机组成,通过立体视觉标定和数字图像处理技术解算出空间特征标记的三维坐标,根据坐标的空间几何关系计算出伞摆角参数;试验结果表明该方法应用成功,能够同时获取伞运动过程中投影在正交平面上的竖直和水平摆角,且具有系统组成简单、通用性强的优点,有较高的应用价值。     

基于三维依赖矩阵的故障预测策略设计

针对不同基于状态监测的故障预测方法难以在一个平台下集成和组合的问题,设计了基于故障、测试、衰退信息三维依赖矩阵的故障预测策略设计框架,在框架内给出了故障预测需求设计和预测用测试选择的基本方法,并在灰色预测和支持向量回归预测的基础上,通过融合粒子群和声算法给出了一种灰色支持向量回归智能组合衰退趋势预测分析方法,结合故障预测实例验证了所给方法的有效性和准确性.     

机载塔康设备综合检查仪设计

使用市场上成熟的模块和技术研制机载塔康设备综合检查仪,以降低成本和提高设备的可靠性;根据设备的测试需求,选用嵌入式工业平板电脑、USB-ARINC429通讯卡、USB-数字IO卡、串行接口数字表和自研的塔康信号模拟器等构成检查仪硬件,使用CVI9.0编写了测试程序;应用表明:检查仪集成度高,使用方便,能够完成对塔康设备的自动及手动测试。     

Ambiguity-free edge-bundling for interactive graph visualization

Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e.g., transportation networks, citation networks, or social networks). Graphs with dense edges, however, are difficult to visualize because fast layout and good clarity are not always easily achieved. When the number of edges is large, edge bundling can be used to improve the clarity, but in many cases, the edges could be still too cluttered to permit correct interpretation of the relations between nodes. In this paper, we present an ambiguity-free edge-bundling method especially for improving local detailed view of a complex graph. Our method makes more efficient use of display space and supports detail-on-demand viewing through an interactive interface. We demonstrate the effectiveness of our method with public coauthorship network data.     

Visual reasoning about social networks using centrality sensitivity

In this paper, we study the sensitivity of centrality metrics as a key metric of social networks to support visual reasoning. As centrality represents the prestige or importance of a node in a network, its sensitivity represents the importance of the relationship between this and all other nodes in the network. We have derived an analytical solution that extracts the sensitivity as the derivative of centrality with respect to degree for two centrality metrics based on feedback and random walks. We show that these sensitivities are good indicators of the distribution of centrality in the network, and how changes are expected to be propagated if we introduce changes to the network. These metrics also help us simplify a complex network in a way that retains the main structural properties and that results in trustworthy, readable diagrams. Sensitivity is also a key concept for uncertainty analysis of social networks, and we show how our approach may help analysts gain insight on the robustness of key network metrics. Through a number of examples, we illustrate the need for measuring sensitivity, and the impact it has on the visualization of and interaction with social and other scale-free networks.