Papyrus 125: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Leszek Jańczuk
 
en>Leszek Jańczuk
interwiki
 
Line 1: Line 1:
Today, there are several other types of web development and blogging software available to design and host your website blogs online and that too in minutes, if not hours. What I advise you do next is save the backup data file to a remote place like a CD-ROM, external disk drive if you have one or a provider such as Dropbox. This is a service where people write articles using a specific keyword you have given them. If you're using Wordpress and want to make your blog a "dofollow" blog, meaning that links from your blog pass on the benefits of Google pagerank, you can install one of the many dofollow plugins available.  In the event you liked this informative article and also you would want to receive more details concerning [http://iz.sa/wordpressdropboxbackup244999 wordpress backup plugin] generously visit the site. provided by Word - Press Automatic Upgrade, so whenever you need to update the new version does not, it automatically creates no webmaster. <br><br>
{{Context|date=November 2009}}


You just download ready made templates to a separate directory and then choose a favorite one in the admin panel. If a newbie missed a certain part of the video then they could always rewind. Several claim that Wordpress just isn't an preferred tool to utilise when developing a professional site. You can up your site's rank with the search engines by simply taking a bit of time with your site. That's a total of 180$ for each Wordpress theme if you sell 3 links and keep the designer link for your own website, or 240$ if you sell all links. <br><br>Photography is an entire activity in itself, and a thorough discovery of it is beyond the opportunity of this content. But if you are not willing to choose cost to the detriment of quality, originality and higher returns, then go for a self-hosted wordpress blog and increase the presence of your business in this new digital age. Setting Up Your Business Online Using Free Wordpress Websites. You or your web designer can customize it as per your specific needs. For any web design and development assignment, this is definitely one of the key concerns, specifically for online retail outlets as well as e-commerce websites. <br><br>If all else fails, please leave a comment on this post with the issue(s) you're having and help will be on the way. In case you need to hire PHP developers or hire Offshore Code - Igniter development services or you are looking for Word - Press development experts then Mindfire Solutions would be the right choice for a Software Development partner. Exacting subjects in reality must be accumulated in head ahead of planning on your high quality theme. The company gains commission from the customers' payment. Wordpress template is loaded with lots of prototype that unite graphic features and content area. <br><br>Website security has become a major concern among individuals all over the world. An ease of use which pertains to both internet site back-end and front-end users alike. By the time you get the Gallery Word - Press Themes, the first thing that you should know is on how to install it. Page speed is an important factor in ranking, especially with Google. Get started today so that people searching for your type of business will be directed to you.
A subset <math>\{\phi_i\}_{i\in J}</math> of a [[Banach space]] <math>X</math>, sometimes called a "system", is '''complete''' if every element in <math>X</math> can be approximated arbitrarily well in norm by finite linear combinations of elements in <math>\{\phi_i\}_{i\in J}</math>.<ref name="heil">C. Heil, A Basis Theory Primer: Expanded Edition. Boston, MA: Birkhauser, 2010.</ref> Such a complete system is '''overcomplete''' if removal of a <math>\phi_j</math> from the system results in a complete system (i.e., <math>\{\phi_i\}_{i\in J\backslash\{j\}}</math> is still complete). In different research, such as signal processing and function approximation, overcompleteness can help researchers to achieve a more stable, more robust, or more compact decomposition than using a basis.<ref name="first">R. Balan, P. Casazza, C. Heil, and Z. Landau, cvercompleteness, and localization of frames. I. theory, The Journal of Fourier Analysis and Applications, vol. 12, no. 2, 2006.</ref> Overcomplete [[Frame of a vector space|frames]] are widely used in mathematics, computer science, engineering, and statistics.
 
==Relation between overcompleteness and frames==
 
