Searcharxiv⌕ Search

arXiv subjects

Hao Su

Publications and source records attributed to Hao Su.

At least 199 records · Page 11Linked to original sources
arXiv2021

Design and Actuator Optimization of Lightweight and Compliant Knee Exoskeleton for Mobility Assistance of Children with Crouch Gait

Pediatric exoskeletons offer great promise to increase mobility for children with crouch gait caused by cerebral palsy. A lightweight, compliant and user-specific actuator is critical for maximizing the benefits of an exoskeleton to users. To date, pediatric exoskeletons generally use the same actuators as adult exoskeletons, which are heavy and resistive to natural movement. There is yet no easy way for robotic exoskeletons to accommodate the changes in design requirements that occur as a child ages. We developed a lightweight (1.65 kg unilateral mass) and compliant pediatric knee exoskeleton with a bandwidth of 22.6 Hz that can provide torque assistance to children with crouch gait using high torque density motor. Experimental results demonstrated that the robot exhibited low mechanical impedance (1.79 Nm average backdrive torque) under the unpowered condition and 0.32 Nm with zero-torque tracking control. Root mean square (RMS) error of torque tracking result is less than 0.73 Nm (5.7% with respect to 12 Nm torque). To achieve optimal age-specific performance, we proposed the first optimization framework that considered both motor and transmission of the actuator system that can produce optimal settings for children between 3 and 18 years old. The optimization generated an optimal motor air gap radius that monotonically increases with age from 0.011 to 0.033 meters, and optimal gear ratio varies from 2.6 to 11.6 (3-13 years old) and 11.6 to 10.2 (13-18 years old), leading to actuators of minimal mass.

cs.RO↗
arXiv2020

MangaGAN: Unpaired Photo-to-Manga Translation Based on The Methodology of Manga Drawing

Manga is a world popular comic form originated in Japan, which typically employs black-and-white stroke lines and geometric exaggeration to describe humans' appearances, poses, and actions. In this paper, we propose MangaGAN, the first method based on Generative Adversarial Network (GAN) for unpaired photo-to-manga translation. Inspired by how experienced manga artists draw manga, MangaGAN generates the geometric features of manga face by a designed GAN model and delicately translates each facial region into the manga domain by a tailored multi-GANs architecture. For training MangaGAN, we construct a new dataset collected from a popular manga work, containing manga facial features, landmarks, bodies, and so on. Moreover, to produce high-quality manga faces, we further propose a structural smoothing loss to smooth stroke-lines and avoid noisy pixels, and a similarity preserving module to improve the similarity between domains of photo and manga. Extensive experiments show that MangaGAN can produce high-quality manga faces which preserve both the facial similarity and a popular manga style, and outperforms other related state-of-the-art methods.

cs.CV↗
arXiv2020

Medical Robots for Infectious Diseases: Lessons and Challenges from the COVID-19 Pandemic

Medical robots can play an important role in mitigating the spread of infectious diseases and delivering quality care to patients during the COVID-19 pandemic. Methods and procedures involving medical robots in the continuum of care, ranging from disease prevention, screening, diagnosis, treatment, and homecare have been extensively deployed and also present incredible opportunities for future development. This paper provides an overview of the current state-of-the-art, highlighting the enabling technologies and unmet needs for prospective technological advances within the next 5-10 years. We also identify key research and knowledge barriers that need to be addressed in developing effective and flexible solutions to ensure preparedness for rapid and scalable deployment to combat infectious diseases.

cs.RO↗
arXiv2020

An End-to-end Method for Producing Scanning-robust Stylized QR Codes

Quick Response (QR) code is one of the most worldwide used two-dimensional codes.~Traditional QR codes appear as random collections of black-and-white modules that lack visual semantics and aesthetic elements, which inspires the recent works to beautify the appearances of QR codes. However, these works adopt fixed generation algorithms and therefore can only generate QR codes with a pre-defined style. In this paper, combining the Neural Style Transfer technique, we propose a novel end-to-end method, named ArtCoder, to generate the stylized QR codes that are personalized, diverse, attractive, and scanning-robust.~To guarantee that the generated stylized QR codes are still scanning-robust, we propose a Sampling-Simulation layer, a module-based code loss, and a competition mechanism. The experimental results show that our stylized QR codes have high-quality in both the visual effect and the scanning-robustness, and they are able to support the real-world application.

