LPNN-based approach for LASSO problem via a sequence of regularized minimizations

In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method.     

电站锅炉制粉系统的爆炸原因与防范对策

火力发电厂制粉系统爆炸事故时有发生 ,重大设备损坏 ,造成了严重的经济损失。本文通过分析研究 ,找出制粉系统爆炸的原因 ,从措施上、煤的质量控制上及制粉系统结构改造上提出了防范的对策。     

Motion and structure interpretation of an optical switch

This paper focuses on tracking, reconstruction and motion estimation of a well-defined MEMS optical switch from a microscopic view. For out-of-view reconstruction, a homography capable of transforming feature points and feature lines between a microscopic image and a CAD model of the switch is implemented. The homography between two sequential microscopic images is decomposed and factorized for motion estimation. Optical flow has also been explored to provide rough estimations of rotation centre and angle. The paper also illustrates motion parameter optimization principles to deal with uncertainty inherent in micro world. After non-linear optimization, estimation accuracy for rotation angle and rotation centre can reach 0.06° and pixel level, respectively.     

浅析露天栈桥改造

结合工程实例，论述了露天栈桥产生裂缝和腐蚀的原因，对栈桥结构进行了评价，提出了加固方案及加固施工中应注意的事项，经使用证明，加固效果良好。     

带限信号高频重建的一种新的正则外推算法

本文提出生种新的带限信号的外推方法，该方法能够很好地抑制噪声干扰，且计算复杂性较低，本文给出算法，证明了收敛性，最后给出了误差计算机实验结果。     

最大熵重建的迭代凸I投影算法

本文探讨了用迭代凸Ｉ投影（ＩｔｅｒａｔｉｖｅＣｏｎｖｅｘＩ－Ｐｒｏｊｅｃｔｉｏｎ，ＩＣＩＰ）算法求解最大熵Ｘ－ＣＴ重建问题．其思路是将这个复杂问题转化为多个简单子问题，然后迭代地求解这种单约束子问题．理论证明，这种算法收敛并能收敛到问题的最大熵解．这种算法形式优美，仿真结果表明算法同时也是有效的．     

A generalized approach to the reconstruction of a restricted class of digitized planar curves

Reconstruction of an original continuous curve and the estimation of its parameters from the digitized version of the curve is a challenging problem, as quantization always causes some loss of information. In this paper, we have developed a scheme for reconstruction which is applicable to a class of curves having at the most two parameters. The class of curves for which the scheme works has also been characterized. We have shown that for one-parameter curves the exact domain of values of the parameter can be obtained. But in the two-parameter case, only the smallest rectangle containing the domain can be realised. The distinctive feature of our scheme is that it provides a unified approach to solve the reconstruction and the domain-finding problem for a class of curves.     

扇形束投影域重建—再投影迭代法

本文所提出的投影域重建——再投影迭代算法可以恢复不完整的扇形束投影数据,从而实现从有限的投影数据重建图象。这种算法把滤波——反投影图象重建过程和再投影的过程纳入一个公式,仅在投影域上估算未知的投影数据,因此避免了重建过程和反投影过程中的插值运算,改善了收敛性,提高了计算精度,缩短了运算时间。模拟实验表明:即使有70％的投影数据丢失,经过两次迭代就能以令人满意的精度恢复丢失的投影数据。     

A geometry-based error estimation for cross-ratios

For choosing specific cross-ratios as 2D projective coordinates in various computer vision applications, a reasonable error analysis model is usually required. This investigation adopts the assumption of normal distribution for positioning errors of point features in an image to formulate the error variances of cross-ratios. Based on a geometry-based error analysis, a straightforward way of identifying the cross-ratios with minimum error variances is proposed. Simulation results show that the proposed approach, as well as a further simplified alternative, yield much better estimations of minimum error variances in terms of accuracy, cost, and stability compared with some other methods, e.g., the one based on the rule given by Georis et al. (IEEE Trans. Pattern Anal. Mach. Intell. 20 (4) (1998) 366). Some causes of the performance differences in the estimations are explained using a special configuration of point features.     

A tolerant approach to reconstruct topology from unorganized trimmed surfaces

Presented in this paper is a topology reconstruction algorithm from a set of unorganized trimmed surfaces. Error-prone small geometric elements are handled to give proper topological information. It gives complete topology to topologically complete models, and it is also tolerant to incomplete models. The proposed algorithm is vertex-based in that clues for topological information are searched from the set of vertices first, not from that of edges.