Sciweavers

220 search results - page 7 / 44
» Simple image set of (max, ) linear mappings
Sort
View
83
Voted
ICCV
2005
IEEE
15 years 11 months ago
The Pyramid Match Kernel: Discriminative Classification with Sets of Image Features
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification m...
Kristen Grauman, Trevor Darrell
TIP
2008
125views more  TIP 2008»
14 years 9 months ago
Segmentation by Fusion of Histogram-Based K-Means Clusters in Different Color Spaces
Abstract--This paper presents a new, simple, and efficient segmentation approach, based on a fusion procedure which aims at combining several segmentation maps associated to simple...
Max Mignotte
ICIP
2002
IEEE
15 years 11 months ago
Certainty color maps compared to histograms
We present a new segmentation algorithm based on probabilistic histograms and introduce certainty calculus and certainty color maps to solve the difficult problem of histogram sep...
Jean-Christophe Baillie
ICCS
2007
Springer
15 years 3 months ago
Parameterization of 3D Surface Patches by Straightest Distances
Abstract. In this paper, we introduce a new piecewise linear parameterization of 3D surface patches which provides a basis for texture mapping, morphing, remeshing, and geometry im...
Sungyeol Lee, Haeyoung Lee
LICS
1997
IEEE
15 years 1 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof