arXiv subjects

Weiwei Xu

Publications and source records attributed to Weiwei Xu.

At least 91 records · Page 5Linked to original sources

arXiv2023

A causal convolutional neural network for multi-subject motion modeling and generation

Inspired by the success of WaveNet in multi-subject speech synthesis, we propose a novel neural network based on causal convolutions for multi-subject motion modeling and generation. The network can capture the intrinsic characteristics of the motion of different subjects, such as the influence of skeleton scale variation on motion style. Moreover, after fine-tuning the network using a small motion dataset for a novel skeleton that is not included in the training dataset, it is able to synthesize high-quality motions with a personalized style for the novel skeleton. The experimental results demonstrate that our network can model the intrinsic characteristics of motions well and can be applied to various motion modeling and synthesis tasks.

cs.GR↗

arXiv2023

How Early Participation Determines Long-Term Sustained Activity in GitHub Projects?

Although the open source model bears many advantages in software development, open source projects are always hard to sustain. Previous research on open source sustainability mainly focuses on projects that have already reached a certain level of maturity (e.g., with communities, releases, and downstream projects). However, limited attention is paid to the development of (sustainable) open source projects in their infancy, and we believe an understanding of early sustainability determinants is crucial for project initiators, incubators, newcomers, and users. In this paper, we aim to explore the relationship between early participation factors and long-term project sustainability. We leverage a novel methodology combining the Blumberg model of performance and machine learning to predict the sustainability of 290,255 GitHub projects. Specificially, we train an XGBoost model based on early participation (first three months of activity) in 290,255 GitHub projects and we interpret the model using LIME. We quantitatively show that early participants have a positive effect on project's future sustained activity if they have prior experience in OSS project incubation and demonstrate concentrated focus and steady commitment. Participation from non-code contributors and detailed contribution documentation also promote project's sustained activity. Compared with individual projects, building a community that consists of more experienced core developers and more active peripheral developers is important for organizational projects. This study provides unique insights into the incubation and recognition of sustainable open source projects, and our interpretable prediction approach can also offer guidance to open source project initiators and newcomers.

cs.SE↗

arXiv2023

Understanding and Remediating Open-Source License Incompatibilities in the PyPI Ecosystem

The reuse and distribution of open-source software must be in compliance with its accompanying open-source license. In modern packaging ecosystems, maintaining such compliance is challenging because a package may have a complex multi-layered dependency graph with many packages, any of which may have an incompatible license. Although prior research finds that license incompatibilities are prevalent, empirical evidence is still scarce in some modern packaging ecosystems (e.g., PyPI). It also remains unclear how developers remediate the license incompatibilities in the dependency graphs of their packages (including direct and transitive dependencies), let alone any automated approaches. To bridge this gap, we conduct a large-scale empirical study of license incompatibilities and their remediation practices in the PyPI ecosystem. We find that 7.27% of the PyPI package releases have license incompatibilities and 61.3% of them are caused by transitive dependencies, causing challenges in their remediation; for remediation, developers can apply one of the five strategies: migration, removal, pinning versions, changing their own licenses, and negotiation. Inspired by our findings, we propose SILENCE, an SMT-solver-based approach to recommend license incompatibility remediations with minimal costs in package dependency graph. Our evaluation shows that the remediations proposed by SILENCE can match 19 historical real-world cases (except for migrations not covered by an existing knowledge base) and have been accepted by five popular PyPI packages whose developers were previously unaware of their license incompatibilities.

cs.SE↗

arXiv2023

A Two-part Transformer Network for Controllable Motion Synthesis

Although part-based motion synthesis networks have been investigated to reduce the complexity of modeling heterogeneous human motions, their computational cost remains prohibitive in interactive applications. To this end, we propose a novel two-part transformer network that aims to achieve high-quality, controllable motion synthesis results in real-time. Our network separates the skeleton into the upper and lower body parts, reducing the expensive cross-part fusion operations, and models the motions of each part separately through two streams of auto-regressive modules formed by multi-head attention layers. However, such a design might not sufficiently capture the correlations between the parts. We thus intentionally let the two parts share the features of the root joint and design a consistency loss to penalize the difference in the estimated root features and motions by these two auto-regressive modules, significantly improving the quality of synthesized motions. After training on our motion dataset, our network can synthesize a wide range of heterogeneous motions, like cartwheels and twists. Experimental and user study results demonstrate that our network is superior to state-of-the-art human motion synthesis networks in the quality of generated motions.

