Sciweavers

1787 search results - page 98 / 358
» Approximation Techniques for Spatial Data
Sort
View
CVPR
1998
IEEE
14 years 11 months ago
Markov Random Fields with Efficient Approximations
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
Yuri Boykov, Olga Veksler, Ramin Zabih
ECCV
2008
Springer
14 years 10 months ago
Efficient Camera Smoothing in Sequential Structure-from-Motion Using Approximate Cross-Validation
Abstract. In the sequential approach to three-dimensional reconstruction, adding prior knowledge about camera pose improves reconstruction accuracy. We add a smoothing penalty on t...
Michela Farenzena, Adrien Bartoli, Youcef Mezouar
PAMI
2007
107views more  PAMI 2007»
13 years 8 months ago
Segmentation of Multivariate Mixed Data via Lossy Data Coding and Compression
—In this paper, based on ideas from lossy data coding and compression, we present a simple but effective technique for segmenting multivariate mixed data that are drawn from a mi...
Yi Ma, Harm Derksen, Wei Hong, John Wright
CAD
2006
Springer
13 years 9 months ago
Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics
This paper compares two techniques for the approximation of the offsets to a given planar curve. The two methods are based on approximate conversion of the planar curve into circu...
Zbynek Sír, Robert Feichtinger, Bert Jü...
JMLR
2010
155views more  JMLR 2010»
13 years 7 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...