Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,561
High Accuracy Optical Flow Estimation Based on a Theory for Warping
, 2004
"... We study an energy functional for computing optical flow that combines three assumptions: a brightness constancy assumption, a gradient constancy assumption, and a discontinuity-preserving spatio-temporal smoothness constraint. ..."
Abstract
-
Cited by 509 (45 self)
- Add to MetaCart
We study an energy functional for computing optical flow that combines three assumptions: a brightness constancy assumption, a gradient constancy assumption, and a discontinuity-preserving spatio-temporal smoothness constraint.
SEGMENTATION OF POINT CLOUDS USING SMOOTHNESS CONSTRAINT
"... For automatic processing of point clouds their segmentation is one of the most important processes. The methods based on curvature and other higher level derivatives often lead to over segmentation, which later needs a lot of manual editing. We present a method for segmentation of point clouds using ..."
Abstract
-
Cited by 44 (1 self)
- Add to MetaCart
using smoothness constraint, which finds smoothly connected areas in point clouds. It uses only local surface normals and point connectivity which can be enforced using either k-nearest or fixed distance neighbours. The presented method requires a small number of intuitive parameters, which provide a
Nonnegative Tensor Factorization with Smoothness Constraints
"... Abstract. Nonnegative Tensor Factorization (NTF) is an emerging technique in multidimensional signal analysis and it can be used to find partsbased representations of high-dimensional data. In many applications such as multichannel spectrogram processing or multiarray spectra analysis, the unknown f ..."
Abstract
- Add to MetaCart
features have locally smooth temporal or spatial structure. In this paper, we incorporate to an objective function in NTF additional smoothness constrains that considerably improve the unknown features. In our approach, we propose to use the Markov Random Field (MRF) model that is commonly
SNOPT: An SQP Algorithm For Large-Scale Constrained Optimization
, 2002
"... Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first deriv ..."
Abstract
-
Cited by 597 (24 self)
- Add to MetaCart
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first
Determining Optical Flow
- ARTIFICIAL INTELLIGENCE
, 1981
"... Optical flow cannot be computed locally, since only one independent measurement is available from the image sequence at a point, while the flow velocity has two components. A second constraint is needed. A method for finding the optical flow pattern is presented which assumes that the apparent veloc ..."
Abstract
-
Cited by 2404 (9 self)
- Add to MetaCart
Optical flow cannot be computed locally, since only one independent measurement is available from the image sequence at a point, while the flow velocity has two components. A second constraint is needed. A method for finding the optical flow pattern is presented which assumes that the apparent
A Signal Processing Approach To Fair Surface Design
, 1995
"... In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals -- functions defined on polyhedral surfaces of arbitrary topology --, we reduce the problem of surface smoothing, or fai ..."
Abstract
-
Cited by 654 (15 self)
- Add to MetaCart
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals -- functions defined on polyhedral surfaces of arbitrary topology --, we reduce the problem of surface smoothing
Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow
, 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating high-fidelit ..."
Abstract
-
Cited by 542 (23 self)
- Add to MetaCart
curvature flow operator that achieves a smoothing of the shape itself, distinct from any parameterization. Additional features of the algorithm include automatic exact volume preservation, and hard and soft constraints on the positions of the points in the mesh. We compare our method to previous operators
Algorithm for the separation of harmonic sounds with time-frequency smoothness constraint
- In: Proc. Int. Conf. on Digital Audio Effects
, 2003
"... A signal model is described which forces temporal and spectral smoothness of harmonic sounds. Smoothness refers to harmonic partials, the amplitudes of which are slowly-varying as a function of time and frequency. An algorithm is proposed for the estimation of the model parameters. The algorithm is ..."
Abstract
-
Cited by 13 (1 self)
- Add to MetaCart
is utilized in a sound separation system, the robustness of which is increased by the smoothness constraints. 1.
SCALABLE MULTIRESOLUTION COLOR IMAGE SEGMENTATION WITH SMOOTHNESS CONSTRAINT
"... This paper presents a novel multiresolution image segmentation method based on the discrete wavelet transform and Markov Random Field (MRF) modelling. A major contribution of this work is to add spatial scalability to the segmentation algorithm producing the same segmentation pattern at different re ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
at different resolutions simultaneously enables the algorithm to directly segment the images in the YUV or similar color spaces where luminance is in full resolution and chrominance components are at half resolution. Allowing for smoothness terms in the objective function at different resolutions improves
Results 1 - 10
of
3,561
