{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:52Z","timestamp":1725455932070},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648260"},{"type":"electronic","value":"9783540685371"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0016490","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:32:22Z","timestamp":1132626742000},"page":"80-95","source":"Crossref","is-referenced-by-count":1,"title":["Video sequence similarity matching"],"prefix":"10.1007","author":[{"given":"D. A.","family":"Adjeroh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. C.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"7_CR1","unstructured":"Adjeroh D.A., Lee M.C. and 1. King, \u201cA distance measure for video sequence similarity matching\u201d, Proc., IW-MMDBMS'98, Ohio, August 1998, to appear."},{"key":"7_CR2","unstructured":"Adjeroh, D. A. and Lee, M.C., \u201cAdaptive Transform Domain Video Scene Analysis\u201d, Proc., IEEE Multimedia97, Ottawa Canada, June 3\u20136, 1997."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1109\/TCOM.1983.1095851","volume":"31","author":"P. Burt","year":"1983","unstructured":"Burt P. and Adelson E., The Laplacian pyramid as a compact code\u201d, IEEE Trans. on Communications, 31, 523\u2013540. 1983.","journal-title":"IEEE Trans. on Communications"},{"issue":"2","key":"7_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1006\/jvci.1996.0346","volume":"8","author":"C-W Chang","year":"1997","unstructured":"Chang C-W, and Lee S-Y, \u201cVideo content representation; indexing, and matching in video information systems\u201d, J. Visual Comm. & Image Repr., 8, 2, 107\u2013120. 1997.","journal-title":"J. Visual Comm. & Image Repr."},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01185431","volume":"12","author":"W.I. Chang","year":"1994","unstructured":"Chang W.I. and Lawler E.L., \u201cSublinear approximate string matching and biological applications\u201d. Algorithmica, 12:327\u2013344, 1994.","journal-title":"Algorithmica"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Cheever E.A., et al, \u201cUsing signal processing techniques for DNA sequence comparison\u201d, Proc., 5th Annual Northeast Bioengineering Conf., pp. 173\u2013174, MA, 1989.","DOI":"10.1109\/NEBC.1989.36756"},{"issue":"4","key":"7_CR7","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1145\/211430.211433","volume":"13","author":"N. Dimitrova","year":"1995","unstructured":"Dimitrova N. and Golshani F., \u201cMotion recovery for video content classification\u201d, ACM Trans. on Information Systems, 13, 4, 408\u2013439, 1995.","journal-title":"ACM Trans. on Information Systems"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Ranganathan M, and Manolopoulos Y, \u201cFast subsequence matching in time-series databases\u201d, Proc., ACM SIGMOD, pp. 419\u2013429, Minneapolis MN, 1994.","DOI":"10.1145\/191839.191925"},{"issue":"6","key":"7_CR9","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/0219067","volume":"19","author":"Z Galil","year":"1990","unstructured":"Galil Z and Park K., \u201cAn improved algorithm for approximate string matching\u201d, SIAM J. of Computing, 19, 6, 989\u2013999, 1990.","journal-title":"SIAM J. of Computing"},{"key":"7_CR10","volume-title":"Digital Image Processing","author":"R.C. Gonzalez","year":"1992","unstructured":"Gonzalez R.C. and Woods R.E., Digital Image Processing. Addison-Wesley Publishing Co., Readings Massachusetts, 1992."},{"issue":"2","key":"7_CR11","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1006\/jvci.1997.0355","volume":"8","author":"F. Idris","year":"1997","unstructured":"Idris F. and Panchanathan S., \u201cReview of image and video indexing\u201d, J. Visual Comm. & and Image Repr., 8,2,146\u2013166, 1997.","journal-title":"J. Visual Comm. & and Image Repr."},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01211664","volume":"7","author":"M. Iorka","year":"1994","unstructured":"Iorka M. and Masato Kurokawa, \u201cEstimation of motion vectors and their aoolication to scene retrieval\u201d, Machine Vision and Applications, 7:199\u2013208, 1994.","journal-title":"Machine Vision and Applications"},{"key":"7_CR13","unstructured":"Irani M. and Anandan P., \u201cVideo indexing based on mosaic representations\u201d, Tech. Report, Dept. of Applied Maths. & Comp. Sc., The Weizmann Institute, Israel, 1997."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Lee J-S, et al, \u201cEfficient algorithms for approximate string matching with swaps\u201d, LNCS 1264, Combinatorial Pattern Matching, pp. 28\u201339, 1997.","DOI":"10.1007\/3-540-63220-4_47"},{"key":"7_CR15","first-page":"35","volume":"21","author":"A. Milosavljevic","year":"1995","unstructured":"Milosavljevic A., \u201cDiscovering dependencies via algorithmic mutual information: a case study in DNA sequence comparison\u201d, Machine Learning, 21, 35\u201350, 1995.","journal-title":"Machine Learning"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF01185432","volume":"12","author":"E.W. Myers","year":"1994","unstructured":"Myers E.W., \u201cA sublinear algorithm for approximate keyword searching\u201d, Algorithmica, 12: 345\u2013374, 1994","journal-title":"Algorithmica"},{"key":"7_CR17","first-page":"556","volume":"5","author":"M Ohya","year":"1989","unstructured":"Ohya M, \u201cInformation treatment of genes\u201d, Trans., Japanese IEICE, E72 5, 556\u2013560, 1989.","journal-title":"Trans., Japanese IEICE, E72"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Pevzner P.A. and M.S. Waterman, \u201cA fast filteration algorithm for the substring matching problem\u201d, LNCS 684, Combinatorial Pattern Matching, pp. 197\u2013214, 1993.","DOI":"10.1007\/BFb0029806"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Sankoff D., \u201cEdit distance for genome comparison based on non-local operations\u201d, LNCS 644, Combinatorial Pattern Matching, pp. 121\u2013135, 1992.","DOI":"10.1007\/3-540-56024-6_10"},{"issue":"8","key":"7_CR20","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1109\/34.531801","volume":"18","author":"H.S. Sawhney","year":"1996","unstructured":"Sawhney H.S., and Ayer S., \u201cCompact representation of videos through dominant and multiple motion estimation\u201d, IEEE Trans. PAMI, 18, 8, 814\u2013830, 1996.","journal-title":"IEEE Trans. PAMI"},{"key":"7_CR21","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P.H Sellers","year":"1980","unstructured":"Sellers P.H, \u201cThe theroy of computation of evolutionary distances: pattern ecognition\u201d, J. of Algorithms, 1, 359\u2013373, 1980.","journal-title":"J. of Algorithms"},{"key":"7_CR22","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.C. Tai","year":"1979","unstructured":"Tai K.C., \u201cThe tree-to-tree correction problem\u201d, J. of ACM, 26: 422\u2013433, 1979.","journal-title":"J. of ACM"},{"key":"7_CR23","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E. Ukkonen","year":"1985","unstructured":"Ukkonen E., \u201cFinding approximate patterns in strings\u201d, J. of Algorithms, 6, 132\u2013137, 1985.","journal-title":"J. of Algorithms"},{"key":"7_CR24","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"A. Wagner","year":"1974","unstructured":"Wagner A. and Fischer M.J, \u201cThe string-to-string correction problem\u201d, J. of ACM, 21: 168\u2013173, 1974.","journal-title":"J. of ACM"},{"key":"7_CR25","volume-title":"Mathematical Methods for DNA Sequences","author":"M.S. Waterman","year":"1989","unstructured":"Waterman, M.S. (ed.), Mathematical Methods for DNA Sequences, CRC Press, Boca Raton, Florida, 1989."},{"issue":"10","key":"7_CR26","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1109\/10.536900","volume":"43","author":"F. Wendling","year":"1996","unstructured":"Wendling F.,et al, \u201cExtraction of spatio temporal signatures from depth EEG seizure signals based on objective matching in warped vectorial observations\u201d, IEEE Trans. Biomedical Engineering, 43, 10, 990\u20131000, 1996.","journal-title":"IEEE Trans. Biomedical Engineering"},{"issue":"3","key":"7_CR27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/93.556537","volume":"3","author":"W. Wold","year":"1996","unstructured":"Wold W., et al, \u201cContent-based classification, search and retrieval of audio\u201d, IEEE Multimedia, 3, 3, 27\u201336, 1996.","journal-title":"IEEE Multimedia"},{"issue":"2","key":"7_CR28","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0097-8485(93)85006-X","volume":"17","author":"J.C. Wooton","year":"1993","unstructured":"Wooton J.C. and Federhen S., \u201cStatistics of local complexity in amino acid sequences and sequence databases\u201d, Computers and Chemistry, 17, 2, 149\u2013163, 1993.","journal-title":"Computers and Chemistry"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Yazdani N and Ozsoyoglu Z.M., \u201cSequence matching of image\u201d, Proc., 8th Int'l Conf. on Scientific and Statistical Database Management, pp. 53\u201362, 1996.","DOI":"10.1109\/SSDM.1996.505915"},{"issue":"6","key":"7_CR30","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K Zhang","year":"1989","unstructured":"Zhang K, and Shasha D., \u201cSimple fast algorithms for the editing distance between trees and related problems\u201d, SIAM J. of Computing, 18, 6, 1245\u20131252, 1989.","journal-title":"SIAM J. of Computing"}],"container-title":["Lecture Notes in Computer Science","Multimedia Information Analysis and Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T18:22:14Z","timestamp":1554574934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648260","9783540685371"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/bfb0016490","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}