cs.CV↗
arXiv2020

Rearrangement: A Challenge for Embodied AI

We describe a framework for research and evaluation in Embodied AI. Our proposal is based on a canonical task: Rearrangement. A standard task can focus the development of new techniques and serve as a source of trained models that can be transferred to other settings. In the rearrangement task, the goal is to bring a given physical environment into a specified state. The goal state can be specified by object poses, by images, by a description in language, or by letting the agent experience the environment in the goal state. We characterize rearrangement scenarios along different axes and describe metrics for benchmarking rearrangement performance. To facilitate research and exploration, we present experimental testbeds of rearrangement scenarios in four different simulation environments. We anticipate that other datasets will be released and new simulation platforms will be built to support training of rearrangement agents and their deployment on physical systems.

cs.AI↗
arXiv2020

Towards Scale-Invariant Graph-related Problem Solving by Iterative Homogeneous Graph Neural Networks

Current graph neural networks (GNNs) lack generalizability with respect to scales (graph sizes, graph diameters, edge weights, etc..) when solving many graph analysis problems. Taking the perspective of synthesizing graph theory programs, we propose several extensions to address the issue. First, inspired by the dependency of the iteration number of common graph theory algorithms on graph size, we learn to terminate the message passing process in GNNs adaptively according to the computation progress. Second, inspired by the fact that many graph theory algorithms are homogeneous with respect to graph weights, we introduce homogeneous transformation layers that are universal homogeneous function approximators, to convert ordinary GNNs to be homogeneous. Experimentally, we show that our GNN can be trained from small-scale graphs but generalize well to large-scale graphs for a number of basic graph theory problems. It also shows generalizability for applications of multi-body physical simulation and image-based navigation problems.

cs.LG↗
arXiv2020

Refactoring Policy for Compositional Generalizability using Self-Supervised Object Proposals

We study how to learn a policy with compositional generalizability. We propose a two-stage framework, which refactorizes a high-reward teacher policy into a generalizable student policy with strong inductive bias. Particularly, we implement an object-centric GNN-based student policy, whose input objects are learned from images through self-supervised learning. Empirically, we evaluate our approach on four difficult tasks that require compositional generalizability, and achieve superior performance compared to baselines.

cs.CV↗
arXiv2020

Adversarial shape perturbations on 3D point clouds

The importance of training robust neural network grows as 3D data is increasingly utilized in deep learning for vision tasks in robotics, drone control, and autonomous driving. One commonly used 3D data type is 3D point clouds, which describe shape information. We examine the problem of creating robust models from the perspective of the attacker, which is necessary in understanding how 3D neural networks can be exploited. We explore two categories of attacks: distributional attacks that involve imperceptible perturbations to the distribution of points, and shape attacks that involve deforming the shape represented by a point cloud. We explore three possible shape attacks for attacking 3D point cloud classification and show that some of them are able to be effective even against preprocessing steps, like the previously proposed point-removal defenses.

cs.CV↗
arXiv2020

Multi-task Batch Reinforcement Learning with Metric Learning

We tackle the Multi-task Batch Reinforcement Learning problem. Given multiple datasets collected from different tasks, we train a multi-task policy to perform well in unseen tasks sampled from the same distribution. The task identities of the unseen tasks are not provided. To perform well, the policy must infer the task identity from collected transitions by modelling its dependency on states, actions and rewards. Because the different datasets may have state-action distributions with large divergence, the task inference module can learn to ignore the rewards and spuriously correlate $\textit{only}$ state-action pairs to the task identity, leading to poor test time performance. To robustify task inference, we propose a novel application of the triplet loss. To mine hard negative examples, we relabel the transitions from the training tasks by approximating their reward functions. When we allow further training on the unseen tasks, using the trained policy as an initialization leads to significantly faster convergence compared to randomly initialized policies (up to $80\%$ improvement and across 5 different Mujoco task distributions). We name our method $\textbf{MBML}$ ($\textbf{M}\text{ulti-task}$ $\textbf{B}\text{atch}$ RL with $\textbf{M}\text{etric}$ $\textbf{L}\text{earning}$).

