262 search results - page 27 / 53 » Image Registration with Minimum Spanning Tree Algorithm |
ICIP
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper describes novel methods for estimating piecewise homogeneous Poisson elds based on minimum description length (MDL) criteria. By adopting a coding-theoretic approach, o...
93
Voted
ALGORITHMICA
2010
14 years 9 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
129
click to vote
CVPR
2012
IEEE
13 years 2 days ago
2012
IEEE
This paper presents a novel method for estimating the geospatial trajectory of a moving camera with unknown intrinsic parameters, in a city-scale urban environment. The proposed m...
IPL
1998
14 years 9 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
IWCIA
2004
Springer
15 years 3 months ago
2004
Springer
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...