Searcharxiv⌕ Search

arXiv subjects

Anders Eriksson

Publications and source records attributed to Anders Eriksson.

At least 37 records · Page 2Linked to original sources

Learning Free-Form Deformations for 3D Object Reconstruction

Representing 3D shape in deep learning frameworks in an accurate, efficient and compact manner still remains an open challenge. Most existing work addresses this issue by employing voxel-based representations. While these approaches benefit greatly from advances in computer vision by generalizing 2D convolutions to the 3D setting, they also have several considerable drawbacks. The computational complexity of voxel-encodings grows cubically with the resolution thus limiting such representations to low-resolution 3D reconstruction. In an attempt to solve this problem, point cloud representations have been proposed. Although point clouds are more efficient than voxel representations as they only cover surfaces rather than volumes, they do not encode detailed geometric information about relationships between points. In this paper we propose a method to learn free-form deformations (FFD) for the task of 3D reconstruction from a single image. By learning to deform points sampled from a high-quality mesh, our trained model can be used to produce arbitrarily dense point clouds or meshes with fine-grained geometry. We evaluate our proposed framework on both synthetic and real-world data and achieve state-of-the-art results on point-cloud and volumetric metrics. Additionally, we qualitatively demonstrate its applicability to label transferring for 3D semantic segmentation.

cs.CV↗

Maximum Consensus Parameter Estimation by Reweighted $\ell_1$ Methods

Robust parameter estimation in computer vision is frequently accomplished by solving the maximum consensus (MaxCon) problem. Widely used randomized methods for MaxCon, however, can only produce {random} approximate solutions, while global methods are too slow to exercise on realistic problem sizes. Here we analyse MaxCon as iterative reweighted algorithms on the data residuals. We propose a smooth surrogate function, the minimization of which leads to an extremely simple iteratively reweighted algorithm for MaxCon. We show that our algorithm is very efficient and in many cases, yields the global solution. This makes it an attractive alternative for randomized methods and global optimizers. The convergence analysis of our method and its fundamental differences from the other iteratively reweighted methods are also presented.

cs.CV↗

Rotation Averaging and Strong Duality

In this paper we explore the role of duality principles within the problem of rotation averaging, a fundamental task in a wide range of computer vision applications. In its conventional form, rotation averaging is stated as a minimization over multiple rotation constraints. As these constraints are non-convex, this problem is generally considered challenging to solve globally. We show how to circumvent this difficulty through the use of Lagrangian duality. While such an approach is well-known it is normally not guaranteed to provide a tight relaxation. Based on spectral graph theory, we analytically prove that in many cases there is no duality gap unless the noise levels are severe. This allows us to obtain certifiably global solutions to a class of important non-convex problems in polynomial time. We also propose an efficient, scalable algorithm that out-performs general purpose numerical solvers and is able to handle the large problem instances commonly occurring in structure from motion settings. The potential of this proposed method is demonstrated on a number of different problems, consisting of both synthetic and real-world data.

cs.CV↗

Image2Mesh: A Learning Framework for Single Image 3D Reconstruction

One challenge that remains open in 3D deep learning is how to efficiently represent 3D data to feed deep networks. Recent works have relied on volumetric or point cloud representations, but such approaches suffer from a number of issues such as computational complexity, unordered data, and lack of finer geometry. This paper demonstrates that a mesh representation (i.e. vertices and faces to form polygonal surfaces) is able to capture fine-grained geometry for 3D reconstruction tasks. A mesh however is also unstructured data similar to point clouds. We address this problem by proposing a learning framework to infer the parameters of a compact mesh representation rather than learning from the mesh itself. This compact representation encodes a mesh using free-form deformation and a sparse linear combination of models allowing us to reconstruct 3D meshes from single images. In contrast to prior work, we do not rely on silhouettes and landmarks to perform 3D reconstruction. We evaluate our method on synthetic and real-world datasets with very promising results. Our framework efficiently reconstructs 3D objects in a low-dimensional way while preserving its important geometrical aspects.

