Simultaneous optimization of photostrictive actuator locations,numbers and light intensities for structural shape control using hierarchical genetic algorithm

The present paper introduces an investigation into simultaneous optimization of the PbLaZrTi-based actuator configuration and corresponding applied light intensity for morphing beam structural shapes. A finite element formulation for multiphysics analysis of coupled opto-electro-thermo-mechanical fields in PbLaZrTi ceramics is derived and verified with the theoretical solution and the commercial software ANSYS. This element is then used to simulate beam bending shape control using the orthotropic PbLaZrTi actuators and the simultaneous optimization. In this procedure, the controlling and geometrical variables are simultaneously optimized via a hierarchical genetic algorithm. A bi-coded chromosome is proposed in a hierarchical mode, which consists of some control genes (i.e. actuator location and number) and parametric genes (i.e. applied light intensity). Whether the parametric gene is activated or not is managed by the value of the first-grade control genes. The numerical results demonstrate that the achieved beam bending shapes correlate remarkably well with the expected ones and the simultaneous optimization of photostrictive actuator locations, numbers and light intensities can result in optimal actuator layout with less PbLaZrTi actuators and irradiated light energy. The simulation results also show that the hierarchical genetic algorithm has more superior performance over the conventional real-coded genetic algorithm.     

参数自适应的条件随机场视频分割方法

针对已有算法需要采用一系列参数经验值得到最优视频分割结果的问题,提出根据视频特征自适应地计算视频邻域关系的特征强度函数,构造参数自适应的条件随机场视频分割模型。算法的核心思想是采用视频中像素之间的邻域关系自适应计算各个模型的特征函数,通过条件随机场模型对这些特征能量函数进行约束并利用Gibbs采样算法对该模型进行求解,获得全局优化的分割结果。针对不同环境下的视频分割实验表明,该算法能够很好地逼近最优经验参数所得到的视频分割结果,从而避免定义经验值所导致的算法局限性问题。     

基于篇章的中文地名识别研究

该文介绍了以篇章为单位的中文地名识别方法和系统实现。地名识别包括简单地名识别和复杂地名识别两个阶段。简单地名识别由基于条件随机场的识别模块和基于篇章地名关系的识别模块顺序构成,以原始文本为输入,直接利用地名内部结构和相邻字信息进行地名识别和文本分词,然后利用篇章地名关系和地名性判断进一步处理。复杂地名识别以简单地名识别结果为输入,采用条件随机场识别。系统在封闭测试和开放测试中F-1值分别达到92.87%和89.76%。研究发现,在地名性判断中地名确信度低的字串对于地名识别干扰性较大,篇章地名关系能够在不降低识别精确度的情况下有效提高召回率,综合利用地名短距离和长距离依存关系可以有效提高地名识别效果。     

ControlNet网络在海上油气田开发中的应用

从技术应用背景分析ControlNet网络出现的时代背景及工业领域对该网络的需求状况,全面分析了ControkNet网络概况和系统原理,介绍了构建ControlNet网络的各种设备性能。本文结合工作中工程实例介绍了ControlNet网络的具体应用,探讨了ControlNet网络解决实际工程问题的可行性。     

模糊马尔可夫随机场理论在阴影检测中的应用

阴影的检测是目标检测、目标跟踪、视频监控等领域的一个关键问题。提出了一种基于模糊马尔可夫随机场的阴影检测算法。该算法把阴影检测问题看做是一个求最优化的像素点分类问题。对于输入的视频,提取背景图像,找出阴影和前景目标物体区域。通过计算阴影概率分布,前景概率分布,隶属度函数,建立模糊马尔可夫随机场。应用贝叶斯准则,最大后验(MAP)估计和条件迭代模式(ICM)算法,寻找最优化的模糊马尔可夫随机场,并利用最大隶属度原则消除模糊性,得到阴影检测的结果。实验证明,文中算法具有较好的阴影检测率和目标检测率。     

Results on rotation symmetric polynomials over GF(p)

