Results 1 - 10 of 1,646

Hamming embedding and weak geometric consistency for large scale image search

by Herve Jegou, Matthijs Douze, Cordelia Schmid - In ECCV , 2008
"... Abstract. This paper improves recent methods for large scale image search. State-of-the-art methods build on the bag-of-features image representation. We, first, analyze bag-of-features in the framework of approximate nearest neighbor search. This shows the suboptimality of such a representation for ..."
Abstract - Cited by 330 (35 self) - Add to MetaCart
for matching descriptors and leads us to derive a more precise representation based on 1) Hamming embedding (HE) and 2) weak geometric consistency constraints (WGC). HE provides binary signatures that refine the matching based on visual words. WGC filters matching descriptors that are not consistent in terms

Flexible Update Propagation for Weakly Consistent Replication

by Karin Petersen, Mike J. Spreitzer , Douglas B. Terry , Marvin M. Theimer, Alan J. Demers
"... Bayou’s anti-entropy protocol for update propagation between weakly consistent storage replicas is based on pair-wise communication, the propagation of write operations, and a set of ordering and closure constraints on the propagation of the writes. The simplicity of the design makes the protocol ve ..."
Abstract - Cited by 327 (11 self) - Add to MetaCart
Bayou’s anti-entropy protocol for update propagation between weakly consistent storage replicas is based on pair-wise communication, the propagation of write operations, and a set of ordering and closure constraints on the propagation of the writes. The simplicity of the design makes the protocol

Improving bag-of-features for large scale image search

by Hervé Jégou, Matthijs Douze, Cordelia Schmid - International Journal of Computer Vision
"... This article improves recent methods for large scale image search. We first analyze the bag-of-features approach in the framework of approximate nearest neighbor search. This leads us to derive a more precise representation based on 1) Hamming embedding (HE) and 2) weak geometric consistency constra ..."
Abstract - Cited by 133 (25 self) - Add to MetaCart
of images show a significant improvement due to the binary signature and the weak geometric consistency constraints, as well as their efficiency. Estimation of the full geometric transformation, i.e., a reranking step on a short-list of images, is shown to be complementary to our weak geometric consistency

Weak Ordering -- A New Definition

by Sarita V. Adve, Mark D. Hill , 1990
"... A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory accesses will appear to execute atomically and in program order. An alternative model, weak ordering, offers greater perfor ..."
Abstract - Cited by 260 (14 self) - Add to MetaCart
about weaker memory, or even write buffers. Following this hypothesis, we re-define weak ordering as a contract between software and hardware. By this contract, software agrees to some formally specified constraints, and hardware agrees to appear sequentially consistent to at least the software

Algorithms for Distributed Constraint Satisfaction: A Review

by Makoto Yokoo, Katsutoshi Hirayama - In CP , 2000
"... . When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints. Vario ..."
Abstract - Cited by 250 (11 self) - Add to MetaCart
. When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints

Recent advances in large scale image search

by Herve Jegou, Matthijs Douze, Cordelia Schmid , 2010
"... This paper introduces recent methods for large scale image search. State-of-the-art methods build on the bag-of-features image representation. We first analyze bag-of-features in the framework of approximate nearest neighbor search. This shows the sub-optimality of such a representation for matchin ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
for matching descriptors and leads us to derive a more precise representation based on 1) Hamming embedding (HE) and 2) weak geometric consistency constraints (WGC). HE provides binary signatures that refine the matching based on visual words. WGC filters matching descriptors that are not consistent in terms

Large scale image search

by H. Jegou, M. Douze, C. Schmid
"... This paper introduces recent methods for large scale image search. State-of-the-art methods build on the bag-of-features image representation. We first analyze bag-of-features in the framework of approximate nearest neighbor search. This shows the sub-optimality of such a representation for matching ..."
Abstract - Add to MetaCart
for matching descriptors and leads us to derive a more precise representation based on 1) Hamming embedding (HE) and 2) weak geometric consistency constraints (WGC). HE provides binary signatures that refine the matching based on visual words. WGC filters matching descriptors that are not consistent in terms

Geometric Consistency Constraints

by Cristian Sminchisescu, Dimitris Metaxas, Sven Dickinson, Cristian Sminchisescu, Dimitris Metaxas, Sven Dickinson, Incremental Model-based Estima, Hal Id Inria, Cristian Sminchisescu, Dimitris Metaxas, Sven Dickinson , 2001
"... HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract - Add to MetaCart
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Analytical methods for dynamic simulation of non-penetrating rigid bodies

by David Baraff - In Proc. of ACM SIGGRAPH ’89 , 1989
"... A method for analytically calculating the forces between systems of rigid bodies in resting (non-colliding) contact is presented. The systems of bodies may either be in motion or static equilibrium and adjacent bodies may touch at multiple points. The analytic formulation of the forces between bodie ..."
Abstract - Cited by 236 (9 self) - Add to MetaCart
constraints, such as linked figures. The analytical formulations used treat both holonomic and non-holonomic constraints in a consistent manner.

Arc consistency for soft constraints

by Martin Cooper, Thomas Schiex , 2001
"... The notion of arc consistency plays a central role in constraint satisfaction. It is known since [19, 4, 5] that the notion of local consistency can be extended to constraint optimisation problems defined by soft constraint frameworks based on an idempotent cost combination operator. This excludes n ..."
Abstract - Cited by 32 (8 self) - Add to MetaCart
The notion of arc consistency plays a central role in constraint satisfaction. It is known since [19, 4, 5] that the notion of local consistency can be extended to constraint optimisation problems defined by soft constraint frameworks based on an idempotent cost combination operator. This excludes
Results 1 - 10 of 1,646