Role of shot length in characterizing tempo and dramatic story sections in motion pictures

Motivated by existing cinematic conventions known as film grammar, we proposed a computational approach to determine tempo as a high-level movie content descriptor as well as means for deriving dramatic story sections and events occurring in movies. Movie tempo is extracted from two easily computed aspects in our approach: shot length and motion. Story sections and events are generally associated with changes in tempo, and are thus identified by edges located in the tempo function. In this paper, we analyze our initial founding of the tempo function on the basis that the distribution of both shot length and motion in movies is normal. Given that the distribution of shot length is approximately Weibull as confirmed in our experiments, we examine the impact of modelling and modifying the contributions of shot length to tempo. We derive an appropriate normalization function that faithfully encapsulates the role of shot length in tempo perception, and analyze the changes to the story sections identified in films.

A cache-based mobility-aware scheme for real-time continuous media delivery in wireless networks

Providing real-time or continuous media (CM) application services in wireless networks poses a significant challenge, as it requires timely delivery of data in a best-effort network. In this paper, we propose a cache-based scheme for mobility-aware, CM applications. The proposed scheme exploits a previously proposed caching strategy to complement Mobile-IP by placing services closer to migrated mobile nodes. The central idea of this work is based on the migration of sessions in order to facilitate uninterrupted delivery of CM in mobile environments. The performance of the proposed scheme is investigated by simulation studies. In particular, the effect of the proposed scheme on several QoS parameters under varying conditions of mobility and CM data is measured.

A generalised cost-aware caching scheme for caching continuous media objects in best-effort network environments

In this paper, we investigate the potential of caching to improve QoS in the context of continuous media applications over wired best-effort networks. We propose the use of a flexible caching scheme, called GD-Multi in caching continuous media (CM) objects. An important novel feature of our scheme is the provision of user or system administrator inputs in determining the cost function. Based on the proposed flexible cost function, Multi, an improvised Greedy Dual (GD) replacement algorithm called GD-multi (GDM) has been developed for layered multi-resolution multimedia streams. The proposed Multi function takes receiver feedback into account. We investigate the influence of parameters such as loss rate, jitter, delay and area in determining a proxy’s cache contents so as to enhance QoS perceived by clients. Simulation studies show improvement in QoS perceived at the clients in accordance to supplied optimisation metrics. From an implementation perspective, signalling requirements for carrying QoS feedback are minimal and fully compatible with existing RTSP-based Internet applications.

A multi-agent incremental negotiation scheme for meetings scheduling

We present an agent-oriented approach to the meeting scheduling problem and propose an incremental negotiation scheme that makes use of a hierarchical structure of an individual agent's working knowledge. First, we formalise the meeting scheduling problem in a multi-agent context, then elaborate on the design of a common agent architecture of all agents in the system. As a result, each agent becomes a modularised computing unit yet possesses high autonomy and robust interface with other agents. The system reserves the meeting participants' privacy since there are no agents with dominant roles, and agents can communicate at an abstract level in their hierarchical structures

Determining dramatic intensification via flashing lights in movies

Movie directors and producers worldwide, in their quest to narrate a good story that warrants repeated audience viewing, use many cinematic elements to intensify and clarify the viewing experience. One such element that directors manipulate is lighting. In this paper we examine one aspect of lighting, namely flashing lights, and its role as an intensifier of dramatic effects in film. We present an algorithm for robust extraction of flashing lights and a simple mechanism to group detected flashing lights into flashing light scenes and analyze the role of these segments in story narration. In addition, we demonstrate how flashing lights detection can improve the performance of shot-based video segmentation. Experiments on a number of video sequences extracted from real movies yields good results. Our technique detects 90.4% of flashing lights. The detected flashing lights correctly eliminates 92.7% of false cuts in these sequences. In addition, data support is compiled to demonstrate the association between flashing light scenes and certain dramatic intensification events such as supernatural power, crisis or excitement.

The digital contamination of dramatic theatre : subject technology in exception

Drawing on Derrida’s analysis of the metaphysics of presence, this paper examines the centrality of presence in much theatre commentary, arguing that such a privileging demonises projected media as a form of contamination. Through a close look at a hybrid work that integrates live performers with avatars from Second Life, I seek a way to move forward between conditions of possibility and impossibility.