Overcompleteness is usually discussed as a property of overcomplete frames. The theory of frame originates in a paper by Duffin and Schaeffer on non-harmonic Fourier series.<ref>R. J. Duffin and A. C. Schaeffer, A class of nonharmonic fourier series, Transactions of the American Mathematical Society, vol. 72, no. 2, pp. 341{366, 1952. [Online]. Available: http://www.jstor.org/stable/1990760</ref> The frame is defined to be a set of non-zero vectors <math>\{\phi_i\}_{i\in J}</math> such that for an arbitrary <math>f\in\mathcal{H}</math>,
 
: <math>A\|f\|^2\leq\sum_{i\in J}|\langle f, \phi_i \rangle|^2\leq B\|f\|^2</math>
 
where <math>\langle\cdot,\cdot\rangle</math> denotes the inner product, <math>A</math> and <math>B</math> are positive constants called bounds of the frame. When <math>A</math> and <math>B</math> can be chosen such that <math>A=B</math>, the frame is called a tight frame.<ref>K. Grochenig, ''Foundations of time-frequency analysis''. Boston, MA: Birkhauser, 2000.</ref>
 
It can be seen that <math>\mathcal{H}=\operatorname{span}\{\phi_i\}</math>.
An example of frame can be given as follows.
Let each of <math>\{\alpha_i\}_{i=1}^{\infty}</math> and <math>\{\beta_i\}_{i=1}^{\infty}</math> be an orthonormal basis of <math>\mathcal{H}</math>, then
 
: <math>\{\phi_i\}_{i=1}^{\infty}=\{\alpha_i\}_{i=1}^{\infty}\cup\{\beta_i\}_{i=1}^{\infty} </math>
 
is a frame of <math>\mathcal{H}</math> with bounds <math>A=B=2</math>.
 
Let <math>S</math> be the frame operator,
 
: <math>Sf=\sum_{i\in J}\langle f, \phi_i \rangle\phi_i</math>
 
A frame that is not a Riesz basis, in which case it consists of a set of functions more than a basis, is said to be overcomplete. In this case, given <math>f\in\mathcal{H}</math>, it can have different decompositions based on the frame. The frame given in the example above is an overcomplete frame.
 
When frames are used for function estimation, one may want to compare the performance of different frames. The parsimony of the approximating functions by different frames may be considered as one way to compare their performances.<ref>[http://www.stat.duke.edu/~banks/218-lectures.dir/dmlect7.pdf], STA218, Data Mining Class Note at Duke University</ref>
 
Given a tolerance <math>\epsilon</math> and a frame <math>F=\{\phi_i\}_{i\in J}</math> in <math>L^2(\mathbb{R})</math>, for any function <math>f\in L^2(\mathbb{R})</math>, define the set of all approximating functions that satisfy <math>\|f-\hat{f}\|<\epsilon</math>
 
: <math>N(f,\epsilon)=\{\hat{f}: \hat{f}=\sum_{i=1}^{k}\beta_i\phi_i, \|f-\hat{f}\|<\epsilon\}</math>
 
Then let
 
: <math>k_{F}(f,\epsilon)=\inf\{k: \hat{f}\in N(f,\epsilon)\}</math>
 
<math>k(f,\epsilon)</math> indicates the parsimony of utilizing frame <math>F</math> to approximate <math>f</math>. Different <math>f</math> may have different <math>k</math> based on the hardness to be approximated with elements in the frame. The worst case to estimate a function in <math>L^2(\mathbb{R})</math> is defined as
 
: <math>k_F (\epsilon)=\sup_{f\in L^2(\mathbb{R})}\{k_{F}(f,\epsilon)\}</math>
 
For another frame <math>G</math>, if <math>k_{F}(\epsilon)<k_{G}(\epsilon)</math>, then frame <math>F</math> is better than frame <math>G</math> at level <math>\epsilon</math>. And if there exists a <math>\gamma</math> that for each <math>\epsilon<\gamma</math>, we have <math>k_{F}(\epsilon)<k_{G}(\epsilon)</math>, then <math>F</math> is better than <math>G</math> broadly.
 
Overcomplete frames are usually constructed in three ways.
# Combine a set of bases, such as wavelet basis and Fourier basis, to obtain an overcomplete frame.
# Enlarge the range of parameters in some frame, such as in Gabor frame and wavelet frame, to have an overcomplete frame.
# Add some other functions to an existing complete basis to achieve an overcomplete frame.
 
An example of an overcomplete frame is shown below. The collected data is in a two-dimensional space, and in this case a basis with two elements should be able to explain all the data. However, when noise is included in the data, a basis may not be able to express the properties of the data. If an overcomlete frame with four elements corresponding to the four axes in the figure is used to express the data, each point would be able to have a good expression by the overcomplete frame.
<gallery>
Image:OvercompleteframeGuoxian.jpg|An example of an overcomplete frame
</gallery>
The flexibility of the overcomplete frame is one of its key advantages when used in expressing a signal or approximating a function. However, because of this redundancy, a function can have multiple expressions under an overcomplete frame.<ref name="second">M. S. Lewicki and T. J. Sejnowski, Learning overcomplete representations, Neural Computation, vol. 12, no. 2, pp. 337{365, 2000.</ref> When the frame is finite, the decomposition can be expressed as
 
: <math>f=Ax \, </math>
 
where <math>f</math> is the function one wants to approximate, <math>A</math> is the matrix containing all the elements in the frame, and <math>x</math> is the coefficients of <math>f</math> under the representation of <math>A</math>. Without any other constraint, the frame will choose to give <math>x</math> with minimal norm in <math>L^2(\mathbb{R})</math>. Based on this, some other properties may also be considered when solving the equation, such as sparsity. So different researchers have been working on solving this equation by adding other constraints in the objective function. For example, a constraint minimizing <math>x</math>'s norm in <math>L^1(\mathbb{R})</math> may be used in solving this equation. This should be equivalent to the [[Least squares#Lasso method|Lasso]] regression in statistics community. Bayesian approach is also used to eliminate the redundancy in an overcompete frame. Lweicki and Sejnowski proposed an algorithm for overcomplete frame by viewing it as a probabilistic model of the observed data.<ref name="second" /> Recently, the overcomplete Gabor frame has been combined with bayesian variable selection method to achieve both small norm expansion coefficients in <math>L^2(\mathbb{R})</math> and sparsity in elements.<ref>P. Wolfe, S. Godsill, and W. Ng, Bayesian variable selection and regularization for time-frequency surface estimation, J. R. Statist. Soc. B, vol. 66, no. 3, 2004.</ref>
 
==Examples of overcomplete frames==
In modern analysis in signal processing and other engineering field, various overcomplete frames are proposed and used. Here two common used frames, Gabor frames and wavelet frames, are introduced and discussed.
 
===Gabor frames===
In usual Fourier transformation, the function in time domain is transformed to the frequency domain. However, the
transformation only shows the frequency property of this function and loses its information in the time domain. If a
window function <math>g</math>, which only has nonzero value in a small interval, is multiplied with the original
function before operating the Fourier transformation, both the information in time and frequency domains may remain
at the chosen interval. When a sequence of translation of <math>g</math> is used in the transformation, the
information of the function in time domain are kept after the transformation.
 
Let operators
 
: <math> T_a: L^2(R)\rightarrow L^2(R), (T_af)(x)=f(x-a)</math>
 
: <math> E_b: L^2(R)\rightarrow L^2(R), (E_bf)(x)=e^{2\pi ibx}f(x)</math>
 
: <math> D_c: L^2(R)\rightarrow L^2(R), (D_cf)(x)=\frac{1}{c^\frac{1}{2}}f(\frac{x}{c})</math>
 
A Gabor frame (also called Weyl-Heisenberg frame) in <math>L^2(R)</math> is defined as the form <math>\{E_{mb}T_
{na}g\}_{m,n\in Z}</math>, where <math>a,b>0</math> and <math>g\in L^2(R)</math> is a fixed function.<ref name="third">O. Christensen, An Introduction to Frames and Riesz Bases. Boston, MA: Birkhauser, 2003.</ref> However, not for every <math>a</math> and <math>b</math> <math>\{E_{mb}T_{na}g\}_{m,n\in Z}</math>
forms a frame on <math>L^2(R)</math>. For example, when <math>ab>1</math>, it is not a frame for <math>L^2(R)</math>. When <math>ab=1</math>, <math>\{E_{mb}T_{na}g\}_{m,n\in Z}</math> is possible to be a frame, in which case it is a Riesz basis. So the possible situation for <math>\{E_{mb}T_{na}g\}_{m,n\in Z}</math> being an overcomplete frame is <math>ab<1</math>.
The Gabor family <math>\{E_{mb/c}T_{nac}g_c\}_{m,n\in Z}</math> is also a frame and sharing the same frame bounds as <math>\{E_{mb}T_{na}g\}_{m,n\in Z}.\,</math>
 
Different kinds of window function <math>g</math> may be used in Gabor frame. Here examples of three window functions are shown, and the condition for the corresponding Gabor system being a frame is shown as
follows.
 
<gallery>
Image:WindowfunctionsGuoxian.jpg|Three window functions used in Gabor frame generation.
</gallery>
(1) <math>g(x)=e^{-x^2}</math>, <math>\{E_{mb}T_{na}g\}_{m,n\in Z}</math> is a frame when
<math>ab<0.994</math>
 
(2) <math> g(x)=\frac{1}{cosh(\pi x)}</math>, <math>\{E_{mb}T_{na}g\}_{m,n\in Z}</math> is a frame when
<math>ab<1</math>
 
(3) <math> g(x)=I_{[0,c)}(x)</math>, where <math>I(x)</math> is the indicator function. The situation for
<math>\{E_{mb}T_{na}g\}_{m,n\in Z}</math> to be a frame stands as follows.
 
1) <math>a>c</math> or <math>a>1</math>, not a frame
 
2) <math>c>1</math> and <math>a=1</math>, not a frame
 
3) <math>a\leq c\leq1</math>, is a frame
 
