Results 1  10
of
367,260
SHARING THE COMPONENTS OF TRANSPOSITIONINVARIANT DISTANCE, DIT, ON DITORGANIZED BURKHARDKELLER STRUCTURE IN SEARCHES FOR BEST MATCHING STRINGS
"... In this work various construction character/frequency information sharing structure approaches are proposed in order to optimize transposition_invariant distance evaluation, [SD87], that distance is used to construct a Burkhardkeller tree, [BK73] and [NK82], where is organized a dictionary of strin ..."
Abstract
 Add to MetaCart
In this work various construction character/frequency information sharing structure approaches are proposed in order to optimize transposition_invariant distance evaluation, [SD87], that distance is used to construct a Burkhardkeller tree, [BK73] and [NK82], where is organized a dictionary
Distortion invariant object recognition in the dynamic link architecture
 IEEE TRANSACTIONS ON COMPUTERS
, 1993
"... We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture exploits correlations in the finescale temporal structure of cellular signals in order to group neurons dynamically into hig ..."
Abstract

Cited by 637 (80 self)
 Add to MetaCart
are represented by sparse graphs, whose vertices are labeled by a multiresolution description in terms of a local power spectrum, and whose edges are labeled by geometrical distance vectors. Object recognition can be formulated as elastic graph matching, which is performed here by stochastic optimization of a
Transposition invariant string matching
, 2003
"... Given strings A = a1a2...am and B = b1b2...bn over an alphabet Σ ⊆ U, whereU is some numerical universe closed under addition and subtraction, and a distance function d(A,B) that gives the score of the best (partial) matching of A and B, the transposition invariant distance is ..."
Abstract

Cited by 29 (8 self)
 Add to MetaCart
Given strings A = a1a2...am and B = b1b2...bn over an alphabet Σ ⊆ U, whereU is some numerical universe closed under addition and subtraction, and a distance function d(A,B) that gives the score of the best (partial) matching of A and B, the transposition invariant distance is
Robust wide baseline stereo from maximally stable extremal regions
 In Proc. BMVC
, 2002
"... The widebaseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements that are put into correspondence, the so called extremal regions, is introduced. Extremal regions possess highly desir ..."
Abstract

Cited by 1014 (35 self)
 Add to MetaCart
sirable properties: the set is closed under 1. continuous (and thus projective) transformation of image coordinates and 2. monotonic transformation of image intensities. An efficient (near linear complexity) and practically fast detection algorithm (near frame rate) is presented for an affinelyinvariant stable
Restricted Transposition Invariant Approximate String Matching Under Edit Distance
"... Abstract. Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and searching for approximate occurrences of A inside B. We consider the classic Levenshtein distance, but the dis ..."
Abstract
 Add to MetaCart
, but the discussion is applicable also to indel distance. A relatively new variant [8] of string matching, motivated initially by the nature of string matching in music, is to allow transposition invariance for A. This means allowing A to be “shifted ” by adding some fixed integer t to the values of all its
Learning Invariance From Transformation Sequences
, 1991
"... Introduction How can we consistently recognize objects when changes in the viewing angle, eye position, distance, size, orientation, relative position, or deformations of the object itself (e.g., of a newspaper or a gymnast) can change their retinal projections so significantly? The visual system m ..."
Abstract

Cited by 317 (2 self)
 Add to MetaCart
Introduction How can we consistently recognize objects when changes in the viewing angle, eye position, distance, size, orientation, relative position, or deformations of the object itself (e.g., of a newspaper or a gymnast) can change their retinal projections so significantly? The visual system
MR Diffusion Tensor Spectroscopy and Imaging
, 1994
"... This paper describes a new NMR imaging modalityMR diffusion tensor imaging. It consists of estimating an effective diffusion tensor, Deff, within a voxel, and then displaying useful quantities derived from it. We show how the phenomenon of anisotropic diffusion of water (or metabolites) in anisotro ..."
Abstract

Cited by 377 (11 self)
 Add to MetaCart
with the eigenvectors of D"f}, while the effective diffusivities along these orthotropic directions are the eigenvalues of De"f. Diffusion ellipsoids, constructed in each voxel from Deff, depict both these orthotropic axes and the mean diffusion distances in these directions. Moreover, the three scalar
Sorting by transpositions
 SIAM Journal on Discrete Mathematics
, 1998
"... Abstract. Sequence comparison in computational molecular biology is a powerful tool for deriving evolutionary and functional relationships between genes. However, classical alignment algorithms handle only local mutations (i.e., insertions, deletions, and substitutions of nucleotides) and ignore glo ..."
Abstract

Cited by 140 (5 self)
 Add to MetaCart
distance between permutations and present approximation algorithms for sorting by transpositions. The algorithms also imply a nontrivial upper bound on the transposition diameter of the symmetric group. Finally, we formulate two biological problems in genome rearrangements and describe the first
Policy invariance under reward transformations: Theory and application to reward shaping
 In Proceedings of the Sixteenth International Conference on Machine Learning
, 1999
"... This paper investigates conditions under which modifications to the reward function of a Markov decision process preserve the optimal policy. It is shown that, besides the positive linear transformation familiar from utility theory, one can add a reward for transitions between states that is express ..."
Abstract

Cited by 240 (8 self)
 Add to MetaCart
that is expressible as the difference in value of an arbitrary potential function applied to those states. Furthermore, this is shown to be a necessary condition for invariance, in the sense that any other transformation may yield suboptimal policies unless further assumptions are made about the underlying MDP
Shape quantization and recognition with randomized trees
 NEURAL COMPUTATION
, 1997
"... We explore a new approach to shape recognition based on a virtually infinite family of binary features ("queries") of the image data, designed to accommodate prior information about shape invariance and regularity. Each query corresponds to a spatial arrangement ofseveral local topographic ..."
Abstract

Cited by 263 (18 self)
 Add to MetaCart
We explore a new approach to shape recognition based on a virtually infinite family of binary features ("queries") of the image data, designed to accommodate prior information about shape invariance and regularity. Each query corresponds to a spatial arrangement ofseveral local
Results 1  10
of
367,260