Results 1  10
of
417
Image recovery using partitionedseparable paraboloidal surrogate coordinate ascent algorithms
 IEEE Tr. Im. Proc
, 2002
"... AbstractIterative coordinate ascent algorithms have been shown to be useful for image recovery, but are poorly suited to parallel computing due to their sequential nature. This paper presents a new fast converging parallelizable algorithm for image recovery that can be applied to a very broad clas ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
AbstractIterative coordinate ascent algorithms have been shown to be useful for image recovery, but are poorly suited to parallel computing due to their sequential nature. This paper presents a new fast converging parallelizable algorithm for image recovery that can be applied to a very broad
Distributed Dual Ascent Algorithm for Steiner Problems in Networks
"... Abstract. Steiner Problems in undirected or directed graphs are often used to model multicast routing problems. The directed case being particularly suitable to situations where most of the trafic has a single source. Sequential Steiner heuristics are not convenient in that context, since one can no ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
and directed Steiner problems. The distributed Dual Ascent has worst case complexities of O(V  2) time and O(T .V  2) messages. Experimental results are also presented, showing the eficiency of the proposed algorithm. 1.
ASCENT: Adaptive selfconfiguring sensor networks topologies
, 2004
"... Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low pernode cost will allow these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks w ..."
Abstract

Cited by 449 (15 self)
 Add to MetaCart
are necessary to establish a routing forwarding backbone. In ASCENT, each node assesses its connectivity and adapts its participation in the multihop network topology based on the measured operating region. This paper motivates and describes the ASCENT algorithm and presents analysis, simulation
Groupedcoordinate ascent algorithms for penalizedlikelihood transmission image reconstruction,”
 IEEE TT. Med. Im.,
, 1997
"... ..."
Direct GradientBased Reinforcement Learning:II. Gradient Ascent Algorithms and Experiments
, 1999
"... Abstract In [2] we introduced GPOMDP, an algorithm for computing arbitrarily accurate approximations to the performance gradient of parameterized partially observable Markov decision processes (POMDPs).The algorithm's chief advantages are that it requires only a single sample path of the under ..."
Abstract
 Add to MetaCart
present CONJPOMDP, a conjugategradient ascent algorithm that uses GPOMDP as a subroutine to estimate the gradient direction. CONJPOMDP uses a novel linesearch routine that relies solely on gradient estimates and hence is robust to noise in the performance estimates. OLPOMDP,an online gradient ascent
Partitioned separable paraboloidal surrogate coordinate ascent algorithm for image restoration
 In Proc. IEEE Intl. Conf. on Image Processing
, 2000
"... We introduce a new fast converging parallelizable algorithm for image restoration. This algorithm is based on paraboloidal surrogate functions to simplify the optimization problem and a concavity technique developed by De Pierro to simultaneously update a set of pixels. To obtain large step sizes w ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
imized by using coordinate ascent (CA) algorithms. Unlike other existing algorithms such EM and CA algorithms, the proposed algorithm not only requires less time per iteration to converge, but is guaranteed to monotonically increase the objective function and intrinsically accommodates nonnegativity constraints
MUONNo092 RASNIK Image Processing with a Steepest Ascent Algorithm
, 1995
"... The RASNIK alignment instrument was developed at NIKHEF [1]. ..."
Design and Implementation of a Distributed Dual Ascent Algorithm for the Steiner Problem in Graphs
"... The Steiner Problem in Graphs (SPG) is defined as follows. Given an undirected graph G = (V, E), positive edge costs c and a set T ⊆ V of terminal nodes, find a connected subgraph (V ′ , E ′ ) of G with T ⊆ V ′ minimizing � e∈E ′ ce. In other words, find a minimum cost tree containing all terminals, ..."
Abstract
 Add to MetaCart
The Steiner Problem in Graphs (SPG) is defined as follows. Given an undirected graph G = (V, E), positive edge costs c and a set T ⊆ V of terminal nodes, find a connected subgraph (V ′ , E ′ ) of G with T ⊆ V ′ minimizing � e∈E ′ ce. In other words, find a minimum cost tree containing all terminals, possibly also
A Hybrid TabuAscent Algorithm fo the Linear Bilevel Programming Problem
, 1996
"... The linear Bilevel Programming Problem (BLP) is an instance of a linear hierarchical decision process where the lower level constraint set is dependent on decisions taken at the upper level. In this paper we propose to solve this NPhard problem using an adaptive search method related to the Tabu S ..."
Abstract
 Add to MetaCart
The linear Bilevel Programming Problem (BLP) is an instance of a linear hierarchical decision process where the lower level constraint set is dependent on decisions taken at the upper level. In this paper we propose to solve this NPhard problem using an adaptive search method related to the Tabu Search metaheuristic. Numerical results on large scale linear BLPs are presented.
Baseline Wandering Removal from Human Electrocardiogram Signal using Projection Pursuit Gradient Ascent Algorithm
"... Abstract Baseline noise removal from electrocardiogram (ECG) signal is a blind source separation problem. Various noises affect the measured ECG signal. Major ECG noises are baseline noise, electrode contact noise, muscle noise, instrument noise. Baseline noise distorts the low frequency segment o ..."
Abstract
 Add to MetaCart
of ECG signal. The low frequency segment is st segment. This segment is very important and has the information related to heart attack. People apply various algorithms to remove this noise from noisy ECG signal. We have applied projection pursuit gradient ascent algorithm to remove this noise from
Results 1  10
of
417