Reducing the bandwidth requirements of P2P keyword indexing

This paper describes the design and evaluation of a federated, peer-to-peer indexing system, which can be used to integrate the resources of local systems into a globally addressable index using a distributed hash table. The salient feature of the indexing systems design is the efficient dissemination of term-document indices using a combination of duplicate elimination, leaf set forwarding and conventional techniques such as aggressive index pruning, index compression, and batching. Together these indexing strategies help to reduce the number of RPC operations required to locate the nodes responsible for a section of the index, as well as the bandwidth utilization and the latency of the indexing service. Using empirical observation we evaluate the performance benefits of these cumulative optimizations and show that these design trade-offs can significantly improve indexing performance when using a distributed hash table.

Championing telemedicine in New Zealand : the case of utilizing video conferencing in psychiatry and dermatology

This research explores the factors that could influence telemedicine success in two hospitals involved in a rural setting in New Zealand. Findings from the cases revealed that telemedicine utilising the video conferencing technology (TMVC) was adopted based on its cost-benefit to the hospitals. This is necessary but considering the impact of other factors, specifically the compatibility factor could have made the adoption decision more effective earlier on. The administration manager was the primary instigator of TMVC in psychiatry in one of the hospitals, whereas in the other hospital it was the dermatologist. Therefore, this research emphasises the importance of the tight coupling between the roles of both the management and the clinical champions for TMVC to succeed in New Zealand. However, the research results suggest the limited use of the technology in the cases.

A simulation model for video traffic performance via ATM over TCP/IP

Although TCP has emerged as the standard in data communication, the introduction of ATM technology has raised numerous problems regarding the effectiveness of using TCP over A TM networks, especially when video traffic performance is considered. This paper presents a simulation model for transmission performance of video traffic via ATM over TCP/IP. The interactivity between TCP/IP and ATM, generation of MPEG traffic and evaluation of traffic performance are implemented in the model. The design and implementation details of the model are carefully described. The experiments conducted using the model and experimental results are briefly introduced, revealing the capability of our model in simulating network events and in evaluating potential solutions to performance issues.

Reducing blocking artefacts in MPEG video coded images using entropic methods

In this paper investigation is made of the. use of entropic methods to identify smooth image blocks in order to filter the reconstructed image of block based transform coded images. We know that blocking artefact is Visually more prominent in the smooth region of a block rather than in the textured region. The entropic methods are employed to distinguish between smooth and textured blocks in a reconstructed image. The linear filtering is then carried out on the smooth region of the image to reduce the blocking artefact. The en tropic criteria investigated in this paper are: Shannon's (Logarithmic) Entropy, Exponential Entropy, and Quadratic Entropy.

An exploratory study of information systems subject indexing

The motivation for detailed study of information systems research subject indexing schemes is explained, along with an analysis of two indexing schemes proposed for use in the area.  A number of reference disciplines are examined for their ability to provide insights and analysis approaches.

Classification of self-consumable highlights for soccer video summaries

An effective scheme for soccer summarization is significant to improve the usage of this massively growing video data. The paper presents an extension to our recent work which proposed a framework to integrate highlights into play-breaks to construct more complete soccer summaries. The current focus is to demonstrate the benefits of detecting some specific audio-visual features during play-break sequences in order to classify highlights contained within them. The main purpose is to generate summaries which are self-consumable individually. To support this framework, the algorithms for shot classification and detection of near-goal and slow-motion replay scenes is described. The results of our experiment using 5 soccer videos (20 minutes each) show the performance and reliability of our framework.

The power of play-break for automatic detection and browsing of self-consumable sport video highlights

To enable content-based retrieval, highlights extraction from broadcasted sport video has been an active research topic in the last decade. There is a well-known theory that high-level semantic, such as goal in soccer can be detected based on the occurrences of specific audio and visual features that can be extracted automatically. However, there is yet a definitive solution for the scope (i.e. start and end) of the detection for self consumable highlights. Thus, in this paper we will primarily demonstrate the benefits of using play-break for this purpose. Moreover, we also propose a browsing scheme that is based on integrated play-break and highlights (extended from [1]). To validate our approach, we will present the results from some experiments and a user study.

Performance of statistical inference for block classification in reducing blocking artefact in video coded images

This paper presents a performance study of four statistical test algorithms used to identify smooth image blocks in order to filter the reconstructed image of a video coded image. The four algorithms considered are the Coefficient of Variation (CV), Exponential Entropy of Pal and Pal (E), Shannon's (Logarithmic) Entropy (H), and Quadratic Entropy (Q). These statistical algorithms are employed to distinguish between smooth and textured blocks in a reconstructed image. The linear filtering is carried out on the smooth blocks of the image to reduce the blocking artefact. The rationale behind applying the filter on the smooth blocks only is that the blocking artefact is visually more prominent in the smooth region of an image rather than in the textured region.