A moving object segmentation algorithm for static camera via active contours and GMM

Moving object segmentation is one of the most challenging issues in computer vision. In this paper, we propose a new algorithm for static camera foreground segmentation. It combines Gaussian mixture model (GMM) and active contours method, and produces much better results than conventional background subtraction methods. It formulates foreground segmentation as an energy minimization problem and minimizes the energy function using curve evolution method. Our algorithm integrates the GMM background model, shadow elimination term and curve evolution edge stopping term into energy function. It achieves more accurate segmentation than existing methods of the same type. Promising results on real images demonstrate the potential of the presented method. Supported by National Basic Research Program of China (Grant No. 2006CB303105), the Chinese Ministry of Education Innovation Team Fund Project (Grant No. IRT0707), the National Natural Science Foundation of China (Grant Nos. 60673109 and 60801053), Beijing Excellent Doctoral Thesis Program (Grant No. YB20081000401), Beijing Municipal Natural Science Foundation (Grant No. 4082025), and Doctoral Foundation of China (Grant No. 20070004037)     

Communication contention in APN list scheduling algorithm

Task scheduling is an essential aspect of parallel process system. This NP-hard problem assumes fully connected homogeneous processors and ignores contention on the communication links. However, as arbitrary processor network (APN), communication contention has a strong influence on the execution time of a parallel application. This paper investigates the incorporation of contention awareness into task scheduling. The innovation is the idea of dynamically scheduling edges to links, for which we use the earliest finish communication time search algorithm based on shortest-path search method. The other novel idea proposed in this paper is scheduling priority based on recursive rank computation on heterogeneous arbitrary processor network. In the end, to reduce time complexity of algorithm, a parallel algorithm is proposed and speedup O(PPE) is achieved. The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that our scheduling algorithm significantly surpasses classic and static communication contention awareness algorithm, especially for high data transmission rate parallel application. Supported by the National Natural Science Foundation of China (Grant Nos. 90715029 and 60603053), the Cultivation Fund of the Key Scientific and Technical Innovation Project, Ministry of Edacation of China, and the Key Project of Science & Technology of Hunan Province (Grant No. 2006GK2006)     

MIMO free space optical communication based on orthogonal space time block code

An appropriate coding method that can reduce the error rate of communication system is especially important to the free space optical communication. STBC (space-time block code) is an orthogonal encoding method integrating space domain and time domain. The technology can combat fading effectively and improve error rate performance. In this paper, first, an STBC fit for optical communication with intensity modulation and direct detection (IM/DD) is proposed by combining the orthogonality of the Alamouti space-time code and the QPPM modulation. Then, the error rate performance of the system is analyzed under four cases: with or without channel fading, with or without background radiation. At last, this scheme is confirmed by Monte Carlo approach. It is shown that this method not only realizes the full speed rate transmission, and can improve the error rate performance of the system effectively, but also overcomes the scintillation effect exerted by atmosphere turbulence. When the symbol error probability (SEP) is 2×10⁻³, according to the 1× 1 system, the sending power of the 2× 1 system is nearly reduced by 3.5 dBJ, and the 2× 2 system is nearly reduced by 9 dBJ. Supported by the Defence Major Laboratory Fund (Grant No. 9140C3601010701), the Science Special Fund of the Education Department of Shaanxi Province (Grant No. 07JK332), the Natural Science Fund of Shaanxi Province (Grant No. 2007F12), the Science and Technology Project of the Communications of Guangdong Province (Grant No. 2007-26), and the Fund of Excellent Doctor Degree of Xi’an University of Technology (Grant No. 602-210808)     

Hierarchical Approximate Matching for Retrieval of Chinese Historical Calligraphy Character

As historical Chinese calligraphy works are being digitized, the problem of retrieval becomes a new challenge. But, currently no OCR technique can convert calligraphy character images into text, nor can the existing Handwriting Character Recognition approach does not work for it. This paper proposes a novel approach to efficiently retrieving Chinese calligraphy characters on the basis of similarity： calligraphy character image is represented by a collection of discriminative features, and high retrieval speed with reasonable effectiveness is achieved. First, calligraphy characters that have no possibility similar to the query are filtered out step by step by comparing the character complexity, stroke density and stroke protrusion. Then, similar calligraphy characters axe retrieved and ranked according to their matching cost produced by approximate shape match. In order to speed up the retrieval, we employed high dimensional data structure - PK-tree. Finally, the efficiency of the algorithm is demonstrated by a preliminary experiment with 3012 calligraphy character images.     

