Modelling and simulation of whirling process based on equivalent cutting volume

The thread whirling is an efficient and precise machining process for manufacturing of screws. The shaping motion of whirling is complex and difficult to model. In this paper, a novel model basing on equivalent cutting volume is proposed. The cutting force and the chip morphology are investigated to validate the model. The simulation of cutting force is in good agreement with the experimental results with error less than 16.5%. A chip with saw-toothed edges is obtained from simulation and for experimental verification. A case study on the effect of the tool edge geometry on cutting forces is also presented. The simulation results show that the tool edge geometry greatly influences the cutting forces. The tool with round edge is a good choice for reducing the cutting forces. The ratio of a_c/R_e holds the balance in selecting the parameter of cutting conditions. The model is applicable for the simulation of whirling process and can be used for parameter optimisation of the cutting tool edge.     

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.     

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

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

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个百分点，说明它能有效剔除误匹配点，进一步提高图像匹配精度。     

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.     

结合MNF变换和Canny算子的遥感影像变化检测

针对大面积区域的多时相遥感影像变化检测的需求，提出了一种基于最小噪声分离（MNF）的Canny边缘检测提取影像变化信息的检测方法。对多时相影像采用多种变换组合成具有多维波段信息的影像，采用最小噪声分离法分离噪声并得到单波段差异图，通过Canny边缘检测法计算梯度幅值，采用高低双阈值法细化边缘，从而提取差异图变化边缘，有效突出了变化信息。以1995年和2003年加扎勒河的两期遥感影像为例，利用两时相影像进行土地覆被变化检测。实验结果表明，该方法适用于监测大面积区域内地物的突变情况。在数据基础上进行最小噪声分离可以有效解决传统Canny边缘检测提取边缘时造成的伪边缘现象，同时采用高低双阈值法有效去除伪边缘点，从而获得更加精确、直观的变化检测效果，在自然地理变化监测、地理国情灾害监测等有很好的应用价值。     

基于5G边缘云的港口统一通信方案研究与实践

5G边缘云具有分布式、灵活组网、快速部署和本地流量分流等优势，在港口等垂直工业领域有很广泛的应用前景，同时对实现港口统一通信也提出了一定的要求。在研究基于5G边缘云的港口统一通信架构的基础上，提出了针对港口现场全域各类要素实现全面感知、支撑自动化业务改造的5G边缘云功能框架。此功能框架能很好地适用于港口场景的有线无线网络融合的统一承载，可作为目前复杂环境下的港口网络统一通信的网络基础设施。最后在某港口码头上对该方案进行了实际验证。     

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.     

ZerNet: Convolutional Neural Networks on Arbitrary Surfaces Via Zernike Local Tangent Space Estimation

In this paper, we propose a novel formulation extending convolutional neural networks (CNN) to arbitrary two-dimensional manifolds using orthogonal basis functions called Zernike polynomials. In many areas, geometric features play a key role in understanding scientific trends and phenomena, where accurate numerical quantification of geometric features is critical. Recently, CNNs have demonstrated a substantial improvement in extracting and codifying geometric features. However, the progress is mostly centred around computer vision and its applications where an inherent grid-like data representation is naturally present. In contrast, many geometry processing problems deal with curved surfaces and the application of CNNs is not trivial due to the lack of canonical grid-like representation, the absence of globally consistent orientation and the incompatible local discretizations. In this paper, we show that the Zernike polynomials allow rigourous yet practical mathematical generalization of CNNs to arbitrary surfaces. We prove that the convolution of two functions can be represented as a simple dot product between Zernike coefficients and the rotation of a convolution kernel is essentially a set of 2 × 2 rotation matrices applied to the coefficients. The key contribution of this work is in such a computationally efficient but rigorous generalization of the major CNN building blocks.