Log in

Relevant bibliographies by topics / Decomposition (Mathematics) Filters (Mathematics) / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Decomposition (Mathematics) Filters (Mathematics).

Dissertations / Theses on the topic 'Decomposition (Mathematics) Filters (Mathematics)'

Author: Grafiati

Published: 4 June 2021

Last updated: 12 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Decomposition (Mathematics) Filters (Mathematics).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Choi, Youngsik. "Incorporating robustness into fuzzy logic and mixture decomposition for image enhancement and segementation /." free to MU campus, to others for purchase, 1996. http://wwwlib.umi.com/cr/mo/fullcit?p9737866.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

梁鴻鈞 and Hung-kwan Leung. "Multi-rank wavelet filters." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B31224714.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Leung, Hung-kwan. "Multi-rank wavelet filters." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk/hkuto/record.jsp?B23242395.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Swarnakar, Vivek. "Optimal morphological filters /." Online version of thesis, 1993. http://hdl.handle.net/1850/11703.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Shen, Jianhong 1971. "Asymptotics of wavelets and filters." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47469.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Burns, Brenda D. "The Staircase Decomposition for Reductive Monoids." NCSU, 2002. http://www.lib.ncsu.edu/theses/available/etd-20020422-102254.

Full text

Abstract:

<p>Burns, Brenda Darlene. The Staircase Decomposition for Reductive Monoids. (Under the direction of Mohan Putcha.) The purpose of the research has been to develop a decomposition for the J-classes of a reductive monoid. The reductive monoid M(K) isconsidered first. A J-class in M(K) consists ofelements of the same rank. Lower and upper staircase matricesare defined and used to decompose a matrix x of rank r into theproduct of a lower staircase matrix, a matrix with a rank rpermutation matrix in the upper left hand corner, and an upperstaircase matrix, each of which is of rank r. The choice of

APA, Harvard, Vancouver, ISO, and other styles

7

Cheng, Ho-Yin, and 鄭浩賢. "Lifting schemes for wavelet filters of trigonometric vanishingmoments." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B42577044.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hersh, Patricia (Patricia Lynn) 1973. "Decomposition and enumeration in partially ordered sets." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/85303.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Loce, Robert P. "Morphological filter mean-absolute-error representation theorems and their application to optimal morphological filter design /." Online version of thesis, 1993. http://hdl.handle.net/1850/11065.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Mahakian, David R. "Analyzing Real-Life Pedestrian Measurements Using Kalman Filters." Thesis, California State University, Long Beach, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=10979263.

Full text

Abstract:

<p> We study pedestrian dynamics using Kalman filtering methods. Kalman filters apply the Bayesian approach to a time series and incorporate the uncertainty in both the measurement and the mathematical model to create a better state estimate of a system, and are commonly used to reduce error in state estimates for applications ranging from radar systems to GPS. </p><p> Our goal is to combine a Kalman filter and the Kuhn-Munkres algorithm to not only predict the locations of the pedestrians but also reconstruct their walking path trajectories. We first worked on the linear system of stochasti

APA, Harvard, Vancouver, ISO, and other styles

11

Korey, Michael Brian. "A decomposition of functions with vanishing mean oscillation." Universität Potsdam, 2001. http://opus.kobv.de/ubp/volltexte/2008/2592/.

Full text

Abstract:

A function has vanishing mean oscillation (VMO) on R up(n) if its mean oscillation - the local average of its pointwise deviation from its mean value - both is uniformly bounded over all cubes within R up(n) and converges to zero with the volume of the cube. The more restrictive class of functions with vanishing lower oscillation (VLO) arises when the mean value is replaced by the minimum value in this definition. It is shown here that each VMO function is the difference of two functions in VLO.

APA, Harvard, Vancouver, ISO, and other styles

12

Wilson, Michelle Marie Lucy. "A survey of primary decomposition using Gröbner bases." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/37005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Jung, Kyomin. "Approximate inference : decomposition methods with applications to networks." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/50595.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2009.<br>Includes bibliographical references (p. 147-151).<br>Markov random field (MRF) model provides an elegant probabilistic framework to formulate inter-dependency between a large number of random variables. In this thesis, we present a new approximation algorithm for computing Maximum a Posteriori (MAP) and the log-partition function for arbitrary positive pair-wise MRF defined on a graph G. Our algorithm is based on decomposition of G into appropriately chosen small components; then computing estimates locally

