245,645 research outputs found
Multi-turn Inference Matching Network for Natural Language Inference
Natural Language Inference (NLI) is a fundamental and challenging task in
Natural Language Processing (NLP). Most existing methods only apply one-pass
inference process on a mixed matching feature, which is a concatenation of
different matching features between a premise and a hypothesis. In this paper,
we propose a new model called Multi-turn Inference Matching Network (MIMN) to
perform multi-turn inference on different matching features. In each turn, the
model focuses on one particular matching feature instead of the mixed matching
feature. To enhance the interaction between different matching features, a
memory component is employed to store the history inference information. The
inference of each turn is performed on the current matching feature and the
memory. We conduct experiments on three different NLI datasets. The
experimental results show that our model outperforms or achieves the
state-of-the-art performance on all the three datasets
A Large Scale Dataset for the Evaluation of Ontology Matching Systems
Recently, the number of ontology matching techniques and systems has increased significantly. This makes the issue of their evaluation and comparison more severe. One of the challenges of the ontology matching evaluation is in building large scale evaluation datasets. In fact, the number of possible correspondences between two ontologies grows quadratically with respect to the numbers of entities in these ontologies. This often makes the manual construction of the evaluation datasets demanding to the point of being infeasible for large scale matching tasks. In this paper we present an ontology matching evaluation dataset composed of thousands of matching tasks, called TaxME2. It was built semi-automatically out of the Google, Yahoo and Looksmart web directories. We evaluated TaxME2 by exploiting the results of almost two dozen of state of the art ontology matching systems. The experiments indicate that the dataset possesses the desired key properties, namely it is error-free, incremental, discriminative, monotonic, and hard for the state of the art ontology matching systems. The paper has been accepted for publication in "The Knowledge Engineering Review", Cambridge Universty Press (ISSN: 0269-8889, EISSN: 1469-8005)
Guided Filtering based Pyramidal Stereo Matching for Unrectified Images
Stereo matching deals with recovering quantitative
depth information from a set of input images, based on the visual
disparity between corresponding points. Generally most of the
algorithms assume that the processed images are rectified. As
robotics becomes popular, conducting stereo matching in the
context of cloth manipulation, such as obtaining the disparity
map of the garments from the two cameras of the cloth folding
robot, is useful and challenging. This is resulted from the fact of
the high efficiency, accuracy and low memory requirement under
the usage of high resolution images in order to capture the details
(e.g. cloth wrinkles) for the given application (e.g. cloth folding).
Meanwhile, the images can be unrectified. Therefore, we propose
to adapt guided filtering algorithm into the pyramidical stereo
matching framework that works directly for unrectified images.
To evaluate the proposed unrectified stereo matching in terms of
accuracy, we present three datasets that are suited to especially
the characteristics of the task of cloth manipulations. By com-
paring the proposed algorithm with two baseline algorithms on
those three datasets, we demonstrate that our proposed approach
is accurate, efficient and requires low memory. This also shows
that rather than relying on image rectification, directly applying
stereo matching through the unrectified images can be also quite
effective and meanwhile efficien
Hausdorff-Distance Enhanced Matching of Scale Invariant Feature Transform Descriptors in Context of Image Querying
Reliable and effective matching of visual descriptors is a key step for many vision applications, e.g. image retrieval. In this paper, we propose to integrate the Hausdorff distance matching together with our pairing algorithm, in order to obtain a robust while computationally efficient process of matching feature descriptors for image-to-image querying in standards datasets. For this purpose, Scale Invariant Feature Transform (SIFT) descriptors have been matched using our presented algorithm, followed by the computation of our related similarity measure. This approach has shown excellent performance in both retrieval accuracy and speed
Building a Static Farm Level Spatial Microsimulation Model: Statistically Matching the Irish National Farm Survey to the Irish Census of Agriculture
This paper looks at the statistical matching technique used to match the Irish Census of Agriculture to the Irish National Farm Survey (NFS) to produce a farm level static spatial microsimulation model of Irish agriculture. The match produces a spatially disaggregated population microdata set of farm households for all of Ireland. Using statistical matching techniques, economists can now create more attribute rich datasets by matching across the common variables in two or more datasets. Static spatial microsimulation then uses these synthetic datasets to analyse the relationships among regions and localities and to project the spatial implications of economic development and policy changes in rural areas. The Irish agriculture microsimulation model uses one of many combinational optimatisation techniques - simulated annealing - to match the Census of Agriculture and the NFS. The static model uses this matched NFS and Census information to produce small area (District Electric Divisions (DED)) population microdata estimates for a particular year. Using the matched NFS/Census microdata, this paper will then analysis the regional farm income distribution for Ireland.
Person Re-identification with Correspondence Structure Learning
This paper addresses the problem of handling spatial misalignments due to
camera-view changes or human-pose variations in person re-identification. We
first introduce a boosting-based approach to learn a correspondence structure
which indicates the patch-wise matching probabilities between images from a
target camera pair. The learned correspondence structure can not only capture
the spatial correspondence pattern between cameras but also handle the
viewpoint or human-pose variation in individual images. We further introduce a
global-based matching process. It integrates a global matching constraint over
the learned correspondence structure to exclude cross-view misalignments during
the image patch matching process, hence achieving a more reliable matching
score between images. Experimental results on various datasets demonstrate the
effectiveness of our approach
- …