Outfit Completion via Conditional Set Transformation
Not on the map. Why?
Abstract (arXiv)
In this paper, we formulate the outfit completion problem as a set retrieval task and propose a novel framework for solving this problem. The proposal includes a conditional set transformation architecture with deep neural networks and a compatibility-based regularization method. The proposed method utilizes a map with permutation-invariant for the input set and permutation-equivariant for the condition set. This allows retrieving a set that is compatible with the input set while reflecting the properties of the condition set. In addition, since this structure outputs the element of the output set in a single inference, it can achieve a scalable inference speed with respect to the cardinality of the output set. Experimental results on real data reveal that the proposed method outperforms existing approaches in terms of accuracy of the outfit completion task, condition satisfaction, and compatibility of completion results.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 14 references that are in the map. First posted on arXiv 28 Nov 2023.
Builds on
6 of 14 references.
References · 6
- 2017Attention Is All You Needcited by 59,932
- 2020Object-Centric Learning with Slot Attentioncited by 865
- 2017Learning Fashion Compatibility with Bidirectional LSTMscited by 69
- 2020Conditional Set Generation with Transformerscited by 32
- 2019Context-Aware Visual Compatibility Predictioncited by 26
- 2018Outfit Generation and Style Extraction via Bidirectional LSTM and Autoencodercited by 9
Built on by
Not cited yet.