Real-time performance can be greatly improved, if the early recognition is implemented. In this paper, a dynamic hand gesture early recognitionsystem is proposed. The system can recognize the gesture before it is com...
详细信息
ISBN:
(纸本)9781479973989
Real-time performance can be greatly improved, if the early recognition is implemented. In this paper, a dynamic hand gesture early recognitionsystem is proposed. The system can recognize the gesture before it is completed. Our method is based on the Hidden Semi-Markov Models. Three-dimensional information of the gesture trajectory collected by leapmotion is the main data we used. Experiments on the dataset which we established demonstrate the effectiveness of our method.
The existing safety and health monitoring methods for bridge construction are mainly manual monitoring and wired monitoring with many disadvantages, such as low efficiency, poor accuracy, great implementation difficul...
详细信息
Nonnegative matrix factorization (NMF) has been successfully applied to many areas of both classification and clustering. Commonly used NMF algorithms mainly target on minimizing the l 2 distance or the Kullback-Leib...
详细信息
ISBN:
(纸本)9781479942145
Nonnegative matrix factorization (NMF) has been successfully applied to many areas of both classification and clustering. Commonly used NMF algorithms mainly target on minimizing the l 2 distance or the Kullback-Leibler (KL) divergence, which may not be suitable for nonlinear cases. In this paper, we propose a new decomposition method by maximizing the correntropy between the original and the product of two low-rank matrices for document clustering. This method also allows us to learn new basis vectors of the semantic feature space from data. To our knowledge, there is no existing work which clusters high dimensional document data by maximizing the correntropy in NMF. Our experimental results show the supremacy of the proposed method over other variants of NMF algorithms on Reuters21578 and TDT2 databasets.
For multi-target route optimization with constraint conditions, the mathematical model for logistics distribution route optimization is built to accelerate response speed of logistics enterprises to customers, improve...
详细信息
For multi-target route optimization with constraint conditions, the mathematical model for logistics distribution route optimization is built to accelerate response speed of logistics enterprises to customers, improve service quality, and strengthen the satisfaction of customers, and a new algorithm with the combination of genetic and ant colony algorithms is proposed to solve the selection issues of such logistics route. Initial pheromone is formed with genetic algorithm, based on which the optimal solution is rapidly sought with ant colony algorithm, and complementary advantages are achieved between above two algorithms. Application examples and simulations are available for calculation, and the results show that such algorithm is practical and effective to optimize logistics distribution route.
Point matching is an important component of image registration. Recent years, Coherent Point Drift (CPD) method becomes a very popular point matching approach. CPD treats point matching as a probability estimation pro...
详细信息
Point matching is an important component of image registration. Recent years, Coherent Point Drift (CPD) method becomes a very popular point matching approach. CPD treats point matching as a probability estimation problem and speeds up the process of matching a lot. In this method, one set of points are thought to be sampled from a Gaussian Mixture Model (GMM), which is centered by the other set of points. However, CPD is sensitive to outliers and noises, especially when the noise ratio increased or the number of outliers gets much high. To deal with this problem, we introduce shape context into the step of searching for matching points and then improve the form of prior probabilities of GMM in this paper. The main idea of our method is that if the most points in a data set are likely to be matched to a particular centroid, this Gaussian component should be have a more influence to GMM. Therefore, we set prior probability of GMM with the similarity between GMM components and the data set. And the computation of similarity is based on shape context. The experiments on 2D and 3D images show that when noise ratio is low, our method performs as well as CPD does, but as the ratio increased, our method is more robust and satisfactory than CPD.
Let $$G=(V, E)$$ be a graph. Denote $$d_G(u, v)$$ the distance between two vertices $$u$$ and $$v$$ in $$G$$ . An $$L(2, 1)$$ -labeling of $$G$$ is a function $$f: V \rightarrow \{0,1,\cdots \}$$ such that for any two...
Let $$G=(V, E)$$ be a graph. Denote $$d_G(u, v)$$ the distance between two vertices $$u$$ and $$v$$ in $$G$$ . An $$L(2, 1)$$ -labeling of $$G$$ is a function $$f: V \rightarrow \{0,1,\cdots \}$$ such that for any two vertices $$u$$ and $$v$$ , $$|f(u)-f(v)| \ge 2$$ if $$d_G(u, v) = 1$$ and $$|f(u)-f(v)| \ge 1$$ if $$d_G(u, v) = 2$$ . The span of $$f$$ is the difference between the largest and the smallest number in $$f(V)$$ . The $$\lambda $$ -number of $$G$$ , denoted $$\lambda (G)$$ , is the minimum span over all $$L(2,1 )$$ -labelings of $$G$$ . In this article, we confirm Conjecture 6.1 stated in X. Li et al. (J Comb Optim 25:716–736, 2013) in the case when (i) $$\ell $$ is even, or (ii) $$\ell \ge 5$$ is odd and $$0 \le r \le 8$$ .
A sequence {ai |1 ≤ i ≤ k} of integers is a weak Sidon sequence if the sums ai + aj are all different for any i i |1 ≤ i ≤ k} such that 1 ≤ a1k ≤ n. Let the weak Sidon number G(k) = min{n | g(n) = k}. In this no...
详细信息
A sequence {ai |1 ≤ i ≤ k} of integers is a weak Sidon sequence if the sums ai + aj are all different for any i i |1 ≤ i ≤ k} such that 1 ≤ a1k ≤ n. Let the weak Sidon number G(k) = min{n | g(n) = k}. In this note, g(n) and G(k) are studied, and g(n) is computed for n ≤ 172, based on which the weak Sidon number G(k) is determined for up to k = 17.
In this paper, we take the advantages of color contrast and color distribution to get high quality saliency maps. The overall procedure flow of our unified framework contains superpixel pre-segmentation, color contras...
详细信息
Multiple kernel learning (MKL) is a widely used kernel learning method, but how to select kernel is lack of theoretical guidance. The performance of MKL is depend on the users' experience, which is difficult to ch...
详细信息
暂无评论