PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!
  • Sesja wygasła!
  • Sesja wygasła!
  • Sesja wygasła!
  • Sesja wygasła!
Tytuł artykułu

Content-based load shedding in multimedia data stream management system

Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
Overload management has become very important in public safety systems that analyse high performance multimedia data streams, especially in the case of detection of terrorist and criminal dangers. Efficient overload management improves the accuracy of automatic identification of persons suspected of terrorist or criminal activity without requiring interaction with them. We argue that in order to improve the quality of multimedia data stream processing in the public safety arena, the innovative concept of a Multimedia Data Stream Management System (MMDSMS) using load-shedding techniques should be introduced into the infrastructure to monitor and optimize the execution of multimedia data stream queries. In this paper, we present a novel content-centered load shedding framework, based on searching and matching algorithms, for analysing video tuples arriving within multimedia data streams. The framework tracks and registers all symptoms of overload, and either prevents overload before it occurs, or minimizes its effects. We have extended our Continuous Query Language (CQL) syntax to enable this load shedding technique. The effectiveness of the framework has been verified using both artificial and real data video streams collected from monitoring devices.
Rocznik
Strony
79--95
Opis fizyczny
Bibliogr. 37 poz., rys., tab.
Twórcy
autor
  • Poznan University of Technology, Institute of Computing Science, ul. Piotrowo 2, 60- 965 Poznan, Poland
  • Poznan University of Technology, Institute of Computing Science, ul. Piotrowo 2, 60- 965 Poznan, Poland
