Sciweavers

306 search results - page 8 / 62
» Underspecified computation of normal forms
Sort
View
ICCV
2007
IEEE
14 years 9 months ago
Normalized Cuts Revisited: A Reformulation for Segmentation with Linear Grouping Constraints
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in computer vision. It has been applied to a wide range of segmentation tasks with great success. A...
Anders P. Eriksson, Carl Olsson, Fredrik Kahl
ECEASST
2010
13 years 2 months ago
Verified Visualisation of Textual Modelling Languages
Abstract. Many modelling languages have both a textual and a graphical form. The relationship between these two forms ought to be clear and concrete, but is instead commonly unders...
Fintan Fairmichael, Joseph Kiniry
ICASSP
2007
IEEE
14 years 1 months ago
Sound Source Tracking and Formation using Normalized Cuts
The goal of computational auditory scene analysis (CASA) is to create computer systems that can take as input a mixture of sounds and form packages of acoustic evidence such that ...
Mathieu Lagrange, George Tzanetakis
HPCS
2009
IEEE
13 years 11 months ago
FFT-Based Dense Polynomial Arithmetic on Multi-cores
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
Marc Moreno Maza, Yuzhen Xie
ICCV
2005
IEEE
14 years 9 months ago
Shapelets Correlated with Surface Normals Produce Surfaces
This paper addresses the problem of deducing the surface shape of an object given just the surface normals. Many shape measurement algorithms such as shape from shading and shape ...
Peter Kovesi