cs.GR↗

arXiv2023

Hybrid Mesh-neural Representation for 3D Transparent Object Reconstruction

We propose a novel method to reconstruct the 3D shapes of transparent objects using hand-held captured images under natural light conditions. It combines the advantage of explicit mesh and multi-layer perceptron (MLP) network, a hybrid representation, to simplify the capture setting used in recent contributions. After obtaining an initial shape through the multi-view silhouettes, we introduce surface-based local MLPs to encode the vertex displacement field (VDF) for the reconstruction of surface details. The design of local MLPs allows to represent the VDF in a piece-wise manner using two layer MLP networks, which is beneficial to the optimization algorithm. Defining local MLPs on the surface instead of the volume also reduces the searching space. Such a hybrid representation enables us to relax the ray-pixel correspondences that represent the light path constraint to our designed ray-cell correspondences, which significantly simplifies the implementation of single-image based environment matting algorithm. We evaluate our representation and reconstruction algorithm on several transparent objects with ground truth models. Our experiments show that our method can produce high-quality reconstruction results superior to state-of-the-art methods using a simplified data acquisition setup.

cs.CV↗

arXiv2023

Unsupervised Domain Adaption with Pixel-level Discriminator for Image-aware Layout Generation

Layout is essential for graphic design and poster generation. Recently, applying deep learning models to generate layouts has attracted increasing attention. This paper focuses on using the GAN-based model conditioned on image contents to generate advertising poster graphic layouts, which requires an advertising poster layout dataset with paired product images and graphic layouts. However, the paired images and layouts in the existing dataset are collected by inpainting and annotating posters, respectively. There exists a domain gap between inpainted posters (source domain data) and clean product images (target domain data). Therefore, this paper combines unsupervised domain adaption techniques to design a GAN with a novel pixel-level discriminator (PD), called PDA-GAN, to generate graphic layouts according to image contents. The PD is connected to the shallow level feature map and computes the GAN loss for each input-image pixel. Both quantitative and qualitative evaluations demonstrate that PDA-GAN can achieve state-of-the-art performances and generate high-quality image-aware graphic layouts for advertising posters.

cs.CV↗

arXiv2023

Fast and Robust Non-Rigid Registration Using Accelerated Majorization-Minimization

Non-rigid 3D registration, which deforms a source 3D shape in a non-rigid way to align with a target 3D shape, is a classical problem in computer vision. Such problems can be challenging because of imperfect data (noise, outliers and partial overlap) and high degrees of freedom. Existing methods typically adopt the $\ell_p$ type robust norm to measure the alignment error and regularize the smoothness of deformation, and use a proximal algorithm to solve the resulting non-smooth optimization problem. However, the slow convergence of such algorithms limits their wide applications. In this paper, we propose a formulation for robust non-rigid registration based on a globally smooth robust norm for alignment and regularization, which can effectively handle outliers and partial overlaps. The problem is solved using the majorization-minimization algorithm, which reduces each iteration to a convex quadratic problem with a closed-form solution. We further apply Anderson acceleration to speed up the convergence of the solver, enabling the solver to run efficiently on devices with limited compute capability. Extensive experiments demonstrate the effectiveness of our method for non-rigid alignment between two shapes with outliers and partial overlaps, with quantitative evaluation showing that it outperforms state-of-the-art methods in terms of registration accuracy and computational speed. The source code is available at https://github.com/yaoyx689/AMM_NRR.

cs.CV↗

arXiv2023

LookinGood^π: Real-time Person-independent Neural Re-rendering for High-quality Human Performance Capture