Bibliografia
  • [1] D. J. Abadi, D. Carney, U. Çetintemel, M. Cherniack, C. Convey, S. Lee, M. Stonebraker, N. Tatbul, and S. Zdonik, “Aurora: A New Model and Architecture for Data Stream Management,” Internat. J. Very Large Data Bases (VLDB J.), 12:2 (2003), 120-139.
  • [2] S. Acharya, P. B. Gibbons, and V. Poosala, “Congressional Samples for Approximate Answering of Group-By Queries,” Proc. ACM SIGMOD Internat. Conf. on Management of Data (SIGMOD ’00) (Dallas, TX, 2000), pp. 487-498.
  • [3] S. Acharya, P. B. Gibbons, V. Poosala, and S. Ramaswamy, “Join Synopses for Approximate Query Answering,” Proc. ACM SIGMOD Internat. Conf. on Management of Data (SIGMOD ’99) (Philadelphia, PA, 1999), pp. 275-286.
  • [4] Amiri, A., Fathy, M., Naseri, A., "Key-frame extraction and video summarization using QR-Decomposition", Digital Content, Multimedia Technology and its Applications (IDC), 2010 6th International Conference on, On page(s): 134 - 139, Volume: Issue: , 16- 18 Aug. 2010.
  • [5] N. Apostoloff and A. Zisserman, “Who Are You? - Real-Time Person Identification,” Proc. British Machine Vision Conf. (BMVC ’07) (Coventry, UK, 2007), pp. 509-518.
  • [6] A. Arasu, B. Babcock, S. Babu, J. Cieslewicz, M. Datar, K. Ito, R. Motwani, U. Srivastava, and J. Widom, “STREAM: The Stanford Data Stream Management System,” Stanford Univ. InfoLab, 2004, <http://dbpubs.stanford.edu:8090/pub/2004-20>.
  • [7] B. Babcock, S. Chaudhuri, and G. Das, “Dynamic Sample Selection for Approximate Query Processing,” Proc. ACM SIGMOD Internat. Conf. on Management of Data (SIGMOD ’03) (San Diego, CA, 2003), pp. 539-550.
  • [8] B. Babcock, M. Datar, and R. Motwani, “Load Shedding for Aggregation Queries over Data Streams,” Proc. 20th Internat. Conf. on Data Eng. (ICDE ’04) (Boston, MA, 2004), pp. 350-361.
  • [9] Camara-Chavez, G., Precioso, F., Cord, M., Phillip-Foliguet, S., de A. Araujo, A., "An interactive video content-based retrieval system", Systems, Signals and Image Processing, 2008. IWSSIP 2008. 15th International Conference on, On page(s): 133 - 136, Volume: Issue: , 25-28 June 2008
  • [10] K. Chakrabarti, M. N. Garofalakis, R. Rastogi, and K. Shim, “Approximate Query Processing Using Wavelets,” Proc. 26th Internat. Conf. on Very Large Data Bases (VLDB ’00) (Cairo, Egy., 2000), pp. 111-122.
  • [11] S. Chandrasekaran, O. Cooper, A. Deshpande, M. J. Franklin, J. M. Hellerstein, W. Hong, S. Krishnamurthy, S. Madden, V. Raman, F. Reiss, and M. Shah, “TelegraphCQ: Continuous Dataflow Processing for an Uncertain World,” Proc. 1st Biennial Conf. on Innovative Data Syst. Res. (CIDR ’03) (Asilomar, CA, 2003).
  • [12] S. Chang, L. Zhao, S. Guirguis and R. Kulkarni, “A Computation-Oriented Multimedia Data Streams Model for Content-Based Information Retrieval.” In Multimedia Tools and Applications, Volume 46, Nos. 2-3, pages 399-423, Jan 2010.
  • [13] Chasanis, V.T., Likas, A.C., Galatsanos, N.P., "Scene Detection in Videos Using Shot Clustering and Sequence Alignment", Multimedia, IEEE Transactions on, On page(s): 89 - 100, Volume: 11 Issue: 1, Jan. 2009
  • [14] S. Chaudhuri, R. Motwani, and V. Narasayya, “On Random Sampling over Joins,” Proc. ACM SIGMOD Internat. Conf. on Management of Data (SIGMOD ’99) (Philadelphia, PA, 1999), pp. 263-274.
  • [15] G. F. Franklin, J. D. Powell, and A. Emami-Naeini, Feedback Control of Dynamic Systems, Prentice Hall, Upper Saddle River, NJ, 2002.
  • [16] Y. E. Ioannidis and V. Poosala, “Histogram-Based Approximation of Set-Valued Query-Answers,” Proc. 25th Internat. Conf. on Very Large Data Bases (VLDB ’99) (Edinburgh, Scot., 1999), pp. 174-185.
  • [17] L. Lim, M. Wang, and J. S. Vitter, “SASH: A Self-Adaptive Histogram Set for Dynamically Changing Workloads,” Proc. 29th Internat. Conf. on Very Large Data Bases (VLDB ’03) (Berlin, Ger., 2003), pp. 369-380.
  • [18] S.-H. Lin, S.-Y. Kung, and L.-J. Lin, “Face Recognition/Detection by Probabilistic Decision-Based Neural Network,” IEEE Trans. Neural Networks, 8:1 (1997), 114-132.
  • [19] Jiebo Luo, Papin, C., Costello, K., "Towards Extracting Semantically Meaningful Key Frames From Personal Video Clips: From Humans to Computers", Circuits and Systems for Video Technology, IEEE Transactions on, On page(s): 289 - 301, Volume: 19 Issue: 2, Feb. 2009.
  • [20] R. Maison, D.J. Steen, M. Zakrzewicz and Z. Biniek, “Monitoring High Performance Data Streams in Vertical Markets: Theory and Applications in Public Safety and Healthcare,” Bell Labs Technical Journal, 16(3) (2011), 163-180.
  • [21] R. Maison and M. Zakrzewicz, “Prediction-Based Load Shedding for Burst Data Streams,” Bell Labs Technical Journal, 16(1) (2011), 121-132.
  • [22] Y. Matias, J. S. Vitter, and M. Wang, “Dynamic Maintenance of Wavelet-Based Histograms,” Proc. 26th Internat. Conf. on Very Large Data Bases (VLDB ’00) (Cairo, Egy., 2000), pp. 101-110.
  • [23] R. Motwani, J. Widom, A. Arasu, B. Babcock, S. Babu, M. Datar, G. Manku, C. Olston, J. Rosenstein, and R. Varma, “Query Processing, Resource Management, and Approximation in a Data Stream Management System,” Proc. 1st Biennial Conf. on Innovative Data Syst. Res. (CIDR ’03) (Asilomar, CA, 2003).
  • [24] A. Pentland, B. Moghaddam, and T. Starner, “View-Based and Modular Eigenspaces for Face Recognition,” Proc. IEEE Conf. on Comput. Vision and Pattern Recognition (CVPR ’94) (Seattle, WA, 1994), pp. 84-91.
  • [25] F. Reiss and J. M. Hellerstein, “Data Triage: An Adaptive Architecture for Load Shedding in TelegraphCQ,” Proc. 21st Internat. Conf. on Data Eng. (ICDE ’05) (Tokyo, Jpn., 2005), pp. 155-156.
  • [26] F. Reiss and J. M. Hellerstein, “Declarative Network Monitoring with an Underprovisioned Query Processor,” Proc. 22nd Internat. Conf. on Data Eng. (ICDE ’06) (Atlanta, GA, 2006), p. 56.
  • [27] F. Sameria and S. Young, “HMM-Based Architecture for Face Identification,” Image and Vision Comput., 12:8 (1994), 537-543.
  • [28] N. Tatbul, U. Çetintemel, S. Zdonik, M. Cherniack, and M. Stonebraker, “Load Shedding in a Data Stream Manager,” Proc. 29th Internat. Conf. on Very Large Data Bases (VLDB ’03) (Berlin, Ger., 2003), pp. 309-320.
  • [29] N. Tatbul and S. Zdonik, “Window-Aware Load Shedding for Aggregation Queries over Data Streams,” Proc. 32nd Internat. Conf. on Very Large Data Bases (VLDB ’06) (Seoul, Kor., 2006), pp. 799-810.
  • [30] Y.-C. Tu, S. Liu, S. Prabhakar, and B. Yao, “Load Shedding in Stream Databases: A Control-Based Approach,” Proc. 32nd Internat. Conf. on Very Large Data Bases (VLDB ’06) (Seoul, Kor., 2006), pp. 787-798.
  • [31] M. A. Turk and A. P. Pentland, “Face Recognition Using Eigenfaces,” Proc. IEEE Conf. on Comput. Vision and Pattern Recognition (CVPR ’91) (Maui, HI, 1991), pp. 586-591.
  • [32] P. Viola and M. Jones, “Robust Real-Time Object Detection,” Proc. 2nd Internat. Workshop on Statistical and Computational Theories of Vision (SCTV ’01) (Vancouver, BC, Can., 2001).
  • [33] J. S. Vitter and M. Wang, “Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets,” Proc. ACM SIGMOD Internat. Conf. on Management of Data (SIGMOD ’99) (Philadelphia, PA, 1999), pp. 193-204.
  • [34] L. Wiskott, J.-M. Fellous, N. Krüger, and C. von der Malsburg, “Face Recognition by Elastic Bunch Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, 19:7 (1997), 775-779.
  • [35] Qing Xu; Pengcheng Wang; Bin Long; Sbert, M.; Feixas, M.; Scopigno, R.; , "Selection and 3D visualization of video key frames," Systems Man and Cybernetics (SMC), 2010 IEEE International Conference on , vol., no., pp.52-59, 10-13 Oct. 2010 doi: 10.1109/ICSMC.2010.5642204.
  • [36] W. Zhao, A. Krishnaswamy, R. Chellappa, D. L. Swets, and J. Weng, “Discriminant Analysis of Principal Components for Face Recognition,” Face Recognition: From Theory to Applications (H. Wechsler, P. J. Phillips, V. Bruce, F. Fogelman Soulié, and T. S. Huang, eds.), Springer-Verlag, Berlin, Heidelberg, New York, 1998, pp. 73-85.
  • [37] Y. Zhuang, Y. Rui, T.S. Huang and S. Mehrotra, "Adaptive key frame extraction using unsupervised clustering," Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on , vol.1, no., pp.866-870 vol.1, 4-7 Oct 1998.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-0b4f3cb3-66a8-4df1-982d-bddffdd2f800
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.