8 Bit Plane Slicing of an image in Image Processing

-



%================ Bit Plane Slicing Program =================%

A=imread('bit_plane_img.tif');
subplot(3,3,1),imshow(A),title('INPUT IMAGE');
for i=1:8
    B=bitplaneslicing(A,i);
    subplot(3,3,i+1),imshow(B),title(i);
end
%====================================================%


%================ Bit Plane Slicing Function =================%
function [ B ] = bitplaneslicing( A ,n)
% function for n bit plane slicing where n<=8
[M,N]=size(A);
B=zeros(M,N);
for i = 1:M
    for j = 1:N
        str=dec2bin(A(i,j),8);
        if strcmp(str(9-n),'0')
            B(i,j)=0;
        else
            B(i,j)=2^(n-1);
        end
    end
end
end
%====================================================%

Input Image: bit_plane_img.tif


Output Image:




Popular posts from this blog

Code to upload multiple files simultaneously using JSP, Servlet .

-
Image
Step 1 : Create a jsp page. index.jsp <%--      Document   : index     Created on : 21 Sep, 2013, 5:58:32 PM     Author     : snlkjha --%> <%@page contentType="text/html" pageEncoding="UTF-8"%> <!DOCTYPE html> <html>     <head>         <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">         <title>JSP Page</title>     </head>     <body>         <form action="UploadServlet" method="post" enctype="multipart/form-data">             <input type="file" id="file" name="file1" accept="image/*"  multiple="muliple" required/><br>             <input type="submit"/>            <br><br> ${requestScope.message} ...
Read more

STRING PALINDROME USING STACK AND QUEUE

-
#include<stdio.h> #include<stdlib.h> #include<string.h> void push(char ); char pop(); void nq(char ); char dq(); typedef struct list {     char data;     struct list *next; }node; node *top=NULL,*front=NULL,*rear=NULL; int main() {     char word[20];     printf("Type the Word:");     scanf("%s",word);     int length=strlen(word),i=0;     while(word[i]!='\0')     {         push(word[i]);         nq(word[i]);         i++;     }     for(i=0;i<length;i++)     {         if(pop()!=dq())         break;             }     if(i==length)        ...
Read more