APA, Harvard, Vancouver, ISO, and other styles

14

Ngulo, Uledi. "Decomposition Methods for Combinatorial Optimization." Licentiate thesis, Linköpings universitet, Tillämpad matematik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-175896.

Full text

Abstract:

This thesis aims at research in the field of combinatorial optimization. Problems within this field often posses special structures allowing them to be decomposed into more easily solved subproblems, which can be exploited in solution methods. These structures appear frequently in applications. We contribute with both re-search on the development of decomposition principles and on applications. The thesis consists of an introduction and three papers. In Paper I, we develop a Lagrangian meta-heuristic principle, which is founded on a primal-dual global optimality condition for discrete and non

APA, Harvard, Vancouver, ISO, and other styles

15

Li, Weigang. "Atomic decomposition of H1 spaces and exponential square classes." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=41682.

Full text

Abstract:

Let $u sb0$ be the harmonic extension of the function f (defined on $R sp{n})$ to $R sbsp{+}{n+1}$. It is well known that $f in H sp{p}(R sp{n}), 00, C sp{ prime prime}< infty,$ which depend only on $ alpha$ and the dimension n. We also get a new proof for an L-harmonic version.

APA, Harvard, Vancouver, ISO, and other styles

16

Loisel, Sébastien. "Optimal and optimized domain decomposition methods on the sphere." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=85572.

Full text

Abstract:

The numerical solution of partial differential equations and boundary value problems is one of the most important tools of modern science. For various reasons (parellelizing, improving condition numbers, finding good preconditioners, etc...) it is desirable to turn a boundary value problem over a large domain O into a set of boundary value problems over domains O1,...,O n such that ∪kO k; this is the domain decomposition method. The solutions u1,...,un of the local problems rarely glue together into a solution u of the global problem, hence we must use an iteration whereby we repeatedly

APA, Harvard, Vancouver, ISO, and other styles

17

Simeone, Daniel. "Network connectivity: a tree decomposition approach." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=18797.

Full text

Abstract:

We show that the gap between the least costly 3-edge-connected metric graph and the least costly 3-vertex-connected metric graph is at most $3$. The approach relies upon tree decompositions, and a degree limiting theorem of Bienstock et al. As well, we explore the tree decomposition approach for general k-edge and vertex-connected graphs, and demonstrate a large amount of the required background theory.<br>Nous démontrons que l'écart entre un graphe métrique 3-arête-connexe de coût minimum et un graphe métrique 3-sommet-connexe de coût minimum est au plus 3. Notre approche repose sur l'existen

APA, Harvard, Vancouver, ISO, and other styles

18

Riaz, Samia. "Domain decomposition method for variational inequalities." Thesis, University of Birmingham, 2014. http://etheses.bham.ac.uk//id/eprint/4815/.

Full text

Abstract:

Variational inequalities have found many applications in applied science. A partial list includes obstacles problems, fluid flow in porous media, management science, traffic network, and financial equilibrium problems. However, solving variational inequalities remain a challenging task as they are often subject to some set of complex constraints, for example the obstacle problem. Domain decomposition methods provide great flexibility to handle these types of problems. In our thesis we consider a general variational inequality, its finite element formulation and its equivalence with linear and

APA, Harvard, Vancouver, ISO, and other styles

19

Oyinsan, Sola. "Primary decomposition of ideals in a ring." CSUSB ScholarWorks, 2007. https://scholarworks.lib.csusb.edu/etd-project/3289.

Full text

Abstract:

The concept of unique factorization was first recognized in the 1840s, but even then, it was still fairly believed to be automatic. The error of this assumption was exposed largely through attempts to prove Pierre de Fermat's, 1601-1665, last theorem. Once mathematicians discovered that this property did not always hold, it was only natural for them to try to search for the strongest available alternative. Thus began the attempt to generalize unique factorization. Using the ascending chain condition on principle ideals, we will show the conditions under which a ring is a unique factorization d

APA, Harvard, Vancouver, ISO, and other styles

20