We propose LookinGood^π, a novel neural re-rendering approach that is aimed to (1) improve the rendering quality of the low-quality reconstructed results from human performance capture system in real-time; (2) improve the generalization ability of the neural rendering network on unseen people. Our key idea is to utilize the rendered image of reconstructed geometry as the guidance to assist the prediction of person-specific details from few reference images, thus enhancing the re-rendered result. In light of this, we design a two-branch network. A coarse branch is designed to fix some artifacts (i.e. holes, noise) and obtain a coarse version of the rendered input, while a detail branch is designed to predict "correct" details from the warped references. The guidance of the rendered image is realized by blending features from two branches effectively in the training of the detail branch, which improves both the warping accuracy and the details' fidelity. We demonstrate that our method outperforms state-of-the-art methods at producing high-fidelity images on unseen people.

cs.CV↗

arXiv2022

Spectroscopic Confirmation of Two X-ray Diffuse and Massive Galaxy Clusters at Low Redshift

We present MMT spectroscopic observations of two massive galaxy cluster candidates at redshift $z\sim0.07$ that show extended and diffuse X-ray emission in the ROSAT All Sky Survey (RASS) images. The targets were selected from a previous catalog of 303 newly-identified cluster candidates with the similar properties using the intra-cluster medium emission. Using the new MMT Hectospec data and SDSS archival spectra, we identify a number of member galaxies for the two targets and confirm that they are galaxy clusters at $z=0.079$ and 0.067, respectively. The size of the two clusters, calculated from the distribution of the member galaxies, is roughly 2 Mpc in radius. We estimate cluster masses using three methods based on their galaxy number overdensities, galaxy velocity dispersions, and X-ray emission. The overdensity-based masses are $(6\sim8) \rm \times10^{14}\ M_\odot$, comparable to the masses of large clusters at low redshift. The masses derived from velocity dispersions are significantly lower, likely due to their diffuse and low concentration features. Our result suggests the existence of a population of large clusters with very diffuse X-ray emission that have been missed by most previous searches using the RASS images. If most of the 303 candidates in the previous catalog are confirmed to be real clusters, this may help to reduce the discrepancy of cosmological results between the CMB and galaxy cluster measurements.

astro-ph.CO↗

arXiv2022

Geometry-aware Two-scale PIFu Representation for Human Reconstruction

Although PIFu-based 3D human reconstruction methods are popular, the quality of recovered details is still unsatisfactory. In a sparse (e.g., 3 RGBD sensors) capture setting, the depth noise is typically amplified in the PIFu representation, resulting in flat facial surfaces and geometry-fallible bodies. In this paper, we propose a novel geometry-aware two-scale PIFu for 3D human reconstruction from sparse, noisy inputs. Our key idea is to exploit the complementary properties of depth denoising and 3D reconstruction, for learning a two-scale PIFu representation to reconstruct high-frequency facial details and consistent bodies separately. To this end, we first formulate depth denoising and 3D reconstruction as a multi-task learning problem. The depth denoising process enriches the local geometry information of the reconstruction features, while the reconstruction process enhances depth denoising with global topology information. We then propose to learn the two-scale PIFu representation using two MLPs based on the denoised depth and geometry-aware features. Extensive experiments demonstrate the effectiveness of our approach in reconstructing facial details and bodies of different poses and its superiority over state-of-the-art methods.

cs.CV↗

arXiv2022

Crystallizing Kagome artificial spin ice

Artificial spin ices are engineered arrays of dipolarly coupled nanobar magnets. They enable direct investigations of fascinating collective phenomena from their diverse microstates. However, experimental access to ground states in the geometrically frustrated systems has proven difficult, limiting studies and applications of novel properties and functionalities from the low energy states. Here, we introduce a convenient approach to control the competing diploar interactions between the neighboring nanomagnets, allowing us to tailor the vertex degeneracy of the ground states. We achieve this by tuning the length of selected nanobar magnets in the spin ice lattice. We demonstrate the effectiveness of our method by realizing multiple low energy microstates in a Kagome artificial spin ice, particularly the hardly accessible long range ordered ground state - the spin crystal state. Our strategy can be directly applied to other artificial spin systems to achieve exotic phases and explore new emergent collective behaviors.

