0.3 Approximation and processing in bases  (Page 3/5)

 Page 3 / 5

Nonlinear approximations operate in two stages. First, a linear operator approximates the analog signal $\phantom{\rule{0.166667em}{0ex}}\overline{f}$ with N samples written $\phantom{\rule{0.166667em}{0ex}}f\left[n\right]=\phantom{\rule{0.166667em}{0ex}}\overline{f}☆{\overline{\phi }}_{s}\left(ns\right)$ . Then, a nonlinear approximation of $\phantom{\rule{0.166667em}{0ex}}f\left[n\right]$ is computed to reduce the N coefficients $\phantom{\rule{0.166667em}{0ex}}f\left[n\right]$ to $M\ll N$ coefficients in a sparse representation.

The discrete signal $\phantom{\rule{0.166667em}{0ex}}f$ can be considered as a vector of ${\mathbb{C}}^{N}$ . Inner products and norms in ${\mathbb{C}}^{N}$ are written

$⟨\phantom{\rule{0.166667em}{0ex}}f,g⟩=\sum _{n=0}^{N-1}f\left[n\right]\phantom{\rule{0.166667em}{0ex}}{g}^{*}{\left[n\right]\phantom{\rule{1.em}{0ex}}\text{and}\phantom{\rule{1.em}{0ex}}\parallel \phantom{\rule{0.166667em}{0ex}}f\parallel }^{2}=\sum _{n=0}^{N-1}{|\phantom{\rule{0.166667em}{0ex}}f\left[n\right]|}^{2}.$

To obtain a sparse representation with a nonlinear approximation, we choose a new orthonormal basis $\mathcal{B}={\left\{{g}_{m}\left[n\right]\right\}}_{m\in \Gamma }$ of ${\mathbb{C}}^{N}$ , which concentrates the signal energy as much as possibleover few coefficients. Signal coefficients ${\left\{⟨\phantom{\rule{0.166667em}{0ex}}f,{g}_{m}⟩\right\}}_{m\in \Gamma }$ are computed from the N input sample values $\phantom{\rule{0.166667em}{0ex}}f\left[n\right]$ with an orthogonal change of basis that takes N 2 operations in nonstructured bases. In a wavelet or Fourier bases, fastalgorithms require, respectively, $O\left(N\right)$ and $O\left(N{log}_{2}N\right)$ operations.

Approximation by thresholding

For $M , an approximation $\phantom{\rule{0.166667em}{0ex}}{f}_{M}$ is computed by selecting the “best” $M vectors within $\mathcal{B}$ . The orthogonal projectionof $\phantom{\rule{0.166667em}{0ex}}f$ on the space V λ generated by M vectors ${\left\{{g}_{m}\right\}}_{m\in \Lambda }$ in $\mathcal{B}$ is

$\begin{array}{c}\hfill {f}_{\lambda }=\sum _{m\in \lambda }⟨\phantom{\rule{0.166667em}{0ex}}f\phantom{\rule{-0.5pt}{0ex}},{g}_{m}⟩\phantom{\rule{0.166667em}{0ex}}{g}_{m}.\end{array}$

Since $\phantom{\rule{0.166667em}{0ex}}f={\sum }_{m\in \gamma }⟨\phantom{\rule{0.166667em}{0ex}}f,{g}_{m}⟩\phantom{\rule{0.166667em}{0ex}}{g}_{m}$ , the resulting error is

$\begin{array}{c}\hfill \parallel \phantom{\rule{0.166667em}{0ex}}f-{f}_{\lambda }{\parallel }^{2}=\sum _{m\in \phantom{\rule{-0.166667em}{0ex}}\phantom{\rule{-0.166667em}{0ex}}\phantom{\rule{-0.166667em}{0ex}}/\lambda }{|⟨\phantom{\rule{0.166667em}{0ex}}f,{g}_{m}⟩|}^{2}.\end{array}$

We write $|\lambda |$ the size of the set λ . The best $M=|\lambda |$ term approximation, which minimizes $\parallel \phantom{\rule{0.166667em}{0ex}}f-{f}_{\lambda }{\parallel }^{2}$ ,  is thus obtained by selecting the M coefficients of largest amplitude. These coefficients are above a threshold T that depends on M :

$\begin{array}{c}\hfill {f}_{M}\phantom{\rule{0.222222em}{0ex}}=\phantom{\rule{0.222222em}{0ex}}{f}_{{\lambda }_{T}}=\sum _{m\in {\lambda }_{T}}⟨\phantom{\rule{0.166667em}{0ex}}f,{g}_{m}⟩\phantom{\rule{0.166667em}{0ex}}{g}_{m}\phantom{\rule{1.em}{0ex}}\text{with}\phantom{\rule{1.em}{0ex}}{\lambda }_{T}=\left\{m\in \gamma \phantom{\rule{3.33333pt}{0ex}}:\phantom{\rule{3.33333pt}{0ex}}|⟨\phantom{\rule{0.166667em}{0ex}}f,{g}_{m}⟩|\ge T\right\}.\end{array}$

This approximation is nonlinear because the approximation set λ T changes with $\phantom{\rule{0.166667em}{0ex}}f$ . The resulting approximation error is:

$\begin{array}{c}\hfill {ϵ}_{n}\left(M,f\right)=\parallel \phantom{\rule{0.166667em}{0ex}}f-{f}_{M}{\parallel }^{2}=\sum _{m\in \phantom{\rule{-0.166667em}{0ex}}\phantom{\rule{-0.166667em}{0ex}}\phantom{\rule{-0.166667em}{0ex}}/{\Lambda }_{T}}{|⟨\phantom{\rule{0.166667em}{0ex}}f,{g}_{m}⟩|}^{2}.\end{array}$

