Sciweavers

2105 search results - page 194 / 421
» Graph Based Image Matching
Sort
View
190
Voted
ICCV
2007
IEEE
15 years 8 months ago
Ten-fold Improvement in Visual Odometry Using Landmark Matching
Our goal is to create a visual odometry system for robots and wearable systems such that localization accuracies of centimeters can be obtained for hundreds of meters of distance ...
Zhiwei Zhu, Taragay Oskiper, Supun Samarasekera, R...
197
Voted
MICCAI
2010
Springer
15 years 4 months ago
Non-parametric Iterative Model Constraint Graph min-cut for Automatic Kidney Segmentation
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
Moti Freiman, A. Kronman, S. J. Esses, Leo Joskowi...
198
Voted
ICIP
2002
IEEE
16 years 7 months ago
A new and simple shape descriptor based on a non-parametric multiscale model
In this paper, we present a new and robust shape descriptor, which can be efficiently used to quickly prune a search for similar shapes in a large image database. The proposed sha...
Max Mignotte
MIR
2004
ACM
153views Multimedia» more  MIR 2004»
15 years 11 months ago
Clip-based similarity measure for hierarchical video retrieval
This paper proposes a new approach and algorithm for the similarity measure of video clips. The similarity is mainly based on two bipartite graph matching algorithms: maximum matc...
Yuxin Peng, Chong-Wah Ngo
148
Voted
ICIP
2007
IEEE
16 years 7 months ago
Estimating Steganographic Capacity for Odd-Even Based Embedding and its Use in Individual Compensation
We present a method to compute the steganographic capacity for images, with odd-even based hiding in the quantized discrete cosine transform domain. The method has been generalize...
Anindya Sarkar, B. S. Manjunath