Sciweavers

6365 search results - page 129 / 1273
» Fast Local Computation Algorithms
Sort
View
ICPR
2000
IEEE
15 years 11 months ago
Boundary Estimation from Intensity/Color Images with Algebraic Curve Models
A new concept and algorithm are presented for noniterative robust estimation of piecewise smooth curves of maximal edge strength in small image windows – typically  ¢¡£  to...
Tolga Tasdizen, David B. Cooper
APIN
1998
132views more  APIN 1998»
15 years 6 months ago
Evolution-Based Methods for Selecting Point Data for Object Localization: Applications to Computer-Assisted Surgery
Object localization has applications in many areas of engineering and science. The goal is to spatially locate an arbitrarily-shaped object. In many applications, it is desirable ...
Shumeet Baluja, David Simon
ICS
2010
Tsinghua U.
16 years 4 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
ICIP
2009
IEEE
16 years 7 months ago
Discrete Curvature Calculation For Fast Level Set Segmentation
Fast level set methods replace continuous PDEs by a discrete formulation, improving the execution times. The regularization in fast level set methods was so far handled indirectly...
IROS
2008
IEEE
114views Robotics» more  IROS 2008»
16 years 1 months ago
Fast color/texture segmentation for outdoor robots
— We present a fast integrated approach for online segmentation of images for outdoor robots. A compact color and texture descriptor has been developed to describe local color an...
Morten Rufus Blas, Motilal Agrawal, Aravind Sundar...