cond-mat.mes-hall↗

arXiv2022

Automatic Quantization for Physics-Based Simulation

Quantization has proven effective in high-resolution and large-scale simulations, which benefit from bit-level memory saving. However, identifying a quantization scheme that meets the requirement of both precision and memory efficiency requires trial and error. In this paper, we propose a novel framework to allow users to obtain a quantization scheme by simply specifying either an error bound or a memory compression rate. Based on the error propagation theory, our method takes advantage of auto-diff to estimate the contributions of each quantization operation to the total error. We formulate the task as a constrained optimization problem, which can be efficiently solved with analytical formulas derived for the linearized objective function. Our workflow extends the Taichi compiler and introduces dithering to improve the precision of quantized simulations. We demonstrate the generality and efficiency of our method via several challenging examples of physics-based simulation, which achieves up to 2.5x memory compression without noticeable degradation of visual quality in the results. Our code and data are available at https://github.com/Hanke98/AutoQuantizer.

cs.GR↗

arXiv2022

Composition-aware Graphic Layout GAN for Visual-textual Presentation Designs

In this paper, we study the graphic layout generation problem of producing high-quality visual-textual presentation designs for given images. We note that image compositions, which contain not only global semantics but also spatial information, would largely affect layout results. Hence, we propose a deep generative model, dubbed as composition-aware graphic layout GAN (CGL-GAN), to synthesize layouts based on the global and spatial visual contents of input images. To obtain training images from images that already contain manually designed graphic layout data, previous work suggests masking design elements (e.g., texts and embellishments) as model inputs, which inevitably leaves hint of the ground truth. We study the misalignment between the training inputs (with hint masks) and test inputs (without masks), and design a novel domain alignment module (DAM) to narrow this gap. For training, we built a large-scale layout dataset which consists of 60,548 advertising posters with annotated layout information. To evaluate the generated layouts, we propose three novel metrics according to aesthetic intuitions. Through both quantitative and qualitative evaluations, we demonstrate that the proposed model can synthesize high-quality graphic layouts according to image compositions.

cs.CV↗

arXiv2022

NICE-SLAM: Neural Implicit Scalable Encoding for SLAM

Neural implicit representations have recently shown encouraging results in various domains, including promising progress in simultaneous localization and mapping (SLAM). Nevertheless, existing methods produce over-smoothed scene reconstructions and have difficulty scaling up to large scenes. These limitations are mainly due to their simple fully-connected network architecture that does not incorporate local information in the observations. In this paper, we present NICE-SLAM, a dense SLAM system that incorporates multi-level local information by introducing a hierarchical scene representation. Optimizing this representation with pre-trained geometric priors enables detailed reconstruction on large indoor scenes. Compared to recent neural implicit SLAM systems, our approach is more scalable, efficient, and robust. Experiments on five challenging datasets demonstrate competitive results of NICE-SLAM in both mapping and tracking quality. Project page: https://pengsongyou.github.io/nice-slam

cs.CV↗

arXiv2022

Active Boundary Loss for Semantic Segmentation

This paper proposes a novel active boundary loss for semantic segmentation. It can progressively encourage the alignment between predicted boundaries and ground-truth boundaries during end-to-end training, which is not explicitly enforced in commonly used cross-entropy loss. Based on the predicted boundaries detected from the segmentation results using current network parameters, we formulate the boundary alignment problem as a differentiable direction vector prediction problem to guide the movement of predicted boundaries in each iteration. Our loss is model-agnostic and can be plugged in to the training of segmentation networks to improve the boundary details. Experimental results show that training with the active boundary loss can effectively improve the boundary F-score and mean Intersection-over-Union on challenging image and video object segmentation datasets.

cs.CV↗

arXiv2021

An X-ray selected catalog of extended galaxy clusters from the ROSAT All-Sky Survey (RXGCC)