In this paper, we generalize the recent counting results about rotation symmetric Boolean functions to the rotation symmetric polynomials over finite fields GF(p). By using Möbius function, we obtain some formulas for more general n, the number of variables. Some known formula in Boolean case are simplified.     

Using local transition probability models in Markov random fields for forest change detection

Change detection based on the comparison of independently classified images (i.e. post-classification comparison) is well-known to be negatively affected by classification errors of individual maps. Incorporating spatial-temporal contextual information in the classification helps to reduce the classification errors, thus improving change detection results. In this paper, spatial-temporal Markov Random Fields (MRF) models were used to integrate spatial-temporal information with spectral information for multi-temporal classification in an attempt to mitigate the impacts of classification errors on change detection. One important component in spatial-temporal MRF models is the specification of transition probabilities. Traditionally, a global transition probability model is used that assumes spatial stationarity of transition probabilities across an image scene, which may be invalid if areas have varying transition probabilities. By relaxing the stationarity assumption, we developed two local transition probability models to make the transition model locally adaptive to spatially varying transition probabilities. The first model called locally adjusted global transition model adapts to the local variation by multiplying a pixel-wise probability of change with the global transition model. The second model called pixel-wise transition model was developed as a fully local model based on the estimation of the pixel-wise joint probabilities. When applied to the forest change detection in Paraguay, the two local models showed significant improvements in the accuracy of identifying the change from forest to non-forest compared with traditional models. This indicates that the local transition probability models can present temporal information more accurately in change detection algorithms based on spatial-temporal classification of multi-temporal images. The comparison between the two local transition models showed that the fully local model better captured the spatial heterogeneity of the transition probabilities and achieved more stable and consistent results over different regions of a large image scene.     

High Performance GPU‐based Proximity Queries using Distance Fields

Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics‐based modelling, augmented and virtual reality. We present efficient algorithms for proximity queries between a closed rigid object and an arbitrary, possibly deformable, polygonal mesh. Using graphics hardware to densely sample the distance field of the rigid object over the arbitrary mesh, we compute minimal proximity and collision response information on the graphics processing unit (GPU) using blending and depth buffering, as well as parallel reduction techniques, thus minimizing the readback bottleneck. Although limited to image‐space resolution, our algorithm provides high and steady performance when compared with other similar algorithms. Proximity queries between arbitrary meshes with hundreds of thousands of triangles and detailed distance fields of rigid objects are computed in a few milliseconds at high‐sampling resolution, even in situations with large overlap.     

Nonparametric Bayesian Image Segmentation

Image segmentation algorithms partition the set of pixels of an image into a specific number of different, spatially homogeneous groups. We propose a nonparametric Bayesian model for histogram clustering which automatically determines the number of segments when spatial smoothness constraints on the class assignments are enforced by a Markov Random Field. A Dirichlet process prior controls the level of resolution which corresponds to the number of clusters in data with a unique cluster structure. The resulting posterior is efficiently sampled by a variant of a conjugate-case sampling algorithm for Dirichlet process mixture models. Experimental results are provided for real-world gray value images, synthetic aperture radar images and magnetic resonance imaging data.     

Inter-Image Statistics for 3D Environment Modeling

In this article we present a method for automatically recovering complete and dense depth maps of an indoor environment by fusing incomplete data for the 3D environment modeling problem. The geometry of indoor environments is usually extracted by acquiring a huge amount of range data and registering it. By acquiring a small set of intensity images and a very limited amount of range data, the acquisition process is considerably simplified, saving time and energy consumption. In our method, the intensity and partial range data are registered first by using an image-based registration algorithm. Then, the missing geometric structures are inferred using a statistical learning method that integrates and analyzes the statistical relationships between the visual data and the available depth on terms of small patches. Experiments on real-world data on a variety of sampling strategies demonstrate the feasibility of our method. Electronic Supplementary Material  The online version of this article () contains supplementary material, which is available to authorized users.