Robust patchwork-based embedding and decoding scheme for digital audio watermarking

This paper presents a novel patchwork-based embedding and decoding scheme for digital audio watermarking. At the embedding stage, an audio segment is divided into two subsegments and the discrete cosine transform (DCT) coefficients of the subsegments are computed. The DCT coefficients related to a specified frequency region are then partitioned into a number of frame pairs. The DCT frame pairs suitable for watermark embedding are chosen by a selection criterion and watermarks are embedded into the selected DCT frame pairs by modifying their coefficients, controlled by a secret key. The modifications are conducted in such a way that the selection criterion used at the embedding stage can be applied at the decoding stage to identify the watermarked DCT frame pairs. At the decoding stage, the secret key is utilized to extract watermarks from the watermarked DCT frame pairs. Compared with existing patchwork watermarking methods, the proposed scheme does not require information of which frame pairs of the watermarked audio signal enclose watermarks and is more robust to conventional attacks.

A non-linear programming-based similarity reasoning scheme for modelling of monotonicity-preserving multi-input fuzzy inference systems

In this paper, the zero-order Sugeno Fuzzy Inference System (FIS) that preserves the monotonicity property is studied. The sufficient conditions for the zero-order Sugeno FIS model to satisfy the monotonicity property are exploited as a set of useful governing equations to facilitate the FIS modelling process. The sufficient conditions suggest a fuzzy partition (at the rule antecedent part) and a monotonically-ordered rule base (at the rule consequent part) that can preserve the monotonicity property. The investigation focuses on the use of two Similarity Reasoning (SR)-based methods, i.e., Analogical Reasoning (AR) and Fuzzy Rule Interpolation (FRI), to deduce each conclusion separately. It is shown that AR and FRI may not be a direct solution to modelling of a multi-input FIS model that fulfils the monotonicity property, owing to the difficulty in getting a set of monotonically-ordered conclusions. As such, a Non-Linear Programming (NLP)-based SR scheme for constructing a monotonicity-preserving multi-input FIS model is proposed. In the proposed scheme, AR or FRI is first used to predict the rule conclusion of each observation. Then, a search algorithm is adopted to look for a set of consequents with minimized root means square errors as compared with the predicted conclusions. A constraint imposed by the sufficient conditions is also included in the search process. Applicability of the proposed scheme to undertaking fuzzy Failure Mode and Effect Analysis (FMEA) tasks is demonstrated. The results indicate that the proposed NLP-based SR scheme is useful for preserving the monotonicity property for building a multi-input FIS model with an incomplete rule base.

A secure tag ownership transfer scheme in a closed loop RFID system

In this paper we propose a novel secure tag ownership transfer scheme for closed loop RFID systems. An important property of our method is that the ownership transfer is guaranteed to be atomic and the scheme is protected against desynchronisation leading to permanent DoS. Further, it is suited to the computational constraints of EPC Class-1 Gen-2 passive RFID tags as they only use the CRC and PRNG functions that passive RFID tags are capable of. We provide a detailed security analysis to show that our scheme satisfies the required security properties of tag anonymity, tag location privacy, forward secrecy, forward untraceability while being resistant to replay, desynchronisation and server impersonation attacks. Performance comparisons show that our scheme is practical and can be implemented on passive low-cost RFID tags.

An evolutionary-based similarity reasoning scheme for monotonic multi-input fuzzy inference systems

In this paper, an Evolutionary-based Similarity Reasoning (ESR) scheme for preserving the monotonicity property of the multi-input Fuzzy Inference System (FIS) is proposed. Similarity reasoning (SR) is a useful solution for undertaking the incomplete rule base problem in FIS modeling. However, SR may not be a direct solution to designing monotonic multi-input FIS models, owing to the difficulty in getting a set of monotonically-ordered conclusions. The proposed ESR scheme, which is a synthesis of evolutionary computing, sufficient conditions, and SR, provides a useful solution to modeling and preserving the monotonicity property of multi-input FIS models. A case study on Failure Mode and Effect Analysis (FMEA) is used to demonstrate the effectiveness of the proposed ESR scheme in undertaking real world problems that require the monotonicity property of FIS models.