Sciweavers

308 search results - page 5 / 62
» How Fast Is the k-Means Method
Sort
View
ICASSP
2008
IEEE
14 years 5 months ago
Fast automated stopping-time and edge-strength estimation for anisotropic diffusion
Anisotropic diffusion (ATD) is an edge-oriented, scale-space based, and iterative image-smoothing process. Two main challenges of ATD are how to automatically stop the iterative p...
Eva Rifkah, Aishy Amer
BILDMED
2004
125views Algorithms» more  BILDMED 2004»
14 years 8 days ago
Fast and Accurate Interactive Image Segmentation in the GEOMAP Framework
Although many interactive segmentation methods exists, none can be considered a silver bullet for all clinical tasks. Moreover, incompatible data representations prevent multiple a...
Hans Meine, Ullrich Köthe, H. Siegfried Stieh...
ACSAC
1999
IEEE
14 years 3 months ago
A Parallel Packet Screen for High Speed Networks
This paper demonstrates why security issues related to the continually increasing bandwidth of High Speed Networks (HSN) cannot be addressed with conventional firewall mechanisms....
Carsten Benecke
ACCV
2007
Springer
14 years 5 months ago
Fast Optimal Three View Triangulation
We consider the problem of L2-optimal triangulation from three separate views. Triangulation is an important part of numerous computer vision systems. Under gaussian noise, minimiz...
Martin Byröd, Klas Josephson, Kalle Åst...
ROBOCUP
2004
Springer
158views Robotics» more  ROBOCUP 2004»
14 years 4 months ago
Plug and Play: Fast Automatic Geometry and Color Calibration for Cameras Tracking Robots
We have developed an automatic calibration method for a global camera system. Firstly, we show how to define automatically the color maps we use for tracking the robots’ markers...
Anna Egorova, Mark Simon, Fabian Wiesel, Alexander...