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.

Matching case history patterns in case-based reasoning

This paper introduces a mechanism for representing and recognizing case history patterns with rich internal temporal aspects. A case history is characterized as a collection of elemental cases as in conventional case-based reasoning systems, together with the corresponding temporal constraints that can be relative and/or with absolute values. A graphical representation for case histories is proposed as a directed, partially weighted and labeled simple graph. In terms of such a graphical representation, an eigen-decomposition graph matching algorithm is proposed for recognizing case history patterns.

A critical examination of node-similarity based graph matching algorithms

In this paper, we shall critically examine a special class of graph matching algorithms that follow the approach of node-similarity measurement. A high-level algorithm framework, namely node-similarity graph matching framework (NSGM framework), is proposed, from which, many existing graph matching algorithms can be subsumed, including the eigen-decomposition method of Umeyama, the polynomial-transformation method of Almohamad, the hubs and authorities method of Kleinberg, and the kronecker product successive projection methods of Wyk, etc. In addition, improved algorithms can be developed from the NSGM framework with respects to the corresponding results in graph theory. As the observation, it is pointed out that, in general, any algorithm which can be subsumed from NSGM framework fails to work well for graphs with non-trivial auto-isomorphism structure.

Measuring similarity of software designs using graph matching for CBR

This paper examines different ways of measuring similarity between software design models for Case Based Reasoning (CBR) to facilitate reuse of software design and code. The paper considers structural and behavioural aspects of similarity between software design models. Similarity metrics for comparing static class structures are defined and discussed. A Graph representation of UML class diagrams and corresponding similarity measures for UML class diagrams are defined. A full search graph matching algorithm for measuring structural similarity diagrams based on the identification of the Maximum Common Sub-graph (MCS) is presented. Finally, a simple evaluation of the approach is presented and discussed.

A robust approach to subsequence matching

In terms of a general time theory which addresses time-elements as typed point-based intervals, a formal characterization of time-series and state-sequences is introduced. Based on this framework, the subsequence matching problem is specially tackled by means of being transferred into bipartite graph matching problem. Then a hybrid similarity model with high tolerance of inversion, crossover and noise is proposed for matching the corresponding bipartite graphs involving both temporal and non-temporal measurements. Experimental results on reconstructed time-series data from UCI KDD Archive demonstrate that such an approach is more effective comparing with the traditional similarity model based algorithms, promising robust techniques for lager time-series databases and real-life applications such as Content-based Video Retrieval (CBVR), etc.

Assortative mating as a mechanism for rapid evolution of a migratory divide.

There have been numerous recent observations of changes in the behavior and dynamics of migratory bird populations, but the plasticity of the migratory trait and our inability to track small animals over large distances have hindered investigation of the mechanisms behind migratory change. We used habitat-specific stable isotope signatures to show that recently evolved allopatric wintering populations of European blackcaps Sylvia atricapilla pair assortatively on their sympatric breeding grounds. Birds wintering further north also produce larger clutches and fledge more young. These findings describe an important process in the evolution of migratory divides, new migration routes, and wintering quarters. Temporal segregation of breeding is a way in which subpopulations of vertebrates may become isolated in sympatry.

Geometry- and diffraction-independent ionization probabilities in intense laser fields: Probing atomic ionization mechanisms with effective intensity matching

We report an experimental technique for the comparison of ionization processes in ultrafast laser pulses irrespective of pulse ellipticity. Multiple ionization of xenon by 50 fs 790 nm, linearly and circularly polarized laser pulses is observed over the intensity range 10 TW/cm(2) to 10 PW/cm(2) using effective intensity matching (EIM), which is coupled with intensity selective scanning (ISS) to recover the geometry-independent probability of ionization. Such measurements, made possible by quantifying diffraction effects in the laser focus, are compared directly to theoretical predictions of multiphoton, tunnel and field ionization, and a remarkable agreement demonstrated. EIM-ISS allows the straightforward quantification of the probability of recollision ionization in a linearly polarized laser pulse. Furthermore, the probability of ionization is discussed in terms of the Keldysh adiabaticity parameter gamma, and the influence of the precursor ionic states present in recollision ionization is observed.

Development of complex classical force fields through force matching to ab initio data: Application to a room-temperature ionic liquid