4) <math>a<1</math> and is an irrational, and <math>c\in(1,2)</math>, is a frame
 
5) <math>a=\frac{p}{q}<1</math>, <math>p</math> and <math>q</math> are relatively primes, <math>2-\frac{1}{q}
<c<2</math>, not a frame
 
6) <math>\frac{3}{4}<a<1</math> and <math>c=L-1+L(1-a)</math>, where <math>L\geq 3</math> and be a natural number,
not a frame
 
7) <math>a<1</math>, <math>c>1</math>, <math>|c-[c]-\frac{1}{2}|<\frac{1}{2}-a</math>, where <math>[c]</math> is the biggest integer not exceeding <math>c</math>, is a frame.
 
The above discussion is a summary of chapter 8 in.<ref name="third" />
 
===Wavelet frames===
 
A collection of wavelet usually refers to a set of functions based on <math>\psi</math>
 
: <math>\{2^\frac{j}{2}\psi(2^jx-k)\}_{j,k\in Z}</math>
 
This forms an orthonormal basis for <math>L^2(R)</math>. However, when <math>j,k</math> can take values in
<math>R</math>, the set represents an overcomplete frame and called undecimated wavelet basis. In general case, a
wavelet frame is defined as a frame for <math>L^2(R)</math> of the form
 
