Partial matching of geometric structures is important in computer vision, pattern recognition and shape analysis applications. The problem consists of matching similar parts of shapes that may be dissimilar as a whole. Recently, it was proposed to consider partial similarity as a multi-criterion optimization problem trying to simultaneously maximize the similarity and the significance of the ma...

This paper presents a new method for matching metric maps generated by mobile robots that act cooperatively. This process of information matching makes it possible to perform global map generation from local maps (possibly partial and nonconsistent) provided by individual robots. The proposed method is based on a paraconsistent artificial neural network model that considers as input data the Eu...

Nuisance parameters do not pose any problems in Bayesian inference as marginalisation allows for study of the posterior distribution solely in terms of the parameter of interest. However, no general solution is available for removing nuisance parameters under the frequentist paradigm. In this paper, we merge the two approaches to construct a general procedure for frequentist elimination of nuis...

Automatic Transcription of Polyphonic Musical Signals with Linear Matching Pursuit By Andrew McLeod The Harmonic Matching Pursuit (HMP) algorithm has offered promising results in the automatic transcription of audio signals. It works by decomposing the given signal into a set of harmonic atoms, and then grouping those atoms into individual notes. HMP has shown very promising results, but more r...