In this paper, by using C-sequentially sign property for bifunctions, we provide sufficient conditions that ensure the existence of solutions of some vector equilibrium problems in Hausdorff topological vector spaces which ordered by a cone. The conditions which we consider are not imposed on the whole domain of the operators involved, but just on a locally segment-dense subset of the domain.

Image co-segmentation is a challenging computer vision task that aims to segment all pixels of the common objects in an image set. In real-world cases, however, the common objects often vary greatly in poses, locations and scales, making their global shapes highly inconsistent across images and difficult to be segmented. To address this problem, this paper proposes a novel co-segmentation appro...

Let Cb(K) be the set of all bounded continuous (real or complex) functions on a complete metric space K and A a closed subspace of Cb(K). Using the variational method, it is shown that the set of all strong peak functions in A is dense if and only if the set of all strong peak points is a norming subset of A. As a corollary we show that if X is a locally uniformly convex, complex Banach space, ...

We show that, if the Julia set of a transcendental entire function is locally connected, then it takes the form of a spider’s web in the sense defined by Rippon and Stallard. In the opposite direction, we prove that a spider’s web Julia set is always locally connected at a dense subset of buried points. We also show that the set of buried points (the residual Julia set) can be a spider’s web.

Given a nonempty set X, a fuzzy ideal I on X is a collection of subsets of X closed under finite union and subset operations. In this paper we define a space to be locally I fuzzy compact space if every point in the space has an I fuzzy compact neighbourhood. Basic results concerning locally I fuzzy compact spaces are given relating to subspaces, preservation of functions, and products. Classic...

We introduce a generative model of dense flow fields within a layered representation of 3-dimensional scenes. Using probabilistic inference and learning techniques (namely, variational methods), we solve the inverse problem and locally segment the foreground from the background, estimate the nonuniform motion of each, and fill in the disocclusions. To illustrate the usefulness of both the repre...

Given a set S of disjoint line segments in the plane, which we call sites, a segment triangulation of S is a partition of the convex hull of S into sites, edges, and faces. The set of faces is a maximal set of disjoint triangles such that the vertices of each triangle are on three distinct sites. The segment Delaunay triangulation of S is the segment triangulation of S whose faces are inscribab...