In this paper we present a new content-based retrieval descriptor, density-based silhouette descriptor (DBS). It characterizes a 3D object with multivariate probability functions of its 2D silhouette features. The new...
详细信息
ISBN:
(纸本)9789898565419
In this paper we present a new content-based retrieval descriptor, density-based silhouette descriptor (DBS). It characterizes a 3D object with multivariate probability functions of its 2D silhouette features. The new descriptor is computationally efficient and induces a permutation property that guarantees invariance at the matching stage. Also, it is insensitive to small shape perturbations and mesh resolution. The retrieval performance on several 3D databases shows that the DBS provides state-of-art discrimination over a broad and heterogeneous set of shape categories.
This paper proposes an automatic salient object extraction framework. Firstly, the saliency model are developed by applying the low level color features and the boundary prior. The initial salient regions are extracte...
详细信息
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$$ .
In this paper, we propose a robust visual tracking algorithm based on online learning of a joint sparse dictionary. The joint sparse dictionary consists of positive and negative sub-dictionaries, which model foregroun...
详细信息
This paper presents a neural network sliding mode control algorithm for position control of modular robot. This method adopts BP neural network to approximate the functional relation between the sliding hyperplane and...
详细信息
ISBN:
(纸本)9781467355339
This paper presents a neural network sliding mode control algorithm for position control of modular robot. This method adopts BP neural network to approximate the functional relation between the sliding hyperplane and the exponential approximation rate. At the same time, the saturation function of sliding mode control algorithm is replaced by a hyperbolic tangent function to realize the boundary design method of the sliding mode control. The results of real-time simulation show that the algorithm proposed in this paper has the merits of fast response, strong robustness, and reducing the chattering of sliding mode control. This method solves the problems that conventional PID algorithm can’t solve under some circumstances, such as complicated environment, great load change, etc.
We propose a novel framework for automatic image segmentation. In this approach, a mixture of several over-segmentation methods are used to produce superpixels and then aggregation is achieved using a cluster ensemble...
详细信息
Aiming at the disadvantages of the traditional off-line vector-based learning algorithm, this paper proposes a kind of Incremental Tensor Principal Component Analysis (ITPCA) algorithm. It represents an image as a ten...
详细信息
As a key technology to implement Semantic Web, linked data have gradually been an academic and industrial concern. Linked data represents a practice of technologies on the web and linked structure data. The goal of li...
详细信息
As a key technology to implement Semantic Web, linked data have gradually been an academic and industrial concern. Linked data represents a practice of technologies on the web and linked structure data. The goal of linked data is to enable people to share structured data on the web as easily as they can share documents today. On the Web of data structured with linked data, users can jump from one dataset to another. Compared with the Web of document which enables one to jump from one document to another, data Web provides much more links and has semantics. Mapping relational databases to RDF is a fundamental problem for the development of linked data. This paper firstly makes an improvement with R2RML to open source software named D2R which can publish linked data, and then takes an example of the data concerning a college enrollment in Sichuan of China in 2011, demonstrating that we can publish the data in RDB into RDF as linked data through the new approach more efficient and make it browsable.
Level set method is convenient in image segmentation for the stabilization and veracity. Gaussian filter is usually taken as a preprocess to reduce the influence of weak edges due to noises, but the disadvantage is ob...
详细信息
In order to settle incremental learning and preserve the space information of images, this paper proposes an incremental tensor discriminant analysis for facial image detection. The proposed algorithm employs tensor r...
详细信息
暂无评论