: <math>\{a^\frac{j}{2}\psi(a^jx-kb)\}_{j,k\in Z}</math>
 
where <math>a>1</math>, <math>b>0</math>, and <math>\psi\in L^2(R)</math>.
The upper and lower bound of this frame can be computed as follows.
Let <math>\hat{\psi}(\gamma)</math> be the Fourier transform for <math>\psi\in L^1(R)</math>
 
: <math>\hat{\psi}(\gamma)=\int_{R}\psi(x)e^{-2\pi ix\gamma}dx</math>
 
When <math>a,b</math> are fixed, define
 
: <math>G_0(\gamma)=\sum_{j\in Z} |\hat{\psi}(a^j\gamma)|^2</math>
 
: <math>G_1(\gamma)=\sum_{k\neq0}\sum_{j\in Z} |\hat{\psi}(a^j\gamma)\hat{\psi}(a^j\gamma+\frac{k}{b})|</math>
 
Then
 
: <math>B=\frac{1}{b}\sup_{|\gamma|\in[1,a]}(G_0(\gamma)+G_1(\gamma))<\infty</math>
 
: <math>A=\frac{1}{b}\inf_{|\gamma|\in[1,a]}(G_0(\gamma)-G_1(\gamma))>0</math>
 
Furthermore, when
 
