993 search results - page 133 / 199 » A Fast Optimization Method for Level Set Segmentation |
117
click to vote
APWEB
2006
Springer
15 years 6 months ago
2006
Springer
Nowadays, the rapid advances in wireless communications, positioning techniques and mobile devices enable location based service such as dynamic traffic navigation. Yet, it is a ch...
129
Voted
ICIP
2000
IEEE
16 years 4 months ago
2000
IEEE
We present an estimation-theoretic approach to curve evolution for the Mumford-Shah problem. By viewing an active contour as the set of discontinuities in the Mumford-Shah problem...
107
click to vote
ECML
2004
Springer
15 years 8 months ago
2004
Springer
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
103
Voted
DAC
2006
ACM
16 years 3 months ago
2006
ACM
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
125
click to vote
SIBGRAPI
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper addresses the problem of foreground extraction using active illumination and graph-cut optimization. Our approach starts by detecting image regions that are likely to b...