Abstract
Re-identification, that is recognizing that an object appearing in a scene is a reoccurrence of an object seen previously by the system (by the same camera or possibly by a different one) is a challenging problem in video surveillance. In this paper, the problem is addressed using a structural, graph-based representation of the objects of interest. A recently proposed graph kernel is adopted for extending to this representation the Principal Component Analyisis (PCA) technique. An experimental evaluation of the method has been performed on two video sequences from the publicly available PETS2009 database.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Database: Pets 2009 (2009), http://www.cvg.rdg.ac.uk/PETS2009/
Bak, S., Corvee, E., Brmond, F., Thonnat, M.: Person re-identification using haar-based and dcd-based signature. In: 2010 Seventh IEEE International Conference on Advanced Video and Signal Based Surveillance (2010)
Bazzani, L., Cristani, M., Perina, A., Farenzena, M., Murino, V.: Multiple-shot person re-identification by hpe signature. In: Proceedings of 20th International Conference on Pattern Recognition, ICPR 2010 (2010)
Bird, N., Masoud, O., Papanikolopoulos, N., Isaacs, A.: Detection of loitering individuals in public transportation areas. IEEE Transactions on Intelligent Transportation Systems 6(2), 167–177 (2005)
Brun, L., Conte, D., Foggia, P., Vento, M., Villemin, D.: Symbolic learning vs. graph kernels: An experimental comparison in a chemical application. In: 14th Conf. on Advances in Databases and Information Systems (ADBIS) (2010)
Conte, D., Foggia, P., Percannella, G., Vento, M.: Performance evaluation of a people tracking system on pets2009 database. In: Seventh IEEE International Conference on Advanced Video and Signal Based Surveillance (2010)
Desobry, F., Davy, M., Doncarli, C.: An online kernel change detection algorithm. IEEE Transaction on Signal Processing 53(8), 2961–2974 (2005)
Dupé, F.X., Brun, L.: Tree covering within a graph kernel framework for shape classification. In: Foggia, P., Sansone, C., Vento, M. (eds.) ICIAP 2009. LNCS, vol. 5716, pp. 278–287. Springer, Heidelberg (2009)
Gandhi, T., Trivedi, M.M.: Panoramic appearance map (pam) for multi-camera based person re-identification. In: IEEE International Conference on Video and Signal Based Surveillance, AVSS 2006 (2006)
Gauzere, B., Brun, L., Villemin, D.: Graph edit distance and treelet kernels for chemoinformatic. In: Graph Based Representation 2011, IAPR-TC15, Munster, Germany (May 2011) (submitted)
Haussler, D.: Convolution kernels on discrete structures. Tech. rep., Department of Computer Science, University of California at Santa Cruz (1999)
Hoffmann, H.: Kernel pca for novelty detection. Pattern Recognition 40(3), 863 (2007)
Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernel between labeled graphs. In: Proc. of the Twentieth International conference on Machine Learning (2003)
Mah, P., Vert, J.P.: Graph kernels based on tree patterns for molecules. Machine Learning 75(1), 3–35 (2008)
Neuhaus, M., Bunke, H.: Bridging the Gap Between Graph Edit Distance and Kernel Machines. World Scientific Publishing Co., Inc., River Edge (2007)
Nock, R., Nielsen, F.: Statistical region merging. IEEE Transaction on Pattern Analysis and Machine Intelligence 26(11), 1452–1458 (2004)
de Oliveira, I.O., de Souza Pio, J.L.: People reidentification in a camera network. In: IEEE Int. Conf. on Dependable, Autonomic and Secure Computing (2009)
Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vision Computing 27(7), 950–959 (2009)
Riesen, K., Neuhaus, M., Bunke, H.: Bipartite graph matching for computing the edit distance of graphs. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol. 4538, pp. 1–12. Springer, Heidelberg (2007)
Scholkopf, B., Platt, J., Shawe-Taylor, J., Smola, A.J., Williamson, R.C.: Estimating the support of a high-dimensional distribution. Neural Computation 13, 1443–1471 (2001)
Shervashidze, N., Vishwanathan, S.V., Petri, T.H., Mehlhorn, K., Borgwardt, K.M.: Efficient graphlet kernels for large graph comparison. In: Twelfth International Conference on Artificial Intelligence and Statistics (2009)
Shervashidze, N., Borgwardt, K.: Fast subtree kernels on graphs. In: Advances in Neural Information Processing Systems 22. Curran Associates Inc. (2009)
Steinke, F., Schökopf, B.: Kernels, regularization and differential equations. Pattern Recognition 41(11), 3271–3286 (2008)
Tax, D., Duin, R.: Support vector domain description. Pattern Recognition Letters 20, 1191–1199 (1999)
TruongCong, D.N., Khoudour, L., Achard, C., Meurie, C., Lezoray, O.: People re-identification by spectral classification of silhouettes. Signal Processing 90, 2362–2374 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brun, L., Conte, D., Foggia, P., Vento, M. (2011). A Graph-Kernel Method for Re-identification. In: Kamel, M., Campilho, A. (eds) Image Analysis and Recognition. ICIAR 2011. Lecture Notes in Computer Science, vol 6753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21593-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-21593-3_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21592-6
Online ISBN: 978-3-642-21593-3
eBook Packages: Computer ScienceComputer Science (R0)