Sciweavers

CVPR
2011
IEEE
12 years 11 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
ACCV
2010
Springer
13 years 6 months ago
Ghost-free High Dynamic Range Imaging
Most high dynamic range image (HDRI) algorithms assume stationary scene for registering multiple images which are taken under different exposure settings. In practice, however, the...
Yong Seok Heo (Seoul National University), Kyoung ...
ECCV
2010
Springer
13 years 9 months ago
Reweighted Random Walks for Graph Matching
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
Minsu Cho (Seoul National University), Jungmin Lee...

Publication
364views
13 years 10 months ago
CV-SLAM: A new ceiling vision-based SLAM technique
We propose a fast and robust CV-SLAM (Ceiling Vision –based Simultaneous Localization and Mapping) technique using a single ceiling vision sensor. The proposed algorithm is suita...
Woo Yeon Jeong (Seoul National University), Kyoung...
ICPR
2010
IEEE
13 years 10 months ago
A Unified Probabilistic Approach to Feature Matching and Object Segmentation
This paper deals with feature matching and segmentation of common objects in a pair of images, simultaneously. For the feature matching problem, the matching likelihoods of all fea...
Tae Hoon Kim (Seoul National University), Kyoung M...