Source author record

Hao Gao

Hao Gao appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

14works
12topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

14 published item(s)

preprint2026arXiv

Img2CADSeq: Image-to-CAD Generation via Sequence-Based Diffusion

Boundary Representation (BRep) is the standard format for Computer-Aided Design (CAD), yet reconstructing high-quality BReps from single-view images remains challenging due to the complexity of topological constraints and operation sequences. We present Img2CADSeq, a multi-stage pipeline that overcomes these limitations by encoding CAD sequences into a three-level hierarchical codebook. Guided by an importance prioritization, this strategy values profiles over details, compressing long sequences into a stable discrete latent space. To bridge the modality gap, we leverage a coarse-to-fine point cloud intermediate, aligning 2D visual features with 3D CAD sequences via contrastive learning to condition a VQ-Diffusion model. Supported by newly introduced CAD-220K and PrintCAD datasets, our approach ensures robust industrial domain adaptation. Extensive experiments demonstrate that Img2CADSeq significantly outperforms state-of-the-art methods, producing standard STEP files that can be directly used in commercial CAD software.

preprint2022arXiv

Adversarial for Social Privacy: A Poisoning Strategy to Degrade User Identity Linkage

Privacy issues on social networks have been extensively discussed in recent years. The user identity linkage (UIL) task, aiming at finding corresponding users across different social networks, would be a threat to privacy if unethically applied. The sensitive user information might be detected through connected identities. A promising and novel solution to this issue is to design an adversarial strategy to degrade the matching performance of UIL models. However, most existing adversarial attacks on graphs are designed for models working in a single network, while UIL is a cross-network learning task. Meanwhile, privacy protection against UIL works unilaterally in real-world scenarios, i.e., the service provider can only add perturbations to its own network to protect its users from being linked. To tackle these challenges, this paper proposes a novel adversarial attack strategy that poisons one target network to prevent its nodes from being linked to other networks by UIL algorithms. Specifically, we reformalize the UIL problem in the perspective of kernelized topology consistency and convert the attack objective to maximizing the structural changes within the target network before and after attacks. A novel graph kernel is then defined with Earth mover's distance (EMD) on the edge-embedding space. In terms of efficiency, a fast attack strategy is proposed by greedy searching and replacing EMD with its lower bound. Results on three real-world datasets indicate that the proposed attacks can best fool a wide range of UIL models and reach a balance between attack effectiveness and imperceptibility.

preprint2022arXiv

Temporal extrapolation of heart wall segmentation in cardiac magnetic resonance images via pixel tracking

In this study, we have tailored a pixel tracking method for temporal extrapolation of the ventricular segmentation masks in cardiac magnetic resonance images. The pixel tracking process starts from the end-diastolic frame of the heart cycle using the available manually segmented images to predict the end-systolic segmentation mask. The superpixels approach is used to divide the raw images into smaller cells and in each time frame, new labels are assigned to the image cells which leads to tracking the movement of the heart wall elements through different frames. The tracked masks at the end of systole are compared with the already available manually segmented masks and dice scores are found to be between 0.81 to 0.84. Considering the fact that the proposed method does not necessarily require a training dataset, it could be an attractive alternative approach to deep learning segmentation methods in scenarios where training data are limited.

preprint2021arXiv

AHP-Net: adaptive-hyper-parameter deep learning based image reconstruction method for multilevel low-dose CT

Low-dose CT (LDCT) imaging is desirable in many clinical applications to reduce X-ray radiation dose to patients. Inspired by deep learning (DL), a recent promising direction of model-based iterative reconstruction (MBIR) methods for LDCT is via optimization-unrolling DL-regularized image reconstruction, where pre-defined image prior is replaced by learnable data-adaptive prior. However, LDCT is clinically multilevel, since clinical scans have different noise levels that depend of scanning site, patient size, and clinical task. Therefore, this work aims to develop an adaptive-hyper-parameter DL-based image reconstruction method (AHP-Net) that can handle multilevel LDCT of different noise levels. AHP-Net unrolls a half-quadratic splitting scheme with learnable image prior built on framelet filter bank, and learns a network that automatically adjusts the hyper-parameters for various noise levels. As a result, AHP-Net provides a single universal training model that can handle multilevel LDCT. Extensive experimental evaluations using clinical scans suggest that AHP-Net outperformed conventional MBIR techniques and state-of-the-art deep-learning-based methods for multilevel LDCT of different noise levels.