Samuelsson, Saga. "The Singular Value Decomposition Theorem." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-150917.

Full text

Abstract:

This essay will present a self-contained exposition of the singular value decomposition theorem for linear transformations. An immediate consequence is the singular value decomposition for complex matrices.<br>Denna uppsats kommer presentera en självständig exposition av singulärvärdesuppdelningssatsen för linjära transformationer. En direkt följd är singulärvärdesuppdelning för komplexa matriser.

APA, Harvard, Vancouver, ISO, and other styles

21

Chen, Huaizhi. "Estimating Stochastic Volatility Using Particle Filters." Cleveland, Ohio : Case Western Reserve University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=case1247125250.

Full text

Abstract:

Thesis (M.S.)--Case Western Reserve University, 2009<br>Title from PDF (viewed on 19 August 2009) Department of Mathematics Includes abstract Includes bibliographical references Available online via the OhioLINK ETD Center

APA, Harvard, Vancouver, ISO, and other styles

22

Muraleetharan, Murugiah. "Generalisations of filters and uniform spaces." Thesis, Rhodes University, 1997. http://hdl.handle.net/10962/d1005223.

Full text

Abstract:

The notion of a filter F ∈ 2²x has been extended to that of a : prefilter: ƒ ∈ 1²x, generalised filter ƒ ∈ 2²x x and fuzzy filter ᵩ ∈ 1¹x. A uniformity is a filter with some other conditions and the notion of a uniformity D ∈ 2²xxx has been extended to that of a : fuzzy uniformity d ∈ 1²xxx , generalised uniformity ∈ 1²xxx and super uniformity b ∈ 1¹x. We establish categorical embeddings from the category of uniform spaces into the categories of fuzzy uniform spaces, generalised uniform spaces and super uniform spaces and also categorical embeddings into the category of super uniform spaces fr

APA, Harvard, Vancouver, ISO, and other styles

23

Khosravi, Mehdi. "Morphological approaches to linear filter implementation and template matching." Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/13745.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Kammogne, Kamgaing Rodrigue. "Domain decomposition methods for reaction-diffusion systems." Thesis, University of Birmingham, 2014. http://etheses.bham.ac.uk//id/eprint/4599/.

Full text

Abstract:

Domain Decomposition (DD) methods have been successfully used to solve elliptic problems, as they deal with them in a more elegant and efficient way than other existing numerical methods. This is achieved through the division of the domain into subdomains, followed by the solving of smaller problems within these subdomains which leads to the solution. Furthermore DD-techniques can incorporate in their implementation not only the physics of the different phenomena associated with the modeling, but also the enhancement of parallel computing. They can be divided into two major categories: with an

APA, Harvard, Vancouver, ISO, and other styles

25

SINN, A. ROBB. "CRITICAL FILTERS OF THE ADOLESCENT MATHEMATICS EXPERIENCE: A SELF-EFFICACY ANALYSIS." University of Cincinnati / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1054304190.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Cheng, Ho-Yin. "Lifting schemes for wavelet filters of trigonometric vanishing moments." Click to view the E-thesis via HKUTO, 2002. http://sunzi.lib.hku.hk/hkuto/record/B42577044.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Chapovalova, Valentina. "Decomposition of Certain C[Sn]-modules into Specht Modules." Thesis, Uppsala universitet, Matematiska institutionen, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-120505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Wyncoll, David Peter. "State space modelling of extreme values with particle filters." Thesis, Lancaster University, 2009. http://eprints.lancs.ac.uk/31479/.

Full text

Abstract:

State space models are a flexible class of Bayesian model that can be used to smoothly capture non-stationarity. Observations are assumed independent given a latent state process so that their distribution can change gradually over time. Sequential Monte Carlo methods known as particle filters provide an approach to inference for such models whereby observations are added to the fit sequentially. Though originally developed for on-line inference, particle filters, along with related particle smoothers, often provide the best approach for off-line inference. This thesis develops new results for

APA, Harvard, Vancouver, ISO, and other styles

29

Niyobuhungiro, Japhet. "Optimal Decomposition in Real Interpolation and Duality in Convex Analysis." Licentiate thesis, Linköpings universitet, Matematik och tillämpad matematik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-94506.

Full text

Abstract:

