Wasserstein Divergence for GANs

In many domains of computer vision, generative adversarial networks (GANs) have achieved great success, among which the family of Wasserstein GANs (WGANs) is considered to be state-of-the-art due to the theoretical contributions and competitive qualitative performance. However, it is very challenging to approximate the $k$-Lipschitz constraint required by the Wasserstein-1 metric~(W-met). In this paper, we propose a novel Wasserstein divergence~(W-div), which is a relaxed version of W-met and does not require the $k$-Lipschitz constraint. As a concrete application, we introduce a Wasserstein divergence objective for GANs~(WGAN-div), which can faithfully approximate W-div through optimization. Under various settings, including progressive growing training, we demonstrate the stability of the proposed WGAN-div owing to its theoretical and practical advantages over WGANs. Also, we study the quantitative and visual performance of WGAN-div on standard image synthesis benchmarks of computer vision, showing the superior performance of WGAN-div compared to the state-of-the-art methods.Comment: accepted by eccv_2018, correct minor error

Noncommutative motives of Azumaya algebras

Let k be a base commutative ring, R a commutative ring of coefficients, X a quasi-compact quasi-separated k-scheme, A a sheaf of Azumaya algebras over X of rank r, and Hmo(R) the category of noncommutative motives with R-coefficients. Assume that 1/r belongs to R. Under this assumption, we prove that the noncommutative motives with R-coefficients of X and A are isomorphic. As an application, we show that all the R-linear additive invariants of X and A are exactly the same. Examples include (nonconnective) algebraic K-theory, cyclic homology (and all its variants), topological Hochschild homology, etc. Making use of these isomorphisms, we then computer the R-linear additive invariants of differential operators in positive characteristic, of cubic fourfolds containing a plane, of Severi-Brauer varieties, of Clifford algebras, of quadrics, and of finite dimensional k-algebras of finite global dimension. Along the way we establish two results of independent interest. The first one asserts that every element of the Grothendieck group of X which has rank r becomes invertible in the R-linearized Grothendieck group, and the second one that every additive invariant of finite dimensional algebras of finite global dimension is unaffected under nilpotent extensions.Comment: 22 pages; revised versio

New algorithms for the dual of the convex cost network flow problem with application to computer vision

Motivated by various applications to computer vision, we consider an integer convex optimization problem which is the dual of the convex cost network flow problem. In this paper, we first propose a new primal algorithm for computing an optimal solution of the problem. Our primal algorithm iteratively updates primal variables by solving associated minimum cut problems. The main contribution in this paper is to provide a tight bound for the number of the iterations. We show that the time complexity of the primal algorithm is K ¢ T(n;m) where K is the range of primal variables and T(n;m) is the time needed to compute a minimum cut in a graph with n nodes and m edges. We then propose a primal-dual algorithm for the dual of the convex cost network flow problem. The primal-dual algorithm can be seen as a refined version of the primal algorithm by maintaining dual variables (flow) in addition to primal variables. Although its time complexity is the same as that for the primal algorithm, we can expect a better performance practically. We finally consider an application to a computer vision problem called the panoramic stitching problem. We apply several implementations of our primal-dual algorithm to some instances of the panoramic stitching problem and test their practical performance. We also show that our primal algorithm as well as the proofs can be applied to the L\-convex function minimization problem which is a more general problem than the dual of the convex cost network flow problem

PC-CUBE: A Personal Computer Based Hypercube

PC-CUBE is an ensemble of IBM PCs or close compatibles connected in the hypercube topology with ordinary computer cables. Communication occurs at the rate of 115.2 K-band via the RS-232 serial links. Available for PC-CUBE is the Crystalline Operating System III (CrOS III), Mercury Operating System, CUBIX and PLOTIX which are parallel I/O and graphics libraries. A CrOS performance monitor was developed to facilitate the measurement of communication and computation time of a program and their effects on performance. Also available are CXLISP, a parallel version of the XLISP interpreter; GRAFIX, some graphics routines for the EGA and CGA; and a general execution profiler for determining execution time spent by program subroutines. PC-CUBE provides a programming environment similar to all hypercube systems running CrOS III, Mercury and CUBIX. In addition, every node (personal computer) has its own graphics display monitor and storage devices. These allow data to be displayed or stored at every processor, which has much instructional value and enables easier debugging of applications. Some application programs which are taken from the book Solving Problems on Concurrent Processors (Fox 88) were implemented with graphics enhancement on PC-CUBE. The applications range from solving the Mandelbrot set, Laplace equation, wave equation, long range force interaction, to WaTor, an ecological simulation

Application for Monitoring Events of OS Windows

Operačný systém predstavuje základ pre prácu s počítačom. Činnosti, ktoré sa odohrávajú v pozadí, vo vnútri operačného systému sú väčšinou pre bežného užívateža vežkou neznámou. Práca popisuje práve aplikáciu pre odhalenie činností operačného systému Windows. Slúži k monitoravaniu udalostí systému. Popisuje aké techniky boli použité pri implementácii a samotnú implementáciu jednotlivých častí. Práca taktiež popisuje vytvorenú aplikáciu, jej jednotlivé časti. Vysvetľuje teóriu monitorovacích techník a všetkých prvkov operačného systému, ktoré boli k tomu použité.Operation system represents basis for work with computer. Activities, which are in the background, inside operation system are mostly for common user big unknown. This work describes exactly application used to reveal background activities of operation system Windows. Application serves for monitoring system events. This work discribes also techniques which were used for implementation and implementation of individual parts itself. Work also describes created application, its individual parts. Explains theory of monitoring techniques and all components of operation system, which were used for monitoring itself.