104 resultados para Localized algorithms
Resumo:
We describe simple yet scalable and distributed algorithms for solving the maximum flow problem and its minimum cost flow variant, motivated by problems of interest in objects similarity visualization. We formulate the fundamental problem as a convex-concave saddle point problem. We then show that this problem can be efficiently solved by a first order method or by exploiting faster quasi-Newton steps. Our proposed approach costs at most O(|ε|) per iteration for a graph with |ε| edges. Further, the number of required iterations can be shown to be independent of number of edges for the first order approximation method. We present experimental results in two applications: mosaic generation and color similarity based image layouting. © 2010 IEEE.
Resumo:
We develop a convex relaxation of maximum a posteriori estimation of a mixture of regression models. Although our relaxation involves a semidefinite matrix variable, we reformulate the problem to eliminate the need for general semidefinite programming. In particular, we provide two reformulations that admit fast algorithms. The first is a max-min spectral reformulation exploiting quasi-Newton descent. The second is a min-min reformulation consisting of fast alternating steps of closed-form updates. We evaluate the methods against Expectation-Maximization in a real problem of motion segmentation from video data.
Resumo:
This paper presents new methods for computing the step sizes of the subband-adaptive iterative shrinkage-thresholding algorithms proposed by Bayram & Selesnick and Vonesch & Unser. The method yields tighter wavelet-domain bounds of the system matrix, thus leading to improved convergence speeds. It is directly applicable to non-redundant wavelet bases, and we also adapt it for cases of redundant frames. It turns out that the simplest and most intuitive setting for the step sizes that ignores subband aliasing is often satisfactory in practice. We show that our methods can be used to advantage with reweighted least squares penalty functions as well as L1 penalties. We emphasize that the algorithms presented here are suitable for performing inverse filtering on very large datasets, including 3D data, since inversions are applied only to diagonal matrices and fast transforms are used to achieve all matrix-vector products.
Resumo:
In this paper, we extract density of localized tail states from measurements of low temperature conductance in amorphous oxide transistors. At low temperatures, trap-limited conduction prevails, allowing extraction of the trapped carrier distribution with energy. Using a test device with a-InGaZnO channel layer, the extracted tail state energy and density at the conduction band minima are 20 meV and 2 × 10 19 cm -3 eV -1, respectively, which are consistent with values reported in the literature. Also, the field-effect mobility as a function of temperature from 77 K to 300 K is retrieved for different gate voltages, yielding the activation energy and the percolation threshold. © 2012 American Institute of Physics.
Resumo:
Single-sensor maximum power point tracking algorithms for photovoltaic systems are presented. The algorithms have the features, characteristics and advantages of the widely used incremental conductance (INC) algorithm. However; unlike the INC algorithm which requires two sensors (the voltage sensor and the current sensor), the single-sensor algorithms are more desirable because they require only one sensor: the voltage sensor. The algorithms operate by maximising power at the DC-DC converter output, instead of the input. © 2013 The Institution of Engineering and Technology.
Resumo:
Several recent control applications consider the coordination of subsystems through local interaction. Often the interaction has a symmetry in state space, e.g. invariance with respect to a uniform translation of all subsystem values. The present paper shows that in presence of such symmetry, fundamental properties can be highlighted by viewing the distributed system as the discrete approximation of a partial differential equation. An important fact is that the symmetry on the state space differs from the popular spatial invariance property, which is not necessary for the present results. The relevance of the viewpoint is illustrated on two examples: (i) ill-conditioning of interaction matrices in coordination/consensus problems and (ii) the string instability issue. ©2009 IEEE.
Resumo:
This book shows how to exploit the special structure of such problems to develop efficient numerical algorithms.
Resumo:
There is a need for a stronger theoretical understanding of Multidisciplinary Design Optimization (MDO) within the field. Having developed a differential geometry framework in response to this need, we consider how standard optimization algorithms can be modeled using systems of ordinary differential equations (ODEs) while also reviewing optimization algorithms which have been derived from ODE solution methods. We then use some of the framework's tools to show how our resultant systems of ODEs can be analyzed and their behaviour quantitatively evaluated. In doing so, we demonstrate the power and scope of our differential geometry framework, we provide new tools for analyzing MDO systems and their behaviour, and we suggest hitherto neglected optimization methods which may prove particularly useful within the MDO context. Copyright © 2013 by ASME.