C. Neti, Salim Roukos
ASRU 1997
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.
C. Neti, Salim Roukos
ASRU 1997
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Takashi Saito
IEICE Transactions on Information and Systems
David B. Mayer, Ashford W. Stalnaker
ACM SIGMIS CPR 1967