Two‐way multi‐view 2‐D/3‐D display combining LC lens and HVxDP panel using novel pixel arrangement

We have developed a two‐way multi‐view 2‐D/3‐D display combining a liquid crystal lens and horizontally and vertically x times‐density pixels (HVxDP) arrangement. The two‐way multi‐view display features the same display resolution in 2‐D and 3‐D modes and a quite small color moiré for landscape and portrait, respectively, when using the HVxDP arrangement. In this paper, we realized suitable 3‐D properties for achieving a good balance between 3‐D moiré and 3‐D crosstalk for landscape and portrait by a two‐way liquid crystal lens with two kinds of focal lengths for the edge part and the center part of the lens.     

Correction of color information of a 3D model using a range intensity image

Most active optical range sensors record, simultaneously with the range image, the amount of light reflected at each measured surface location: this information forms what is called a range intensity image, also known as a reflectance image. This paper proposes a method that uses this type of image for the correction of the color information of a textured 3D model. This color information is usually obtained from color images acquired using a digital camera. The lighting condition for the color images are usually not controlled, thus this color information may not be accurate. On the other hand, the illumination condition for the range intensity image is known since it is obtained from a controlled lighting and observation configuration, as required for the purpose of active optical range measurement. The paper describes a method for combining the two sources of information, towards the goal of compensating for a reference range intensity image is first obtained by considering factors such as sensor properties, or distance and relative surface orientation of the measured surface. The color image of the corresponding surface portion is then corrected using this reference range intensity image. A B-spline interpolation technique is applied to reduce the noise of range intensity images. Finally, a method for the estimation of the illumination color is applied to compensate for the light source color. Experiments show the effectiveness of the correction method using range intensity images.     

基于投影匹配的钢坯端面字符快速识别方法

由于高温及复杂光照的干扰等成像环境的影响,钢坯端面字符自动识别存在很多困难,其实时自动识别难度大。现存的字符识别方法难以适应实际生产现场的需求。文章提出了一种基于投影匹配的快速识别方法,通过将图象二值化后进行垂直投影,直接将一维投影结果进行模板匹配,降低运算维数。大量的现场实验证明,该方法可有效的减少识别时间,提高生产效率,字符的拒识率和误识率较低,可满足生产线的实时要求。     

大气湍流图像像素偏差机理分析

对大气湍流导致图像畸变和像素偏差的因素进行了深入分析,对大气湍流状态下激光发射远距离光束的光束漂移均方值进行仿真,分析光束漂移均方值曲线,为后续对图像畸变、像素偏差校正及克服湍流影响提供有效的理论依据。     

数据归一化方法综述

当今,人工智能已经广泛应用到各个领域中,并取得了显著的效果。数据归一化是人工智能应用落地中的一个重要环节,它有助于避免神经网络因数据量纲的复杂性对数据进行错误建模。在大数据场景下,相当一部分数据是以流的形式先后到达训练点,所以在流场景下数据归一化研究是当前亟待解决的关键问题。目前关于归一化研究的综述较多,大多仅仅针对于批数据的归一化研究,而缺乏对流数据的归一化方法的总结,不具参考性。在批数据归一化研究基础之上,系统化整理并详尽分析了流数据归一化的相关文献,凝练提出了基于流数据的归一化分类方法,并将数据归一化方法划分为批数据的归一化方法和流数据的归一化方法。同时,对这些方法的原理、优势和可以解决的主要问题进行了对比分析,在不同场景下对数据归一化的未来研究方向进行了展望。     

An adaptive threshold in joint approximate diagonalization by assuming exponentially distributed errors

Joint approximate diagonalization (JAD) is one of well-known methods for solving blind source separation. JAD diagonalizes many cumulant matrices of given observed signals as accurately as possible, where the optimization for each pair of signals is repeated until the convergence. In each pair optimization, JAD should decide whether the pair is actually optimized by a convergence decision condition, where a fixed threshold has been employed in many cases. Though a sufficiently small threshold is desirable for the accuracy of results, the speed of convergence is quite slow if the threshold is too small. In this paper, we propose a new decision condition with an adaptive threshold for JAD under a probabilistic framework. First, it is assumed that the errors in JAD (non-diagonal elements in cumulant matrices) are given by the exponential distribution. Next, it is shown that the maximum likelihood estimation of the probabilistic model is equivalent to JAD. Then, an adaptive threshold is theoretically derived by utilizing the model selection theory. Numerical experiments verify the efficiency of the proposed method for blind source separation of artificial sources and natural images. It is also shown that the proposed method is especially effective when the number of samples is limited.     