cs.CV↗

Compact Model Representation for 3D Reconstruction

3D reconstruction from 2D images is a central problem in computer vision. Recent works have been focusing on reconstruction directly from a single image. It is well known however that only one image cannot provide enough information for such a reconstruction. A prior knowledge that has been entertained are 3D CAD models due to its online ubiquity. A fundamental question is how to compactly represent millions of CAD models while allowing generalization to new unseen objects with fine-scaled geometry. We introduce an approach to compactly represent a 3D mesh. Our method first selects a 3D model from a graph structure by using a novel free-form deformation FFD 3D-2D registration, and then the selected 3D model is refined to best fit the image silhouette. We perform a comprehensive quantitative and qualitative analysis that demonstrates impressive dense and realistic 3D reconstruction from single images.

cs.CV↗

Richardson-Lucy Deblurring for Moving Light Field Cameras

We generalize Richardson-Lucy (RL) deblurring to 4-D light fields by replacing the convolution steps with light field rendering of motion blur. The method deals correctly with blur caused by 6-degree-of-freedom camera motion in complex 3-D scenes, without performing depth estimation. We introduce a novel regularization term that maintains parallax information in the light field while reducing noise and ringing. We demonstrate the method operating effectively on rendered scenes and scenes captured using an off-the-shelf light field camera. An industrial robot arm provides repeatable and known trajectories, allowing us to establish quantitative performance in complex 3-D scenes. Qualitative and quantitative results confirm the effectiveness of the method, including commonly occurring cases for which previously published methods fail. We include mathematical proof that the algorithm converges to the maximum-likelihood estimate of the unblurred scene under Poisson noise. We expect extension to blind methods to be possible following the generalization of 2-D Richardson-Lucy to blind deconvolution.

cs.CV↗

Reconstruction of annular bi-layered media in cylindrical waveguide section

A radial transverse resonance model for two cylindrical concentric layers with different complex dielectric constants is presented. An inverse problem with four unknowns - 3 physical material parameters and one dimensional dielectric layer thickness parameter- is solved by employing TE110 and TE210 modes with different radial field distribution. First a Newton-Raphson algorithm is used to solve a least square problem with a Lorentzian function (as resonance model and "measured" data generator). Then found resonance frequencies and quality factors are used in a second inverse Newton-Raphson algorithm that solves four transverse resonance equations in order to get four unknown parameters. The use of TE110 and TE210 models offers one dimensional radial tomographic capability. An open ended coax quarter-wave resonator is added to the sensor topology, and the effect on the convergence is investigated.

physics.optics↗

Non-linear Dimensionality Regularizer for Solving Inverse Problems

Consider an ill-posed inverse problem of estimating causal factors from observations, one of which is known to lie near some (un- known) low-dimensional, non-linear manifold expressed by a predefined Mercer-kernel. Solving this problem requires simultaneous estimation of these factors and learning the low-dimensional representation for them. In this work, we introduce a novel non-linear dimensionality regulariza- tion technique for solving such problems without pre-training. We re-formulate Kernel-PCA as an energy minimization problem in which low dimensionality constraints are introduced as regularization terms in the energy. To the best of our knowledge, ours is the first at- tempt to create a dimensionality regularizer in the KPCA framework. Our approach relies on robustly penalizing the rank of the recovered fac- tors directly in the implicit feature space to create their low-dimensional approximations in closed form. Our approach performs robust KPCA in the presence of missing data and noise. We demonstrate state-of-the-art results on predicting missing entries in the standard oil flow dataset. Additionally, we evaluate our method on the challenging problem of Non-Rigid Structure from Motion and our approach delivers promising results on CMU mocap dataset despite the presence of significant occlusions and noise.

cs.CV↗

Demography-adjusted tests of neutrality based on genome-wide SNP data

