Sciweavers

2489 search results - page 59 / 498
» On the Subgroup Distance Problem
Sort
View
138
Voted
JMIV
2010
98views more  JMIV 2010»
15 years 2 months ago
Expectations of Random Sets and Their Boundaries Using Oriented Distance Functions
Shape estimation and object reconstruction are common problems in image analysis. Mathematically, viewing objects in the image plane as random sets reduces the problem of shape es...
Hanna K. Jankowski, Larissa I. Stanberry
137
Voted
JMIV
2008
268views more  JMIV 2008»
15 years 3 months ago
A Fast Marching Method for the Area Based Affine Distance
In this paper we consider the problem of computing the area-based affine distance for a convex domain in the plane. Since this affine distance satisfies a non-homogeneous Monge-Amp...
Moacyr A. H. B. da Silva, Ralph Teixeira, Sin&eacu...
166
Voted
CVPR
2008
IEEE
15 years 10 months ago
Manifold-Manifold Distance with application to face recognition based on image set
In this paper, we address the problem of classifying image sets, each of which contains images belonging to the same class but covering large variations in, for instance, viewpoin...
Ruiping Wang, Shiguang Shan, Xilin Chen, Wen Gao
141
Voted
PR
2007
180views more  PR 2007»
15 years 3 months ago
Hybrid image matching combining Hausdorff distance with normalized gradient matching
Image matching has been a central problem in computer vision and image processing for decades. Most of the previous approaches to image matching can be categorized into the intens...
Chyuan-Huei Thomas Yang, Shang-Hong Lai, Long-Wen ...
133
Voted
DMGT
2011
94views more  DMGT 2011»
14 years 7 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...