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.

"Google News" y el impacto de la Ley de Propiedad Intelectual en la prensa: un nuevo amanecer para la información

2015 se recordará como el gran año del cambio en los medios de comunicación, especialmente para la prensa. A lo largo del mismo se ha llevado a cabo una enconada lucha entre los editores y Google News, a la que se han sumado Yahoo News, Facebook, LinkedIn, Twitter, etc., para determinar quién debe pagar por los contenidos, quién los creará, quién los distribuirá y quién y cómo los leerá. Nuevos pactos para nuevos lectores. Nuevos acuerdos para reflotar económicamente la prensa. Y todo ello bajo el paraguas de la Ley de Propiedad Intelectual en España y otras similares que se irán publicando o adaptando en Europa. Se ofrece un estudio y análisis de la situación previa al establecimiento de dicha ley y las consecuencias de su aplicación.

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.