cs.LG↗
arXiv2020

Photon-Driven Neural Path Guiding

Although Monte Carlo path tracing is a simple and effective algorithm to synthesize photo-realistic images, it is often very slow to converge to noise-free results when involving complex global illumination. One of the most successful variance-reduction techniques is path guiding, which can learn better distributions for importance sampling to reduce pixel noise. However, previous methods require a large number of path samples to achieve reliable path guiding. We present a novel neural path guiding approach that can reconstruct high-quality sampling distributions for path guiding from a sparse set of samples, using an offline trained neural network. We leverage photons traced from light sources as the input for sampling density reconstruction, which is highly effective for challenging scenes with strong global illumination. To fully make use of our deep neural network, we partition the scene space into an adaptive hierarchical grid, in which we apply our network to reconstruct high-quality sampling distributions for any local region in the scene. This allows for highly efficient path guiding for any path bounce at any location in path tracing. We demonstrate that our photon-driven neural path guiding method can generalize well on diverse challenging testing scenes that are not seen in training. Our approach achieves significantly better rendering results of testing scenes than previous state-of-the-art path guiding methods.

cs.GR↗
arXiv2020

Meshing Point Clouds with Predicted Intrinsic-Extrinsic Ratio Guidance

We are interested in reconstructing the mesh representation of object surfaces from point clouds. Surface reconstruction is a prerequisite for downstream applications such as rendering, collision avoidance for planning, animation, etc. However, the task is challenging if the input point cloud has a low resolution, which is common in real-world scenarios (e.g., from LiDAR or Kinect sensors). Existing learning-based mesh generative methods mostly predict the surface by first building a shape embedding that is at the whole object level, a design that causes issues in generating fine-grained details and generalizing to unseen categories. Instead, we propose to leverage the input point cloud as much as possible, by only adding connectivity information to existing points. Particularly, we predict which triplets of points should form faces. Our key innovation is a surrogate of local connectivity, calculated by comparing the intrinsic/extrinsic metrics. We learn to predict this surrogate using a deep point cloud network and then feed it to an efficient post-processing module for high-quality mesh generation. We demonstrate that our method can not only preserve details, handle ambiguous structures, but also possess strong generalizability to unseen categories by experiments on synthetic and real data. The code is available at https://github.com/Colin97/Point2Mesh.

cs.CV↗
arXiv2020

Weakly-supervised 3D Shape Completion in the Wild

3D shape completion for real data is important but challenging, since partial point clouds acquired by real-world sensors are usually sparse, noisy and unaligned. Different from previous methods, we address the problem of learning 3D complete shape from unaligned and real-world partial point clouds. To this end, we propose a weakly-supervised method to estimate both 3D canonical shape and 6-DoF pose for alignment, given multiple partial observations associated with the same instance. The network jointly optimizes canonical shapes and poses with multi-view geometry constraints during training, and can infer the complete shape given a single partial point cloud. Moreover, learned pose estimation can facilitate partial point cloud registration. Experiments on both synthetic and real data show that it is feasible and promising to learn 3D shape completion through large-scale data without shape and pose supervision.

cs.CV↗
arXiv2020

Deep Keypoint-Based Camera Pose Estimation with Geometric Constraints

Estimating relative camera poses from consecutive frames is a fundamental problem in visual odometry (VO) and simultaneous localization and mapping (SLAM), where classic methods consisting of hand-crafted features and sampling-based outlier rejection have been a dominant choice for over a decade. Although multiple works propose to replace these modules with learning-based counterparts, most have not yet been as accurate, robust and generalizable as conventional methods. In this paper, we design an end-to-end trainable framework consisting of learnable modules for detection, feature extraction, matching and outlier rejection, while directly optimizing for the geometric pose objective. We show both quantitatively and qualitatively that pose estimation performance may be achieved on par with the classic pipeline. Moreover, we are able to show by end-to-end training, the key components of the pipeline could be significantly improved, which leads to better generalizability to unseen datasets compared to existing learning-based methods.

cs.CV↗
arXiv2020

Information-Theoretic Local Minima Characterization and Regularization

