39 search results - page 3 / 8 » Algorithms for Finding Maximal-Scoring Segment Sets (Extende... |
ICCS
2005
Springer
2005
Springer
Towards a Bayesian Approach to Robust Finding Correspondences in Multiple View Geometry Environments
14 years 1 months ago
Abstract. This paper presents a new Bayesian approach to the problem of finding correspondences of moving objects in a multiple calibrated camera environment. Moving objects are d...
BMCBI
2007
13 years 8 months ago
2007
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
IPMI
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. In this paper, we propose an original and efficient tree matching algorithm for intra-patient hepatic vascular system registration. Vascular systems are segmented from CT...
ICA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...