163 search results - page 18 / 33 » Optimal Correspondences from Pairwise Constraints |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper concerns the reconstruction of a temporally-varying scene from a video sequence of noisy linear projections. Assuming that each video frame is sparse or compressible in...
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. This paper proposes a method for phase registration of a single non-parametric quasi-periodic signal. After a short-term period has been detected for each sample by norma...
PAMI
2007
13 years 7 months ago
2007
—This paper presents a novel probabilistic approach to hierarchical, exemplar-based shape matching. No feature correspondence is needed among exemplars, just a suitable pairwise ...