地面三维激光扫描点云数据处理及建模

本论文以昆明理工大学呈贡校区“昆明理工大学”石碑作为目标场景,利用地面三维激光扫描仪Maptek I-Site 8200SR获取目标场景的点云数据,使用Maptek I-Site Studio 6.0对点云数据进行预处理,包括点云数据的配准、去噪及精简;通过提取特征点云同时结合AutoCAD2014、3ds Max实现对目标场景的建模。研究三维激光扫描点云数据预处理的方法步骤及模型构建过程,通过分析数据处理及建模结果,结合当前的研究状况探讨了模型的相关应用,并展望进一步的研究方向以及工作内容。     

一种快速的三维扫描数据自动配准方法

研究了两幅和多幅深度图像的自动配准问题.在配准两幅深度图像时,结合二维纹理图像配准深度图像,具体过程是:首先,从扫描数据中提取纹理图像,特别地,针对不包含纹理图像的扫描数据提出了一种根据深度图像直接生成纹理图像的方法;然后,基于SIFT(scale-invariant feature transform)特征提取纹理图像中的兴趣像素,并通过预过滤和交叉检验兴趣像素等方法从中找出匹配像素对的候选集;之后,使用RANSAC(random sample consensus)算法,根据三维几何信息的约束找出候选集中正确的匹配像素对和相对应的匹配顶点对,并根据这些匹配顶点对计算出两幅深度图像间的刚体置换矩阵;最后,使用改进的ICP(iterative closest point)算法优化这一结果.在配准多幅深度图像时,提出了一种快速构建模型图的方法,可以避免对任意两幅深度图像作配准,提高了配准速度.该方法已成功应用于多种文物的三维逼真建模.     

ViWoSG: A distributed scene graph of ultramassive distributed virtual environments

An ultra-massive distributed virtual environment generally consists of ultra-massive terrain data and a large quantity of objects and their attribute data, such as 2D/3D geometric models, audio/video, images, vectors, characteristics, etc. In this paper, we propose a novel method for constructing distributed scene graphs with high extensibility. Thismethod can support high concurrent interaction of clients and implement various tasks such as editing, querying, accessing and motion controlling. Some application experiments are performed to demonstrate its efficiency and soundness. Supported by the National Basic Research Program of China (Grant No. 2004CB719403), the National High-Tech Research & Development Program of China (Grant Nos. 2006AA01Z334, 2007AA01Z318, 2009AA01Z324), the National Natural Science Foundation of China (Grant Nos. 60573151, 60703062, 60833007), and the Marine 908-03-01-10 Project     

Modeling plants with sensor data

Sensor data, typically images and laser data, are essential to modeling real plants. However, due to the complex geometry of the plants, the measurement data are generally limited, thereby bringing great difficulties in classifying and constructing plant organs, comprising leaves and branches. The paper presents an approach to modeling plants with the sensor data by detecting reliable sharp features, i.e. the leaf apexes of the plants with leaves and the branch tips of the plants without leaves, on volumes recovered from the raw data. The extracted features provide good estimations of correct positions of the organs. Thereafter, the leaves are reconstructed separately by simply fitting and optimizing a generic leaf model. One advantage of the method is that it involves limited manual intervention. For plants without leaves, we develop an efficient strategy for decomposition-based skeletonization by using the tip features to reconstruct the 3D models from noisy laser data. Experiments show that the sharp feature detection algorithm is effective, and the proposed plant modeling approach is competent in constructing realistic models with sensor data. Supported in part by the National Basic Research Program of China (Grant No. 2004CB318000), the National High-Tech Research & Development Program of China (Grant Nos. 2006AA01Z301, 2006AA01Z302, 2007AA01Z336), Key Grant Project of Chinese Ministry of Education (Grant No. 103001)     

Formal Ontology: Foundation of Domain Knowledge Sharing and Reusing

Domain analysis is the activity of identifying and representing the relevant information in a domain,so that the information can be shared and reused in similar systems.But until now,no efficient approaches are available for capturing and representing the results of domain analysis and then for sharing and reusing the domain knowledge.This paper proposes an ontology-oriented approach for formalizing the domain models.The architecture for the multiple-layer structure of the domain knowledge base is also discussed.And finally,some genetic algorithm-based methods have been given for supporting the knowledge sharing and reusing.     

Illumination Invariant Recognition of Three-Dimensional Texture in Color Images