[link] (b) shows that the approximation support λ T of an image in a wavelet orthonormal basis depends on the geometry of edges and textures.Keeping large wavelet coefficients is equivalent to constructing an adaptiveapproximation grid specified by the scale–space support λ T . It increases the approximation resolutionwhere the signal is irregular. The geometry of λ T gives the spatial distribution of sharp image transitions and edges, and their propagation across scales.Chapter 6 proves that wavelet coefficients give important information about singularities and local Lipschitz regularity.This example illustrates how approximation support provides “geometric”information on $\phantom{\rule{0.166667em}{0ex}}f$ , relative to a dictionary, that is a wavelet basis in this example.

[link] (d) gives the nonlinear wavelet approximation $\phantom{\rule{0.166667em}{0ex}}{f}_{M}$ recovered from the $M=N/16$ large-amplitude wavelet coefficients, with an error $\parallel \phantom{\rule{0.166667em}{0ex}}f-{f}_{M}{\parallel }^{2}/{\parallel \phantom{\rule{0.166667em}{0ex}}f\parallel }^{2}=5\phantom{\rule{0.45pt}{0ex}}×{10}^{-3}$ . This error is nearly three times smaller thanthe linear approximation error obtained with the same number of wavelet coefficients, and the imagequality is much better.

An analog signal can be recovered from the discrete nonlinear approxima-tion  $\phantom{\rule{0.166667em}{0ex}}{f}_{M}$ :

${\overline{f}}_{M}\left(x\right)=\sum _{n=0}^{N-1}{f}_{M}\left[n\right]\phantom{\rule{0.166667em}{0ex}}{\phi }_{s}\left(x-ns\right).$

Since all projections are orthogonal, the overall approximationerror on the original analog signal $\phantom{\rule{0.166667em}{0ex}}\overline{f}\left(x\right)$ is the sum of the analog sampling error and the discrete nonlinear error:

$\parallel \phantom{\rule{0.166667em}{0ex}}\overline{f}-\phantom{\rule{0.166667em}{0ex}}{\overline{f}}_{M}{\parallel }^{2}=\parallel \phantom{\rule{0.166667em}{0ex}}\overline{f}-\phantom{\rule{0.166667em}{0ex}}{\overline{f}}_{N}{\parallel }^{2}+{\parallel \phantom{\rule{0.166667em}{0ex}}f-\phantom{\rule{0.166667em}{0ex}}{f}_{M}\parallel }^{2}={ϵ}_{l}\left(N,f\right)+{ϵ}_{n}\left(M,f\right).$

In practice, N is imposed by the resolution of the signal-acquisition hardware, and M is typically adjusted so that ${ϵ}_{n}\left(M,f\right)\phantom{\rule{0.222222em}{0ex}}\ge \phantom{\rule{0.222222em}{0ex}}{ϵ}_{l}\left(N,f\right)$ .

what is Nano technology ?
write examples of Nano molecule?
Bob
The nanotechnology is as new science, to scale nanometric
brayan
nanotechnology is the study, desing, synthesis, manipulation and application of materials and functional systems through control of matter at nanoscale
Damian
Is there any normative that regulates the use of silver nanoparticles?
what king of growth are you checking .?
Renato
What fields keep nano created devices from performing or assimulating ? Magnetic fields ? Are do they assimilate ?
why we need to study biomolecules, molecular biology in nanotechnology?
?
Kyle
yes I'm doing my masters in nanotechnology, we are being studying all these domains as well..
why?
what school?
Kyle
biomolecules are e building blocks of every organics and inorganic materials.
Joe
anyone know any internet site where one can find nanotechnology papers?
research.net
kanaga
sciencedirect big data base
Ernesto
Introduction about quantum dots in nanotechnology
what does nano mean?
nano basically means 10^(-9). nanometer is a unit to measure length.
Bharti
do you think it's worthwhile in the long term to study the effects and possibilities of nanotechnology on viral treatment?
absolutely yes
Daniel
how to know photocatalytic properties of tio2 nanoparticles...what to do now
it is a goid question and i want to know the answer as well
Maciej
characteristics of micro business
Abigail
for teaching engĺish at school how nano technology help us
Anassong
Do somebody tell me a best nano engineering book for beginners?
there is no specific books for beginners but there is book called principle of nanotechnology
NANO
what is fullerene does it is used to make bukky balls
are you nano engineer ?
s.
fullerene is a bucky ball aka Carbon 60 molecule. It was name by the architect Fuller. He design the geodesic dome. it resembles a soccer ball.
Tarell
what is the actual application of fullerenes nowadays?
Damian
That is a great question Damian. best way to answer that question is to Google it. there are hundreds of applications for buck minister fullerenes, from medical to aerospace. you can also find plenty of research papers that will give you great detail on the potential applications of fullerenes.
Tarell
what is the Synthesis, properties,and applications of carbon nano chemistry
Mostly, they use nano carbon for electronics and for materials to be strengthened.
Virgil
is Bucky paper clear?
CYNTHIA
carbon nanotubes has various application in fuel cells membrane, current research on cancer drug,and in electronics MEMS and NEMS etc
NANO
so some one know about replacing silicon atom with phosphorous in semiconductors device?
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Harper
Do you know which machine is used to that process?
s.
how to fabricate graphene ink ?
for screen printed electrodes ?
SUYASH
What is lattice structure?
of graphene you mean?
Ebrahim
or in general
Ebrahim
in general
s.
Graphene has a hexagonal structure
tahir
On having this app for quite a bit time, Haven't realised there's a chat room in it.
Cied
Got questions? Join the online conversation and get instant answers! By       By  