Results 1  10
of
674
Refining Initial Points for KMeans Clustering
, 1998
"... Practical approaches to clustering use an iterative procedure (e.g. KMeans, EM) which converges to one of numerous local minima. It is known that these iterative techniques are especially sensitive to initial starting conditions. We present a procedure for computing a refined starting condition fro ..."
Abstract

Cited by 317 (5 self)
 Add to MetaCart
Practical approaches to clustering use an iterative procedure (e.g. KMeans, EM) which converges to one of numerous local minima. It is known that these iterative techniques are especially sensitive to initial starting conditions. We present a procedure for computing a refined starting condition
Distributed Localization in Wireless Sensor Networks: A Quantitative Comparison
, 2003
"... This paper studies the problem of determining the node locations in adhoc sensor networks. We compare three distributed localization algorithms (Adhoc positioning, Robust positioning, and Nhop multilateration) on a single simulation platform. The algorithms share a common, threephase structure: ..."
Abstract

Cited by 302 (7 self)
 Add to MetaCart
: (1) determine nodeanchor distances, (2) compute node positions, and (3) optionally refine the positions through an iterative procedure. We present a detailed analysis comparing the various alternatives for each phase, as well as a headtohead comparison of the complete algorithms. The main
Nonlinear inverse scale space methods for image restoration
 Communications in Mathematical Sciences
, 2005
"... Abstract. In this paper we generalize the iterated refinement method, introduced by the authors in [8], to a timecontinuous inverse scalespace formulation. The iterated refinement procedure yields a sequence of convex variational problems, evolving toward the noisy image. The inverse scale space m ..."
Abstract

Cited by 65 (18 self)
 Add to MetaCart
method arises as a limit for a penalization parameter tending to zero, while the number of iteration steps tends to infinity. For the limiting flow, similar properties as for the iterated refinement procedure hold. Specifically, when a discrepancy principle is used as the stopping criterion, the error
Initialization of iterative refinement clustering algorithms
 In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD–98
, 1998
"... Iterative refinement clustering algorithms (e.g. KMeans, EM) converge to one of numerous local minima. It is known that they are especially sensitive to initial conditions. We present a procedure for computing a refined starting condition from a given initial one that is based on an efficient techn ..."
Abstract

Cited by 75 (2 self)
 Add to MetaCart
Iterative refinement clustering algorithms (e.g. KMeans, EM) converge to one of numerous local minima. It is known that they are especially sensitive to initial conditions. We present a procedure for computing a refined starting condition from a given initial one that is based on an efficient
Active Shape Models  "Smart Snakes"
 IN PROCEEDINGS OF THE BRITISH MACHINE VISION CONFERENCE
, 1992
"... We describe 'Active Shape Models' which iteratively adapt to refine estimates of the pose, scale and shape of models of image objects. The method uses flexible models derived from sets of training examples. These models, known as Point Distribution Models, represent objects as sets of labe ..."
Abstract

Cited by 218 (4 self)
 Add to MetaCart
deform into shapes conforming to global constraints imposed by the training set. An iterative procedure deforms the model example to find the best fit to the image object. Results of applying the method are described. The technique is shown to be a powerful method for refining estimates of object shape
An iterator construct for the refinement calculus
 In Fourth Irish Workshop on Formal Methods
, 2000
"... This paper concerns the introduction of an iterator into the refinement calculus. The construct is based on concepts from functional programming, and the work gives an interesting example of crossfertilisation between the functional and imperative programming worlds. Specifically, the iterator cons ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper concerns the introduction of an iterator into the refinement calculus. The construct is based on concepts from functional programming, and the work gives an interesting example of crossfertilisation between the functional and imperative programming worlds. Specifically, the iterator
Procedures and Invariants in the Refinement Calculus
 Science of Computer Programming
, 1994
"... Invariants allow a rigorous treatment of types as sets in the refinement calculus, a method for developing imperative programs. The interaction of procedures and invariants is explored, resulting in a practical formalisation of existing programming practice. 1 Introduction The notion of local invar ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
Invariants allow a rigorous treatment of types as sets in the refinement calculus, a method for developing imperative programs. The interaction of procedures and invariants is explored, resulting in a practical formalisation of existing programming practice. 1 Introduction The notion of local
A Compressive Landweber Iteration for Solving IllPosed Inverse Problems
, 2008
"... In this paper we shall be concerned with the construction of an adaptive Landweber iteration for solving linear illposed and inverse problems. Classical Landweber iteration schemes provide in combination with suitable regularization parameter rules order optimal regularization schemes. However, for ..."
Abstract

Cited by 124 (4 self)
 Add to MetaCart
we define an adaptive variant of Landweber’s iteration. In combination with an adequate refinement/stopping rule (apriori as well as aposteriori principles) we prove that the proposed procedure is an regularization method which converges in norm for exact and noisy data. The proposed approach
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
steps in Fourier imaging by using a very large number of receivers. Kwiat et al. (4) proposed a similar concept in 1991. In 1989 Kelton et al. In all contributions procedures for image reconstruction were derived. However, applications of the concepts noted have not been reported, reflecting
Iterative Teaching Procedure
"... � We explore different ways in which expression of emotion can be used, in conjunction with detection of touch, in a robot to guide the human user. � Two experiments are considered to illustrate this concept. 1. In the first experiment a robot is taught via tactile feedback to refine its manipulatio ..."
Abstract
 Add to MetaCart
� We explore different ways in which expression of emotion can be used, in conjunction with detection of touch, in a robot to guide the human user. � Two experiments are considered to illustrate this concept. 1. In the first experiment a robot is taught via tactile feedback to refine its
Results 1  10
of
674