: <math>\sum_{j\in Z}|\hat{\psi}(2^j\gamma)|^2=A</math>
 
: <math>\sum_{j=0}^\infty \hat{\psi}(2^j\gamma)\overline{\hat{\psi}(2^j(\gamma+q))}=0</math>, for all odd integers <math>q</math>
 
the generated frame <math>\{\psi_{j,k}\}_{j,k\in Z}</math> is a tight frame.
 
The discussion in this section is based on chapter 11 in.<ref name="third" />
 
==Applications==
Overcomplete Gabor frames and Wavelet frames have been used in various research area including signal detection, image representation, object recognition, noise reduction, sampling theory, operator theory, harmonic analysis, nonlinear sparse approximation, pseudodifferential operators, wireless communications, geophysics, quantum computing, and filter banks.<ref name="first" /><ref name="third" />
 
==References==
{{Reflist}}
 
[[Category:Linear algebra]]

Latest revision as of 16:01, 26 February 2013

My name is Jestine (34 years old) and my hobbies are Origami and Microscopy.

Here is my web site; http://Www.hostgator1centcoupon.info/ (support.file1.com)

A subset of a Banach space , sometimes called a "system", is complete if every element in can be approximated arbitrarily well in norm by finite linear combinations of elements in .[1] Such a complete system is overcomplete if removal of a from the system results in a complete system (i.e., is still complete). In different research, such as signal processing and function approximation, overcompleteness can help researchers to achieve a more stable, more robust, or more compact decomposition than using a basis.[2] Overcomplete frames are widely used in mathematics, computer science, engineering, and statistics.

Relation between overcompleteness and frames

Overcompleteness is usually discussed as a property of overcomplete frames. The theory of frame originates in a paper by Duffin and Schaeffer on non-harmonic Fourier series.[3] The frame is defined to be a set of non-zero vectors such that for an arbitrary ,

where denotes the inner product, and are positive constants called bounds of the frame. When and can be chosen such that , the frame is called a tight frame.[4]

It can be seen that . An example of frame can be given as follows. Let each of and be an orthonormal basis of , then

is a frame of with bounds .

Let be the frame operator,

A frame that is not a Riesz basis, in which case it consists of a set of functions more than a basis, is said to be overcomplete. In this case, given , it can have different decompositions based on the frame. The frame given in the example above is an overcomplete frame.

When frames are used for function estimation, one may want to compare the performance of different frames. The parsimony of the approximating functions by different frames may be considered as one way to compare their performances.[5]

Given a tolerance and a frame in , for any function , define the set of all approximating functions that satisfy

Then let

indicates the parsimony of utilizing frame to approximate . Different may have different based on the hardness to be approximated with elements in the frame. The worst case to estimate a function in is defined as

For another frame , if , then frame is better than frame at level . And if there exists a that for each , we have , then is better than broadly.

Overcomplete frames are usually constructed in three ways.

  1. Combine a set of bases, such as wavelet basis and Fourier basis, to obtain an overcomplete frame.
  2. Enlarge the range of parameters in some frame, such as in Gabor frame and wavelet frame, to have an overcomplete frame.
  3. Add some other functions to an existing complete basis to achieve an overcomplete frame.

An example of an overcomplete frame is shown below. The collected data is in a two-dimensional space, and in this case a basis with two elements should be able to explain all the data. However, when noise is included in the data, a basis may not be able to express the properties of the data. If an overcomlete frame with four elements corresponding to the four axes in the figure is used to express the data, each point would be able to have a good expression by the overcomplete frame.

The flexibility of the overcomplete frame is one of its key advantages when used in expressing a signal or approximating a function. However, because of this redundancy, a function can have multiple expressions under an overcomplete frame.[6] When the frame is finite, the decomposition can be expressed as

