Dynamic subspace clustering for very large high-dimensional databases

Emerging high-dimensional data mining applications needs to find interesting clusters embeded in arbitrarily aligned subspaces of lower dimensionality. It is difficult to cluster high-dimensional data objects, when they are sparse and skewed. Updations are quite common in dynamic databases and they are usually processed in batch mode. In very large dynamic databases, it is necessary to perform incremental cluster analysis only to the updations. We present a incremental clustering algorithm for subspace clustering in very high dimensions, which handles both insertion and deletions of datapoints to the backend databases.

Operator-splitting finite element algorithms for computations of high-dimensional parabolic problems

An operator-splitting finite element method for solving high-dimensional parabolic equations is presented. The stability and the error estimates are derived for the proposed numerical scheme. Furthermore, two variants of fully-practical operator-splitting finite element algorithms based on the quadrature points and the nodal points, respectively, are presented. Both the quadrature and the nodal point based operator-splitting algorithms are validated using a three-dimensional (3D) test problem. The numerical results obtained with the full 3D computations and the operator-split 2D + 1D computations are found to be in a good agreement with the analytical solution. Further, the optimal order of convergence is obtained in both variants of the operator-splitting algorithms. (C) 2012 Elsevier Inc. All rights reserved.

Mathematical symbols and computing methods in high dimensional biomimetic informatics and their applications

High dimensional biomimetic informatics (HDBI) is a novel theory of informatics developed in recent years. Its primary object of research is points in high dimensional Euclidean space, and its exploratory and resolving procedures are based on simple geometric computations. However, the mathematical descriptions and computing of geometric objects are inconvenient because of the characters of geometry. With the increase of the dimension and the multiformity of geometric objects, these descriptions are more complicated and prolix especially in high dimensional space. In this paper, we give some definitions and mathematical symbols, and discuss some symbolic computing methods in high dimensional space systematically from the viewpoint of HDBI. With these methods, some multi-variables problems in high dimensional space can be solved easily. Three detailed algorithms are presented as examples to show the efficiency of our symbolic computing methods: the algorithm for judging the center of a circle given three points on this circle, the algorithm for judging whether two points are on the same side of a hyperplane, and the algorithm for judging whether a point is in a simplex constructed by points in high dimensional space. Two experiments in blurred image restoration and uneven lighting image correction are presented for all these algorithms to show their good behaviors.

Iris recognition algorithm based on point covering of high-dimensional space and neural network

In this paper, we constructed a Iris recognition algorithm based on point covering of high-dimensional space and Multi-weighted neuron of point covering of high-dimensional space, and proposed a new method for iris recognition based on point covering theory of high-dimensional space. In this method, irises are trained as "cognition" one class by one class, and it doesn't influence the original recognition knowledge for samples of the new added class. The results of experiments show the rejection rate is 98.9%, the correct cognition rate and the error rate are 95.71% and 3.5% respectively. The experimental results demonstrate that the rejection rate of test samples excluded in the training samples class is very high. It proves the proposed method for iris recognition is effective.

Blind image restoration based on the theory of high-dimensional space geometry

In practical situations, the causes of image blurring are often undiscovered or difficult to get known. However, traditional methods usually assume the knowledge of the blur has been known prior to the restoring process, which are not practicable for blind image restoration. A new method proposed in this paper aims exactly at blind image restoration. The restoration process is transformed into a problem of point distribution analysis in high-dimensional space. Experiments have proved that the restoration could be achieved using this method without re-knowledge of the image blur. In addition, the algorithm guarantees to be convergent and has simple computation.

High dimensional imagery geometry and it's applications

Because of information digitalization and the correspondence of digits and the coordinates, Information Science and high-dimensional space have consanguineous relations. With the transforming from the information issues to the point analysis in high-dimensional space, we proposed a novel computational theory, named High dimensional imagery geometry (HDIG). Some computational algorithms of HDIG have been realized using software, and how to combine with groups of simple operators in some 2D planes to implement the geometrical computations in high-dimensional space is demonstrated in this paper. As the applications, two kinds of experiments of HDIG, which are blurred image restoration and pattern recognition ones, are given, and the results are satisfying.

An algorithm for removing facial makeup disturbances based on high dimensional imaginal geometry

