{"title":"Video shot analysis using efficient multiple object tracking","authors":"V. V. Vinod, H. Murase","doi":"10.1109/MMCS.1997.609762","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609762","url":null,"abstract":"We present a method for analyzing video shots by tracking interesting objects in the video. Tracking employs efficient object search using upper bound pruning and statistical prediction of search area. The trades are analyzed to identify representative frames in shot and to build a concise representation. Experimental results on different types of video data are promising.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"159 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125932166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"JETS: a Java-enabled telecollaboration system","authors":"S. Shirmohammadi, N. Georganas","doi":"10.1109/MMCS.1997.609767","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609767","url":null,"abstract":"Real-time collaboration systems, in which participants share multimedia documents and applications in real time, have been a subject of interest for many years. Recent advancements in the Internet technology such as the emergence of Java-enabled browsers, VRML, ActiveX, LiveConnect; and similar technologies have provided users with access to dynamic multimedia content and applications on the World Wide Web. Among these technologies, Java applets seem to have introduced the most exciting notion: platform-independent applications provided by the network. Using a web-browser users can now run applications dynamically off the network. From a network-centric-computing point of view, the next logical step towards collaborative environments would to be the real-time sharing of these applications. In order to achieve that, the authors have designed JETS: a generic, multiuser/collaborative system which enables the real-time sharing of Java applets through the Internet.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"82 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130693956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adaptive continuous media applications in mobile computing environments","authors":"T. Nakajima, Akihiro Hokimoto","doi":"10.1109/MMCS.1997.609588","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609588","url":null,"abstract":"This paper presents a new framework for building continuous media applications in a mobile computing environment. In a mobile computing environment, network bandwidth and machine configurations may be changed dramatically, and mobile applications should be adapted to various operational environments for efficient execution. In our framework, an application is partitioned into two pieces. One piece runs on a mobile computer such as a notebook computer and a PDA, and another piece runs on a stationary computer. They are connected by several types of wireless networks that can be replaced at any time while applications run. The piece on a stationary computer is called a service proxy. The service proxy filters or caches data from servers on the Internet before transmitting the data to the piece on a mobile computer. These two pieces are constructed by composing small objects. The composition of objects can be dynamically reconfigured by adding or removing replaceable devices transparently from users.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129754082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An adaptive threshold finding algorithm for introducing IP traffic into ATM","authors":"T. Atmaca, B. Aygun, H. Korezlioglu","doi":"10.1109/MMCS.1997.609579","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609579","url":null,"abstract":"Internet is the largest computer network in the world and in the near future all Internet traffic will be carried over ATM. Internetworking on Internet depends on IP (Internet Protocol). Yet there still exist some points on carrying IP traffic over ATM that have not been standardized. The success of ATM mainly depends on its capability of carrying IP traffic together with other real time CBR or VBR traffic (e.g. voice or video). In this work we study the adaptive controllability of queues with an MMBP arrival process and geometric service times. The queueing system is chosen to model the IP-LAN and ATM interconnection. The control of the queueing system is done by threshold pairs for determining the service rates according to the queue occupancy and the arrival phase. The interworking unit continuously observes the queue occupancy and the arrivals to select a service rate according to threshold pairs.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"853 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123137782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"MrBrAQue: a multimedia medical report management system","authors":"P. Merialdo, G. Sindoni","doi":"10.1109/MMCS.1997.609794","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609794","url":null,"abstract":"The goal of the MrBrAQue (Medical Report BRowse And QUEry) project is to develop a system that enables effective management of a large collection of multimedia documents. The tools for consulting the report collection are presented in this paper. Our proposal is based on a paradigm, which we call orthogonal navigation, that allows a user to dynamically build a hypermedia network of documents by means of queries over the document collection.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125712611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An aggressive admission control scheme for multimedia servers","authors":"Xiaoye Jiang, P. Mohapatra","doi":"10.1109/MMCS.1997.609785","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609785","url":null,"abstract":"The authors have proposed two types of admission control algorithms for multimedia storage servers: future-max (FM) and interval estimation (IE). The FM algorithm uses the maximum bandwidth requirement of the the future to estimate the bandwidth requirement. The IE algorithm defines a class of admission control schemes that uses a combination of maximum and average bandwidth within each interval to estimate the bandwidth requirement of the interval. The performance evaluations done through simulations show that the server utilization and the quality of service are improved by using the FM and IE algorithms.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114484129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An optimal dynamic multicast routing algorithm for multimedia applications","authors":"Moon-sik Kang","doi":"10.1109/MMCS.1997.609573","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609573","url":null,"abstract":"A source-based optimal dynamic multicast routing algorithm is proposed, which satisfies the network conditions of delay constraints and cost minimization and adapts to a dynamic network events. Also, we look at the following network requirements: efficient dynamic group support, high-quality data distribution, and adaptability to dynamically changing events. We construct a dynamic delay-bounded optimal multicast tree using partial multicast routing and evaluate the performance of the proposed algorithm by running simulations, written in C++, with randomly-generated test networks on a Sun Sparc 20 workstation. By choosing appropriate values for the delay bound, we were able to obtain an optimal solution that lies between the minimum-cost solution and the minimum-delay one.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127890715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"IMcast: an object-oriented tool for image multicasting","authors":"Eric R. Kass, P. McKinley","doi":"10.1109/MMCS.1997.609783","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609783","url":null,"abstract":"An online still image distribution system, IMcast, was developed to support instruction in the College of Veterinary Medicine at Michigan State University. The main objective of this project was to build a system that could quickly dispense medical images from an instructor's workstation to PCs on student desktops with no degradation in image quality. IMcast uses a client/server paradigm and is designed to take advantage of the message-based Microsoft Windows operating system. Images are transmitted using IP multicast and a negative acknowledgement protocol. Development of large software applications dictates a modular design. Object orientation facilitates this organization by forcing software components to interact with one another by way of public interfaces. The object-oriented IMcast architecture is presented.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132952283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Color clustering techniques for color-content-based image retrieval from image databases","authors":"Jia Wang, Wen-jann Yang, R. Acharya","doi":"10.1109/MMCS.1997.609755","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609755","url":null,"abstract":"Image retrieval based on color content is an auxiliary function for traditional text-annotated image databases. Most color-based image retrieval systems adopt color histograms as the feature of color content. One of the most important steps in these systems is to reduce histogram dimensions with the least loss in color content. A good clustering technique is vital for this purpose. This paper examines the color conservation property by applying different clustering techniques in perceptually uniform color spaces and different images. For studying color spaces, the perceptual uniform spaces, such as Mathematical Transformation to Munsell system (MTM) and C.I.E. L*a*b*, are investigated. For evaluating clustering techniques, the equalized quantization approach, the hierarchical clustering approach, and the Color-Naming-System (CNS) supervised clustering approach are studied. For analyzing color loss, the error bound, the quantized error in color space conversion, and the average quantized error of 400 color images are explored. An image retrieval application based on color content is shown to demonstrate the difference in applying these clustering techniques. These simulation results suggest that good clustering techniques usually lead to more effective retrieval.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132046684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modeling of moving objects in a video database","authors":"John Z. Li, M. Tamer Özsu, D. Szafron","doi":"10.1109/MMCS.1997.609625","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609625","url":null,"abstract":"We introduce an innovative way to represent the trajectory of a single moving object and the relative spatio-temporal relations between multiple moving objects. The representation supports a rich set of spatial topological and directional relations. It also supports both quantitative and qualitative user queries about moving objects. Algorithms for matching trajectories and spatio-temporal relations of moving objects are designed to facilitate query processing. These algorithms can handle both exact and similarity matches. We also discuss the integration of our moving object model, based on a video model, in an object oriented system.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123642238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}