Recent experimental neutron diffraction data and ab initio molecular dynamics simulation of the ionic liquid dimethylimidazolium chloride ([dmim]Cl) have provided a structural description of the system at the molecular level. However, partial radial distribution functions calculated from the latter, when compared to previous classical simulation results, highlight some limitations in the structural description offered by force fieldbased simulations. With the availability of ab initio data it is possible to improve the classical description of [dmim]Cl by using the force matching approach, and the strategy for fitting complex force fields in their original functional form is discussed. A self-consistent optimization method for the generation of classical potentials of general functional form is presented and applied, and a force field that better reproduces the observed first principles forces is obtained. When used in simulation, it predicts structural data which reproduces more faithfully that observed in the ab initio studies. Some possible refinements to the technique, its application, and the general suitability of common potential energy functions used within many ionic liquid force fields are discussed.

FPGA-based minutia matching for biometric fingerprint image database retrieval

In this paper, a parallel-matching processor architecture with early jump-out (EJO) control is proposed to carry out high-speed biometric fingerprint database retrieval. The processor performs the fingerprint retrieval by using minutia point matching. An EJO method is applied to the proposed architecture to speed up the large database retrieval. The processor is implemented on a Xilinx Virtex-E, and occupies 6,825 slices and runs at up to 65 MHz. The software/hardware co-simulation benchmark with a database of 10,000 fingerprints verifies that the matching speed can achieve the rate of up to 1.22 million fingerprints per second. EJO results in about a 22% gain in computing efficiency.

Fast model based feature matching technique applied to airport lighting

The use of image processing techniques to assess the performance of airport landing lighting using images of it collected from an aircraft-mounted camera is documented. In order to assess the performance of the lighting, it is necessary to uniquely identify each luminaire within an image and then track the luminaires through the entire sequence and store the relevant information for each luminaire, that is, the total number of pixels that each luminaire covers and the total grey level of these pixels. This pixel grey level can then be used for performance assessment. The authors propose a robust model-based (MB) featurematching technique by which the performance is assessed. The development of this matching technique is the key to the automated performance assessment of airport lighting. The MB matching technique utilises projective geometry in addition to accurate template of the 3D model of a landing-lighting system. The template is projected onto the image data and an optimum match found, using nonlinear least-squares optimisation. The MB matching software is compared with standard feature extraction and tracking techniques known within the community, these being the Kanade–Lucus–Tomasi (KLT) and scaleinvariant feature transform (SIFT) techniques. The new MB matching technique compares favourably with the SIFT and KLT feature-tracking alternatives. As such, it provides a solid foundation to achieve the central aim of this research which is to automatically assess the performance of airport lighting.

Transmission line matching effects on the performance of shunt-C/series-tuned and series-L/parallel-tuned Class-E amplifiers

The impact that the transmission-line load-network has on the performance of the recently introduced series-L/parallel-tuned Class-E amplifier and the classic shunt-C/series-tuned configuration when compared to optimally derived lumped load networks is discussed. In addition an improved load topology which facilitates harmonic suppression of up to 5 order as required for maximum Class-E efficiency as well as load resistance transformation and a design procedure involving the use of Kuroda's identity and Richard's transformation enable a distributed synthesis process which dispenses with the need for iterative tuning as previously required in order to achieve optimum Class-E operation. © 2005 IEEE.

Size-assortative pairing in Gammarus pulex (Crustacea : Amphipoda): a test of the timing hypothesis

We present the first empirical test of the timing hypothesis regarding the generation of size-assortative pairing in amphipods. The timing hypothesis proposes that, since large males are better able to afford the costs of mate guarding than small males, the former can take larger females into precopula earlier in the female moult cycle than is feasible for the latter. This leaves small males to form pairs with smaller females closer to moult, thus generating size assortment. We presented male Gammarus pulex, collected both in precopula and as singletons, with females that were (1) previously guarded and therefore near to copulatory moult and (2) previously unguarded and therefore far from copulatory moult. This comparison tested the prediction of the timing hypothesis, that size assortment should break down when the opportunity for time-based male decisions is removed, but that size assortment should occur where timing is not disrupted. Counter to the hypothesis, we found that size assortment did not break down upon removal of the time factor. Large males tended to initiate mate guarding earlier than small males in both female moult groups. However, only in the previously unguarded group did large males guard for longer than small males. This result suggests that, although size assortment occurred in all groups, the causative mechanisms that generated this pattern may differ between these groups. We therefore consider the possible importance of mechanisms such as aggression, simultaneous manipulation of females and female resistance in producing size assortment where males encounter numerous females that are close to moult. We also observed that prior recent guarding experience by males had no effect on latency to guard or size-assortative pairing. (C) 2002 The Association for the Study of Animal Behaviour. Published by Elsevier Science Ltd. All rights reserved.