In this paper, a novel algorithm for removing facial makeup disturbances as a face detection preprocess based on high dimensional imaginal geometry is proposed. After simulation and practical application experiments, the algorithm is theoretically analyzed. Its apparent effect of removing facial makeup and the advantages of face detection with this pre-process over face detection without it are discussed. Furthermore, in our experiments with color images, the proposed algorithm even gives some surprises.

Mandarin speech emotion recognition based on high dimensional geometry theory

In this paper, a novel approach for mandarin speech emotion recognition, that is mandarin speech emotion recognition based on high dimensional geometry theory, is proposed. The human emotions are classified into 6 archetypal classes: fear, anger, happiness, sadness, surprise and disgust. According to the characteristics of these emotional speech signals, the amplitude, pitch frequency and formant are used as the feature parameters for speech emotion recognition. The new method called high dimensional geometry theory is applied for recognition. Compared with traditional GSVM model, the new method has some advantages. It is noted that this method has significant values for researches and applications henceforth.

Phylogeny of SARS-CoV based on high-dimensional information geometry

We proposed a novel methodology, which firstly, extracting features from species' complete genome data, using k-tuple, followed by studying the evolutionary relationship between SARS-CoV and other coronavirus species using the method, called "High-dimensional information geometry". We also used the mothod, namely "caculating of Minimum Spanning Tree", to construct the Phyligenetic tree of the coronavirus. From construction of the unrooted phylogenetic tree, we found out that the evolution distance between SARS-CoV and other coronavirus species is comparatively far. The tree accurately rebuilt the three groups of other coronavirus. We also validated the assertion from other literatures that SARS-CoV is similar to the coronavirus species in Group I.

High-Dimensional Space Geometrical Informatics and its applications to image restoration

With a view to solve the problems in modern information science, we put forward a new subject named High-Dimensional Space Geometrical Informatics (HDSGI). It builds a bridge between information science and point distribution analysis in high-dimensional space. A good many experimental results certified the correctness and availability of the theory of HDSGI. The proposed method for image restoration is an instance of its application in signal processing. Using an iterative "further blurring-debluring-further blurring" algorithm, the deblured image could be obtained.

A novel image restoration algorithm based on high-dimensional space geometry

A novel image restoration approach based on high-dimensional space geometry is proposed, which is quite different from the existing traditional image restoration techniques. It is based on the homeomorphisms and "Principle of Homology Continuity" (PHC), an image is mapped to a point in high-dimensional space. Begin with the original blurred image, we get two further blurred images, then the restored image can be obtained through the regressive curve derived from the three points which are mapped form the images. Experiments have proved the availability of this "blurred-blurred-restored" algorithm, and the comparison with the classical Wiener Filter approach is presented in final.

A novel image restoration approach based on point location in high-dimensional space geometry

The goal of image restoration is to restore the original clear image from the existing blurred image without distortion as possible. A novel approach based on point location in high-dimensional space geometry method is proposed, which is quite different from the thought ways of existing traditional image restoration approaches. It is based on the high-dimensional space geometry method, which derives from the fact of the Principle of Homology-Continuity (PHC). Begin with the original blurred image, we get two further blurred images. Through the regressive deducing curve fitted by these three images, the first iterative deblured image could be obtained. This iterative "blurring-debluring-blurring" process is performed till reach the deblured image. Experiments have proved the availability of the proposed approach and achieved not only common image restoration but also blind image restoration which represents the majority of real problems.

A face detection algorithm based on high dimensional space geometry

In this paper, a face detection algorithm which is based on high dimensional space geometry has been proposed. Then after the simulation experiment of Euclidean Distance and the introduced algorithm, it was theoretically analyzed and discussed that the proposed algorithm has apparently advantage over the Euclidean Distance. Furthermore, in our experiments in color images, the proposed algorithm even gives more surprises.

High-Dimensional Space Geometrical Informatics and its applications to image restoration

With a view to solve the problems in modern information science, we put forward a new subject named High-Dimensional Space Geometrical Informatics (HDSGI). It builds a bridge between information science and point distribution analysis in high-dimensional space. A good many experimental results certified the correctness and availability of the theory of HDSGI. The proposed method for image restoration is an instance of its application in signal processing. Using an iterative "further blurring-debluring-further blurring" algorithm, the deblured image could be obtained.