2024 CVPR InteractDiffusion: Interaction Control in Text-to-Image Diffusion Models Jiun Tian Hoe, Xudong Jiang, Chee Seng Chan, and 2 more authors In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , 2024 Bib HTML PDF Code @inproceedings{interactdiffusion2024, title = {InteractDiffusion: Interaction Control in Text-to-Image Diffusion Models}, author = {Hoe, Jiun Tian and Jiang, Xudong and Chan, Chee Seng and Tan, Yap-Peng and Hu, Weipeng}, booktitle = {Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)}, year = {2024}, abs = {Large-scale text-to-image (T2I) diffusion models have showcased incredible capabilities in generating coherent images based on textual descriptions, enabling vast applications in content generation. While recent advancements have introduced control over factors such as object localization, posture, and image contours, a crucial gap remains in our ability to control the interactions between objects in the generated content. Well-controlling interactions in generated images could yield meaningful applications, such as creating realistic scenes with interacting characters. In this work, we study the problems of conditioning T2I diffusion models with Human-Object Interaction (HOI) information, consisting of a triplet label (person, action, object) and corresponding bounding boxes. We propose a pluggable interaction control model, called InteractDiffusion that extends existing pre-trained T2I diffusion models to enable them being better conditioned on interactions. Specifically, we tokenize the HOI information and learn their relationships via interaction embeddings. A conditioning self-attention layer is trained to map HOI tokens to visual tokens, thereby conditioning the visual tokens better in existing T2I diffusion models. Our model attains the ability to control the interaction and location on existing T2I diffusion models, which outperforms existing baselines by a large margin in HOI detection score, as well as fidelity in FID and KID. Project page: https://jiuntian.github.io/interactdiffusion.}, url = {https://arxiv.org/pdf/2312.05849.pdf}, } 2023 BMVC Unsupervised Hashing with Similarity Distribution Calibration Kam Woh Ng, Xiatian Zhu, Jiun Tian Hoe, and 4 more authors In British Machine Vision Conference (BMVC) , 2023 Bib HTML PDF Code @inproceedings{sdc2023, title = {Unsupervised Hashing with Similarity Distribution Calibration}, author = {Ng, Kam Woh and Zhu, Xiatian and Hoe, Jiun Tian and Chan, Chee Seng and Zhang, Tianyu and Song, Yi-Zhe and Xiang, Tao}, booktitle = {British Machine Vision Conference (BMVC)}, year = {2023}, abs = {Unsupervised hashing methods typically aim to preserve the similarity between data points in a feature space by mapping them to binary hash codes. However, these methods often overlook the fact that the similarity between data points in the continuous feature space may not be preserved in the discrete hash code space, due to the limited similarity range of hash codes. The similarity range is bounded by the code length and can lead to a problem known as similarity collapse. That is, the positive and negative pairs of data points become less distinguishable from each other in the hash space. To alleviate this problem, in this paper a novel Similarity Distribution Calibration (SDC) method is introduced. SDC aligns the hash code similarity distribution towards a calibration distribution (e.g., beta distribution) with sufficient spread across the entire similarity range, thus alleviating the similarity collapse problem. Extensive experiments show that our SDC outperforms significantly the state-of-the-art alternatives on coarse category-level and instance-level image retrieval. Code is available at https://github.com/kamwoh/sdc.}, url = {https://arxiv.org/pdf/2302.07669.pdf}, } 2021 NeurIPS One Loss for All: Deep Hashing with a Single Cosine Similarity based Learning Objective Jiun Tian Hoe, Kam Woh Ng, Tianyu Zhang, and 3 more authors In Advances in Neural Information Processing Systems (NeurIPS) , 2021 Bib HTML PDF Code @inproceedings{orthohash2021, title = {One Loss for All: Deep Hashing with a Single Cosine Similarity based Learning Objective}, author = {Hoe, Jiun Tian and Ng, Kam Woh and Zhang, Tianyu and Chan, Chee Seng and Song, Yi-Zhe and Xiang, Tao}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2021}, abs = {A deep hashing model typically has two main learning objectives: to make the learned binary hash codes discriminative and to minimize a quantization error. With further constraints such as bit balance and code orthogonality, it is not uncommon for existing models to employ a large number (>4) of losses. This leads to difficulties in model training and subsequently impedes their effectiveness. In this work, we propose a novel deep hashing model with only . Specifically, we show that maximizing the cosine similarity between the continuous codes and their corresponding can ensure both hash code discriminativeness and quantization error minimization. Further, with this learning objective, code balancing can be achieved by simply using a Batch Normalization (BN) layer and multi-label classification is also straightforward with label smoothing. The result is a one-loss deep hashing model that removes all the hassles of tuning the weights of various losses. Importantly, extensive experiments show that our model is highly effective, outperforming the state-of-the-art multi-loss hashing models on three large-scale instance retrieval benchmarks, often by significant margins. }, url = {https://proceedings.neurips.cc/paper/2021/hash/cbcb58ac2e496207586df2854b17995f-Abstract.html}, }