preprint2021arXiv

Enhancing Crystal Structure Prediction by decomposition methods based on graph theory

Crystal structure prediction algorithms have become powerful tools for materials discovery in recent years, however, they are usually limited to relatively small systems. The main challenge is that the number of local minima grows exponentially with system size. In this work, we proposed two crossover-mutation schemes based on graph theory to accelerate the evolutionary structure searching. These schemes can detect molecules or clusters inside periodic networks using quotient graphs for crystals and the decomposition can dramatically reduce the searching space. Sufficient examples for the test, including the high pressure phases of methane, ammonia, MgAl2O4, and boron, show that these new evolution schemes can obviously improve the success rate and searching efficiency compared with the standard method in both isolated and extended systems.

preprint2021arXiv

Superionic silica-water and silica-hydrogen compounds under high pressure

Silica, water and hydrogen are known to be the major components of celestial bodies, and have significant influence on the formation and evolution of giant planets, such as Uranus and Neptune. Thus, it is of fundamental importance to investigate their states and possible reactions under the planetary conditions. Here, using advanced crystal structure searches and first-principles calculations in the Si-O-H system, we find that a silica-water compound (SiO2)2(H2O) and a silica-hydrogen compound SiO2H2 can exist under high pressures above 450 and 650 GPa, respectively. Further simulations reveal that, at high pressure and high temperature conditions corresponding to the interiors of Uranus and Neptune, these compounds exhibit superionic behavior, in which protons diffuse freely like liquid while the silicon and oxygen framework is fixed as solid. Therefore, these superionic silica-water and silica-hydrogen compounds could be regarded as important components of the deep mantle or core of giants, which also provides an alternative origin for their anomalous magnetic fields. These unexpected physical and chemical properties of the most common natural materials at high pressure offer key clues to understand some abstruse issues including demixing and erosion of the core in giant planets, and shed light on building reliable models for solar giants and exoplanets.

preprint2020arXiv

Dimensionalities and multiplicities determination of crystal nets

Low-dimensional materials have attracted significant attentions over the past decade. To discover new low-dimensional materials, high-throughout screening methods have been applied in different materials databases. For this purpose, the reliability of dimensionality identification is therefore highly important. In this work, we find that the existence of self-penetrating nets may lead to incorrect results by previous methods. In stead of this, we use the quotient graph to analysis the topologies of structures and compute their dimensionalities. Based on the quotient graph, we can calculate not only the dimensionality but also the multiplicity of self-penetrating structures. As a demonstration, we screened the Crystallography Open Database using our method and found hundreds of structures with different dimensionalities and high multiplicities up to eleven.

preprint2019arXiv

A preliminary study on a multi-resolution-level inverse planning algorithm for Gamma Knife radiosurgery

Manual forward planning for GK radiosurgery is complicated and time-consuming, particularly for cases with large or irregularly shaped targets. Inverse planning eases GK planning by solving an optimization problem. However, due to the vast search space, most inverse planning algorithms have to decouple the planning process to isocenter preselection and sector duration optimization. This sequential scheme does not necessarily lead to optimal isocenter locations and hence optimal plans. In this study, we attempt to optimize the isocenter positions, beam shapes and durations simultaneously by proposing a multi-resolution-level (MRL) strategy to handle the large-scale GK optimization problem. In our approach, several rounds of optimizations were performed with a progressively increased spatial resolution for isocenter candidate selection. The isocenters selected from last round and their neighbors on a finer resolution were used as new isocenter candidates for next round of optimization. After plan optimization, shot sequencing was performed to group the optimized sectors to deliverable shots supported by GK treatment units. We have tested our algorithm on 6 GK cases previously treated in our institution (2 meningioma cases, 3 cases with single metastasis and 1 case with 6 metastases). Compared with manual planning, achieving same coverage and similar selectivity, our algorithm improved the gradient index averagely from 3.1 to 2.9 and reduced the maximum dose of brainstem from 8.0Gy to 5.6Gy. The average beam-on time was also reduced by from 103.8 mins to 87.4 mins. Our method was also compared with the inverse planning algorithm provided in Leksell GammaPlan planning system, and outperformed it with better plan quality for all the 6 cases.This preliminary study has demonstrated the effectiveness and feasibility of our MRL inverse planning approach for GK radiosurgery.

