完全偏序集中的正交分解

本文提出了完全偏序集中的正交分解的概念,讨论了其存在性与唯一性.提出了完全偏序集的正交基与趋紧正交基等概念,弄清了具有超紧正交基的完全偏序集的结构与性质,及其与正交分解的存在性与唯一性之间的关系,推广了文[9,10]中提出的程序正交展开的理论.     

一种新的图像分析方法——面积直方图

文章提出了面积直方图的概念。从为有序元素集定义面积直方图出发,通过图像的阀值分解及层集等概念,面积直方图被扩展到了灰度图像。典型地,一个灰度图像的面积直方图就是图像中连接元素的面积统计分布。面积直方图描述了图像中基于面积的尺度分布,能够用来分析基于连接操作子处理的图像或图像的面积尺度空间。最后给出了面积直方图的一些应用实例。     

Untangling euler diagrams

In many common data analysis scenarios the data elements are logically grouped into sets. Venn and Euler style diagrams are a common visual representation of such set membership where the data elements are represented by labels or glyphs and sets are indicated by boundaries surrounding their members. Generating such diagrams automatically such that set regions do not intersect unless the corresponding sets have a non-empty intersection is a difficult problem. Further, it may be impossible in some cases if regions are required to be continuous and convex. Several approaches exist to draw such set regions using more complex shapes, however, the resulting diagrams can be difficult to interpret. In this paper we present two novel approaches for simplifying a complex collection of intersecting sets into a strict hierarchy that can be more easily automatically arranged and drawn (Figure 1). In the first approach, we use compact rectangular shapes for drawing each set, attempting to improve the readability of the set intersections. In the second approach, we avoid drawing intersecting set regions by duplicating elements belonging to multiple sets. We compared both of our techniques to the traditional non-convex region technique using five readability tasks. Our results show that the compact rectangular shapes technique was often preferred by experimental subjects even though the use of duplications dramatically improves the accuracy and performance time for most of our tasks. In addition to general set representation our techniques are also applicable to visualization of networks with intersecting clusters of nodes.     

Theoretical foundations of spatially-variant mathematical morphology part I: binary images

We develop a general theory of spatially-variant (SV) mathematical morphology for binary images in the Euclidean space. The basic SV morphological operators (i.e., SV erosion, SV dilation, SV opening and SV closing) are defined. We demonstrate the ubiquity of SV morphological operators by providing a SV kernel representation of increasing operators. The latter representation is a generalization of Matheron's representation theorem of increasing and translation-invariant operators. The SV kernel representation is redundant, in the sense that a smaller subset of the SV kernel is sufficient for the representation of increasing operators. We provide sufficient conditions for the existence of the minimal basis representation in terms of upper-semi-continuity in the hit-or-miss topology. The latter minimal basis representation is a generalization of Maragos' minimal basis representation for increasing and translation-invariant operators. Moreover, we investigate the upper-semi-continuity property of the basic SV morphological operators. Several examples are used to demonstrate that the theory of spatially-variant mathematical morphology provides a general framework for the unification of various morphological schemes based on spatiallyvariant geometrical structuring elements (e.g., circular, affine and motion morphology). Simulation results illustrate the theory of the proposed spatially-variant morphological framework and show its potential power in various image processing applications.     

A new approach based on orthogonal bases of data space to decomposition of mixed pixels for hyperspectral imagery

A new algorithm for decomposition of mixed pixels based on orthogonal bases of data space is proposed in this paper. It is a simplex-based method which extracts endmembers sequentially using computations of largest simplex volumes. At each searching step of this extraction algorithm, searching for the simplex with the largest volume is equivalent to searching for a new orthogonal basis which has the largest norm. The new endmember corresponds to the new basis with the largest norm. This algorithm runs very fast and can also avoid the dilemma in traditional simplex-based endmember extraction algorithms, such as N-FINDR, that it generally produces different sets of final endmembers if different initial conditions are used. Moreover, with this set of orthogonal bases, the proposed algorithm can also determine the proper number of endmembers and finish the unmixing of the original images which the traditional simplex-based algorithms cannot do by themselves. Experimental results of both artificial simulated images and practical remote sensing images demonstrate the algorithm proposed in this paper is a fast and accurate algorithm for the decomposition of mixed pixels.     