Tests of the neutral evolution hypothesis are usually built on the standard null model which assumes that mutations are neutral and population size remains constant over time. However, it is unclear how such tests are affected if the last assumption is dropped. Here, we extend the unifying framework for tests based on the site frequency spectrum, introduced by Achaz and Ferretti, to populations of varying size. A key ingredient is to specify the first two moments of the frequency spectrum. We show that these moments can be determined analytically if a population has experienced two instantaneous size changes in the past. We apply our method to data from ten human populations gathered in the 1000 genomes project, estimate their demographies and define demography-adjusted versions of Tajima's $D$, Fay & Wu's $H$, and Zeng's $E$. The adjusted test statistics facilitate the direct comparison between populations and they show that most of the differences among populations seen in the original tests can be explained by demography. We carried out whole genome screens for deviation from neutrality and identified candidate regions of recent positive selection. We provide track files with values of the adjusted and original tests for upload to the UCSC genome browser.

q-bio.PE↗

Determining interaction rules in animal swarms

In this paper we introduce a method for determining local interaction rules in animal swarms. The method is based on the assumption that the behavior of individuals in a swarm can be treated as a set of mechanistic rules. The principal idea behind the technique is to vary parameters that define a set of hypothetical interactions to minimize the deviation between the forces estimated from observed animal trajectories and the forces resulting from the assumed rule set. We demonstrate the method by reconstructing the interaction rules from the trajectories produced by a computer simulation.

physics.bio-ph↗

On the microscopic foundation of dissipative particle dynamics

Mesoscopic particle based fluid models, such as dissipative particle dynamics, are usually assumed to be coarse-grained representations of an underlying microscopic fluid. A fundamental question is whether there exists a map from microscopic particles in these systems to the corresponding coarse-grained particles, such that the coarse-grained system has the same bulk and transport properties as the underlying system. In this letter, we investigate the coarse-graining of microscopic fluids using a Voronoi type projection that has been suggested in several studies. The simulations show that the projection fails in defining coarse-grained particles that have a physically meaningful connection to the microscopic fluid. In particular, the Voronoi projection produces identical coarse-grained equilibrium properties when applied to systems with different microscopic interactions and different bulk properties.

cond-mat.soft↗

Bottom-up derivation of an effective thermostat for united atoms simulations of water

In this article we derive the effective pairwise interactions in a Langevin type united atoms model of water. The interactions are determined from the trajectories of a detailed molecular dynamics simulation of simple point charge water. A standard method is used for estimating the conservative interaction, whereas a new "bottom-up" method is used to determine the effective dissipative and stochastic interactions. We demonstrate that, when compared to the standard united atoms model, the transport properties of the coarse-grained model is significantly improved by the introduction of the derived dissipative and stochastic interactions. The results are compared to a previous study, where a "top-down" approach was used to obtain transport properties consistent with those of the simple point charge water model.

physics.comp-ph↗

A new perspective on the dynamics of fragmented populations

Understanding the time evolution of fragmented animal populations and their habitats, connected by migration, is a problem of both theoretical and practical interest. This paper presents a method for calculating the time evolution of the habitats' population size distribution from a general stochastic dynamic within each habitat, using a deterministic approximation which becomes exact for an infinite number of habitats. Fragmented populations are usually thought to be characterized by a separation of time scale between, on the one hand, colonization and extinction of habitats and, on the other hand, the local population dynamics within each habitat. The analysis in this paper suggests an alternative view: the effective population dynamic stems from a law of large numbers, where stochastic fluctuations in population size of single habitats are buffered through the dispersal pool so that the global population dynamic remains approximately smooth. For illustration, the deterministic approximation is compared to simulations of a stochastic model with density dependent local recruitment and mortality. The article is concluded with a discussion of the general implications of the results, and possible extensions of the method.

q-bio.PE↗

A method for estimating the interactions in dissipative particle dynamics from particle trajectories

