Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Iteratively Reweighted Least Squares Minimization With Prior Information A New Approach, Dmitriy Popov
Iteratively Reweighted Least Squares Minimization With Prior Information A New Approach, Dmitriy Popov
Electronic Theses and Dissertations
Iteratively reweighted least squares (IRLS) algorithms provide an alternative to the more standard 1 l -minimization approach in compressive sensing. Daubechies et al. introduced a particularly stable version of an IRLS algorithm and rigorously proved its convergence in 2010. They did not, however, consider the case in which prior information on the support of the sparse domain of the solution is available. In 2009, Miosso et al. proposed an IRLS algorithm that makes use of this information to further reduce the number of measurements required to recover the solution with specified accuracy. Although Miosso et al. obtained a number of …
Convergence Of The Mean Shift Algorithm And Its Generalizations, Ting Hu
Convergence Of The Mean Shift Algorithm And Its Generalizations, Ting Hu
Electronic Theses and Dissertations
Mean shift is an effective iterative algorithm widely used in image analysis tasks like tracking, image segmentation, smoothing, filtering, edge detection and etc. It iteratively estimates the modes of the probability function of a set of sample data points based in a region. Mean shift was invented in 1975, but it was not widely used until the work by Cheng in 1995. After that, it becomes popular in computer vision. However the convergence, a key character of any iterative algorithm, has been rigorously proved only very recently, but with strong assumptions. In this thesis, the method of mean shift is …
The Use Of Filters In Topology, Abdellatif Dasser
The Use Of Filters In Topology, Abdellatif Dasser
Electronic Theses and Dissertations
Sequences are sufficient to describe topological properties in metric spaces or, more generally, topological spaces having a countable base for the topology. However, filters or nets are needed in more abstract spaces. Nets are more natural extension of sequences but are generally less friendly to work with since quite often two nets have distinct directed sets for domains. Operations involving filters are set theoretic and generally certain to filters on the same set. The concept of a filter was introduced by H. Cartan in 1937 and an excellent treatment of the subject can be found in N. Bourbaki (1940).