Sciweavers

619 search results - page 3 / 124
» Random Bichromatic Matchings
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
13 years 9 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
ICASSP
2011
IEEE
12 years 11 months ago
Keypoint-based near-duplicate images detection using affine invariant feature and color matching
This paper presents a new keypoint-based approach to nearduplicate images detection. It consists of three steps. Firstly, the keypoints of images are extracted and then matched. S...
Yue Wang, Zujun Hou, Karianto Leman
JMLR
2010
115views more  JMLR 2010»
13 years 2 months ago
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching
We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact ...
Nic Schraudolph
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 3 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska