This paper presents mSpiders, a system that extends traditional co-browsing to support mobility and awareness among participants. The system offers mobile users the ability to easily get help and share web documents with others over the Internet and greatly enhances users' Web-sharing experience. By introducing a new method to track and present the current attention of each participant - their region of interest (ROI), the system enables all participants aware of each other's presence and what they are viewing, independent of the specificities of Web content, browsers used and their settings.

This paper describes the analysis, implementation and performance of a new clock synchronization algorithm, which utilizes the physical properties of synthetic quartz crystals. Thus a very high accuracy (down to a few milliseconds) can be achieved. This algorithm adjusts itself to the preferences of the local quartz oscillator and dynamically to the changing environment conditions such as temperature, and humidity via a additional phase locked loop control loop. As the computing and bandwidth requirements could be kept pretty low, this algorithm could be very well used in mobile environment.

A new system is presented for accessing remote document (ARD) in a limited computing environment. It provides mobile device (PDA, HPC and PPC) users with the ability to easily access remote documents over the Internet and to quickly view the content with its original look and feel without downloading and further to print or fax the document on a remote printer over the Internet. This is achieved through the combination of the unique document streaming-on-demand mechanism and the ability to preserve the original look and feel, and off-the-shell products that support Internet printing services. We describe in detail how the challenging issues are addressed and how the system is implemented.

Over low bit rate channels, we adopt the streaming of nonlinearly sampled video frames (i.e., key-frame slideshow) synchronized with the audio stream. Given the channel and buffer limits, we wish to obtain a set of sampled frames that is not only feasible (i.e., no frame drop) but also optimal in terms of maximal information flow. The contributions of this work include the novel modeling scheme for channel and buffer limits in the video temporal sampling problem; the development of the corresponding efficient algorithms for finding the global optimal solution; and the extension and analysis of these algorithms for practical application scenarios. The proposed algorithms have made possible the automated production of video streaming over low bit rate channels for devices with limited memory and storage capability.

Over low-bit-rate channels, we adopt the streaming of nonlinearly sampled video frames (i.e., key-frame slideshow) synchronized with the audio stream. Given the channel and buffer limits, we wish to obtain a set of sampled frames that is not only feasible (i.e., streamable), but also optimal in terms of maximal information flow (given that the semantic information contents of each frame can be quantified either automatically or manually). Different application scenarios are considered and modeled in a principle way, for which we propose computationally efficient algorithms for finding the global optimal solution. The contributions of this paper include the novel modeling schemes for channel and buffer limits in the video temporal sampling problem, the analysis and development of the corresponding efficient algorithms for finding the global optimal solution, and the extension and analysis of these algorithms for practical application scenarios. The proposed algorithms have made possible the automated production of the new form of video streaming over low bit rate channels for devices with limited storage capabilities.

In this paper, we present a novel statistical approach, called the weighted voting method, for automatic news video story categorization based on the closed captioned text. News video is initially segmented into stories using the demarcations in the closed captioned text, then a set of

Article Share on Content-sensitive video streaming over low bitrate and lossy wireless network Authors: Kun Tan Tsinghua University, Beijing, China Tsinghua University, Beijing, ChinaView Profile , Richard Ribier Siemens Corporate Research, Princeton, NJ Siemens Corporate Research, Princeton, NJView Profile , Shih-Ping Liou Siemens Corporate Research, Princeton, NJ Siemens Corporate Research, Princeton, NJView Profile Authors Info & Claims MULTIMEDIA '01: Proceedings of the ninth ACM international conference on MultimediaOctober 2001 Pages 512–515https://doi.org/10.1145/500141.500227Published:01 October 2001Publication History 5citation511DownloadsMetricsTotal Citations5Total Downloads511Last 12 Months8Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

We discuss extensions to our video browsing tool described by Hjelsvold et al. (see Handbook of Internet and multimedia systems and applications, 1998). We propose to include audio related informative visual content into our tool. Hence, we suggest representing the audio track of the video by its spectrogram image and pitch curve to enhance the video and audio related information available to the user. This representation also facilitates the correction of automatically computed audio event boundaries and introduction of speaker segments. We also provide a real-time approach for segmenting audio into events, namely, silence, speech and non-speech, to further enhance the audio information space.

Raw video needs to be organized into a meaningful structure to allow easy browsing and content-based indexing. We propose and implement an interactive video organization system which allows the user to verify or correct the results of automatic algorithms at all levels of processing. The organized video is depicted as a hierarchical tree structure. The user has access to interfaces which allow the manipulation of shots, intermediate representations and the high level semantic units in the organized video.

This paper introduces the CARAT-ARC digital multimedia archiving system. CARAT-ARC is an open system for indexing, storing and searching multimedia documents (audio, video, graphics, text, etc.) It uses a hybrid approach to multimedia indexing and retrieval by combining automatic feature extraction with advanced multimedia browsing and logging tools. The motivation for such a hybrid approach as well as a description of the main parts of the systems are presented.

This paper presents a 3D image registration approach to 3D CT angiography (CTA). We extend the interest operator from 2D to 3D in order to extract 3D feature points and develop a 3D image flow algorithm to find matches of feature points between the mask and the contrast data sets. A robust 3D motion estimation algorithm is also developed which handles outliers up to 50% of all computed image flow vectors. The subtracted volume after motion correction is rendered on the display. The proposed algorithm has been successfully applied to a clinical CTA data set and the result is very promising.>

Motion estimation from video sequences is important in many applications such as image coding, visual navigation, and security monitoring. The apparent deficit of existing methods have been their sensitivity to the presence of outliers and their limited ability to deal with multiple moving objects. In this paper, we present a motion estimator which models local image flow field using second-order polynomials with 6 parameters. We also show how constraints on the magnitude of image velocities as well as an the projective transformation can be used to better compute image flows even at the presence of outliers as well as the existence of multiple moving objects. Image flow results for several red video sequences show the robustness of this estimation scheme.>

A spatio-temporal approach is presented which can extract motion information without requiring the computation of image flow. In this approach, an image sequence is treated as a single 3-D image. The sequence is first segmented through the grouping of voxels in the spatio-temporal space. After the image sequence is segmented, the area in the image which corresponds to the moving objects in the scene is identified. The direction of motion in space for each identified moving object is reported.>

Due to the potential for essentially unbounded scene complexity, it is often necessary to translate the sensor-derived signals into richer symbolic representations. A key initial stage in this abstraction process is signal-level perceptual organization (SLPO) involving the processes of partitioning and identification. A parallel SLPO algorithm that follows the global hypothesis testing paradigm, but breaks the iterative structure of conventional region growing through the use of alpha -partitioning and region filtering is presented. These two techniques segment an image such that the gray-level variation within each region can be described by a regression model. Experimental results demonstrate the effectiveness of this algorithm.>

The authors present a parallel 3-D image segmentation algorithm which, through the use of alpha -partitioning and volume filtering, segments 3-D images such that the gray-level variation within each volume can be described by a regression model. Experimental results indicate that the use of discontinuity locations in alpha -partitioning can greatly assist the segmentation of 3-D images. It is also shown that the use of volume filters in removing incorrect partitions permits quick segmentation of 3-D images into functional descriptions for each volume. These two characteristics enabled the parallel 3-D image segmentation algorithm to produce fair segmentation results with large savings in computation time.>