Results 1  10
of
11
A Robust Technique for Matching Two Uncalibrated Images Through the Recovery of the Unknown Epipolar Geometry
, 1994
"... ..."
(Show Context)
Learning compatibility coefficients for relaxation labeling processes
 IEEE Trans. Pattern Anal. Machine Intell
, 1994
"... AbstractRelaxation labeling processes have been widely used in many different domains including image processing, pattern recognition, and artificial intelligence. They are iterative procedures that aim at reducing local ambiguities and achieving global consistency through a parallel exploitation o ..."
Abstract

Cited by 44 (5 self)
 Add to MetaCart
AbstractRelaxation labeling processes have been widely used in many different domains including image processing, pattern recognition, and artificial intelligence. They are iterative procedures that aim at reducing local ambiguities and achieving global consistency through a parallel exploitation of contextual information, which is quantitatively expressed in terms of a set of “compatibility coefficients. ” The problem of determining compatibility coefficients has received a considerable attention in the past and many heuristic, statisticalbased methods have been suggested. In this paper, we propose a rather different viewpoint to solve this problem: we derive them attempting to optimize the performance of the relaxation algorithm over a sample of training data; no statistical interpretation is given: compatibility coefficients are simply interpreted as real numbers, for which performance is optimal. Experimental results over a novel application of relaxation are given, which prove the effectiveness of the proposed approach. Index Terms Compatibility coefficients, constraint satisfaction, gradient projection, learning, neural networks, nonlinear
POS Tagging Using Relaxation Labelling
 PROCEEDINGS OF 16TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL LINGUISTICS, COLING
, 1996
"... Relaxation labelling is an optimization technique used in many fields to solve constraint satisfaction problems. The algorithm finds a combination of values for a set of variables such that satisfies  to the maximum possible degree  a set of given constraints. This pat)er scribes some experiment ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
Relaxation labelling is an optimization technique used in many fields to solve constraint satisfaction problems. The algorithm finds a combination of values for a set of variables such that satisfies  to the maximum possible degree  a set of given constraints. This pat)er scribes some experiments performed applying it to POS tagging, and the results obtained. it also ponders the possibility of applying it, to Word Sense Disambiguation.
Tracking of object with svm regression
 In Proc. IEEE Conf. on Computer Vision and Pattern Recognition
, 2001
"... This paper presents a novel featurematching based approach for rigid object tracking. The proposed method models the tracking problem as discovering the affine transforms of object images between frames according to the extracted feature correspondences. False feature matches (outliers) are automat ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
This paper presents a novel featurematching based approach for rigid object tracking. The proposed method models the tracking problem as discovering the affine transforms of object images between frames according to the extracted feature correspondences. False feature matches (outliers) are automatically detected and removed with a new SVM regression technique, where outliers are iteratively identified as support vectors with the gradually decreased insensitive margin ε. This method, in addition to object tracking, can also be used for general featurebased epipolar constraint estimation, in which it can quickly detect outliers even if they make up, in theory, over 50 % of the whole data. We have applied the proposed method to track real objects under cluttering backgrounds with very encouraging results. 1
Experiments on Applying Relaxation Labeling to Map Multilingual Hierarchies.
"... This paper explores the automatic construction of a multilingual Lexical Knowledge Base from preexisting lexical resources. This paper presents a new approach for linking already existing hierarchies. The Relaxation labeling algorithm is used to select among all the candidate connections proposed ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper explores the automatic construction of a multilingual Lexical Knowledge Base from preexisting lexical resources. This paper presents a new approach for linking already existing hierarchies. The Relaxation labeling algorithm is used to select among all the candidate connections proposed by a bilingual dictionary the right conection for each node in the taxonomy.
A Constraint Satisfaction Alternative for POS Tagging
, 1996
"... Relaxation labelling is an optimization technique used in many fields to solve constraint satisfaction problems (CSP). The algorithm finds a combination of values for a set of variables such that satisfiesto the maximum possible degree a set of given constraints. This paper describes some experime ..."
Abstract
 Add to MetaCart
Relaxation labelling is an optimization technique used in many fields to solve constraint satisfaction problems (CSP). The algorithm finds a combination of values for a set of variables such that satisfiesto the maximum possible degree a set of given constraints. This paper describes some experiments performed applying it to POS tagging and the constraints used.
Selective Tuning
, 2008
"... available at www.sciencedirect.com www.elsevier.com/locate/brainres Research Report The different stages of visual recognition need different attentional binding strategies ..."
Abstract
 Add to MetaCart
(Show Context)
available at www.sciencedirect.com www.elsevier.com/locate/brainres Research Report The different stages of visual recognition need different attentional binding strategies
A General Framework for Relaxation Processes by
, 2001
"... This paper addresses a major problem in pattern recognition: the unambiguous identification of objects. Comparing the characteristics of objects with the characteristics of possible interpretations, the identification of objects is frequently ambiguous. To reduce ambiguous assignments one can includ ..."
Abstract
 Add to MetaCart
(Show Context)
This paper addresses a major problem in pattern recognition: the unambiguous identification of objects. Comparing the characteristics of objects with the characteristics of possible interpretations, the identification of objects is frequently ambiguous. To reduce ambiguous assignments one can include a) more characteristics or b) contextual information into the identification. We use contextual information. Various approaches are suggested in the literature to describe and generalize discrete or continuous relaxation processes concerning to several objectives and one can find a suitable approach for every problem. The wider problem addressed here is to find the bestsuited relaxation process for a given assignment problem or, better still, to construct a taskdependent relaxation process. In this paper we describe an approach to generalizing relaxation processes. For this purpose, we develop a general framework for the theoretical foundations of relaxation processes in pattern recognition. The resulting structure enables 1) a description of all known relaxation processes in general terms and 2) the design of taskdependent relaxation processes. We show that the wellknown standard relaxation formulas verify our approach.
A SYSTEMATIC APPROACH TO CONTINUOUS GRAPH LABELING WITH APPLICATION TO COMPUTER VISION*
"... The discrete and continuous graph labeling problem are discussed. A basis for the continuous graph labeling problem is presented, in which an explicit connection between the discrete and continuous problems is made. The need for this basis is argued by noting conditions which must be satisfied befor ..."
Abstract
 Add to MetaCart
The discrete and continuous graph labeling problem are discussed. A basis for the continuous graph labeling problem is presented, in which an explicit connection between the discrete and continuous problems is made. The need for this basis is argued by noting conditions which must be satisfied before solutions can be pursued in a formal manner. Several cooperative solution algorithms based on the proposed formulation and results of the application of these algorithms to the problem of extracting line drawings are presented. I XHECIONTINlrnrlrGRAPHLAREXWGJzQRLEM A graph labeling problem is one in which a unique label, A from a set A of possible labels must be assigned to each vertex of a graph G = (V,E). The assignment
unknown title
"... The study of vision, in both man and machine, is viewed as the discovery of constraints. Computational constraints often imply assumptions necessary for achieving a problem's solution, while psychological and neurophysiological ones restrict the manner in which such solutions can be achieved. T ..."
Abstract
 Add to MetaCart
The study of vision, in both man and machine, is viewed as the discovery of constraints. Computational constraints often imply assumptions necessary for achieving a problem's solution, while psychological and neurophysiological ones restrict the manner in which such solutions can be achieved. These ideas are illustrated by several examples of research related to the early processing of visual information. The development of the paper takes place historically, starting with Helmholtz and Mach, as well as comceptually, from the concrete to the abstract, and anatomically, from the eye to the brain. I