Indexing and matching trajectories under inconsistent sampling rates

Quantifying the similarity between two trajectories is a fundamental operation in analysis of spatio-temporal databases. While a number of distance functions exist, the recent shift in the dynamics of the trajectory generation procedure violates one of their core assumptions; a consistent and uniform sampling rate. In this paper, we formulate a robust distance function called Edit Distance with Projections (EDwP) to match trajectories under inconsistent and variable sampling rates through dynamic interpolation. This is achieved by deploying the idea of projections that goes beyond matching only the sampled points while aligning trajectories. To enable efficient trajectory retrievals using EDwP, we design an index structure called TrajTree. TrajTree derives its pruning power by employing the unique combination of bounding boxes with Lipschitz embedding. Extensive experiments on real trajectory databases demonstrate EDwP to be up to 5 times more accurate than the state-of-the-art distance functions. Additionally, TrajTree increases the efficiency of trajectory retrievals by up to an order of magnitude over existing techniques.

Largest Matching Areas for Illumination and Occlusion Robust Face Recognition

In this paper, we introduce a novel approach to face recognition which simultaneously tackles three combined challenges: 1) uneven illumination; 2) partial occlusion; and 3) limited training data. The new approach performs lighting normalization, occlusion de-emphasis and finally face recognition, based on finding the largest matching area (LMA) at each point on the face, as opposed to traditional fixed-size local area-based approaches. Robustness is achieved with novel approaches for feature extraction, LMA-based face image comparison and unseen data modeling. On the extended YaleB and AR face databases for face identification, our method using only a single training image per person, outperforms other methods using a single training image, and matches or exceeds methods which require multiple training images. On the labeled faces in the wild face verification database, our method outperforms comparable unsupervised methods. We also show that the new method performs competitively even when the training images are corrupted.

Between-taxon matching of common and rare species richness patterns

Aim: Our primary aim is to understand how assemblages of rare (restricted range) and common (widespread) species are correlated with each other among different taxa. We tested the proposition that marine species richness patterns of rare and common species differ, both within a taxon in their contribution to the richness pattern of the full assemblage and among taxa in the strength of their correlations with each other. Location The UK intertidal zone. Methods: We used high-resolution marine datasets for UK intertidal macroalgae, molluscs and crustaceans each with more than 400 species. We estimated the relative contribution of rare and common species, treating rarity and commonness as a continuous spectrum, to spatial patterns in richness using spatial crosscorrelations. Correlation strength and significance was estimated both within and between taxa. Results: Common species drove richness patterns within taxa, but rare species contributed more when species were placed on an equal footing via scaling by binomial variance. Between taxa, relatively small sub-assemblages (fewer than 60 species) of common species produced the maximum correlation with each other, regardless of taxon pairing. Cross-correlations between rare species were generally weak, with maximum correlation occurring between small sub-assemblages in only one case. Cross-correlations between common and rare species of different taxa were consistently weak or absent. Main conclusions: Common species in the three marine assemblages were congruent in their richness patterns, but rare species were generally not. The contrast between the stronger correlations among common species and the weak or absent correlations among rare species indicates a decoupling of the processes driving common and rare species richness patterns. The internal structure of richness patterns of these marine taxa is similar to that observed for terrestrial taxa.

Towards the 2021 UK Census imputation strategy: Response mode as a matching variable in a donor-based approach?

Since July 2014, the Office for National Statistics has committed to a predominantly online 2021 UK Census. Item-level imputation will play an important role in adjusting the 2021 Census database. Research indicates that the internet may yield cleaner data than paper based capture and attract people with particular characteristics. Here, we provide preliminary results from research directed at understanding how we might manage these features in a 2021 UK Census imputation strategy. Our findings suggest that if using a donor-based imputation method, it may need to consider including response mode as a matching variable in the underlying imputation model.

Convex Quadratic Programming Approach to the Maximum Matching Problem

The problem of determining a maximum matching or whether there exists a perfect matching, is very common in a large variety of applications and as been extensively studied in graph theory. In this paper we start to introduce a characterisation of a family of graphs for which its stability number is determined by convex quadratic programming. The main results connected with the recognition of this family of graphs are also introduced. It follows a necessary and sufficient condition which characterise a graph with a perfect matching and an algorithmic strategy, based on the determination of the stability number of line graphs, by convex quadratic programming, applied to the determination of a perfect matching. A numerical example for the recognition of graphs with a perfect matching is described. Finally, the above algorithmic strategy is extended to the determination of a maximum matching of an arbitrary graph and some related results are presented.

Face matching impairment in developmental prosopagnosia

