Frequency-domain iterative learning control of a marine vibrator

To the purpose of marine seismic acquisition, new acoustic sources have been developed to reduce the environmental impact. The use of marine vibrators makes it possible to define emission frequency ranges, consequently allowing limitation of the frequencies that disturb marine animal life. Constructing marine vibrators with high efficiency and linear dynamics is however difficult, and the vibrators suffer from both friction, backlash and high-order harmonics. These nonlinear effects, in combination with drifting dynamics, make the required control a crucial and challenging problem. This paper presents a model-based iterative learning control solution, performed in the frequency-domain. Additionally, an adaptive reidentification algorithm is developed to cope with drifting dynamics. The proposed solutions are successfully evaluated in experiments with a marine vibrator.     

一种新柱式

文章介绍了在计算机的帮助下产生的一种全新的柱式。它基于一种基本的折叠手法,其结果所呈现的极其丰富的细节超越了传统cAD工具能够绘制的极限,也超越了肉眼所能观察的极限。这些出乎意料的形式与极其微小的细节来自计算机程序的反复迭代,它们超出了建筑师的经验、教育和历史认知,无论从手法还是结果来看,都是一种彻底的创新。文章还指出,建造如此复杂的细节需要现代化的数字加工技术与独特的加工技巧。     

CroMatcher: An ontology matching system based on automated weighted aggregation and iterative final alignment

In order to perform ontology matching with high accuracy, while at the same time retaining applicability to most diverse input ontologies, the matching process generally incorporates multiple methods. Each of these methods is aimed at a particular ontology component, such as annotations, structure, properties or instances. Adequately combining these methods is one of the greatest challenges in designing an ontology matching system. In a parallel composition of basic matchers, the ability to dynamically set the weights of the basic matchers in the final output, thus making the weights optimal for the given input, is the key breakthrough for obtaining first-rate matching performance. In this paper we present CroMatcher, an ontology matching system, introducing several novelties to the automated weight calculation process. We apply substitute values for matchers that are inapplicable for the particular case and use thresholds to eliminate low-probability alignment candidates. We compare the alignments produced by the matchers and give less weight to the matchers producing mutually similar alignments, whereas more weight is given to those matchers whose alignment is distinct and rather unique. We also present a new, iterative method for producing one-to-one final alignment of ontology structures, which is a significant enhancement of similar non-iterative methods proposed in the literature. CroMatcher has been evaluated against other state-of-the-art matching systems at the OAEI evaluation contest. In a large number of test cases it achieved the highest score, which puts it among the state-of-the-art leaders.     

Comparison of two-level NMPC and ILC strategies for wet-clutch control

Modeling and control of clutch engagements has been recognized as a challenging problem, due to nonlinear and time-varying dynamics, switching discontinuously between two phases. Furthermore, the optimal references are not known a priori and vary with operating conditions. To address these issues a two-level control scheme is proposed, consisting of a learning algorithm at the high level, updating parameterized references to be tracked at the low level. To simplify the tracking, the controls for both phases are separated. In a first implementation, two (non)linear model predictive controllers (NMPCs) are used sequentially, while in a second implementation these are replaced by two Iterative Learning Controllers (ILCs). The performance and robustness are investigated on a test setup with wet-clutches, and it is shown that both implementations combined with suitable high level algorithms result in good engagements.     

一种使用多维度直方图匹配的图像风格迁移算法

在传统的基于直方图匹配的图像风格迁移算法的基础上，提出一种新的基于多维度直方图匹配的图像风格迁移算法。通过构建关于原图像的不同维度的直方图，然后进行原图像和目标图像的匹配，分别得到原图像在不同维度直方图下的风格迁移图像，最后对这些风格迁移后的图像进行融合生成最终的结果。在保持原图像与目标图像整体风格上尽量相似的情形下，同时又使原图像的局部细节尽可能保留，实现整体风格相似却又保留局部细节的平衡。     

Recent Trends,Applications, and Perspectives in 3D Shape Similarity Assessment

