11 search results - page 2 / 3 » The Union of Colorful Simplices Spanned by a Colored Point S... |
PICS
2003
13 years 6 months ago
2003
Color gamut characterization is an essential step in the ICC profile generation for imaging devices. It is also needed as part of evaluation and comparison of image quality achiev...
ICTAI
2006
IEEE
13 years 11 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
DAM
2011
12 years 11 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
VISUALIZATION
1991
IEEE
13 years 8 months ago
1991
IEEE
or vectors at every mesh point may lead to a very cluttered image. Continuous coloring or data mapping, on the other hand, provide a smooth representation of the data. The use of t...
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
Considerable advances have been made in learning to recognize and localize visual object classes. Simple bag-offeature approaches label each pixel or patch independently. More adv...