Wasserstein GANs (WGANs), built upon the Kantorovich-Rubinstein (KR) duality of distance, is one most theoretically sound GAN models. However, in practice it does not always outperform other variants GANs. This mostly due to imperfect implementation Lipschitz condition required by KR duality. Extensive work has been done community with different implementations constraint, which, however, still...

We develop the fuzzy generalized ordered weighted averaging distance (FGOWAD) operator. It is a new aggregation operator that uses the main characteristics of the generalized OWA (GOWA), the ordered weighted averaging distance (OWAD) and uncertain information represented as fuzzy numbers. This operator includes a wide range of distance measures and aggregation operators such as the fuzzy maximu...

We present an algorithm for computing exact shortest paths, and consequently distance functions, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex triangulated polyhedral surface. The algorithm is generalized to the case when a set of generalized sites is considered, providing their distance field that implicitly represents the Voronoi diag...