A hybrid fractal video compression method

Fractal image compression is a relatively recent image compression method. Its extension to a sequence of motion images is important in video compression applications. There are two basic fractal compression methods, namely the cube-based and the frame-based methods, being commonly used in the industry. However there are advantages and disadvantages in both methods. This paper proposes a hybrid algorithm highlighting the advantages of the two methods in order to produce a good compression algorithm for video industry. Experimental results show the hybrid algorithm improves the compression ratio and the quality of decompressed images.

Matching search in fractal video compression and its parallel implementation in distributed computing environments

Fractal video compression is a relatively new video compression method. Its attraction is due to the high compression ratio and the simple decompression algorithm. But its computational complexity is high and as a result parallel algorithms on high performance machines become one way out. In this study we partition the matching search, which occupies the majority of the work in a fractal video compression process, into small tasks and implement them in two distributed computing environments, one using DCOM and the other using .NET Remoting technology, based on a local area network consists of loosely coupled PCs. Experimental results show that the parallel algorithm is able to achieve a high speedup in these distributed environments.

Adaptive partition and hybrid method in fractal video compression

Fractal image compression is a relatively recent image compression method, which is simple to use and often leads to a high compression ratio. These advantages make it suitable for the situation of a single encoding and many decoding, as required in video on demand, archive compression, etc. There are two fundamental fractal compression methods, namely, the cube-based and the frame-based methods, being commonly studied. However, there are advantages and disadvantages in both methods. This paper gives an extension of the fundamental compression methods based on the concept of adaptive partition. Experimental results show that the algorithms based on adaptive partition may obtain a much higher compression ratio compared to algorithms based on fixed partition while maintaining the quality of decompressed images.

Design of parallel algorithms for fractal video compression

The intrinsic independent features of the optimal codebook cubes searching process in fractal video compression systems are examined and exploited. The design of a suitable parallel algorithm reflecting the concept is presented. The Message Passing Interface (MPI) is chosen to be the communication tool for the implementation of the parallel algorithm on distributed memory parallel computers. Experimental results show that the parallel algorithm is able to reduce the compression time and achieve a high speed-up without changing the compression ratio and the quality of the decompressed image. A scalability test was also performed, and the results show that this parallel algorithm is scalable.

Grey video compression methods using fractals

The authors' experience in the treatment of grey video compression using fractals is summarized and compared with other research in the same field. Experience with parallel and distributed computing is also discussed.

Character-angle based video annotation

A video annotation system includes clips organization, feature description and pattern determination. This paper aims to present a system for basketball zone-defence detection. Particularly, a character-angle based descriptor for feature description is proposed. The well-performed experimental results in basketball zone-defence detection demonstrate that it is robust for both simulations and real-life cases, with less sensitivity to the distribution caused by local translation of subprime defenders. Such a framework can be easily applied to other team-work sports.

Temporal pattern recognition in video clips detection

Temporal representation and reasoning plays an important role in Data Mining and Knowledge Discovery, particularly, in mining and recognizing patterns with rich temporal information. Based on a formal characterization of time-series and state-sequences, this paper presents the computational technique and algorithm for matching state-based temporal patterns. As a case study of real-life applications, zone-defense pattern recognition in basketball games is specially examined as an illustrating example. Experimental results demonstrate that it provides a formal and comprehensive temporal ontology for research and applications in video events detection.

Can the use of supplementary video and audio materials support student understanding of 3D animation? Some results, analysis and conclusions

A project within a computing department at the University of Greenwich, has been carried out to identify whether podcasting can be used to help understanding and learning of a subject (3D Animation). We know that the benefits of podcasting in education (HE) can be justified, [1]; [2]; [3]; [4]; [5]; [6] and that some success has been proven, but this paper aims to report the results of a term-long project that provided podcast materials for students to help support their learning using Xserve and Podcast Producer technology. Findings in a previous study [6] identified podcasting as a way to diversify learning and provde a more personalised learning experience for students, as well as being able to provide access to a greater mix of learning styles [7]. Finally this paper aims to present the method of capture and distribution, the methodologies of the study, analysis of results, and conclusions that relate to podcasting and enhanced supported learning.

To fit in or stand out? The interaction between mortality salience, dissent and self esteem on social projection

Social projection (SP) refers to our tendency to assume that others think the same as we do, but the effect can also be used to detect the extent to which participants want to see themselves as similar to others. Simon et al (1997) found that participants informed that they were deviant increased their SP but those told that they were conformist reduced theirs. This compensatory function supports Brewer’s optimal distinctiveness which states that a balance must be struck between competing desires to feel similar and unique. In line with terror management theory, the effect was particularly apparent under conditions of mortality salience (MS). So far SP has only been examined on measures that target personal identity so this experiment developed a measure to target social identity as well. Participants were provided with either minority or majority dissent feedback, in MS or control conditions, and their SP on items relevant to personal and social identity were recorded. Results showed that group feedback only impacted upon participants SP on social identity measures and interacted with MS and self-esteem; those with high self-esteem had higher SP scores following minority dissent under conditions of mortality salience, indicating an attempt to assert their individuality. On SP measures targeting personal identity, MS and self-esteem interacted; the death prime increased SP scores for those with low self-esteem but decreased it for those with high self-esteem. Findings are interpreted in terms of TMT and optimal distinctiveness theory and their applications.