scispace - formally typeset
Search or ask a question
Topic

Pairwise comparison

About: Pairwise comparison is a research topic. Over the lifetime, 6804 publications have been published within this topic receiving 174081 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: It is shown that the pairwise commutative assumption of Takagi-Sugeno fuzzy models can be relaxed by a similar approach as that for uncertainty, which is applicable to a rather broad class of TS models, which are nonHurwitz and/or nonpairwise Commutative.
Abstract: Stability issues of linear Takagi-Sugeno (TS) fuzzy models (1985, 1992) are investigated. We first propose a systematic way of searching for a common matrix, which, in turn, is related to stability for N subsystems that are under a pairwise commutative assumption. The robustness issue under uncertainty in each subsystem is then considered. We then show that the pairwise commutative assumption can, in fact, be relaxed by a similar approach as that for uncertainty. The result is applicable to a rather broad class of TS models, which are nonHurwitz and/or nonpairwise commutative.

138 citations

Journal ArticleDOI
TL;DR: Some recent, efficient approaches to nonlinear system identification, ARMA modeling, and time-series analysis are described and illustrated and examples are provided to demonstrate superiority over established classical techniques.
Abstract: Some recent, efficient approaches to nonlinear system identification, ARMA modeling, and time-series analysis are described and illustrated. Sufficient detail and references are furnished to enable ready implementation, and examples are provided to demonstrate superiority over established classical techniques. The ARMA identification algorithm presented does not require a priori knowledge of, or assumptions about, the order of the system to be identified or signal to be modeled. A suboptimal, recursive, pairwise search of the orthogonal candidate data records is conducted, until a given least-squares criterion is satisfied. In the case of nonlinear systems modeling, discrete-time Volterra series is stressed, or rather a more efficient parallel-cascade approach. The model is constructed by adding parallel paths (each consisting of the cascade of dynamic linear and static nonlinear systems). In the case of time-series analysis, a non-Fourier sinusoidal series approach is stressed. The relevant frequencies are estimated by an orthogonal search procedure. A search of the candidate sinusoids is conducted until a given mean-square criterion is satisfied. >

137 citations

Journal ArticleDOI
TL;DR: This work shows how, given a collection of pairwise shape maps, to define an optimization problem whose output is a set of alternative maps, compositions of those given, which are consistent, and individually at times much better than the original.
Abstract: Finding an informative, structure-preserving map between two shapes has been a long-standing problem in geometry processing, involving a variety of solution approaches and applications. However, in many cases, we are given not only two related shapes, but a collection of them, and considering each pairwise map independently does not take full advantage of all existing information. For example, a notorious problem with computing shape maps is the ambiguity introduced by the symmetry problem — for two similar shapes which have reflectional symmetry there exist two maps which are equally favorable, and no intrinsic mapping algorithm can distinguish between them based on these two shapes alone. Another prominent issue with shape mapping algorithms is their relative sensitivity to how “similar” two shapes are — good maps are much easier to obtain when shapes are very similar. Given the context of additional shape maps connecting our collection, we propose to add the constraint of global map consistency, requiring that any composition of maps between two shapes should be independent of the path chosen in the network. This requirement can help us choose among the equally good symmetric alternatives, or help us replace a “bad” pairwise map with the composition of a few “good” maps between shapes that in some sense interpolate the original ones. We show how, given a collection of pairwise shape maps, to define an optimization problem whose output is a set of alternative maps, compositions of those given, which are consistent, and individually at times much better than the original. Our method is general, and can work on any collection of shapes, as long as a seed set of good pairwise maps is provided. We demonstrate the effectiveness of our method for improving maps generated by state-of-the-art mapping methods on various shape databases.

137 citations

Book ChapterDOI
05 Sep 2010
TL;DR: This work proposes a simple and computationally efficient method for expressing pairwise relationships between quantized features that combines the power of discriminative representations with key aspects of Naive Bayes.
Abstract: The popular bag-of-words paradigm for action recognition tasks is based on building histograms of quantized features, typically at the cost of discarding all information about relationships between them. However, although the beneficial nature of including these relationships seems obvious, in practice finding good representations for feature relationships in video is difficult. We propose a simple and computationally efficient method for expressing pairwise relationships between quantized features that combines the power of discriminative representations with key aspects of Naive Bayes. We demonstrate how our technique can augment both appearance- and motion-based features, and that it significantly improves performance on both types of features.

136 citations

Proceedings ArticleDOI
07 Jun 2015
TL;DR: In this article, pairwise costs are added to the min-cost network flow framework for multi-object tracking, and a convex relaxation solution with an efficient rounding heuristic is proposed to give certificates of small suboptimality.
Abstract: Multi-object tracking has been recently approached with the min-cost network flow optimization techniques. Such methods simultaneously resolve multiple object tracks in a video and enable modeling of dependencies among tracks. Min-cost network flow methods also fit well within the “tracking-by-detection” paradigm where object trajectories are obtained by connecting per-frame outputs of an object detector. Object detectors, however, often fail due to occlusions and clutter in the video. To cope with such situations, we propose to add pairwise costs to the min-cost network flow framework. While integer solutions to such a problem become NP-hard, we design a convex relaxation solution with an efficient rounding heuristic which empirically gives certificates of small suboptimality. We evaluate two particular types of pairwise costs and demonstrate improvements over recent tracking methods in real-world video sequences.

135 citations


Network Information
Related Topics (5)
Markov chain
51.9K papers, 1.3M citations
81% related
Cluster analysis
146.5K papers, 2.9M citations
76% related
Deep learning
79.8K papers, 2.1M citations
75% related
Optimization problem
96.4K papers, 2.1M citations
74% related
Robustness (computer science)
94.7K papers, 1.6M citations
74% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20241
20231,305
20222,607
2021581
2020554
2019520