Hierarchy Composition GAN for High-fidelity Image Synthesis

Despite the rapid progress of generative adversarial networks (GANs) in image synthesis in recent years, the existing image synthesis approaches work in either geometry domain or appearance domain alone which often introduces various synthesis artifacts. This paper presents an innovative Hierarchical Composition GAN (HIC-GAN) that incorporates image synthesis in geometry and appearance domains into an end-to-end trainable network and achieves superior synthesis realism in both domains simultaneously. We design an innovative hierarchical composition mechanism that is capable of learning realistic composition geometry and handling occlusions while multiple foreground objects are involved in image composition. In addition, we introduce a novel attention mask mechanism that guides to adapt the appearance of foreground objects which also helps to provide better training reference for learning in geometry domain. Extensive experiments on scene text image synthesis, portrait editing and indoor rendering tasks show that the proposed HIC-GAN achieves superior synthesis performance qualitatively and quantitatively.Comment: 11 pages, 8 figure

Geometric Construction-Based Realization of Spatial Elastic Behaviors in Parallel and Serial Manipulators

This paper addresses the realization of spatial elastic behavior with a parallel or a serial manipulator. Necessary and sufficient conditions for a manipulator (either parallel or serial) to realize a specific elastic behavior are presented and interpreted in terms of the manipulator geometry. These conditions completely decouple the requirements on component elastic properties from the requirements on mechanism kinematics. New construction-based synthesis procedures for spatial elastic behaviors are developed. With these synthesis procedures, one can select each elastic component of a parallel (or serial) mechanism based on the geometry of a restricted space of allowable candidates. With each elastic component selected, the space of allowable candidates is further restricted. For each stage of the selection process, the geometry of the remaining allowable space is described

Sharper and Simpler Nonlinear Interpolants for Program Verification

Interpolation of jointly infeasible predicates plays important roles in various program verification techniques such as invariant synthesis and CEGAR. Intrigued by the recent result by Dai et al.\ that combines real algebraic geometry and SDP optimization in synthesis of polynomial interpolants, the current paper contributes its enhancement that yields sharper and simpler interpolants. The enhancement is made possible by: theoretical observations in real algebraic geometry; and our continued fraction-based algorithm that rounds off (potentially erroneous) numerical solutions of SDP solvers. Experiment results support our tool's effectiveness; we also demonstrate the benefit of sharp and simple interpolants in program verification examples

Progress in Nanoporous Templates: Beyond Anodic Aluminum Oxide and Towards Functional Complex Materials

Successful synthesis of ordered porous, multi-component complex materials requires a series of coordinated processes, typically including fabrication of a master template, deposition of materials within the pores to form a negative structure, and a third deposition or etching process to create the final, functional template. Translating the utility and the simplicity of the ordered nanoporous geometry of binary oxide templates to those comprising complex functional oxides used in energy, electronic, and biology applications has been met with numerous critical challenges. This review surveys the current state of commonly used complex material nanoporous template synthesis techniques derived from the base anodic aluminum oxide (AAO) geometry

Noise in optical synthesis images. I. Ideal Michelson interferometer

We study the distribution of noise in optical images produced by the aperture synthesis technique, in which the principal source of noise is the intrinsic shot noise of photoelectric detection. The results of our analysis are directly applicable to any space-based optical interferometer. We show that the signal-to-noise ratio of images synthesized by such an ideal interferometric array is essentially independent of the details of the beam-combination geometry, the degree of array redundancy, and whether zero-spatial-frequency components are included in image synthesis. However, the distribution of noise does depend on the beam-combination geometry. A highly desirable distribution, one of uniform noise across the entire image, is obtained only when the beams from the n primary apertures are subdivided and combined pairwise on n(n - 1)/2 detectors

Perception of Motion and Architectural Form: Computational Relationships between Optical Flow and Perspective

Perceptual geometry refers to the interdisciplinary research whose objectives focuses on study of geometry from the perspective of visual perception, and in turn, applies such geometric findings to the ecological study of vision. Perceptual geometry attempts to answer fundamental questions in perception of form and representation of space through synthesis of cognitive and biological theories of visual perception with geometric theories of the physical world. Perception of form, space and motion are among fundamental problems in vision science. In cognitive and computational models of human perception, the theories for modeling motion are treated separately from models for perception of form.Comment: 10 pages, 13 figures, submitted and accepted in DoCEIS'2012 Conference: http://www.uninova.pt/doceis/doceis12/home/home.ph

Learning to Synthesize a 4D RGBD Light Field from a Single Image

We present a machine learning algorithm that takes as input a 2D RGB image and synthesizes a 4D RGBD light field (color and depth of the scene in each ray direction). For training, we introduce the largest public light field dataset, consisting of over 3300 plenoptic camera light fields of scenes containing flowers and plants. Our synthesis pipeline consists of a convolutional neural network (CNN) that estimates scene geometry, a stage that renders a Lambertian light field using that geometry, and a second CNN that predicts occluded rays and non-Lambertian effects. Our algorithm builds on recent view synthesis methods, but is unique in predicting RGBD for each light field ray and improving unsupervised single image depth estimation by enforcing consistency of ray depths that should intersect the same scene point. Please see our supplementary video at https://youtu.be/yLCvWoQLnmsComment: International Conference on Computer Vision (ICCV) 201

Shape Completion using 3D-Encoder-Predictor CNNs and Shape Synthesis

We introduce a data-driven approach to complete partial 3D shapes through a combination of volumetric deep neural networks and 3D shape synthesis. From a partially-scanned input shape, our method first infers a low-resolution -- but complete -- output. To this end, we introduce a 3D-Encoder-Predictor Network (3D-EPN) which is composed of 3D convolutional layers. The network is trained to predict and fill in missing data, and operates on an implicit surface representation that encodes both known and unknown space. This allows us to predict global structure in unknown areas at high accuracy. We then correlate these intermediary results with 3D geometry from a shape database at test time. In a final pass, we propose a patch-based 3D shape synthesis method that imposes the 3D geometry from these retrieved shapes as constraints on the coarsely-completed mesh. This synthesis process enables us to reconstruct fine-scale detail and generate high-resolution output while respecting the global mesh structure obtained by the 3D-EPN. Although our 3D-EPN outperforms state-of-the-art completion method, the main contribution in our work lies in the combination of a data-driven shape predictor and analytic 3D shape synthesis. In our results, we show extensive evaluations on a newly-introduced shape completion benchmark for both real-world and synthetic data

Two-View Matching with View Synthesis Revisited

Wide-baseline matching focussing on problems with extreme viewpoint change is considered. We introduce the use of view synthesis with affine-covariant detectors to solve such problems and show that matching with the Hessian-Affine or MSER detectors outperforms the state-of-the-art ASIFT. To minimise the loss of speed caused by view synthesis, we propose the Matching On Demand with view Synthesis algorithm (MODS) that uses progressively more synthesized images and more (time-consuming) detectors until reliable estimation of geometry is possible. We show experimentally that the MODS algorithm solves problems beyond the state-of-the-art and yet is comparable in speed to standard wide-baseline matchers on simpler problems. Minor contributions include an improved method for tentative correspondence selection, applicable both with and without view synthesis and a view synthesis setup greatly improving MSER robustness to blur and scale change that increase its running time by 10% only.Comment: 25 pages, 14 figure