10838244
Streaming SMIL Presentations via a Multimedia Semantic Model
The Synchronized Multimedia Integration Language (SMIL) allows Web designers to design complicated and vivid multimedia presentations in a declarative manner. In this paper, an abstract semantic model called Multimedia Augmented Transition Network (MATN) is used to model the conceptual structure of SMIL, as well as the temporal relations and synchronization control. The advantages of using the MATN model are its simplicity and ease of modification (scalability). Users can easily generate their favorite multimedia presentations using MATNs and render them using the SMIL players. Since the SMIL specification is quite new to the Internet society, the functionality of the players is limited, i.e., they often acquire proprietary platforms or cannot deal with MPEG or RTP media objects. Another contribution of this paper is to propose a novel architecture based on Java JMF technology for tackling with such constraints.
14165227
Special issue: "Web retrieval and mining"
5119403
Multimedia Information Systems
This is the third year for the minitrack on Multimedia Information Systems at the Annual Hawaii International Conference on System Sciences. The presence of this minitrack reflects the importance and recent proliferation of multimedia applications. This proliferation has been driven by technological advances resulting in dramatic decreases in price/performance ratios in processing and storage technologies, video and audio input/output devices, imaging systems, and telecommunications. As it is not disputed that multimedia technology will be an indispensable aspect of computer/human interaction in the next-generation computing environment, approaches for applying multi-media technology and mechanisms for managing multimedia information in organizations are in demand.
17605322
Motion Activity Based Semantic Video Similarity Retrieval
Semantic feature extraction of video shots and fast video sequence matching are important and required for efficient retrieval in a large video database. In this paper, a novel mechanism of similarity retrieval is proposed. Similarity measure between video sequences considering the spatio-temporal variation through consecutive frames is presented. For bridging the semantic gap between low-level features and the rich meaning that users desire to capture, video shots are analyzed and characterized by the high-level feature of motion activity in compressed domain. The extracted features of motion activity are further described by the 2D-histogram that is sensitive to the spatio-temporal variation of moving objects. In order to reduce the dimensions of feature vector space in sequence matching, Discrete Cosine Transform (DCT) is exploited to map semantic features of consecutive frames to the frequency domain while retains the discriminatory information and preserves the Euclidean distance between feature vectors. Experiments are performed on MPEG-7 testing videos, and the results of sequence matching show that a few DCT transformed coefficients are adequate and thus reveal the effectiveness of the proposed mechanism of video retrieval.
5225848
Towards an Automated Dental Identification System (ADIS)
This paper addresses the problem of developing an automated system for postmortem identification using dental records. The Automated Dental Identification System (ADIS) can be used by law enforcement agencies to locate missing persons using databases of dental x-rays. Currently, this search and identification process is carried out manually, which makes it very time-consuming and unreliable. In this paper, we propose architecture for ADIS, we define the functionality of its components, and we briefly describe some of the techniques used in realizing these components.
5569010
A Fast Efficient Parallel Hough Transform Algorithm on LARPBS
A parallel algorithm for Hough transform on a linear array with reconfigurable pipeline bus system (LARPBS) is presented. Suppose the number of θ-values to be considered is m, for an image with n × n pixels, the algorithm can complete Hough transform in O(1) time using mn2 processors and achieve optimal speed and efficiency. We also illustrate how to partition data and perform the algorithm on a LARPBS with fewer than mn2 processors, and hence show that the algorithm is highly scalable.
9059456
Model Checking One Million Lines of C Code
Implementation bugs in security-critical software are pervasive. Several authors have previously suggested model checking as a promising means to detect improper use of system interfaces and thereby detect a broad class of security vulnerabilities. In this paper, we report on our practical experience using MOPS, a tool for software model checking security-critical applications. As examples of security vulnerabilities that can be analyzed using model checking, we pick five important classes of vulnerabilities and show how to codify them as temporal safety properties, and then we describe the results of checking them on several significant Unix applications using MOPS. After analyzing over one million lines of code, we found more than a dozen new security weaknesses in important, widely-deployed applications. This demonstrates for the first time that model checking is practical and useful for detecting security weaknesses at large scale in real,
53306841
Dental Biometrics: Alignment and Matching of Dental Radiographs
Dental biometrics utilizes dental radiographs for human identification. The dental radiographs provide information about teeth, including tooth contours, relative positions of neighboring teeth, and shapes of the dental work (e.g., crowns, fillings, and bridges). The proposed system has two main stages: feature extraction and matching. The feature extraction stage uses anisotropic diffusion to enhance the images and a mixture of Gaussians model to segment the dental work. The matching stage has three sequential steps: tooth-level matching, computation of image distances, and subject identification. In the tooth-level matching step, tooth contours are matched using a shape registration method and the dental work is matched on overlapping areas. The distance between the tooth contours and the distance between the dental works are then combined using posterior probabilities. In the second step, the tooth correspondences between the given query (postmortem) radiograph and the database (antemortem) radiograph are established. A distance based on the corresponding teeth is then used to measure the similarity between the two radiographs. Finally, all the distances between the given postmortem radiographs and the antemortem radiographs that provide candidate identities are combined to establish the identity of the subject associated with the postmortem radiographs.
10299300
On the development of a fully automated cryosection image registration system
The CCD cryosection images for the male collected in the National Library of Medicine's Visible Human Project were registered through a procedure involving significant human intervention. In addition, several large misalignments were visible in the registered CCD data for the male. To expedite the exploitation of the visible human cryosection data sets, there is a need to develop a highly accurate yet efficient image registration tool. In this paper, we present the current status of the development of such a fully automated registration system. This system is based on the maximization of mutual information criterion. One key issue of this approach is a robust optimization scheme. The method developed in this paper is to estimate the initial search point through segmentations of regions of interest for each cryosection image slice. Experimental results using the 70 mm cryosection image data for the male are presented in this paper.