Developmental prosopagnosia (DP) is commonly referred to as ‘face blindness’, a term that implies a perceptual basis to the condition. However, DP presents as a deficit in face recognition and is diagnosed using memory-based tasks. Here, we test face identification ability in six people with DP, who are severely impaired on face memory tasks, using tasks that do not rely on memory. First, we compared DP to control participants on a standardised test of unfamiliar face matching using facial images taken on the same day and under standardised studio conditions (Glasgow Face Matching Test; GFMT). DP participants did not differ from normative accuracy scores on the GFMT. Second, we tested face matching performance on a test created using images that were sourced from the Internet and so vary substantially due to changes in viewing conditions and in a person’s appearance (Local Heroes Test; LHT). DP participants show significantly poorer matching accuracy on the LHT relative to control participants, for both unfamiliar and familiar face matching. Interestingly, this deficit is specific to ‘match’ trials, suggesting that people with DP may have particular difficulty in matching images of the same person that contain natural day-to-day variations in appearance. We discuss these results in the broader context of individual differences in face matching ability.

Multi-scale keypoint annotation: a biological approach

The primary visual cortex employs simple, complex and end-stopped cells to create a scale space of 1D singularities (lines and edges) and of 2D singularities (line and edge junctions and crossings called keypoints). In this paper we show first results of a biological model which attributes information of the local image structure to keypoints at all scales, ie junction type (L, T, +) and main line/edge orientations. Keypoint annotation in combination with coarse to fine scale processing facilitates various processes, such as image matching (stereo and optical flow), object segregation and object tracking.

Face recogniton based on the optimal combination of neural networks, eigenfaces and least squares matching methods

Report of a research project of the Fachhochschule Hannover, University of Applied Sciences and Arts, Department of Information Technologies. Automatic face recognition increases the security standards at public places and border checkpoints. The picture inside the identification documents could widely differ from the face, that is scanned under random lighting conditions and for unknown poses. The paper describes an optimal combination of three key algorithms of object recognition, that are able to perform in real time. The camera scan is processed by a recurrent neural network, by a Eigenfaces (PCA) method and by a least squares matching algorithm. Several examples demonstrate the achieved robustness and high recognition rate.

Behavioural development in a matching-to-sample task and token use by an infant chimpanzee reared by his mother

Animal Cognition, V.6, pp. 259–267

Groundtruth system for underwater benchmarking

Oceans - San Diego, 2013

Probabilistic Egomotion for Stereo Visual Odometry

We present a novel approach of Stereo Visual Odometry for vehicles equipped with calibrated stereo cameras. We combine a dense probabilistic 5D egomotion estimation method with a sparse keypoint based stereo approach to provide high quality estimates of vehicle’s angular and linear velocities. To validate our approach, we perform two sets of experiments with a well known benchmarking dataset. First, we assess the quality of the raw velocity estimates in comparison to classical pose estimation algorithms. Second, we added to our method’s instantaneous velocity estimates a Kalman Filter and compare its performance with a well known open source stereo Visual Odometry library. The presented results compare favorably with state-of-the-art approaches, mainly in the estimation of the angular velocities, where significant improvements are achieved.

Probabilistic Stereo Egomotion Transform

In this paper we propose a novel fully probabilistic solution to the stereo egomotion estimation problem. We extend the notion of probabilistic correspondence to the stereo case which allow us to compute the whole 6D motion information in a probabilistic way. We compare the developed approach against other known state-of-the-art methods for stereo egomotion estimation, and the obtained results compare favorably both for the linear and angular velocities estimation.

Enhancing Agent Mediated Electronic Markets with Ontology Matching Services and Social Network Support