基于非参数独立分量分析的说话人识别方法

首先用非参数独立分量分析方法提取表征说话人音频特性的时域基函数组,语音信号可由这些基函数线性组合而成。每个可识别的说话人对应一个不同的基函数组,对某个特定人的输入音频,只有与它对应的基函数组使其系数向量各分量之间的独立性最强(也就是互信息最小)。对待识别音频,分别用已知说话人的时域基函数组计算各自的系数向量,并计算系数向量各分量之间的互信息。互信息最小的基函数组对应的说话人即为识别结果。实验结果表明,即使用很少的测试数据.也能达到很高的识别率。     

强偏序时态模式中混合依赖集的成员籍问题

有效的模式分解算法设计中应着重考虑和解决成员籍问题,时态类型间偏序关系在强偏序时态模式中的存在给解决成员籍问题带来了困难。为了有效解决强偏序时态模式中混合依赖集的成员籍问题,提出了给定时态类型上的偏序混合依赖基、强偏序模式混合依赖基、偏序时态函数依赖和偏序时态多值依赖的混合集闭包、强偏序模式混合闭包等概念,给出了求混合依赖集中属性的依赖基、属性集的闭包的算法,并在此基础上给出了强偏序模式混合依赖集成员籍问题的算法,证明了其正确性及可终止性,对该算法的时间复杂度进行了分析。应用实例表明相关理论和算法能解决强偏序混合依赖集中成员籍问题的判定问题,为解决强偏序时态模式规范化问题以及时态数据库设计提供了理论基础。     

Regular ordered semigroups in terms of fuzzy subsets

Given a set S, a fuzzy subset of S (or a fuzzy set in S) is, by definition, an arbitrary mapping f : S → [0, 1] where [0, 1] is the usual interval of real numbers. If the set S bears some structure, one may distinguish some fuzzy subsets of S in terms of that additional structure. This important concept of a fuzzy set was first introduced by Zadeh. Fuzzy groups have been first considered by Rosenfeld, fuzzy semigroups by Kuroki. A theory of fuzzy sets on ordered groupoids and ordered semigroups can be developed. Some results on ordered groupoids-semigroups have been already given by the same authors in [N. Kehayopulu, M. Tsingelis, Fuzzy sets in ordered groupoids, Semigroup Forum 65 (2002) 128-132; N. Kehayopulu, M. Tsingelis, The embedding of an ordered groupoid into a poe-groupoid in terms of fuzzy sets, Inform. Sci. 152 (2003) 231-236; N. Kehayopulu, M. Tsingelis, Fuzzy bi-ideals in ordered semigroups, Inform. Sci. 171 (2004) 13-28] where S has been endowed with the structure of an ordered semigroup and defined “fuzzy” analogous for several notions that have been proved to be useful in the theory of ordered semigroups. The characterization of regular rings in terms of right and left ideals is well known. The characterization of regular semigroups and regular ordered semigroups in terms of left and right ideals or in terms of left, right ideals and quasi-ideals is well known as well. The characterization of regular le-semigroups (that is lattice ordered semigroups having a greatest element) in terms of right ideal elements and left ideal elements or right, left and quasi-ideal elements is also known. In the present paper we first give the main theorem which characterizes the regular ordered semigroups by means of fuzzy right and fuzzy left ideals. Then we characterize the regular ordered semigroups in terms of fuzzy right, fuzzy left ideals and fuzzy quasi-ideals. The paper serves as an example to show that one can pass from the theory of ordered semigroups to the theory of “fuzzy” ordered semigroups. Some of our results are true for ordered groupoids in general.     

