Abstract
We introduce the complete graph decomposition approach for joint grouping and labeling. Our framework takes into consideration both how to group subjects and how to assign labels to them in a joint manner, without knowing the number of groups beforehand. We model the relations of different targets via a complete graph, which is decomposed into a set of complete subgraphs to represent distinct groups. We implement this joint framework by fusing both deep features and rich contextual cues with model parameters learned from data. We propose an alternating search algorithm to solve the relevant inference problem efficiently. We evaluate the effectiveness of the proposed approach on human activity understanding, and show the proposed approach is competitive compared against the state-of-the-art.
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
Eddy, I., Nikolaus, M., Tonmoy, S., Margret, K., Alexey, D., Thomas, B.: FlowNet2.0: evolution of optical flow estimation with deep networks. In: IEEE Conference on Computer Vision and Pattern Recognition (2017)
Grötschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. 45(1–3), 59–96 (1989)
He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: IEEE Conference on Computer Vision and Pattern Recognition (2016)
Joseph, R., Ali, F.: YOLO9000: better, faster, stronger. In: IEEE Conference on Computer Vision and Pattern Recognition (2017)
Kappes, J., et al.: A comparative study of modern inference techniques for discrete energy minimization problems. In: IEEE Conference on Computer Vision and Pattern Recognition (2013)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291–307 (1970)
Keuper, M., Levinkov, E., Bonneel, N., Lavoué, G., Brox, T., Andres, B.: Efficient decomposition of image and mesh graphs by lifted multicuts. In: IEEE International Conference on Computer Vision (2015)
Kong, Y., Jia, Y., Fu, Y.: Learning human interaction by interactive phrases. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7572, pp. 300–313. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33718-5_22
Law, M., Urtasun, R., Zemel, R.: Deep spectral clustering learning. In: International Conference on Machine Learning (2017)
Levinkov, E., Tang, S., Insafutdinov, E., Andres, B.: Joint graph decomposition and node labeling by local search. In: IEEE Conference on Computer Vision and Pattern Recognition (2017)
Ryoo, M., Aggarwal, J.: UT-interaction dataset, ICPR contest on semantic description of human activities (SDHA). In: IEEE International Conference on Pattern Recognition Workshops (2010)
Simonyan, K., Zisserman, A.: Two-stream convolutional networks for action recognition in videos. In: Advances in Neural Information Processing Systems (2014)
Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014)
Stergiou, A., Poppe, R.: Understanding human-human interactions: a survey. arXiv preprint arXiv:1808.00022 (2018)
Tang, S., Andres, B., Andriluka, M., Schiele, B.: Subgraph decomposition for multi-target tracking. In: IEEE Conference on Computer Vision and Pattern Recognition (2015)
Tsochantaridis, I., Joachims, T., Hofmann, T., Altun, Y.: Large margin methods for structured and interdependent output variables. J. Mach. Learn. Res. 6(2), 1453–1484 (2006)
Vondrick, C., Patterson, D., Ramanan, D.: Efficiently scaling up crowdsourced video annotation. Int. J. Comput. Vis. 101(1), 184–204 (2013)
Wang, L., et al.: Temporal segment networks: towards good practices for deep action recognition. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9912, pp. 20–36. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46484-8_2
Wang, Z., Liu, S., Zhang, J., Chen, S., Guan, Q.: A spatio-temporal CRF for human interaction understanding. IEEE Trans. Circ. Syst. Video Technol. 27(8), 1647–1660 (2017)
Acknowledgement
This work is partially supported by National Natural Science Foundation of China (61802348).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Ge, J., Wang, Z., Meng, J., Zhang, J., Chen, S. (2019). Joint Grouping and Labeling via Complete Graph Decomposition. In: Gedeon, T., Wong, K., Lee, M. (eds) Neural Information Processing. ICONIP 2019. Communications in Computer and Information Science, vol 1143. Springer, Cham. https://doi.org/10.1007/978-3-030-36802-9_53
Download citation
DOI: https://doi.org/10.1007/978-3-030-36802-9_53
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-36801-2
Online ISBN: 978-3-030-36802-9
eBook Packages: Computer ScienceComputer Science (R0)