Os Mercados Eletrónicos atingiram uma complexidade e nível de sofisticação tão elevados, que tornaram inadequados os modelos de software convencionais. Estes mercados são caracterizados por serem abertos, dinâmicos e competitivos, e constituídos por várias entidades independentes e heterogéneas. Tais entidades desempenham os seus papéis de forma autónoma, seguindo os seus objetivos, reagindo às ocorrências do ambiente em que se inserem e interagindo umas com as outras. Esta realidade levou a que existisse por parte da comunidade científica um especial interesse no estudo da negociação automática executada por agentes de software [Zhang et al., 2011]. No entanto, a diversidade dos atores envolvidos pode levar à existência de diferentes conceptualizações das suas necessidades e capacidades dando origem a incompatibilidades semânticas, que podem prejudicar a negociação e impedir a ocorrência de transações que satisfaçam as partes envolvidas. Os novos mercados devem, assim, possuir mecanismos que lhes permitam exibir novas capacidades, nomeadamente a capacidade de auxiliar na comunicação entre os diferentes agentes. Pelo que, é defendido neste trabalho que os mercados devem oferecer serviços de ontologias que permitam facilitar a interoperabilidade entre os agentes. No entanto, os humanos tendem a ser relutantes em aceitar a conceptualização de outros, a não ser que sejam convencidos de que poderão conseguir um bom negócio. Neste contexto, a aplicação e exploração de relações capturadas em redes sociais pode resultar no estabelecimento de relações de confiança entre vendedores e consumidores, e ao mesmo tempo, conduzir a um aumento da eficiência da negociação e consequentemente na satisfação das partes envolvidas. O sistema AEMOS é uma plataforma de comércio eletrónico baseada em agentes que inclui serviços de ontologias, mais especificamente, serviços de alinhamento de ontologias, incluindo a recomendação de possíveis alinhamentos entre as ontologias dos parceiros de negociação. Este sistema inclui também uma componente baseada numa rede social, que é construída aplicando técnicas de análise de redes socias sobre informação recolhida pelo mercado, e que permite melhorar a recomendação de alinhamentos e auxiliar os agentes na sua escolha. Neste trabalho são apresentados o desenvolvimento e implementação do sistema AEMOS, mais concretamente: • É proposto um novo modelo para comércio eletrónico baseado em agentes que disponibiliza serviços de ontologias; • Adicionalmente propõem-se o uso de redes sociais emergentes para captar e explorar informação sobre relações entre os diferentes parceiros de negócio; • É definida e implementada uma componente de serviços de ontologias que é capaz de: • o Sugerir alinhamentos entre ontologias para pares de agentes; • o Traduzir mensagens escritas de acordo com uma ontologia em mensagens escritas de acordo com outra, utilizando alinhamentos previamente aprovados; • o Melhorar os seus próprios serviços recorrendo às funcionalidades disponibilizadas pela componente de redes sociais; • É definida e implementada uma componente de redes sociais que: • o É capaz de construir e gerir um grafo de relações de proximidade entre agentes, e de relações de adequação de alinhamentos a agentes, tendo em conta os perfis, comportamento e interação dos agentes, bem como a cobertura e utilização dos alinhamentos; • o Explora e adapta técnicas e algoritmos de análise de redes sociais às várias fases dos processos do mercado eletrónico. A implementação e experimentação do modelo proposto demonstra como a colaboração entre os diferentes agentes pode ser vantajosa na melhoria do desempenho do sistema e como a inclusão e combinação de serviços de ontologias e redes sociais se reflete na eficiência da negociação de transações e na dinâmica do mercado como um todo.

NAVA enhances tidal volume and diaphragmatic electro-myographic activity matching: a Range90 analysis of supply and demand.

Neurally adjusted ventilatory assist (NAVA) is a ventilation assist mode that delivers pressure in proportionality to electrical activity of the diaphragm (Eadi). Compared to pressure support ventilation (PS), it improves patient-ventilator synchrony and should allow a better expression of patient's intrinsic respiratory variability. We hypothesize that NAVA provides better matching in ventilator tidal volume (Vt) to patients inspiratory demand. 22 patients with acute respiratory failure, ventilated with PS were included in the study. A comparative study was carried out between PS and NAVA, with NAVA gain ensuring the same peak airway pressure as PS. Robust coefficients of variation (CVR) for Eadi and Vt were compared for each mode. The integral of Eadi (ʃEadi) was used to represent patient's inspiratory demand. To evaluate tidal volume and patient's demand matching, Range90 = 5-95 % range of the Vt/ʃEadi ratio was calculated, to normalize and compare differences in demand within and between patients and modes. In this study, peak Eadi and ʃEadi are correlated with median correlation of coefficients, R > 0.95. Median ʃEadi, Vt, neural inspiratory time (Ti_ ( Neural )), inspiratory time (Ti) and peak inspiratory pressure (PIP) were similar in PS and NAVA. However, it was found that individual patients have higher or smaller ʃEadi, Vt, Ti_ ( Neural ), Ti and PIP. CVR analysis showed greater Vt variability for NAVA (p < 0.005). Range90 was lower for NAVA than PS for 21 of 22 patients. NAVA provided better matching of Vt to ʃEadi for 21 of 22 patients, and provided greater variability Vt. These results were achieved regardless of differences in ventilatory demand (Eadi) between patients and modes.

Niagara Falls Stereo Cards collection, 1885-1903, n.d.

This collection contains 40 stereo cards of Niagara Falls and the Niagara River. Images include Niagara Falls in winter (the ice bridge); Prospect Point; the Whirlpool Rapids and the Whirlpool; the Upper River rapids; the Maid of the Mist; and Dixon crossing the Niagara River on a tightrope below the Great Cantilever Bridge. Twenty of the cards were published by Underwood & Underwood. The remaining cards are from various publishers including Keystone View Company, American Stereoscopic, Griffith & Griffith, H.C. White Company, E. & H.T. Anthony & Company, and Realistic Travels Publisher. George E. Curtis and Geo. Barker are listed as photographers on a few of the cards.