We introduce a method for determining the functional form of the stochastic and dissipative interactions in a dissipative particle dynamics (DPD) model from projected phase space trajectories. The DPD model is viewed as a coarse graining of a detailed dynamics that displays a clear time scale separation. Based on the Mori-Zwanzig projection operator method we derive a consistency equation for the stochastic interaction in DPD. The consistency equation can be solved by an iterative boot strapping procedure. Combined with standard techniques for estimating the conservative interaction, our method makes it possible to reconstruct all the forces in a coarse grained DPD model. We demonstrate how the method works by recreating the interactions in a DPD model from its phase space trajectory. Furthermore, we discuss how our method can be used in realistic systems with finite time scale separation.

cond-mat.soft↗

Effective thermostat induced by coarse-graining of SPC water

We investigate how the transport properties of a united atoms fluid with a dissipative particle dynamics thermostat depend on the functional form and magnitude of both the conservative and the stochastic interactions. We demonstrate how the thermostat strongly affects the hydrodynamics, especially diffusion, viscosity, and local escape times. As model system we use SPC water, from which projected trajectories are used to determine the effective interactions in the united atoms model. The simulation results support our argument that the thermostat should be viewed as an integral part of the coarse-grained dynamics, rather than a tool for approaching thermal equilibrium. As our main result we show that the united atoms model with the adjusted effective interactions approximately reproduce the diffusion constant and the viscosity of the underlying detailed SPC water model.

physics.chem-ph↗

Using force covariance to derive effective stochastic interactions in dissipative particle dynamics

There exist methods for determining effective conservative interactions in coarse grained particle based mesoscopic simulations. The resulting models can be used to capture thermal equilibrium behavior, but in the model system we study do not correctly represent transport properties. In this article we suggest the use of force covariance to determine the full functional form of dissipative and stochastic interactions. We show that a combination of the radial distribution function and a force covariance function can be used to determine all interactions in dissipative particle dynamics. Furthermore we use the method to test if the effective interactions in dissipative particle dynamics (DPD) can be adjusted to produce a force covariance consistent with a projection of a microscopic Lennard-Jones simulation. The results indicate that the DPD ansatz may not be consistent with the underlying microscopic dynamics. We discuss how this result relates to theoretical studies reported in the literature.

cond-mat.soft↗

Coarse-Graining and Scaling in Dissipative Particle Dynamics

Dissipative particle dynamics (DPD) is now a well-established method for simulating soft matter systems. However, its applicability was recently questioned because some investigations showed an upper coarse-graining limit that would prevent the applicability of the method to the whole mesoscopic range. This article aims to reestablish DPD as a truly scale-free method by analyzing the problems reported by other authors and by presenting a scaling scheme that allows one to gauge a DPD-simulation to any desired length scale.

cond-mat.soft↗

Broadband UBVRI Photometry of Horizontal-Branch and Metal-Poor Candidates from the HK and Hamburg/ESO Surveys. I

We report broadband UBV and/or BVRI CCD photometry for a total of 1857 stars in the thick-disk and halo populations of the Galaxy. The majority of our targets were selected as candidate field horizontal-branch or other A-type stars (FHB/A, N = 576), or candidate low-metallicity stars (N = 1221), from the HK and Hamburg/ESO objective-prism surveys. Similar data for a small number of additional stars from other samples are also reported. These data are being used for several purposes. In the case of the FHB/A candidates they are used to accurately separate the lower-gravity FHB stars from various higher-gravity A-type stars, a subsample that includes the so-called Blue Metal Poor stars, halo and thick-disk blue stragglers, main-sequence A-type dwarfs, and Am and Ap stars. These data are also being used to derive photometric distance estimates to high-velocity hydrogen clouds in the Galaxy and for improved measurements of the mass of the Galaxy. Photometric data for the metal-poor candidates are being used to refine estimates of stellar metallicity for objects with available medium-resolution spectroscopy, to obtain distance estimates for kinematic analyses, and to establish initial estimates of effective temperature for analysis of high-resolution spectroscopy of the stars for which this information now exists.

astro-ph↗