LMNtal as a hierarchical logic programming language

LMNtal (pronounced “elemental”) is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. LMNtal is an outcome of the attempt to unify constraint-based concurrency and Constraint Handling Rules (CHR), the two notable extensions to concurrent logic programming. LMNtal is intended to be a substrate language of various computational models, especially those addressing concurrency, mobility and multiset rewriting. Although the principal objective of LMNtal was to provide a unifying computational model, it is of interest to equip the formalism with a precise logical interpretation. In this paper, we show that it is possible to give LMNtal a simple logical interpretation based on intuitionistic linear logic and a flattening technique. This enables us to call LMNtal a hierarchical, concurrent linear logic language.     

An efficient Earth Mover's Distance algorithm for robust histogram comparison

We propose EMD-L1: a fast and exact algorithm for computing the Earth Mover's Distance (EMD) between a pair of histograms. The efficiency of the new algorithm enables its application to problems that were previously prohibitive due to high time complexities. The proposed EMD-L1 significantly simplifies the original linear programming formulation of EMD. Exploiting the L1 metric structure, the number of unknown variables in EMD-L1 is reduced to O(N) from O(N2) of the original EMD for a histogram with N bins. In addition, the number of constraints is reduced by half and the objective function of the linear program is simplified. Formally, without any approximation, we prove that the EMD-L1 formulation is equivalent to the original EMD with a L1 ground distance. To perform the EMD-L1 computation, we propose an efficient tree-based algorithm, Tree-EMD. Tree-EMD exploits the fact that a basic feasible solution of the simplex algorithm-based solver forms a spanning tree when we interpret EMD-L1 as a network flow optimization problem. We empirically show that this new algorithm has an average time complexity of O(N2), which significantly improves the best reported supercubic complexity of the original EMD. The accuracy of the proposed methods is evaluated by experiments for two computation-intensive problems: shape recognition and interest point matching using multidimensional histogram-based local features. For shape recognition, EMD-L1 is applied to compare shape contexts on the widely tested MPEG7 shape data set, as well as an articulated shape data set. For interest point matching, SIFT, shape context and spin image are tested on both synthetic and real image pairs with large geometrical deformation, illumination change, and heavy intensity noise. The results demonstrate that our EMD-L1-based solutions outperform previously reported state-of-the-art features and distance measures in solving the two tasks.     

Linearity Analysis of Concurrent Logic Programs

Automatic memory management and the hiding of the notion of pointers are the prominent features of symbolic processing languages. They make programming easy and guarantee the safety of memory references. For the memory management of linked data structures, copying garbage collection is most widely used because of its simplicity and desirable properties. However, if certain properties about runtime storage allocation and the behavior of pointers can be obtaind by static analysis, a compiler may be able to generate object code closer to that of procedural programs. In the fields of parallel, distributed and real-time computation, it is highly desirable to be able to identify data structures in a program that can be managed without using garbage collection. To this end, this paper proposes a framework of linearity analysis for a concurrent logic language Moded Flat GHC, and proves its basic property. The purpose of linearity analysis is to distinguish between fragments of data structures that may be referenced by two or more pointers and those that cannot be referenced by two or more pointers. Data structures with only one reader are amenable to compile-time garbage collection or local reuse. The proposed framework of linearity analysis is constraint-based and involves both equality and implicational constraints. It has been implemented as part of klint v2, a static analyzer for KL1 programs.     

Electrical and structural properties of ortho-chloranil doped zinc phthalocyanine films

Electrical conductivity of evaporated zinc phthalocyanine (ZnPc) films, doped with orthochloranil (o-CA) molecules, is investigated. Benzoico-CA solution is introduced in the film and benzene is removed by vapourization afterwards. The film conductivity at first increased and then decreased with incremental doping. The maximum conductivity of the sample appeared at doping level × (=o-CA/ZnPc) 0.2 and is about 10³ times as large as that of the as-evaporated one. About a ten-fold further increase in the conductivity is obtained by the heat-treatment of 150 °C for 12 h. The conductivity change by doping is explained by taking into account thato-CA molecules behave not only as acceptors in the film but destructively for the film structure. The phase change of ZnPc by benzoic solution is also discussed.