preprint2019arXiv

Bas-relief Generation from Point Clouds Based on Normal Space Compression with Real-time Adjustment on CPU

Bas-relief generation based on 3d models is a hot topic in computer graphics. State-of-the-art algorithms take a mesh surface as input, but real-time interaction via CPU cannot be realized. In this paper, a bas-relief generation algorithm that takes a scattered point cloud as input is proposed. The algorithm takes normal vectors as the operation object and the variation of the local surface as the compression criterion. By constructing and solving linear equations of bas-relief vertices, the closed-form solution can be obtained. Since there is no need to compute discrete gradients on a point cloud lacking topology information, it is easier to implement and more intuitive than gradient domain methods. The algorithm provides parameters to adjust the bas-relief height, saturation and detail richness. At the same time, through the solution strategy based on the subspace, it realizes the real-time adjustment of the bas-relief effect based on the computing power of a consumer CPU. In addition, an iterative solution to generate a bas-relief model of a specified height is presented to meet specific application requirements. Experiments show that our algorithm provides a unified solution for various types of bas-relief creation and can generate bas-reliefs with good saturation and rich details.

preprint2016arXiv

Fused Analytical and Iterative Reconstruction (AIR) via modified proximal forward-backward splitting: a FDK-based iterative image reconstruction example for CBCT

This work is to develop a general framework, namely analytical iterative reconstruction (AIR) method, to incorporate analytical reconstruction (AR) method into iterative reconstruction (IR) method, for enhanced CT image quality and reconstruction efficiency. Specifically, AIR is established based on the modified proximal forward-backward splitting (PFBS) algorithm, and its connection to the filtered data fidelity with sparsity regularization is discussed. As a result, AIR decouples data fidelity and image regularization with a two-step iterative scheme, during which an AR-projection step updates the filtered data fidelity term, while a denoising solver updates the sparsity regularization term. During the AR-projection step, the image is projected to the data domain to form the data residual, and then reconstructed by certain AR to a residual image which is then weighted together with previous image iterate to form next image iterate. Intuitively since the eigenvalues of AR-projection operator are close to the unity, PFBS based AIR has a fast convergence. Such an advantage is rigorously established through convergence analysis and numerical computation of convergence rate. The proposed AIR method is validated in the setting of circular cone-beam CT with AR being FDK and total-variation sparsity regularization, and has improved image quality from both AR and IR. For example, AIR has improved visual assessment and quantitative measurement in terms of both contrast and resolution, and reduced axial and half-fan artifacts.

preprint2016arXiv

Origin of the superconductivity of WTe2 under pressure

