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...
详细信息
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.
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...
详细信息
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...
详细信息
It is well known that the backgrounds or the targets always change in real scenes, which weakens the effectiveness of classical tracking algorithms because of frequent model mismatches. In this paper, an object tracki...
详细信息
In this paper, we try to deal with the problem of shadow detection from static images and video sequences. In instead to considering individual regions separately, we use relative illumination conditions between segme...
详细信息
pattern Mining is a popular issue in biological sequence analysis. With the introduction of wildcard gaps, more interesting patterns can be mined. In this paper, we propose a new definition related to pattern frequenc...
详细信息
Weak boundary contrast, inhomogeneous background and overlapped intensity distributions of the object and background are main causes that may lead to failure of boundary detection for many traditional active contour m...
详细信息
ISBN:
(纸本)9781479923427
Weak boundary contrast, inhomogeneous background and overlapped intensity distributions of the object and background are main causes that may lead to failure of boundary detection for many traditional active contour methods. In this paper, we propose a region-based active contour model to address these problems in both local and global ways. A localized active contour framework is developed, in which two local boundary measures are introduced for the evolution of the level set function. These measures are used to select the boundary candidates for boundary preservation such that the evolution of the contour is guided in a reasonable way. The object boundary is determined by a global boundary measure which evaluates the boundary completeness during the entire evolution process. The experiments demonstrate that our method works well against weak boundary contrast, inhomogeneous background and overlapped intensity distributions.
暂无评论