no code implementations • 17 Nov 2024 • Yan Zheng, Zhenxiao Liang, Xiaoyan Cong, Lanqing Guo, Yuehao Wang, Peihao Wang, Zhangyang Wang
We explore the oscillatory behavior observed in inversion methods applied to large-scale text-to-image diffusion models, with a focus on the "Flux" model.
1 code implementation • 29 Sep 2024 • Chen Song, Zhenxiao Liang, Bo Sun, QiXing Huang
We present Parametric Piecewise Linear Networks (PPLNs) for temporal vision inference.
1 code implementation • NeurIPS 2019 • Leonidas J. Guibas, Qi-Xing Huang, Zhenxiao Liang
A recent trend in optimizing maps such as dense correspondences between objects or neural networks between pairs of domains is to optimize them jointly.
1 code implementation • CVPR 2019 • Xiangru Huang, Zhenxiao Liang, Xiaowei Zhou, Yao Xie, Leonidas Guibas, Qi-Xing Huang
Our approach alternates between transformation synchronization using weighted relative transformations and predicting new weights of the input relative transformations using a neural network.
1 code implementation • CVPR 2019 • Zaiwei Zhang, Zhenxiao Liang, Lemeng Wu, Xiaowei Zhou, Qi-Xing Huang
Optimizing a network of maps among a collection of objects/domains (or map synchronization) is a central problem across computer vision and many other relevant fields.
no code implementations • ECCV 2018 • Yifan Sun, Zhenxiao Liang, Xiangru Huang, Qi-Xing Huang
Most existing techniques in map computation (e. g., in the form of feature or dense correspondences) assume that the underlying map between an object pair is unique.
no code implementations • ICML 2018 • Chandrajit Bajaj, Tingran Gao, Zihang He, Qi-Xing Huang, Zhenxiao Liang
We introduce a principled approach for simultaneous mapping and clustering (SMAC) for establishing consistent maps across heterogeneous object collections (e. g., 2D images or 3D shapes).
no code implementations • NeurIPS 2017 • Xiangru Huang, Zhenxiao Liang, Chandrajit Bajaj, Qi-Xing Huang
In this paper, we introduce a robust algorithm, \textsl{TranSync}, for the 1D translation synchronization problem, in which the aim is to recover the global coordinates of a set of nodes from noisy measurements of relative coordinates along an observation graph.