This thesis is devoted to the study of mathematical properties of exact minimizers for the K–,L–, and E– functionals of the theory of real interpolation. Recently exact minimizers for these functionals have appeared in important results in image processing. In the thesis, we present a geometry of optimal decomposition for L– functional for the couple (ℓ2, X), where space ℓ2 is defined by the standard Euclidean norm ǁ · ǁ2 and where X is a Banach space on Rn. The well known ROF denoising model is a special case of an L– functional for the couple (L2, BV) where L2 and BV stand for the space of s

APA, Harvard, Vancouver, ISO, and other styles

30

Pun, Ka-shun Carson, and 潘加信. "New design and realization techniques for perfect reconstruction two-channel filterbanks and wavelets bases." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31226632.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Kardamis, Joseph R. "Audio watermarking techniques using singular value decomposition /." Online version of thesis, 2007. http://hdl.handle.net/1850/4493.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Li, Zhi Xiong. "A revision of adaptive Fourier decomposition." Thesis, University of Macau, 2012. http://umaclib3.umac.mo/record=b2590642.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Ahiati, Veroncia Sitsofe. "Cardinal spline wavelet decomposition based on quasi-interpolation and local projection." Thesis, Stellenbosch : University of Stellenbosch, 2009. http://hdl.handle.net/10019.1/2580.

Full text

Abstract:

Thesis (MSc (Mathematics))--University of Stellenbosch, 2009.<br>Wavelet decomposition techniques have grown over the last two decades into a powerful tool in signal analysis. Similarly, spline functions have enjoyed a sustained high popularity in the approximation of data. In this thesis, we study the cardinal B-spline wavelet construction procedure based on quasiinterpolation and local linear projection, before specialising to the cubic B-spline on a bounded interval. First, we present some fundamental results on cardinal B-splines, which are piecewise polynomials with uniformly space

APA, Harvard, Vancouver, ISO, and other styles

34

Chabbi, Charef. "VLSI NMOS hardware design of a linear phase FIR low pass digital filer." Ohio : Ohio University, 1985. http://www.ohiolink.edu/etd/view.cgi?ohiou1183749814.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Sinn, Robb. "Critical filters of the adolescent mathematics experience a self-efficacy theory /." Cincinnati, Ohio : University of Cincinnati, 2003. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=1054304190.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Chapovalova, Valentina. "Decomposition of Certain C[Sn]-modules into Specht Modules." Thesis, Uppsala University, Department of Mathematics, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-120505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Williams, Adrian Leonard. "Some more decomposition numbers for modular representations of symmetric groups." Thesis, Imperial College London, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.313541.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Turner, James Anthony. "Application of domain decomposition methods to problems in topology optimisation." Thesis, University of Birmingham, 2015. http://etheses.bham.ac.uk//id/eprint/5842/.

Full text

Abstract:

Determination of the optimal layout of structures can be seen in everyday life, from nature to industry, with research dating back to the eighteenth century. The focus of this thesis involves investigation into the relatively modern field of topology optimisation, where the aim is to determine both the optimal shape and topology of structures. However, the inherent large-scale nature means that even problems defined using a relatively coarse finite element discretisation can be computationally demanding. This thesis aims to describe alternative approaches allowing for the practical use of topo

APA, Harvard, Vancouver, ISO, and other styles

39

Azzato, Jeffrey Donald. "Linked tree-decompositions of infinite represented matroids : a thesis submitted to the Victoria University of Wellington in fulfilment of the requirements for the degree of Master of Science in Mathematics /." ResearchArchive@Victoria e-Thesis, 2008. http://hdl.handle.net/10063/322.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Hägg, Linus. "Quasi-Arithmetic Filters for Topology Optimization." Licentiate thesis, Umeå universitet, Institutionen för datavetenskap, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-116983.

Full text

Abstract:

Topology optimization is a framework for finding the optimal layout of material within a given region of space. In material distribution topology optimization, a material indicator function determines the material state at each point within the design domain. It is well known that naive formulations of continuous material distribution topology optimization problems often lack solutions. To obtain numerical solutions, the continuous problem is approximated by a finite-dimensional problem. The finite-dimensional approximation is typically obtained by partitioning the design domain into a finite