where is the function one wants to approximate, is the matrix containing all the elements in the frame, and is the coefficients of under the representation of . Without any other constraint, the frame will choose to give with minimal norm in . Based on this, some other properties may also be considered when solving the equation, such as sparsity. So different researchers have been working on solving this equation by adding other constraints in the objective function. For example, a constraint minimizing 's norm in may be used in solving this equation. This should be equivalent to the Lasso regression in statistics community. Bayesian approach is also used to eliminate the redundancy in an overcompete frame. Lweicki and Sejnowski proposed an algorithm for overcomplete frame by viewing it as a probabilistic model of the observed data.[6] Recently, the overcomplete Gabor frame has been combined with bayesian variable selection method to achieve both small norm expansion coefficients in and sparsity in elements.[7]

Examples of overcomplete frames

In modern analysis in signal processing and other engineering field, various overcomplete frames are proposed and used. Here two common used frames, Gabor frames and wavelet frames, are introduced and discussed.

Gabor frames

In usual Fourier transformation, the function in time domain is transformed to the frequency domain. However, the transformation only shows the frequency property of this function and loses its information in the time domain. If a window function , which only has nonzero value in a small interval, is multiplied with the original function before operating the Fourier transformation, both the information in time and frequency domains may remain at the chosen interval. When a sequence of translation of is used in the transformation, the information of the function in time domain are kept after the transformation.

Let operators

A Gabor frame (also called Weyl-Heisenberg frame) in is defined as the form , where and is a fixed function.[8] However, not for every and forms a frame on . For example, when , it is not a frame for . When , is possible to be a frame, in which case it is a Riesz basis. So the possible situation for being an overcomplete frame is . The Gabor family is also a frame and sharing the same frame bounds as

Different kinds of window function may be used in Gabor frame. Here examples of three window functions are shown, and the condition for the corresponding Gabor system being a frame is shown as follows.

(1) , is a frame when

(2) , is a frame when

(3) , where is the indicator function. The situation for to be a frame stands as follows.

1) or , not a frame

2) and , not a frame

3) , is a frame

4) and is an irrational, and , is a frame

5) , and are relatively primes, , not a frame

6) and , where and be a natural number, not a frame

7) , , , where is the biggest integer not exceeding , is a frame.

The above discussion is a summary of chapter 8 in.[8]

Wavelet frames

A collection of wavelet usually refers to a set of functions based on

This forms an orthonormal basis for . However, when can take values in , the set represents an overcomplete frame and called undecimated wavelet basis. In general case, a wavelet frame is defined as a frame for of the form

where , , and . The upper and lower bound of this frame can be computed as follows. Let be the Fourier transform for

When are fixed, define

Then

Furthermore, when

, for all odd integers

the generated frame is a tight frame.

The discussion in this section is based on chapter 11 in.[8]

Applications

Overcomplete Gabor frames and Wavelet frames have been used in various research area including signal detection, image representation, object recognition, noise reduction, sampling theory, operator theory, harmonic analysis, nonlinear sparse approximation, pseudodifferential operators, wireless communications, geophysics, quantum computing, and filter banks.[2][8]

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

  1. C. Heil, A Basis Theory Primer: Expanded Edition. Boston, MA: Birkhauser, 2010.
  2. 2.0 2.1 R. Balan, P. Casazza, C. Heil, and Z. Landau, cvercompleteness, and localization of frames. I. theory, The Journal of Fourier Analysis and Applications, vol. 12, no. 2, 2006.
  3. R. J. Duffin and A. C. Schaeffer, A class of nonharmonic fourier series, Transactions of the American Mathematical Society, vol. 72, no. 2, pp. 341{366, 1952. [Online]. Available: http://www.jstor.org/stable/1990760
  4. K. Grochenig, Foundations of time-frequency analysis. Boston, MA: Birkhauser, 2000.
  5. [1], STA218, Data Mining Class Note at Duke University
  6. 6.0 6.1 M. S. Lewicki and T. J. Sejnowski, Learning overcomplete representations, Neural Computation, vol. 12, no. 2, pp. 337{365, 2000.
  7. P. Wolfe, S. Godsill, and W. Ng, Bayesian variable selection and regularization for time-frequency surface estimation, J. R. Statist. Soc. B, vol. 66, no. 3, 2004.
  8. 8.0 8.1 8.2 8.3 O. Christensen, An Introduction to Frames and Riesz Bases. Boston, MA: Birkhauser, 2003.