Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025
In this paper, we present a robust mixture decomposition technique that automatically finds a compact representation of the data in terms of components. We apply it to the problem of organizing databases for efficient retrieval. The time taken for retrieval is an order of magnitude smaller than that of exhaustive search methods. We also compare our approach with other methods for decomposition that use traditional criteria such as Akaike, Schwarz, and minimum description length. We report results on the VisTex texture image database from the MIT Media Lab.
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025
Guangnan Ye, Dong Liu, et al.
ICCV 2013
Peter L. Williams, Nelson L. Max, et al.
IEEE TVCG
Cen Rao, Alexei Gritai, et al.
ICCV 2003