APA, Harvard, Vancouver, ISO, and other styles

41

Ortiz, Marcos A. "Convex decomposition techniques applied to handlebodies." Diss., University of Iowa, 2015. https://ir.uiowa.edu/etd/1713.

Full text

Abstract:

Contact structures on 3-manifolds are 2-plane fields satisfying a set of conditions. The study of contact structures can be traced back for over two-hundred years, and has been of interest to mathematicians such as Hamilton, Jacobi, Cartan, and Darboux. In the late 1900's, the study of these structures gained momentum as the work of Eliashberg and Bennequin described subtleties in these structures that could be used to find new invariants. In particular, it was discovered that contact structures fell into two classes: tight and overtwisted. While overtwisted contact structures are relatively w

APA, Harvard, Vancouver, ISO, and other styles

42

陳志榮 and Chi-wing Chan. "Design of 1-D and 2-D perfect reconstruction filter banks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31214915.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Ozkan, Sibel. "Hamilton decompositions of graphs with primitive complements." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Spring%20Dissertations/OZKAN_SIBEL_27.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Shankar, Jayashree. "Analysis of a nonhierarchical decomposition algorithm." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-09192009-040336/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Pfister, Noah. "Using Empirical Mode Decomposition to Study Periodicity and Trends in Extreme Precipitation." ScholarWorks @ UVM, 2015. http://scholarworks.uvm.edu/graddis/366.

Full text

Abstract:

Classically, we look at annual maximum precipitation series from the perspective of extreme value statistics, which provides a useful statistical distribution, but does not allow much flexibility in the context of climate change. Such distributions are usually assumed to be static, or else require some assumed information about possible trends within the data. For this study, we treat the maximum rainfall series as sums of underlying signals, upon which we perform a decomposition technique, Empirical Mode Decomposition. This not only allows the study of non-linear trends in the data, but could

APA, Harvard, Vancouver, ISO, and other styles

46

Kwizera, Petero. "Matrix Singular Value Decomposition." UNF Digital Commons, 2010. http://digitalcommons.unf.edu/etd/381.

Full text

Abstract:

This thesis starts with the fundamentals of matrix theory and ends with applications of the matrix singular value decomposition (SVD). The background matrix theory coverage includes unitary and Hermitian matrices, and matrix norms and how they relate to matrix SVD. The matrix condition number is discussed in relationship to the solution of linear equations. Some inequalities based on the trace of a matrix, polar matrix decomposition, unitaries and partial isometies are discussed. Among the SVD applications discussed are the method of least squares and image compression. Expansion of a matrix a

APA, Harvard, Vancouver, ISO, and other styles

47

Magee, David Patrick. "Optimal arbitrary time-delay filtering to minimize vibration in elastic manipulator systems." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/15891.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

West, Philip Davidson. "Nonlinear filtering for stochastic hybrid and nonlinear systems with applications to target tracking." Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/14808.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Palansuriya, Charaka Jeewana. "Domain decomposition based algorithms for some inverse problems." Thesis, University of Greenwich, 2000. http://gala.gre.ac.uk/8226/.

Full text

Abstract:

The work presented in this thesis develop algorithms to solve inverse problems where source terms are unknown. The algorithms are developed 011frameworks provided by domain decomposition methods and the numerical schemes use finite volume and finite difference discretisations. Three algorithms are developed in the context of a metal cutting problem. The algorithms require measurement data within the physical body in order to retrieve the temperature field and the unknown source terms. It is shown that the algorithms can retrieve both the temperature field and the unknown source accurately. App

APA, Harvard, Vancouver, ISO, and other styles

50

Gui, Le. "Use of operator theory and sub-band filters in the analysis and encoding of signals and images." Diss., University of Iowa, 2009. https://ir.uiowa.edu/etd/293.

Full text

Abstract:

The thesis is motivated by recent advances in signal and image processing, a part of electrical and computer engineering. In the first part, we begin with a new approach to the mathematical signal processing as used in the digital processing of images. We prove such results in the 2D case, and we explain their use. A key point we explore is the interplay between the two cases, continuous and discrete. Our discrete algorithms present fast matrix-operations to be applied to images in pixel form. This part of the thesis in turn is based on tools from wavelet analysis, and more generally from the

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!