1604 search results - page 148 / 321 » Approximation algorithms for developable surfaces |
114
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
The classical optical flow assumes that a feature point maintains constant brightness across the frames. For fluidtype motions such as smoke or clouds, the constant brightness ass...
111
click to vote
EMMCVPR
2001
Springer
15 years 6 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
IJNSEC
2008
15 years 1 months ago
2008
Agreement algorithms can be categorized in different ways. One categorization of such algorithms is based on whether the final decisions are exact or inexact. In inexact algorithm...
132
click to vote
CIT
2007
Springer
15 years 7 months ago
2007
Springer
In this paper a fuzzy quantization dequantization criterion is used to propose an evaluation technique to determine the appropriate clustering algorithm suitable for a particular ...
144
click to vote
NN
2000
Springer
15 years 1 months ago
2000
Springer
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...