50 resultados para Matching de grafos
Resumo:
Given the success of patch-based approaches to image denoising,this paper addresses the ill-posed problem of patch size selection.Large patch sizes improve noise robustness in the presence of good matches, but can also lead to artefacts in textured regions due to the rare patch effect; smaller patch sizes reconstruct details more accurately but risk over-fitting to the noise in uniform regions. We propose to jointly optimize each matching patch’s identity and size for gray scale image denoising, and present several implementations.The new approach effectively selects the largest matching areas, subject to the constraints of the available data and noise level, to improve noise robustness. Experiments on standard test images demonstrate our approach’s ability to improve on fixed-size reconstruction, particularly at high noise levels, on smoother image regions.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.