Abstract
Retrieving the most relevant exemplars in image databases has been a difficult task. Most of exemplar selection methods were proposed and developed to work with a specific classifier. Research in exemplar selection is targeting schemes that can benefit a wide range of classifiers. Recently, Sparse Modeling Representative Selection (SMRS) method has been proposed for selecting the most relevant instances. SMRS is based on data self-representation in the sense that it estimates a coding matrix using a codebook set to the data themselves. The matrix coefficients are estimated using block sparsity constraint. In this paper, we propose a coding scheme based on a two stage Collaborative Neighbor Representation in the matrix of coefficients is estimated without any explicit sparse coding. For the second stage, we introduce two schemes for sample pruning in the second stage. Experiments are conducted on summarizing two video movies. We also provide quantitative performance evaluation via classification on the selected prototypes. To this end, one face dataset, one handwritten digits dataset, and one object dataset are used. These experiments showed that the proposed method can outperform state-of-the art methods including the SMRS method.
This work was supported by the project EHU13/40.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Garcia, S., Derrac, J., Cano, R., Herrera, F.: Prototype selection for nearest neighbor classification: taxonomy and empirical study. IEEE Trans. Pattern Anal. Mach. Intell. 34(3), 417–435 (2012)
Gu, M., Eisenstat, S.: Efficient algorithms for computing a strong rankrevealing QR factorization. SIAM J. Sci. Comput. 17, 848–869 (1996)
Frey, B., Dueck, D.: Clustering by passing messages between data points. Sci. Mag. 315, 972–976 (2007)
Tropp, J.: Column subset selection, matrix factorization and eigenvalue optimization. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 978–986, January 2009
Boutsidis, C., Mahoney, M., Drineas, P.: An improved approximation algorithm for the column subset selection problem. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 968–977, January 2009
Elhamifar, E., Sapiro, G., Vidal, R.: See all by looking at a few: sparse modeling for finding representative objects. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 1600–1607, June 2012
Bien, J., Xu, Y., Mahoney, M.: CUR from a sparse optimization viewpoint. In: Advances in Neural Information Processing Systems, pp. 217–225, December 2010
Czarnowski, I.: Cluster-based instance selection for machine classification. Knowl. Inf. Syst. 78(3), 1–21 (2010)
Chen, J., Zhang, C., Xue, X., Liu, C.L.: Fast instance selection for speeding up support vector machines. Knowl.-Based Syst. 47, 1–7 (2013)
Narayan, B., Murthy, C., Pal, S.: Maxdiff kd-trees for data condensation. Pattern Recogn. Lett. 27, 187–200 (2006)
Chan, T.: Rank revealing QR factorizations. Linear Algebra Appl. 88–89, 67–82 (1987)
Esser, E., Moller, M., Osher, S., Sapiro, G., Xin, J.: A convex model for nonnegative matrix factorization and dimensionality reduction on physical space. IEEE Trans. Image Process. 21(7), 3239–3252 (2012)
Charikar, M., Guha, S., Tardos, A., Shmoys, D.: A constant-factor approximation algorithm for the k-median problem. J. Comput. Syst. Sci. 65(1), 129–149 (2002)
Givoni, I., Chung, C., Frey, B.: Hierarchical affinity propagation. In: Conference on Uncertainty in Artificial Intelligence, July 2011
Duda, R., Hart, P., Stork, D.: Pattern Classification. WileyInterscience, U.S.A (2004)
Dueck, D., Frey, B.: Non-metric affinity propagation for unsupervised image categorization. In: Proceedings of International Conference in Computer Vision, pp. 1–8, October 2007
Olvera-López, J.A., Carrasco-Ochoa, J.A., MartÃnez-Trinidad, J.F.: Prototype selection via prototype relevance. In: Ruiz-Shulcloper, J., Kropatsch, W.G. (eds.) CIARP 2008. LNCS, vol. 5197, pp. 153–160. Springer, Heidelberg (2008)
Dornaika, F., Aldine, I.K.: Instance selection using two phase collaborative neighbor representation. In: Wermter, S., Weber, C., Duch, W., Honkela, T., Koprinkova-Hristova, P., Magg, S., Palm, G., Villa, A.E.P. (eds.) ICANN 2014. LNCS, vol. 8681, pp. 121–128. Springer, Heidelberg (2014)
Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1–122 (2011)
Waqas, J., Yi, Z., Zhang, L.: Collaborative neighbor representation based classification using \(l_{2}\)-minimization approach. Pattern Recogn. Lett. 34(2), 201–208 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Dornaika, F., Aldine, I.K., Cases, B. (2015). Exemplar Selection Using Collaborative Neighbor Representation. In: Onieva, E., Santos, I., Osaba, E., Quintián, H., Corchado, E. (eds) Hybrid Artificial Intelligent Systems. HAIS 2015. Lecture Notes in Computer Science(), vol 9121. Springer, Cham. https://doi.org/10.1007/978-3-319-19644-2_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-19644-2_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19643-5
Online ISBN: 978-3-319-19644-2
eBook Packages: Computer ScienceComputer Science (R0)