Sciweavers

3630 search results - page 223 / 726
» Fast Marching Methods
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 6 months ago
Fast simulation of large-scale growth models
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
Tobias Friedrich, Lionel Levine
CGA
2007
15 years 6 months ago
Fast Simulation of Laplacian Growth
— Laplacian instability is the physical mechanism that drives pattern formation in many disparate natural phenomena. However, current algorithms for simulating this instability a...
Theodore Kim, Jason Sewall, Avneesh Sud, Ming C. L...
JCC
2008
117views more  JCC 2008»
15 years 6 months ago
FACTS: Fast analytical continuum treatment of solvation
: An efficient method for calculating the free energy of solvation of a (macro)molecule embedded in a continuum solvent is presented. It is based on the fully analytical evaluation...
Urs Haberthür, Amedeo Caflisch
JVCIR
2008
137views more  JVCIR 2008»
15 years 6 months ago
A fast MPEG-7 dominant color extraction with new similarity measure for image retrieval
Dominant color descriptor (DCD) is one of the color descriptors proposed by MPEG-7 that has been extensively used for image retrieval. Among the color descriptors, DCD describes t...
Nai-Chung Yang, Wei-Han Chang, Chung Ming Kuo, Tsi...
JMIV
2006
161views more  JMIV 2006»
15 years 6 months ago
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization
This paper deals with the total variation minimization problem in image restoration for convex data fidelityfunctionals.Weproposeanewandfastalgorithmwhichcomputesanexactsolutionint...
Jérôme Darbon, Marc Sigelle