Source author record

Hanli Qiao

Hanli Qiao 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

3works
3topics
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

3 published item(s)

preprint2026arXiv

UFO: A Domain-Unification-Free Operator Framework for Generalized Operator Learning

Neural operators have become an effective framework for learning mappings between function spaces, yet most existing architectures realize operators within a single representational domain, such as physical, spectral, or latent space. In this work, we introduce UFO (Domain-Unification-Free Operator), a cross-domain neural operator framework that realizes operators through adaptive, jointly conditioned interactions among representations defined on distinct domains. UFO enables discretization decoupling: the input function can be observed at resolutions or locations different from those used during training, while the solution can be queried at arbitrary output resolutions. Across four complementary benchmarks covering discontinuous inputs, irregular sampling with spectral mismatch, nonlinear dynamics, and stochastic high-frequency fields, UFO delivers accurate, robust, and physically coherent predictions under distribution shifts. These results establish cross-domain, phase-modulated realization as a powerful framework for discretization-decoupled neural operator learning.

preprint2016arXiv

On the topology preservation of Gneiting's functions in image registration

The purpose of image registration is to determine a transformation such that the transformed version of the source image is similar to the target one. In this paper we focus on landmark-based image registration using radial basis functions (RBFs) transformations, in particular on the topology preservation of compactly supported radial basis functions (CSRBFs) transformations. In [1] the performances of Gneiting's and Wu's functions are compared with the ones of other well known schemes in image registration, as thin plate spline and Wendland's functions. Several numerical experiments and real-life cases with medical images show differences in accuracy and smoothness of the considered interpolation methods, which can be explained taking into account their topology preservation properties. Here we analyze analytically and experimentally the topology preservation performances of Gneiting's functions, comparing results with the ones obtained in [2], where Wendland's and Wu's functions are considered.

preprint2014arXiv

New SVD based initialization strategy for Non-negative Matrix Factorization

There are two problems need to be dealt with for Non-negative Matrix Factorization (NMF): choose a suitable rank of the factorization and provide a good initialization method for NMF algorithms. This paper aims to solve these two problems using Singular Value Decomposition (SVD). At first we extract the number of main components as the rank, actually this method is inspired from [1, 2]. Second, we use the singular value and its vectors to initialize NMF algorithm. In 2008, Boutsidis and Gollopoulos [3] provided the method titled NNDSVD to enhance initialization of NMF algorithms. They extracted the positive section and respective singular triplet information of the unit matrices {C(j)}k j=1 which were obtained from singular vector pairs. This strategy aims to use positive section to cope with negative elements of the singular vectors, but in experiments we found that even replacing negative elements by their absolute values could get better results than NNDSVD. Hence, we give another method based SVD to fulfil initialization for NMF algorithms (SVD-NMF). Numerical experiments on two face databases ORL and YALE [16, 17] show that our method is better than NNDSVD.