There is a known tension between cosmological parameter constraints obtained from the primary CMB and those from galaxy cluster samples. One possible explanation could be certain types of groups or clusters of galaxy have been missed in the past. We aim to search for galaxy groups and clusters with particularly extended surface brightness distributions, by creating a new X-ray selected catalog of extended galaxy clusters from the ROSAT All-Sky Survey, using a dedicated algorithm optimized for extended sources. Through extensive simulations, the detection efficiency and sample purity are investigated. Previous cluster catalogs in X-ray and other wave-bands, as well as spectroscopic and photometric redshifts of galaxies are used for the cluster identification. We report a catalog of galaxy clusters at high galactic latitude based on the ROSAT All-sky Survey, named as RXGCC, which includes 944 groups and clusters. Out of it, 641 clusters have been identified through ICM emission previously (Bronze), 154 known optical and infrared clusters are detected as X-ray clusters for the first time (Silver), and 149 identified as clusters for the first time (Gold). Based on 200 simulations, the contamination ratio of the detections which were identified as clusters by ICM emission, and the detections which were identified as optical and infrared clusters in previous work is 0.008 and 0.100, respectively. Compared with Bronze sample, the Gold+Silver sample is less luminous, less massive, and has a flatter surface brightness profile. Specifically, the median flux in [0.1-2.4]keV band for Gold+Silver and Bronze sample is 2.496e-12 erg/s/cm^2 and 4.955e-12 erg/s/cm^2, respectively. The median slope of cluster profile is 0.76 and 0.83 for Gold+Silver and Bronze sample, respectively. This whole sample is available at https://github.com/wwxu/rxgcc.github.io/blob/master/table_rxgcc.fits (Abridged)

astro-ph.CO↗

arXiv2021

Location-aware Single Image Reflection Removal

This paper proposes a novel location-aware deep-learning-based single image reflection removal method. Our network has a reflection detection module to regress a probabilistic reflection confidence map, taking multi-scale Laplacian features as inputs. This probabilistic map tells if a region is reflection-dominated or transmission-dominated, and it is used as a cue for the network to control the feature flow when predicting the reflection and transmission layers. We design our network as a recurrent network to progressively refine reflection removal results at each iteration. The novelty is that we leverage Laplacian kernel parameters to emphasize the boundaries of strong reflections. It is beneficial to strong reflection detection and substantially improves the quality of reflection removal results. Extensive experiments verify the superior performance of the proposed method over state-of-the-art approaches. Our code and the pre-trained model can be found at https://github.com/zdlarr/Location-aware-SIRR.

cs.CV↗

arXiv2021

Halo Mass-Concentration Relation at High-Mass End

The concentration-mass (c-M) relation encodes the key information of the assembly history of the dark matter halos, however its behavior at the high mass end has not been measured precisely in observations yet. In this paper, we report the measurement of halo c-M relation with galaxy-galaxy lensing method, using shear catalog of the Dark Energy Camera Legacy Survey (DECaLS) Data Release 8, which covers a sky area of 9500 deg^2. The foreground lenses are selected from redMaPPer, LOWZ, and CMASS catalogs, with halo mass range from 10^{13} to 10^{15} M_sun and redshift range from z=0.08 to z=0.65. We find that the concentration decreases with the halo mass from 10^{13} to 10^{14} M_sun, but shows a trend of upturn after the pivot point of ~10^{14} M_sun. We fit the measured c-M relation with the concentration model c(M)=C_0 (M/(10^{12} M_sun/h)^{-γ} [1+(M/M_0)^{0.4}], and get the values (C_0, γ, log(M_0) = (5.119_{-0.185}^{0.183}, 0.205_{-0.010}^{0.010}, 14.083_{-0.133}^{0.130}), and (4.875_{-0.208}^{0.209}, 0.221_{-0.010}^{0.010}, 13.750_{-0.141}^{0.142}) for halos with 0.08<=z<0.35 and 0.35<=z<0.65, respectively. We also show that the model including an upturn is favored over a simple power-law model. Our measurement provides important information for the recent argument of massive cluster formation process.

astro-ph.CO↗