一种参照模糊集的云模型集合论方法研究

参照模糊集构建云模型的集合论方法能够很好地扩展云模型的应用领域。本文提出了一种参照模糊集的云模型集合论方法。对云模型及其组成元素进行了阐述，提出了云集合元素的I运算和P运算，在此基础上给出了云集合的基础运算方法，研究了云集合的截集和分解定理。本文研究对云模型在集合理论方面的拓展具有较好的参考意义。     

On lattice ordered soft sets

Certain type of linguistic terms such as satisfactory, good, very good and excellent have an order among them. In this paper we introduce a new concept of soft sets with some order among the parameters. Some properties of lattice ordered soft sets are given. Lattice ordered soft sets are very useful in particular type of decision making problems where some order exists among the elements of parameters set.     

From the Happened-Before Relation to the Causal Ordered Set Abstraction

Several works in distributed systems have been designed based on the Happened-Before Relation (HBR). Most of these works intend to be efficient in their implementation by identifying and ensuring dependency constraints among single events. Even when the minimal causal dependencies among events have been clearly identified, the evolution of systems, which may involve a high number of processes and a high volume of transmitted data, calls for the need to design even more efficient approaches. This paper proposes the Causal Ordered Set Abstraction (CAOS) where the causally related events are arranged in sets that are strictly causally ordered. As for single events, CAOS establishes that any pair of resultant sets can be, and can only be, causally or concurrently related. We claim that our ordered set abstraction can be used to design more efficient algorithms based on the HBR principle. This assertion is based on two main properties. First, CAOS attains a consistent compact representation of a distributed computation. Second, as a consequence of the causal ordering of the events in the resultant sets, it is sufficient to verify only a pair of single events, one per each set, in order to determine whether these sets are causally or concurrently related, regardless of the cardinality of the sets.     

Updating approximations with dynamic objects based on local multigranulation rough sets in ordered information systems

The main task of local rough set model is to avoid the interference of complicated calculation and invalid information in the formation of approximation space. In this paper, we first present a local rough set model based on dominance relation to make the local rough set theory applicable to the ordered information system, then two kinds of local multigranulation rough set models in the ordered information system are constructed by extending the single granulation environment to a multigranulation case. Moreover, the updating processes of dynamic objects based on global (classical) and local multigranulation rough sets in the ordered information system are analyzed and compared carefully. It is addressed about how the rough approximation spaces of global multigranulation rough set and local multigranulation rough set change when the object set increase or decrease in an ordered information system. The relevant algorithms for updating approximations with dynamic objects on global and local multigranulation rough sets are provided in ordered information systems. To illustrate the superiority and the effectiveness of the proposed dynamic updating approaches in the ordered information system, experimental evaluation is performed using six datasets coming from the University of California-Irvine repository.

     

Inf-Semilattice Approach to Self-Dual Morphology

Today, the theoretical framework of mathematical morphology is phrased in terms of complete lattices and operators defined on them. The characterization of a particular class of operators, such as erosions or openings, depends almost entirely upon the choice of the underlying partial ordering. This is not so strange if one realizes that the partial ordering formalizes the notions of foreground and background of an image. The duality principle for partially ordered sets, which says that the opposite of a partial ordering is also a partial ordering, gives rise to the fact that all morphological operators occur in pairs, e.g., dilation and erosion, opening and closing, etc. This phenomenon often prohibits the construction of tools that treat foreground and background of signals in exactly the same way. In this paper we discuss an alternative framework for morphological image processing that gives rise to image operators which are intrinsically self-dual. As one might expect, this alternative framework is entirely based upon the definition of a new self-dual partial ordering.     

格拉斯曼流形降维及应用研究