In this paper, illumination-affine invariant methods are presented based on affine moment normalization techniques, Zernike moments, and multiband correlation functions. The methods are suitable for the illumination invariant recognition of 3D color texture. Complex valued moments (i.e., Zernike moments) and affine moment normalization are used in the derivation of illumination affine invariants where the real valued affine moment invariants fail to provide affine invariants that are independent of illumination changes. Three different moment normalization methods have been used, two of which are based on affine moment normalization technique and the third is based on reducing the affine transformation to a Euclidian transform. It is shown that for a change of illumination and orientation, the affinely normalized Zernike moment matrices are related by a linear transform. Experimental results are obtained in two tests: the first is used with textures of outdoor scenes while the second is performed on the well-known CURET texture database. Both tests show high recognition efficiency of the proposed recognition methods.     

Segment-based coding of color images

Based on the idea of second generation image coding, a novel scheme for coding still images is presented. At first, an image was partitioned with a pulse-coupled neural network; and then an improved chain code and the 2D discrete cosine transform was adopted to encode the shape and the color of its edges respectively. To code its smooth and texture regions, an improved zero-trees strategy based on the 2nd generation wavelet was chosen. After that, the zero-tree chart was selected to rearrange quantified coefficients. And finally some regulations were given according to psychology of various users. Experiments under noiseless channels demonstrate that the proposed method performs better than those of the current one, such as JPEG, CMP, EZW and JPEG2000. Supported by the Senior University Technology Innovation Essential Project Cultivation Fund Project (Grant No. 706028) and the Natural Science Fund of Jiangsu Province (Grant No. BK2007103)     

Realistic modeling and animation of human body based on scanned data

In this paper we propose a novel method for building animation model of real human body from surface scanned data. The human model is represented by a triangular mesh and described as a layered geometric model. The model consists of two layers: the control skeleton generating body animation from motion capture data, and the simplified surface model providing an efficient representation of the skin surface shape. The skeleton is generated automatically from surface scanned data using the feature extraction, and then a point-to-line mapping is used to map the surface model onto the underlying skeleton. The resulting model enables real-time and smooth animation by manipulation of the skeleton while maintaining the surface detail. Compared with earlier approach, the principal advantages of our approach are the automated generation of body control skeletons from the scanned data for real-time animation, and the automatic mapping and animation of the captured human surface shape. The human model constructed in this work can be used for applications of ergonomic design,garment CAD, real-time simulating humans in virtual reality environment and so on.     

Domain-specific formal ontology of archaeology and its application in knowledge acquisition and analysis

Inherent heterogeneity and distribution of knowledge strongly prevent knowledge from sharing and reusing among different agents and software entities, and a formal ontology has been viewed as a promising means to tackle this problem. In this paper, a domain-specific formal ontology of archaeology is presented. The ontology mainly consists of three parts: archaeological categories, their relationships and axioms. The ontology not only captures the semantics of archaeological knowledge, but also provides archaeology with an explicit and forma specification of a shared conceptualization, thus making archaeological knowledge shareable and reusable across humans and machines in a structured fashion. Further, we propose a method to verify ontology correctness based on the individuals of categories. As applications of the ontology, we have developed an ontology-driven approach to knowledge acquisition from archaeological text and a question answering system for archaeological knowledge.     

A Novel Representation and Feature Matching Algorithm for Automatic Pairwise Registration of Range Images

Automatic registration of range images is a fundamental problem in 3D modeling of free-from objects. Various feature matching algorithms have been proposed for this purpose. However, these algorithms suffer from various limitations mainly related to their applicability, efficiency, robustness to resolution, and the discriminating capability of the used feature representation. We present a novel feature matching algorithm for automatic pairwise registration of range images which overcomes these limitations. Our algorithm uses a novel tensor representation which represents semi-local 3D surface patches of a range image by third order tensors. Multiple tensors are used to represent each range image. Tensors of two range images are matched to identify correspondences between them. Correspondences are verified and then used for pairwise registration of the range images. Experimental results show that our algorithm is accurate and efficient. Moreover, it is robust to the resolution of the range images, the number of tensors per view, the required amount of overlap, and noise. Comparisons with the spin image representation revealed that our representation has more discriminating capabilities and performs better at a low resolution of the range images. This work has been provisionally patented under Australian patent number 2004902436 and is sponsored by ARC grant number DP0344338.     

Progress in the Development of National Knowledge Infrastructure