Tungsten ditelluride (WTe2) has attracted significant attention due to its interesting electronic properties, such as the unsaturated magnetoresistance and superconductivity. Recently, it has been proposed to be a new type of Weyl semimetal, which is distinguished from other transition metal dichalcogenides (TMDs) from a topological prospective. Here, we study the structure of WTe2 under pressure with a crystal structure prediction and ab initio calculations combined with high pressure synchrotron X-ray diffraction and Raman spectroscopy measurements. We find that the ambient orthorhombic structure (Td) transforms into a monoclinic structure (1T') at around 4-5 GPa. As the transition pressure is very close to the critical point in recent high-pressure electrical transport measurements, the emergence of superconductivity in WTe2 under pressure is attributed to the Td-1T' structure phase transition, which associates with a sliding mechanism of the TMD layers and results in a shorter Te-Te interlayer distance compared to the intralayer ones. These results highlight the critical role of the interlayer stacking and chalcogen interactions on the electronic and superconducting properties of multilayered TMDs under hydrostatic strain environments.

preprint2013arXiv

AIR: fused Analytical and Iterative Reconstruction method for computed tomography

Purpose: CT image reconstruction techniques have two major categories: analytical reconstruction (AR) method and iterative reconstruction (IR) method. AR reconstructs images through analytical formulas, such as filtered backprojection (FBP) in 2D and Feldkamp-Davis-Kress (FDK) method in 3D, which can be either mathematically exact or approximate. On the other hand, IR is often based on the discrete forward model of X-ray transform and formulated as a minimization problem with some appropriate image regularization method, so that the reconstructed image corresponds to the minimizer of the optimization problem. This work is to investigate the fused analytical and iterative reconstruction (AIR) method. Methods: Based on IR with L1-type image regularization, AIR is formulated with a AR-specific preconditioner in the data fidelity term, which results in the minimal change of the solution algorithm that replaces the adjoint X-ray transform by the filtered X-ray transform. As a proof-of-concept 2D example of AIR, FBP is incorporated into tensor framelet (TF) regularization based IR, and the formulated AIR minimization problem is then solved through split Bregman method with GPU-accelerated X-ray transform and filtered adjoint X-ray transform. Conclusion: AIR, the fused Analytical and Iterative Reconstruction method, is proposed with a proof-of-concept 2D example to synergize FBP and TF-regularized IR, with improved image resolution and contrast for experimental data. The potential impact of AIR is that it offers a general framework to develop various AR enhanced IR methods, when neither AR nor IR alone is sufficient.

preprint2012arXiv

Cine cone beam CT reconstruction using low-rank matrix factorization: algorithm and a proof-of-princple study

Respiration-correlated CBCT, commonly called 4DCBCT, provide respiratory phase-resolved CBCT images. In many clinical applications, it is more preferable to reconstruct true 4DCBCT with the 4th dimension being time, i.e., each CBCT image is reconstructed based on the corresponding instantaneous projection. We propose in this work a novel algorithm for the reconstruction of this truly time-resolved CBCT, called cine-CBCT, by effectively utilizing the underlying temporal coherence, such as periodicity or repetition, in those cine-CBCT images. Assuming each column of the matrix $\bm{U}$ represents a CBCT image to be reconstructed and the total number of columns is the same as the number of projections, the central idea of our algorithm is that the rank of $\bm{U}$ is much smaller than the number of projections and we can use a matrix factorization form $\bm{U}=\bm{L}\bm{R}$ for $\bm{U}$. The number of columns for the matrix $\bm{L}$ constraints the rank of $\bm{U}$ and hence implicitly imposing a temporal coherence condition among all the images in cine-CBCT. The desired image properties in $\bm{L}$ and the periodicity of the breathing pattern are achieved by penalizing the sparsity of the tight wavelet frame transform of $\bm{L}$ and that of the Fourier transform of $\bm{R}$, respectively. A split Bregman method is used to solve the problem. In this paper we focus on presenting this new algorithm and showing the proof of principle using simulation studies on an NCAT phantom.

preprint2011arXiv

Omni-tomography/Multi-tomography -- Integrating Multiple Modalities for Simultaneous Imaging

Current tomographic imaging systems need major improvements, especially when multi-dimensional, multi-scale, multi-temporal and multi-parametric phenomena are under investigation. Both preclinical and clinical imaging now depend on in vivo tomography, often requiring separate evaluations by different imaging modalities to define morphologic details, delineate interval changes due to disease or interventions, and study physiological functions that have interconnected aspects. Over the past decade, fusion of multimodality images has emerged with two different approaches: post-hoc image registration and combined acquisition on PET-CT, PET-MRI and other hybrid scanners. There are intrinsic limitations for both the post-hoc image analysis and dual/triple modality approaches defined by registration errors and physical constraints in the acquisition chain. We envision that tomography will evolve beyond current modality fusion and towards grand fusion, a large scale fusion of all or many imaging modalities, which may be referred to as omni-tomography or multi-tomography. Unlike modality fusion, grand fusion is here proposed for truly simultaneous but often localized reconstruction in terms of all or many relevant imaging mechanisms such as CT, MRI, PET, SPECT, US, optical, and possibly more. In this paper, the technical basis for omni-tomography is introduced and illustrated with a top-level design of a next generation scanner, interior tomographic reconstructions of representative modalities, and anticipated applications of omni-tomography.