Recent advances in deep learning theory have evoked the study of generalizability across different local minima of deep neural networks (DNNs). While current work focused on either discovering properties of good local minima or developing regularization techniques to induce good local minima, no approach exists that can tackle both problems. We achieve these two goals successfully in a unified manner. Specifically, based on the observed Fisher information we propose a metric both strongly indicative of generalizability of local minima and effectively applied as a practical regularizer. We provide theoretical analysis including a generalization bound and empirically demonstrate the success of our approach in both capturing and improving the generalizability of DNNs. Experiments are performed on CIFAR-10, CIFAR-100 and ImageNet for various network architectures.

cs.LG↗
arXiv2020

Magnetism-induced topological transition in EuAs3

The nature of the interaction between magnetism and topology in magnetic topological semimetals remains mysterious, but may be expected to lead to a variety of novel physics. We present $ab$ $initio$ band calculations, electrical transport and angle-resolved photoemission spectroscopy (ARPES) measurements on the magnetic semimetal EuAs$_3$, demonstrating a magnetism-induced topological transition from a topological nodal-line semimetal in the paramagnetic or the spin-polarized state to a topological massive Dirac metal in the antiferromagnetic (AFM) ground state at low temperature, featuring a pair of massive Dirac points, inverted bands and topological surface states on the (010) surface. Shubnikov-de Haas (SdH) oscillations in the AFM state identify nonzero Berry phase and a negative longitudinal magnetoresistance ($n$-LMR) induced by the chiral anomaly, confirming the topological nature predicted by band calculations. When magnetic moments are fully polarized by an external magnetic field, an unsaturated and extremely large magnetoresistance (XMR) of $\sim$ 2$\times10^5$ % at 1.8 K and 28.3 T is observed, likely arising from topological protection. Consistent with band calculations for the spin-polarized state, four new bands in quantum oscillations different from those in the AFM state are discerned, of which two are topologically protected. Nodal-line structures at the $Y$ point in the Brillouin zone (BZ) are proposed in both the spin-polarized and paramagnetic states, and the latter is proven by ARPES. Moreover, a temperature-induced Lifshitz transition accompanied by the emergence of a new band below 3 K is revealed. These results indicate that magnetic EuAs$_3$ provides a rich platform to explore exotic physics arising from the interaction of magnetism with topology.

cond-mat.mtrl-sci↗
arXiv2020

Electronic structure of a Si-containing topological Dirac semimetal CaAl2Si2

There has been an upsurge in the discovery of topological quantum materials, where various topological insulators and semimetals have been theoretically predicted and experimentally observed. However, only very few of them contains silicon, the most widely used element in electronic industry. Recently, ternary compound CaAl2Si2 has been predicted to be a topological Dirac semimetal, hosting Lorentz-symmetry-violating quasiparticles with a strongly tilted conical band dispersion. In this work, by using high-resolution angle-resolved photoemission spectroscopy (ARPES), we investigated the comprehensive electronic structure of CaAl2Si2. A pair of topological Dirac crossings is observed along the kz direction, in good agreement with the ab initio calculations, confirming the topological Dirac semimetal nature of the compound. Our study expands the topological material family on Si-containing compounds, which have great application potential in realizing low-cost, nontoxic electronic device with topological quantum states.

cond-mat.mtrl-sci↗
arXiv2020

Rethinking Sampling in 3D Point Cloud Generative Adversarial Networks

In this paper, we examine the long-neglected yet important effects of point sampling patterns in point cloud GANs. Through extensive experiments, we show that sampling-insensitive discriminators (e.g.PointNet-Max) produce shape point clouds with point clustering artifacts while sampling-oversensitive discriminators (e.g.PointNet++, DGCNN) fail to guide valid shape generation. We propose the concept of sampling spectrum to depict the different sampling sensitivities of discriminators. We further study how different evaluation metrics weigh the sampling pattern against the geometry and propose several perceptual metrics forming a sampling spectrum of metrics. Guided by the proposed sampling spectrum, we discover a middle-point sampling-aware baseline discriminator, PointNet-Mix, which improves all existing point cloud generators by a large margin on sampling-related metrics. We point out that, though recent research has been focused on the generator design, the main bottleneck of point cloud GAN actually lies in the discriminator design. Our work provides both suggestions and tools for building future discriminators. We will release the code to facilitate future research.

cs.CV↗