HOPE-Highly Optimistic People Evolve!

HOPE is required to grow in ones life. You all dream of joining the best companies in your life. How many of you work to achieve it?

Most of the MNCs are in a single click. The companies that were covered in it are Amazon; Continental Hospital; Cyent; Cognizent; Capgemini; CA; Hyaat; Karvy and Andhrabank.

Being Positive!

Everyone starts their day with a plan, ultimately something else will occur. Yet we need to think with open minded and proceed in life.

#quotes #rain #sky #sunset #font #mganeshsai #brand #atmosphere #passion #positivity

ModeShift Sorting Technique Code In Matlab With Best Result- M. Ganesh Sai

ganesh_NF_1_5_9_u-sorttic
clc;
a=imread(‘lena_gray.tif’);
imshow(a)
nf=.9;
ws=9;
b=imnoise(a,’salt & pepper’,nf);
figure,imshow(b)
[m1 n1]=size(a);
r=floor(ws/2);
b1=zeros(m1+ws-1);
b1=uint8(b1);
[m n]=size(b1);
b1(r+1:m-r,r+1:n-r)=b;
for i=r+1:m-r
for j=r+1:n-r
t1=b1(i-r:i+r,j-r:j+r);
t2=sort(t1,1);
t2=sort(t2,2);
t2=t2′;
t2=t2(:);
t2=t2′;
le=length(t2);
len=ceil(le/2);
if (0<t1(r+1,r+1)&&t1(r+1,r+1)<255)
else
if t1(r+1,r+1)==255
for i1=len:-1:1
if (0<t2(i1)&&t2(i1)<255)
b1(i,j)=t2(i1);
break;
end
if (i1==1)
b1(i,j)=t2(len);
end
end
elseif t1(r+1,r+1)==0
for i1=len:le
if (0<t2(i1)&&t2(i1)<255)
b1(i,j)=t2(i1);
break;
end
if (i1==le)
b1(i,j)=t2(len);
end
end
end
end
end
end
b2=b1(r+1:m-r,r+1:n-r);
figure,imshow(b2)
toc

Merge Sort Code in 2-D Image Processing – M. Ganesh Sai

tic
clc
clear all
close all
a=imread(‘cameraman.tif’);
imshow(a)
nf=.1;
ws=3;
b=imnoise(a,’salt & pepper’,nf);
figure,imshow(b)
[m1 n1]=size(a);
r=floor(ws/2);
b1=128*ones(m1+ws-1);
b1=uint8(b1);
[m n]=size(b1);
b1(r+1:m-r,r+1:n-r)=b;
for i=r+1:m-r
for j=r+1:n-r
t1=b1(i-r:i+r,j-r:j+r);
t1=t1(:);
t1=t1′;
merged=mergeSort1(t1);
pmin=merged(1);
pmax=merged(end);
pmed=merged(ceil(length(t1)/2));
if pmin<b1(i,j)<pmax&&pmin>0&&pmax<255
b1(i,j)=b1(i,j);
end
if pmin<pmed<pmax || (0<pmed && pmed<255)
b1(i,j)=pmed;
end
if pmed==0 || pmed==255
pmed=b1(i,j-1);
end
if b1(i,j)==0 || b1(i,j)==255
b1(i,j)=b1(i,j-1);
end
end
end
b2=b1(r+1:m-r,r+1:n-r);
figure,imshow(b2)
[psnr,mse]=psnr_mse_maxerr(a,b2);
display(psnr);
toc

cameraman_NF_2_4_8_U-sort

Insertion Sort Code in Matlab 2-D

clc, clear, close all;
tic
a=imread(‘lena_gray.tif’); imshow(a);
nf=.5;
ws=3;

b=imnoise(a,’salt & pepper’,nf);
figure,imshow(b);

[m1 n1]=size(a);
ll=floor(ws/2);
y=zeros(m1+ws-1); % b1 is zero matrix of 514*514
y=uint8(y); % b1 is a unsign 8 bit
[m n]=size(y); % Size of b1 matrix is 514*514
y(ll+1:m-ll,ll+1:n-ll)=b; % b1(2:513,2:513)

for i = 2:m1-1
for j = 2:n1-1
flg = 0;
n = size(b);
for l = 2:n;
key = y(l);
k = l-1;
while(k>0 && y(k)>key)
y(k+1) = y(k);
k = k-1;
y(k+1)=key;
end
end
if y(i,j) == 0 || y(i,j) == 255
flg = 1;
end
if flg == 0
if S(1) < y(i,j) && y(i,j) < S(5) && 0 < S(1) && S(9) < 255
y(i,j) = y(i,j);
end
else
if S(1) < S(5) && S(5) < S(9) && 0 < S(5) && S(5) < 255
y(i,j) = S(5);
end
if S(1) >= S(5) || S(5) >= S(9) || S(5) == 255 && S(5) == 0
y(i,j) = y(i,j-1);
end
end
end
end
y(1,:) = y(2,:);
y(R,:) = y(R-1,:);
y(:,1) = y(:,2);
y(:,C) = y(:,C-1);
b2=b1(ll+1:m-ll,ll+1:n-ll);
figure,imshow(b2);
toc

Pirate

Column Sorting Code with Best Result in Matlab(2-D)

clc, clear, close all;
tic

a=imread(‘cameraman.tif’); imshow(a);
nf=.5;
ws=3;
ll=floor(ws/2);

b=imnoise(a,’salt & pepper’,nf); % Generation of noisey input to algorithm
figure,imshow(b);

[m1 n1]=size(a);
b1=zeros(m1+ws-1);
b1=uint8(b1);
[m n]=size(b1);
b1(ll+1:m-ll,ll+1:n-ll)=b;
for i = 2:m-1
for j = 2:n-1
if(b1(i,j)<=0||b1(i,j)>=255)
y=b1(i-ll:i+ll,j-ll:j+ll);
p = sort(y(:,1:1));
q = sort(y(:,2:2));
r = sort(y(:,3:3));
b = [p,q,r];
S = sort(b(:));
flg = 1;
if S(1) < b1(i,j) && b1(i,j) < S(5) && 0 < S(1) && S(9) < 255
b1(i,j) = y(i,j);

else
b1(i,j) = S(5);
end
end
end
end

b2=b1(ll+1:m-ll,ll+1:n-ll);
figure,imshow(b2)
[psnr,mse]=psnr_mse_maxerr(a,b2);
display(psnr)
display(mse)
toc

cameraman_NF_2_4_8_U-sort

Learn To Share And Grow