Sciweavers

1145 search results - page 142 / 229
» Discrete Green's Functions
Sort
View
COMPGEOM
2011
ACM
14 years 10 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
ICCV
2001
IEEE
16 years 8 months ago
JetStream: Probabilistic Contour Extraction with Particles
The problem of extracting continuous structures from noisy or cluttered images is a difficult one. Successful extraction depends critically on the ability to balance prior constra...
Andrew Blake, Michel Gangnet, Patrick Pérez
ECCV
2002
Springer
16 years 8 months ago
Real-Time Interactive Path Extraction with on-the-Fly Adaptation of the External Forces
The aim of this work is to propose an adaptation of optimal path based interactive tools for image segmentation (related to Live-Wire [12] and Intelligent Scissors [18] approaches)...
Olivier Gérard, Thomas Deschamps, Myriam Gr...
MICCAI
2006
Springer
16 years 7 months ago
Towards Optimization of Probe Placement for Radio-Frequency Ablation
We present a model for the optimal placement of mono- and bipolar probes in radio-frequency (RF) ablation. The model is based on a numerical computation of the probe's electri...
Inga Altrogge, Tim Kröger, Tobias Preusser, C...
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
16 years 3 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor