Results 1  10
of
6,585
EpiConvergence of Minimum Curvature Variation Bsplines
, 1000
"... We study the curvature variation functional, i.e., the integral over the square of arclength derivative of curvature, along a planar curve. With no other constraints than prescribed position, slope angle, and curvature at the endpoints of the curve, the minimizer of this functional is known as a cu ..."
Abstract
 Add to MetaCart
We study the curvature variation functional, i.e., the integral over the square of arclength derivative of curvature, along a planar curve. With no other constraints than prescribed position, slope angle, and curvature at the endpoints of the curve, the minimizer of this functional is known as a
PathPlanning with ObstacleAvoiding Minimum Curvature Variation Bsplines
"... ii We study the general problem of computing an obstacleavoiding path that, for a prescribed weight, minimizes the weighted sum of a smoothness measure and a safety measure of the path. We consider planar curvaturecontinuous paths, that are functions on an interval of a room axis, for a pointsize ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
size vehicle amidst obstacles. The obstacles are two disjoint continuous functions on the same interval. A path is found as a minimizer of the weighted sum of two costs, namely 1) the integral of the square of arclength derivative of curvature along the path (smoothness), and 2) the distance in L 2 norm
An Algorithm for Total Variation Minimization and Applications
, 2004
"... We propose an algorithm for minimizing the total variation of an image, and provide a proof of convergence. We show applications to image denoising, zooming, and the computation of the mean curvature motion of interfaces. ..."
Abstract

Cited by 624 (8 self)
 Add to MetaCart
We propose an algorithm for minimizing the total variation of an image, and provide a proof of convergence. We show applications to image denoising, zooming, and the computation of the mean curvature motion of interfaces.
Nonlinear total variation based noise removal algorithms
, 1992
"... A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using the g ..."
Abstract

Cited by 2271 (51 self)
 Add to MetaCart
A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using
Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1996
"... We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum and c ..."
Abstract

Cited by 774 (20 self)
 Add to MetaCart
We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum
VERY HIGH RESOLUTION INTERPOLATED CLIMATE SURFACES FOR GLOBAL LAND AREAS
, 2005
"... We developed interpolated climate surfaces for global land areas (excluding Antarctica) at a spatial resolution of 30 arc s (often referred to as 1km spatial resolution). The climate elements considered were monthly precipitation and mean, minimum, and maximum temperature. Input data were gathered ..."
Abstract

Cited by 553 (8 self)
 Add to MetaCart
We developed interpolated climate surfaces for global land areas (excluding Antarctica) at a spatial resolution of 30 arc s (often referred to as 1km spatial resolution). The climate elements considered were monthly precipitation and mean, minimum, and maximum temperature. Input data were gathered
A Variational Level Set Approach to Multiphase Motion
 JOURNAL OF COMPUTATIONAL PHYSICS 127, 179–195 (1996) ARTICLE NO. 0167
, 1996
"... A coupled level set method for the motion of multiple junctions (of, e.g., solid, liquid, and grain boundaries), which follows the gradient flow for an energy functional consisting of surface tension (proportional to length) and bulk energies (proportional to area), is sin �1 developed. The approach ..."
Abstract

Cited by 315 (38 self)
 Add to MetaCart
. The approach combines the level set method of S. Osher and J. A. Sethian with a theoretical variational formulation of the motion by F. Reitich and H. M. Soner. The resulting method uses as many level set functions as there are regions and the energy functional is evaluated entirely in terms of level set
A VectorPerturbation technique for NearCapacity . . .
 IEEE TRANS. COMMUN
, 2005
"... Recent theoretical results describing the sum capacity when using multiple antennas to communicate with multiple users in a known rich scattering environment have not yet been followed with practical transmission schemes that achieve this capacity. We introduce a simple encoding algorithm that achi ..."
Abstract

Cited by 323 (10 self)
 Add to MetaCart
that achieves nearcapacity at sum rates of tens of bits/channel use. The algorithm is a variation on channel inversion that regularizes the inverse and uses a “sphere encoder ” to perturb the data to reduce the power of the transmitted signal. This paper is comprised of two parts. In this first part, we show
Artificial Evolution for Computer Graphics
 Computer Graphics
, 1991
"... This paper describes how evolutionary techniques of variation and selection can be used to create complex simulated structures, textures, and motions for use in computer graphics and animation. Interactive selection, based on visual perception of procedurally generated results, allows the user to di ..."
Abstract

Cited by 316 (2 self)
 Add to MetaCart
This paper describes how evolutionary techniques of variation and selection can be used to create complex simulated structures, textures, and motions for use in computer graphics and animation. Interactive selection, based on visual perception of procedurally generated results, allows the user
Global Minimum for Active Contour Models: A Minimal Path Approach
, 1997
"... A new boundary detection approach for shape modeling is presented. It detects the global minimum of an active contour model’s energy between two end points. Initialization is made easier and the curve is not trapped at a local minimum by spurious edges. We modify the “snake” energy by including the ..."
Abstract

Cited by 238 (70 self)
 Add to MetaCart
A new boundary detection approach for shape modeling is presented. It detects the global minimum of an active contour model’s energy between two end points. Initialization is made easier and the curve is not trapped at a local minimum by spurious edges. We modify the “snake” energy by including
Results 1  10
of
6,585