The optimization of porous infill structures via local volume constraints has
become a popular approach in topology optimization. In some design settings,
however, the iterative optimization process c
Motion-compensated motion reconstruction (mcmr) is a powerful concept with considerable potential, consisting of two coupled sub-problems : motion estimation, assuming a known image, and image reconstruction, assuming known motion.
In this work, we propose a learning-based self-supervised framework for mcmr, to efficiently deal with nonrigid motion corruption in cardiac mrimaging.
In this work, we propose a model order reduction framework to deal with
inverse problems in a non-intrusive setting. Inverse problems, especially in a
partial differential equation context, require a
Dynamic neural cellular automata (dynca) is a framework for real-time and controlable dynamic texture synthesis.
Our method is built upon the recently introduced neural cellular automaton (nca) models, and can synthesize infinitely-long and arbitrary-size realistic texture videos in real-time.
The braking performance of the brake system is a target performance that must
be considered for vehicle development. Apparent piston travel (APT) and drag
torque are the most representative factors fo
We demonstrate a lensless three-dimensional microscope that forms image through a single layer of microlens array and reconstructs objects through a geometrical-optics-based pixel back projection algorithm and background suppressions.
Our system enables near real-time object reconstructions across a large volume of 23x23x5 mm^3, with a lateral resolution of 40 um and axial resolution of 300 um.
Pose tracking of tensegrity robots, which are composed of rigid compressive elements (rods) and flexible tensile elements (e.g., cables), has been recognized as a grand challenge in this domain.
This work aims to address what has been recognized as a grand challenge in this domain, i.e., the pose tracking of tensegrity robots through a markerless, vision-based method, as well as novel, onboard sensors that can measure the length of the robot s cables.
Gatys et al. recently introduced a neural algorithm that renders a content
image in the style of another image, achieving so-called style transfer.
However, their framework requires a slow iterative o
With the advent of the big data era, the data quality problem is becoming
more and more crucial. Among many factors, data with missing values is one
primary issue, and thus developing effective imputa
This paper proposes a novel location-free camouflage generation network (lcg-net) that generates result by one inference of high-level features of foreground and background image, and is hundreds of times faster than previous methods.
Specifically, a position-aligned structure fusion (psf) module is devised to guide structure feature fusion based on the point-to-point structure similarity of foreground and background, and introduce local appearance features point-by-point.
We propose a novel method for planning shortest length piecewise-linear
motions through complex environments punctured with static, moving, or even
morphing obstacles. Using a moment optimization appr
Policy networks are a central feature of deep reinforcement learning (RL)
algorithms for continuous control, enabling the estimation and sampling of
high-value actions. From the variational inference
Optimization was recently shown to control the inductive bias in a learning
process, a property referred to as implicit, or iterative regularization. The
estimator obtained iteratively minimizing the
Machine learning is an emerging field which holds the promise to bypass the fundamental computational bottleneck caused by traditional iterative solvers in critical applicationsrequiring near-real-time optimization.
We denote our method as, learning to optimize the optimization process (loop).
Deep (reinforcement) learning systems are sensitive to hyperparameters which are notoriously expensive to tune, typically requiring running iterative processes over multiple epochs or episodes. Tradit
The Gaussian process (GP) regression can be severely biased when the data are
contaminated by outliers. This paper presents a new robust GP regression
algorithm that iteratively trims the most extreme
This paper proposes a novel generative adversarial layout refinement network
for automated floorplan generation. Our architecture is an integration of a
graph-constrained relational GAN and a conditio
Local geometry optimization is an important part of both computational materialsand surface science because it is the path to finding ground state atomic structures and reaction pathways.
This process is slow at the quantum level of theory because it involves an iterative calculation of forces using quantum chemical codes such as density functional theory (dft), which are computationally expensive, and which limit the speed of the optimization algorithms.
Trajectory planning is a key piece in the algorithmic architecture of a
robot. Trajectory planners typically use iterative optimization schemes for
generating smooth trajectories that avoid collisions
Chemical process optimization and control are affected by 1) plant-model mismatch, 2) process disturbances, and 3) constraints for safe operation. Reinforcement learning by policy optimization would b