{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:36:46Z","timestamp":1725899806011},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374432"},{"type":"electronic","value":"9783642374449"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37444-9_10","type":"book-chapter","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T14:22:02Z","timestamp":1364394122000},"page":"120-133","source":"Crossref","is-referenced-by-count":8,"title":["Maximal Cliques Based Rigid Body Motion Segmentation with a RGB-D Camera"],"prefix":"10.1007","author":[{"given":"Samunda","family":"Perera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Barnes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Perera, S., Barnes, N.: A simple and practical solution to the rigid body motion segmentation problem using a RGB-D camera. In: Proc. Int Digital Image Computing Techniques and Applications (DICTA) Conf., pp. 494\u2013500 (2011)","DOI":"10.1109\/DICTA.2011.89"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1008000628999","volume":"29","author":"J.P. Costeira","year":"1998","unstructured":"Costeira, J.P., Kanade, T.: A multibody factorization method for independently moving objects. International Journal of Computer Vision\u00a029, 159\u2013179 (1998)","journal-title":"International Journal of Computer Vision"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1109\/TPAMI.2005.244","volume":"27","author":"R. Vidal","year":"2005","unstructured":"Vidal, R., Ma, Y., Sastry, S.: Generalized principal component analysis (GPCA). IEEE Trans. Pattern Anal. Mach. Intell.\u00a027, 1945\u20131959 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1007948927139","volume":"26","author":"K. Kanatani","year":"1998","unstructured":"Kanatani, K.: Geometric information criterion for model selection. International Journal of Computer Vision\u00a026, 171\u2013189 (1998)","journal-title":"International Journal of Computer Vision"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1098\/rsta.1998.0224","volume":"356","author":"P.H.S. Torr","year":"1998","unstructured":"Torr, P.H.S.: Geometric motion segmentation and model selection. Philosophical Transactions: Mathematical, Physical and Engineering Sciences\u00a0356, 1321\u20131340 (1998)","journal-title":"Philosophical Transactions: Mathematical, Physical and Engineering Sciences"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/11744023_47","volume-title":"Computer Vision \u2013 ECCV 2006","author":"K. Schindler","year":"2006","unstructured":"Schindler, K., James, U., Wang, H.: Perspective n-View Multibody Structure-and-Motion Through Model Selection. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03951, pp. 606\u2013619. Springer, Heidelberg (2006)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/34.88573","volume":"13","author":"S. Umeyama","year":"1991","unstructured":"Umeyama, S.: Least-squares estimation of transformation parameters between two point patterns. IEEE Trans. Pattern Anal. Mach. Intell.\u00a013, 376\u2013380 (1991)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Agrawal, M., Konolige, K., Iocchi, L.: Real-time detection of independent motion using stereo. In: Proc. IEEE Workshop Motion and Video Computing WACV\/MOTIONS 2005, vol.\u00a02, pp. 207\u2013214 (2005)","DOI":"10.1109\/ACVMOT.2005.98"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1177\/027836498200100304","volume":"1","author":"R.C. Bolles","year":"1982","unstructured":"Bolles, R.C., Cain, R.A.: Recognizing and locating partially visible objects: The local-feature-focus method. The Int. J. of Robotics Research\u00a01, 57\u201382 (1982)","journal-title":"The Int. J. of Robotics Research"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-46805-6_15","volume-title":"Shape, Contour and Grouping in Computer Vision","author":"P. Tu","year":"1999","unstructured":"Tu, P., Saxena, T., Hartley, R.: Recognizing Objects Using Color-Annotated Adjacency Graphs. In: Forsyth, D., Mundy, J.L., Di Ges\u00fa, V., Cipolla, R. (eds.) Shape, Contour, and Grouping 1999. LNCS, vol.\u00a01681, pp. 246\u2013263. Springer, Heidelberg (1999)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Ion, A., Carreira, J., Sminchisescu, C.: Image segmentation by figure-ground composition into maximal cliques. In: Proc. IEEE Int Computer Vision (ICCV) Conf., pp. 2110\u20132117 (2011)","DOI":"10.1109\/ICCV.2011.6126486"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Enqvist, O., Josephson, K., Kahl, F.: Optimal correspondences from pairwise constraints. In: Proc. IEEE 12th Int Computer Vision Conf., pp. 1295\u20131302 (2009)","DOI":"10.1109\/ICCV.2009.5459319"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11263-011-0437-z","volume":"96","author":"A. Delong","year":"2012","unstructured":"Delong, A., Osokin, A., Isack, H., Boykov, Y.: Fast approximate energy minimization with label costs. Int. J. Comput. Vision\u00a096, 1\u201327 (2012)","journal-title":"Int. J. Comput. Vision"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM\u00a016, 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E. Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science\u00a0363, 28\u201342 (2006)","journal-title":"Theoretical Computer Science"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-17517-6_36","volume-title":"Algorithms and Computation","author":"D. Eppstein","year":"2010","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I. LNCS, vol.\u00a06506, pp. 403\u2013414. Springer, Heidelberg (2010)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing\u00a06, 505\u2013517 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters\u00a027, 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput.\u00a014, 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K. Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New Algorithms for Enumerating All Maximal Cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 260\u2013272. Springer, Heidelberg (2004)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20662-7_31","volume-title":"Experimental Algorithms","author":"D. Eppstein","year":"2011","unstructured":"Eppstein, D., Strash, D.: Listing All Maximal Cliques in Large Sparse Real-World Graphs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 364\u2013375. Springer, Heidelberg (2011)"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J. Moon","year":"1965","unstructured":"Moon, J., Moser, L.: On cliques in graphs. Israel J. of Mathematics\u00a03, 23\u201328 (1965)","journal-title":"Israel J. of Mathematics"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045, 634\u2013652 (1998)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37444-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:27:40Z","timestamp":1558315660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37444-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374432","9783642374449"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37444-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}