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.

Droplet formation with electromagnetic pulse force

Methods for serial generation of droplets from a liquid jet are shortly reviewed. A method of liquid metal droplet generation based on AC high frequency magnetic field is considered in detail. Numerical model for direct simulation of the time dependent droplet generation process is presented. Computed examples demonstrate the liquid silicon droplet formation for the cases of 500-1500 μm diameter.

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.

Time-reversal ultrawideband breast imaging: pulse design criteria considering multiple tumors with unknown tissue properties

Pulse design is investigated for time-reversal (TR) imaging as applied to ultrawideband (UWB) breast cancer detection. Earlier it has been shown that a suitably-designed UWB pulse may help to improve imaging performance for a single-tumor breast phantom with predetermined lesion properties. The current work considers the following more general and practical situations: presence of multiple malignancies with unknown tumor size and dielectric properties. Four pulse selection criteria are proposed with each focusing on one of the following aspects: eliminating signal clutter generated by tissue inhomogeneities, canceling mutual interference among tumors, improving image resolution, and suppressing artifacts created by sidelobe of the target response. By applying the proposed criteria, the shape parameters of UWB waveforms with desirable characteristics are identified through search of all the possible pulses. Simulation example using a numerical breast phantom, comprised of two tumors and structured clutter distribution, demonstrates the effectiveness of the proposed approach. Specifically, a tradeoff between the image resolution and signal-to-clutter contrast (SCC) is observed in terms of selection of the excitation waveforms.