视频人脸识别的核心问题是如何准确、高效地构建人脸模型并度量模型的相似性,为此提出一种维数约减的格拉斯曼流形鉴别分析方法以提高集合匹配的性能。首先通过子空间建模图像集合,引入投影映射将格拉斯曼流形上的基本元素表示成对应的投影矩阵。然后,为解决高维矩阵计算开销大以及在小样本条件下不能有效描述样本分布的缺陷,引入二维主成分分析方法对子空间的正交基矩阵降维。通过QR分解正则化降维后的矩阵,得到一个低维、紧致的格拉斯曼流形以获得图像集更好的表达。最后将其投影到高维核空间中进行分类。在公开的视频数据库中的实验结果证明,提出的方法在降低计算开销的同时能够获得较高的正确率,是一种有效的基于集合的对象匹配和人脸识别方法。     

Four- and eight-node hybrid-Trefftz quadrilateral finite element models for helmholtz problem

In this paper, four- and eight-node quadrilateral finite element models which can readily be incorporated into the standard finite element program framework are devised for plane Helmholtz problems. In these models, frame (boundary) and domain approximations are defined. The former is obtained by nodal interpolation and the latter is truncated from Trefftz solution sets. The equality of the two approximations are enforced along the element boundary. Both the Bessel and plane wave solutions are employed to construct the domain approximation. For full rankness, a minimal of four and eight domain modes are required for the four- and eight-node elements, respectively. By using local coordinates and directions, rank sufficient and invariant elements with minimal and close to minimal numbers of domain approximation modes are devised. In most tests, the proposed hybrid-Trefftz elements with the same number of nodes yield close solutions. In absolute majority of the tests, the proposed elements are considerably more accurate than their single-field counterparts.     

Data-driven model reduction-based nonlinear MPC for large-scale distributed parameter systems

Model predictive control (MPC) has been effectively applied in process industries since the 1990s. Models in the form of closed equation sets are normally needed for MPC, but it is often difficult to obtain such formulations for large nonlinear systems. To extend nonlinear MPC (NMPC) application to nonlinear distributed parameter systems (DPS) with unknown dynamics, a data-driven model reduction-based approach is followed. The proper orthogonal decomposition (POD) method is first applied off-line to compute a set of basis functions. Then a series of artificial neural networks (ANNs) are trained to effectively compute POD time coefficients. NMPC, using sequential quadratic programming is then applied. The novelty of our methodology lies in the application of POD's highly efficient linear decomposition for the consequent conversion of any distributed multi-dimensional space-state model to a reduced 1-dimensional model, dependent only on time, which can be handled effectively as a black-box through ANNs. Hence we construct a paradigm, which allows the application of NMPC to complex nonlinear high-dimensional systems, even input/output systems, handled by black-box solvers, with significant computational efficiency. This paradigm combines elements of gain scheduling, NMPC, model reduction and ANN for effective control of nonlinear DPS. The stabilization/destabilization of a tubular reactor with recycle is used as an illustrative example to demonstrate the efficiency of our methodology. Case studies with inequality constraints are also presented.     

Design study of LineSets, a novel set visualization technique

Computing and visualizing sets of elements and their relationships is one of the most common tasks one performs when analyzing and organizing large amounts of data. Common representations of sets such as convex or concave geometries can become cluttered and difficult to parse when these sets overlap in multiple or complex ways, e.g., when multiple elements belong to multiple sets. In this paper, we present a design study of a novel set visual representation, LineSets, consisting of a curve connecting all of the set's elements. Our approach to design the visualization differs from traditional methodology used by the InfoVis community. We first explored the potential of the visualization concept by running a controlled experiment comparing our design sketches to results from the state-of-the-art technique. Our results demonstrated that LineSets are advantageous for certain tasks when compared to concave shapes. We discuss an implementation of LineSets based on simple heuristics and present a study demonstrating that our generated curves do as well as human-drawn ones. Finally, we present two applications of our technique in the context of search tasks on a map and community analysis tasks in social networks.