The recent introduction of 3D shape analysis frameworks able to quantify the deformation of a shape into another in terms of the variation of real functions yields a new interpretation of the 3D shape similarity assessment and opens new perspectives. Indeed, while the classical approaches to similarity mainly quantify it as a numerical score, map‐based methods also define (dense) shape correspondences. After presenting in detail the theoretical foundations underlying these approaches, we classify them by looking at their most salient features, including the kind of structure and invariance properties they capture, as well as the distances and the output modalities according to which the similarity between shapes is assessed and returned. We also review the usage of these methods in a number of 3D shape application domains, ranging from matching and retrieval to annotation and segmentation. Finally, the most promising directions for future research developments are discussed.     

基于改进网格运动统计特征的图像匹配算法

为了解决尺度不变特征变换（SIFT）算法在图像匹配中匹配正确率低、耗时长等问题，提出一种基于改进网格运动统计特征RANSAC-GMS的图像匹配算法。首先，利用快速旋转不变性特征（ORB）算法对图像进行预匹配，对预匹配的特征点采用网格运动统计（GMS）来支持估计量以实现正确匹配点与错误匹配点的区分；然后，采用改进的随机抽样一致性（RANSAC）算法通过匹配点间的距离相似性对特征点进行筛选，并采用评价函数对筛选后的新数据集进行重新整理，进而实现对误匹配点的剔除。采用Oxford标准图库和现实中拍摄的图像对图像匹配算法进行测试对比，实验结果表明，所提算法在图像匹配中的平均匹配正确率达到91%以上；与GMS、SIFT、ORB等算法相比，该改进算法的近景匹配正确率和远景匹配正确率分别最少提高了16.15个百分点和3.56个百分点，说明它能有效剔除误匹配点，进一步提高图像匹配精度。     

Stochastic resonance in parallel concatenated turbo code decoding

In an array of threshold devices, we examine the effect of noise in improving performance of turbo code decoding. Such a phenomenon of noise-enhanced effect is termed stochastic resonance (SR). When signal is subthreshold, SR is observed by using Gaussian noise during iterative decoding. That is, the minimal bit error ratio (BER) is achieved at some non-zero noise intensity level. Besides, the larger the number of threshold devices is, the more remarkable the SR effect becomes. Especially when noise intensity is nearly optimal, BER approximates to zero after a few decoding iterations. Moreover, when Gaussian mixture noise is utilized, suprathreshold stochastic resonance (SSR) occurs in turbo decoding. These results show the beneficial effect of noise in channel coding and decoding.     

An adaptive control scheme using multiple reference models

This paper develops an extended model reference adaptive control scheme to expand the capacity of state feedback state tracking adaptive control to handle the plant‐model matching uncertainties for single‐input LTI systems. The extended scheme is developed, using multiple reference model systems (only one of which is required to be able to match the controlled plant), and multiple controllers (which are updated from adaptive laws generated from multiple reference model systems based estimation errors), as two key features of such design to relax a plant‐model matching condition. A switching mechanism is constructed using those multiple estimation errors, capable of selecting the suitable control input from the multiple control signals, to achieve the desired system performance. An aircraft flight control example is presented to show the capacity of such design in relaxing a practical design condition. Copyright © 2013 John Wiley & Sons, Ltd.     

Fast pixel-matching for video object segmentation

Video object segmentation, aiming to segment the foreground objects given the annotation of the first frame, has been attracting increasing attentions. Many state-of-the-art approaches have achieved great performance by relying on online model updating or mask-propagation techniques. However, most online models require high computational cost due to model fine-tuning during inference. Most mask-propagation based models are faster but with relatively low performance due to failure to adapt to object appearance variation. In this paper, we are aiming to design a new model to make a good balance between speed and performance. We propose a model, called NPMCA-net, which directly localizes foreground objects based on mask-propagation and non-local technique by matching pixels in reference and target frames. Since we bring in information of both first and previous frames, our network is robust to large object appearance variation, and can better adapt to occlusions. Extensive experiments show that our approach can achieve a new state-of-the-art performance with a fast speed at the same time (86.5% IoU on DAVIS-2016 and 72.2% IoU on DAVIS-2017, with speed of 0.11s per frame) under the same level comparison. Source code is available at https://github.com/siyueyu/NPMCA-net.