# 9.1 A class of fast algorithms for total variation image restoration  (Page 6/6)

 Page 6 / 6

We tested several kinds of blurring kernels including Gaussian, average and motion. The additive noise is Gaussian for TV/L ${}^{2}$ problems and impulsive for TV/L ${}^{1}$ problem. The quality of image is measured by the signal-to-noise ratio (SNR) defined by

$\text{SNR}\triangleq 10*{log}_{10}\frac{\parallel \overline{u}-E\left(\overline{u}\right){\parallel }^{2}}{\parallel \overline{u}{-u\parallel }^{2}},$

where $\overline{u}$ is the original image and $E\left(\overline{u}\right)$ is the mean intensity value of $\overline{u}$ . All blurring effects were generated using the MATLAB function“imfilter " with periodic boundaryconditions, and noise was added using“imnoise ". All theexperiments were finished under Windows Vista Premium and MATLAB v7.6 (R2008a) running on a Lenovo laptop with an Intel Core 2 DuoCPU at 2 GHz and 2 GB of memory.

## Practical implementation

Generally, the quality of the restored image is expected to increase as $\beta$ increases because the approximation problems become closer to the original ones. However, the alternating algorithmsconverge slowly when $\beta$ is large, which is well-known for the class of penalty methods. An effective remedy is to graduallyincrease $\beta$ from a small value to a pre-specified one. compares the different convergence behaviors of the proposed algorithm when with and without continuation, where weused Gaussian blur of size 11 and standard deviation 5 and added white Gaussian noise with mean zero and standard deviation ${10}^{-3}$ .

In this continuation framework, we compute a solution of an approximation problem which used a smaller beta, and use thesolution to warm-start the next approximation problem corresponding to a bigger $\beta$ . As can be seen from , with continuation on $\beta$ the convergence is greatly sped up. In our experiments, we implemented the alternating minimizationalgorithms with continuation on $\beta$ , which we call the resulting algorithm“Fast Total Variation de-convolution”or FTVd, which, for TV/L ${}^{2}$ , the framework is given below.

[FTVd]:

• Input $f$ , $K$ and $\mu >0$ . Given ${\beta }_{max}>{\beta }_{0}>0$ .
• Initialize $u=f$ , ${u}_{p}=0$ , $\beta ={\beta }_{0}$ and $ϵ>0$ .
• While $\beta \le {\beta }_{max}$ , Do
• Run Algorithm "Basic Algorithm" until an optimality condition is met.
• $\beta ←2*\beta$ .
• End Do

Generally, it is difficult to determine how large $\beta$ is sufficient to generate a solution that is close to be a solution ofthe original problems. In practice, we observed that the SNR values of recovered images from the approximation problems are stabilizedonce $\beta$ reached a reasonably large value. To see this, we plot the SNR values of restored images corresponding to $\beta ={2}^{0},{2}^{1},\cdots ,{2}^{18}$ in . In this experiment, we used the same blur and noise as we used in the testing ofcontinuation. As can be seen from , the SNR values on both images essentially remain constant for $\beta \ge {2}^{7}$ . This suggests that $\beta$ need not to be excessively large from a practical point of view. In our experiments, we set ${\beta }_{0}=1$ and ${\beta }_{max}={2}^{7}$ in Algorithm  "Practical Implementation" . For each $\beta$ , the inner iteration was stopped once an optimality condition is satisfied. For TV/L ${}^{1}$ problems, we also implement continuation on $\gamma$ , and used similar settings as used in TV/L ${}^{2}$ .

## Recovered results

In this subsection, we present results recovered from TV/L ${}^{2}$ and TV/L ${}^{1}$ problems including ( ), ( ) and their multichannel extensions. We tested various of blurs with differentlevels of Gaussian noise and impulsive noise. Here we merely present serval test results. gives two examples of blurry and noisy images and the recovered ones, where the blurredimages are corrupted by Gaussian noise, while gives the recovered results where the blurred images are corrupted by random-valued noise. For TV/L ${}^{1}$ problems, we set $\gamma ={2}^{15}$ and $\beta ={2}^{10}$ in the approximation model and implemented continuation on both $\beta$ and $\gamma$ .

## Concluding remarks

We proposed, analyzed and tested an alternating algorithm FTVd which for solving the TV/ ${L}^{2}$ problem. This algorithm was extended to solve the TV/ ${L}^{1}$ model and their multichannel extensions by incorporating an extension of TV. Cross-channel blurs are permittedwhen the underlying image has more than one channels. We established strong convergence results for the algorithms and validated a continuationscheme. Numerical results are given to demonstrate the feasibility and efficiency of the proposed algorithms.

## Acknowledgements

This Connexions module describes work conducted as part of Rice University's VIGRE program, supported by National Science Foundation grant DMS-0739420.

#### Questions & Answers

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
what is biological synthesis of nanoparticles
what's the easiest and fastest way to the synthesize AgNP?
China
Cied
how did you get the value of 2000N.What calculations are needed to arrive at it
Privacy Information Security Software Version 1.1a
Good
Berger describes sociologists as concerned with
Got questions? Join the online conversation and get instant answers!