This paper presents the recent process in a long-term research project,called National Knowledge Infrastructure(or NKI).Initiated in the early 2000,the project aims to develop a multi-domain shareable knowledge base for knowledge-intensive applications.To develop NKI,we have used domain-specific ontologies as a solid basis,and have built more than 600 ontologies.Using these ontologies and our knowledge acquisition methods,we have extracted about 1.1 millions of domain assertions.For users to access our NKI knowledge,we have developed a uniform multi-modal human-knowledge interface.We have also implemented a knowledge application programming interface for various applications to share the NKI knowledge.     

Compressed Data Cube for Approximate OLAP Query Processing

Approximate query processing has emerged as an approach to dealing with the huge data volume and complex queries in the environment of data warehouse.In this paper,we present a novel method that provides approximate answers to OLAP queries.Our method is based on building a compressed (approximate) data cube by a clustering technique and using this compressed data cube to provide answers to queries directly,so it improves the performance of the queries.We also provide the algorithm of the OLAP queries and the confidence intervals of query results.An extensive experimental study with the OLAP council benchmark shows the effectiveness and scalability of our cluster-based approach compared to sampling.     

基于投影图像 SURF 特征提取的三维模型配准

针对传统三维模型配准方法存在对点云初始位置有一定要求、模型配准的精度有 时不高等问题,提出了一种基于三维模型投影图像 SURF 特征提取的三维模型配准方法。首先 通过扫描三维模型数据确定投影图像的范围,判断每个投影图像像素所隶属的模型网格,并求 解从投影图像到纹理图像的映射关系,从而获取二维投影图像;然后对这两幅投影图像分别进 行 SURF 特征点的选取与特征值的计算,并按 SURF 特征值进行特征匹配,再根据投影图像像 素点与三维网格端点的映射关系计算三维特征点对;最后通过匹配的特征点对求取模型变换矩 阵完成三维模型的配准。实验结果表明,该方法在配准时间变化不大的前提下,有效提高了配 准精度,并具有较好的鲁棒性。     

Synthetic aperture radar tomography sampling criteria and three-dimensional range migration algorithm with elevation digital spotlighting

Based on the general geometric model of multi-baseline Synthetic Aperture Radar Tomography (To-moSAR), the three-dimensional (3-D) sampling criteria, the analytic expression of the 3-D Point Spread Function (PSF) and the 3-D resolution are derived in the 3-D wavenumber domain in this paper. Considering the relationship between the observation geometry and the size of illuminated scenario, a 3-D Range Migration Algorithm with Elevation Digital Spotlighting (RMA-EDS) is proposed. With this algo-rithm 3-D imag...     

Multivariable direct adaptive decoupling controller using multiple models and a case study

In this paper, a multivariable direct adaptive controller using multiple models without minimum phase assumption is presented to improve the transient response when the parameters of the system jump abruptly. The controller is composed of multiple fixed controller models, a free-running adaptive controller model and a re-initialized adaptive controller model. The fixed controller models are derived from the corresponding fixed system models directly. The adaptive controller models adopt the direct adaptive algorithm to reduce the design calculation. At every instant, the optimal controller is chosen out according to the switching index. The interaction of the system is viewed as the measured disturbance which is eliminated by the choice of the weighing polynomial matrix. The global convergence is obtained. Finally, several simulation examples in a wind tunnel experiment are given to show both effectiveness and practicality of the proposed method. The significance of the proposed method is that it is applicable to a non-minimum phase system, adopting direct adaptive algorithm to overcome the singularity problem during the matrix calculation and realizing decoupling control for a multivariable system. Supported by the National Natural Science Foundation of China (Grant Nos. 60504010, 60864004), the National High-Tech Research and Development Program of China (Grant No. 2008AA04Z129), the Key Project of Chinese Ministry of Education (Grant No. 208071), and the Natural Science Foundation of Jiangxi Province (Grant No. 0611006)     

Univied Parallel Lattice Structures for Block Time—Recursive Real—Valued Duiscrete Gabor Transforms

In this paper,the 1-D real-valued discrete Gabor transform(RDGT)proposed in the previous work and its relationship with the complex-valued discrete Gabor transform(CDGT)are briefly reviewed.Block time-recursive RDGT algorithms for the efficient and fast computation of the 1-D RDGT coefficients and for the fast reconstruction of the original signal from the coefficients are developed in both critical sampling and oversampling cases.Unified parallel lattice structuires for the implementation of the algorithms are studied.And the computational complexity analysis and comparison show that the proposed algorithms provide a more efficient and faster approach to the computation of the discrete Gabor transforms.