Sciweavers

605 search results - page 98 / 121
» Geometrical Structure of Boosting Algorithm
Sort
View
MVA
2010
126views Computer Vision» more  MVA 2010»
13 years 6 months ago
Rapid automated detection of roots in minirhizotron images
An approach for rapid, automatic detection of plant roots in minirhizotron images is presented. The problem is modeled as a Gibbs point process with a modified Candy model, in wh...
Guang Zeng, Stanley T. Birchfield, Christina E. We...
IJCV
2011
152views more  IJCV 2011»
13 years 2 months ago
Recovering Occlusion Boundaries from an Image
Occlusion reasoning is a fundamental problem in computer vision. In this paper, we propose an algorithm to recover the occlusion boundaries and depth ordering of free-standing str...
Derek Hoiem, Alexei A. Efros, Martial Hebert
ICALP
2011
Springer
12 years 11 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
TOG
2012
206views Communications» more  TOG 2012»
11 years 10 months ago
Beady: interactive beadwork design and construction
We introduce the interactive system “Beady” to assist the design and construction of customized 3D beadwork. The user first creates a polygonal mesh model called the design m...
Yuki Igarashi, Takeo Igarashi, Jun Mitani
AAAI
2012
11 years 10 months ago
Transfer Learning with Graph Co-Regularization
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
Mingsheng Long, Jianmin Wang 0001, Guiguang Ding, ...