ProjectsGeek

Download Mini projects with Source Code, Java projects with Source Codes

ProjectsGeek

Coloured Image , Copyright Protection

by Leave a Comment

Final Year PROJECT SYNOPSIS
 
“COPYRIGHT PROTECTION OF COLORED IMAGES USING DIGITAL WATERMARKING” 

ABSTRACT 

 

      Research in digital data hiding was first triggered by its potential use for copyright protection of multimedia data exchanged in digital form. In this kind of application, usually termed digital watermarking, a code conveying some important information about the legal data owner, or the allowed users of data, is hidden within the data itself, instead of being attached to the data as a header or a separate file. The need to carefully hide the information within the host data is explained by the desire not to degrade the quality of the host signal, and by the assumption that it is more difficult to remove the information needed for copyright protection without knowing exactly where it is hidden.
      In our project we are specifically dealing with the digital colored images as this field has not been explored much and till date most of the work done is concerned with the gray images.
      Thus we can conclude that the study of digital watermarking and this project are going to produce many fruitful results in the very near future for the human race in the field of science and technology which will be used for security purposes which is every body’s need in today’s world.
Group Members:-
·     xyz
SYNOPSIS 

 

Project Statement:- 

 

     We are implementing Watermarking Technique for Copyright Protection of colored images. In this we will be embedding a copyright message in the image which will check the authenticity of the legal owner.
Sponsored By:- 

 

          Network Security Solutions (India) Ltd. 

 

Technology:- 

 

     In this project we are using “C” language for the coding on linux platform .The format of the image being used is PPM format.
      We will also be using the concepts of DSF (trees) for storing the sub bands. We will be using some tools such as NetPBM library for various functions like converting jpeg format to PPM format etc.
Brief Project Desctiption:- 

 

      In our project we are using Discrete Wavelet Transform (DWT) technique for embedding and extraction of the watermark.DWT is the most recent technique which has many advantages over the previous techniques like DCT , DFT etc. 

The various stages of the technique are as follows:-
1.      Signature Generation: The mark is a sequence of pseudo random numbers     

 

            which are generated using a seed which in turn is calculated on the basis of the   
            textual message to be embedded. 

 

2.      Decomposition: The host image is decomposed to obtain a multi-resolution
      approximation image using three level DWT.
3.      Coefficient Selection: The coefficients of LL sub band are selected.
4.      Embedding: The watermark is embedded in the approximation image(LL sub
            band ) using the additive embedding  formula:
         F`(i,j) = Fmean + ( F(i,j) – Fmean ) * ( 1 + α * wi ) 

 

       Where,
                  Fmean  is the average value of all the coefficients.
                  α  is weighting factor.
                  wi is the watermark.
5.      Extraction: The blind watermark extraction is used which does not need the              

 

            original image. 

 

Platform:- 

      Linux Operating systems.
Software & Hardware requirements :- 

      This project has the following s/w requirements:-
                                   *  Compiler for ‘C & C++’
                                   *  NetPBM package.
      This project has the following h/w requirements:-
                              *  Multimedia PC configuration
Name of the College: 

 

Group Members:-
Project guide: 

 

     (CTO Network Security Solutions (India) Ltd) 

 

      Email       :   
Contacts: 

 

      Email       :  
      Phone       :  

 

 

DOWNLOAD SYNOPSIS

Other Projects to Try:

  1. Covert Communication , Diigtal Images
  2. Final year engineering projects Ideas for CSE
  3. Final Year Project-Multicast DNS Resolver project
  4. Network Based Image Retrieval System Project
  5. Chroma Based Image Retrival System Project

Chroma Based Image Retrival System Project

by Leave a Comment

Chroma Based Image Retrival System Project PROJECT SYNOPSIS

 
 
 

Project Definition

Chroma based Image Retrieval System that uses wavelet technology for feature extraction.

Technology

        We have implemented the search engine using Turbo C and the GUI implementation is done using MS Visual Basic. The two are interfaced on the supporting platform of Windows.
 

Brief DESCRIPTION  

In the past decade, with the rapid increase in the volume of multimedia (Image) data, the demand of efficient and fast retrieval methods has increased tremendously.
Traditionally, Text Annotations, like file name, caption, keywords etc. have been used to describe the contents of the images. The common example of this is the Google Image Engine that uses the text annotations for searching. But the use of annotations becomes cumbersome and inadequate to represent the image contents.
Hence, we look forward to represent images in terms of coefficients in transform domain. The wavelet based transforms are best suited for the given problem domain because of the advanced features of wavelets like better multiple resolution for analyzing different frequency components.
For applying the wavelet transform, the wavelet analysis algorithm used in this project is Haar wavelet transform for calculation of the feature vectors of the images. Feature vectors or the Signature Vectors hence calculated (taking the chroma/color content of image as the feature for representation) are stored in a database.
 Now for an efficient and fast similarity searching in sequence database of large number of images, we make use of clustering technique i.e. K-Means algorithm is applied which divides the entire database into distinct clusters on the basis of cluster centroids. While doing so, the main aim is to retrieve all relevant images at the same minimizing irrelevant images during pruning. Applying Clustering techniques simply improves the search time (which linearly depends on the number of similar images) by uniformly distributing the images among various clusters.
 

PLATFORM USED

    • Windows XP

SOFTWARE AND HARDWARE REQUIREMENTS

ThiS project has the following software requirements:-
  • Borland C++ Compiler
  • MS Visual Studio Package
  • Large memory model
 
This project has the following hardware requirements:-
  • Multimedia PC configuration
  • Other conventional resources
 

DOWNLOAD SYNOPSIS

 

Other Projects to Try:

  1. Context Based Search Engine Final Year Project
  2. Network Based Image Retrieval System Project
  3. Education Based System Project using Java
  4. Covert Communication , Diigtal Images
  5. Coloured Image , Copyright Protection

Bug Tracking System

by 1 Comment

Final Year PROJECT SYNOPSIS
BUG TRACKING SYSTEM
Project definition:
A holistic bug tracking system which enables reporting and follows up with solution of any bug found in development of any software project of an organization.
Brief Description:
The system is implemented using client server architecture.
A multithreaded server servicing multiple clients and their requests.
Bug Tracking System 1
The clients send bug/failure reports to the server where they are entered into a bug database. A solution is found for the bug by consulting the database.If it is a bug that has been encountered before, its solution is directly obtained from the database else its solution is derived manually. Necessary action is then taken and change reports are generated. These change reports are then forwarded to all concerned parties.
In addition, add ons like support for mobile devices and a business intelligence plugin may be incorporated at a later stage.
The clients send data to server in the form of XML files which are parsed at server end.
There are two streams –message stream and data stream, used between client(s) and server. Message queues are used to buffer messages and allow the server to service multiple clients simultaneously.
SERVER :
The server provides basic client registration and communication which is both transparent as well as dynamic. Each client registration request paves the way for a new POSIX thread in the server process to service the client. A shared data list of all the clients holding information of each and every registered client is shared among the threads which necessitates the Reader Writer synchronization through POSIX Reader Writer Locks. The server is developed in C.
Client :
The client is a dual threaded application –The first one runs in the background receiving all the responses from the server. The second one runs in the front, interacting with the user, receiving his requests, processing them and shows the results. All the registered clients may communicate freely and transparently with other clients without knowing the whereabouts of other registered clients via the server.
No synchronization is required. The client is very light, so the server takes care of all the transparency, communication, synchronization and error handling. There is no software limitation to the no of clients, limited only by server resources and maximum limit of TCP ports in the TCP/IP family i.e. 216  ports. The client is developed in Java Swing
NETWORKING IN LINUX:
LINUX provides a nimble solution for networking enabling a software concept known as sockets. The use of sockets obviates the need of low network details such as drivers and hardware instructions. Our project uses TCP/IP family stream sockets for the purpose of communication.
              
INTERPROCESS COMMUNICATION IN LINUX:
LINUX provides a simple yet powerful means of IPC. It can be implemented easily by means of message queue and shared memory. We prefer using message queue as it is properly structured and doesn’t need explicit synchronization as in case of others eg pipes
INTERTHREAD COMMUNICATION:
No doubt threads can empower the processing both in efficiency as well as effectiveness but it has many synchronization problems such as :
Sharing of globals –The global variables are accessible variable can only be used in synchronization.
Sharing of buffers – A process has a single set of various buffers (standard descriptors) allotted by the kernel which may not be sufficient for catering to the needs of all the threads.
SYNCHRONISATION:
LINUX provides an elegant solution to the synchronization problems discussed above. For example, mutexes and semaphores provide easy and effective synchronization.
 
Software/Tool Requirements:
Linux OS
Sun JAVA Kit
Sun Studio
Anjuta Debugger
TCP/IP Networking Support in Linux based systems
POSIX & System V system call interface in Linux
Any java compatible web browser (eg Netscape)
Hardware Requirements:
Two 386 or above personal computers
Ethernet LAN Cards in each participating computer system

Team Members:

xyx

Other Projects to Try:

  1. Bug Tracking System Java Project
  2. Chat Server project in Java
  3. Threads in Java Tutorial for Beginners
  4. Study of free and open source software WINE
  5. Email Program System Java Project

Operations on matrices like addition, multiplication, saddle point, magic square ,inverse & transpose

by Leave a Comment

Write a program to perform operations on matrices like addition, multiplication, saddle point, magic square ,inverse & transpose etc using functions & pointers. 


#include
#include
#include
#include void main()
{
int m1[30][30],m2[30][30],m3[30][30]={0};
int i,j,x,k,r1,r2,c1,c2,n,ch,sum=0;
char wish,y;
clrscr();
printf(“enter no of row for 1st matrix”);
scanf(“%d”,&r1);
printf(“enter no of col for 1st matrix”);
scanf(“%d”,&c1);
for(i=0;i<r1;i++)
for(j=0;j<c1;j++)
{
printf(“\n\t\t enter a[%d][%d]:”,i,j);
scanf(“%d”,&m1[i][j]);
}
printf(“enter no of row for 2nd matrix”);
scanf(“%d”,&r2);
printf(“enter no of col for 2nd matrix”);
scanf(“%d”,&c2);
for(i=0;i<r2;i++)
for(j=0;j<c2;j++)
{
printf(“\n\t\t enter a[%d][%d]:”,i,j);
scanf(“%d”,&m2[i][j]);
}
menu:
printf(“\n for sum of matrix press 1”);
printf(“\n for mutiplication of matrix press 2”);
printf(“\n for transpose of 1st matrix  press 3”);
printf(“\n for cheaking symatericness of 1st matrix  press 4”);
printf(“\n for cheaking sqew symatry  matrix press 5\n”);
scanf(“%d”,&ch);
switch(ch)
{
case 1://addition
if((r1==r2)&&(c1==c2))
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
m3[i][j]=m1[i][j]+m2[i][j];
}
else
{
exit(0);
}
for(i=0;i<r1;i++)
{
printf(“\n”);
for(j=0;j<c1;j++)
printf(“\t\t%d”,m3[i][j]);
}
break;
case 2://multiplication
sum=0;
if(c1==r2)
{
for(i=0;i<r1;i++)
{
printf(“\n”);
for(j=0;j<c2;j++)
{
for(k=0;k<c1;k++)
{
sum+=(m1[i][k]*m2[k][j]);
}
printf(“\t\t%d”,sum);
sum=0;
}
}
}
else
exit(0);
break;
case 3:
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
{
m3[j][i]=m1[i][j] ;
}
}
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
{
printf(“\t\t%d”,m3[i][j]);
}
printf(“\n”);
}
break;
case 4:
/*int flag=0;
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
m3[j][i]=m1[i][j];
}
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
{
if(m3[i][j]==m1[i][j])
flag++;
}
}
if(flag==r1*c1)
printf(” 1st matrix  is symatric”);
else
printf(” 1st matrix  is not symatric”);*/
int flag=1;
for(i=0;i<r1;i++)
{
for(j=i+1;j<c1;j++)
{
if(m1[i][j]!=m1[j][i])
{
flag=0;
}
}
}
if(flag==1)
printf(” 1st matrix  is symatric”);
else
printf(” 1st matrix  is not symatric”);
break;
case 5://skew symatric
int fl=0;
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
m3[j][i]=m1[i][j];
}
for(i=0;i<r1;i++)
{
for(j=0;j<c1;j++)
{
if(m3[i][j]==-m1[i][j])
fl++;
}
}
if(fl==r1*c1)
printf(” 1st matrix  is skew symatric”);
else
printf(” 1st matrix  is not  skew symatric”);
}
getch();
}//prg terminates

 

Other Projects to Try:

  1. Matrix Operations with Pointers
  2. Set operations – Union, Intersection, Difference, Symmetric Difference using C
  3. Matrix Operations in C Language
  4. Sparse Matrix Operations Code using C Langauge
  5. Multiply Two 8 Bit Numbers Successive Addition Method

string operations such as Copy, Length, Reversing, Palindrome, Concatenation

by Leave a Comment

Write a program to perform various string operations such as Copy, Length, Reversing, Palindrome, Concatenation
#include
#include
#include
void main()
{
int  no,m,ch ,i,j,n,k,flag=0;
char str[20],str2[20],str3[20],str4[20];
char wish;
clrscr();
do
{
menu:
printf(“\n1.length of the string.”);
printf(“\n2.copying string another.”);
printf(“\n3.concatination of two string”);
printf(“\n4.reversing the string”);
printf(“\n5.checking palindrome or not.”);
printf(“\n6.checking sub-string in the string.” );
printf(“\nEnter the choice:”);
scanf(“%d”,&ch);
switch(ch)
{
case 1:
printf(“Enter the string: “);
flushall();
gets(str);
for(i=1;str[i]!=’\0′;i++); //to find the length of the string
printf(“the length of the string is:%d “,i);
break;
case 2:
printf(“Enter the string: “);
flushall();
gets(str);
for(i=0;str[i]!=’\0′;i++)//TO COPY A STRING IN OTHER
{
str2[i]=str[i];
}
str2[i]=’\0′;
printf(“\n the copied string is: “);
puts(str2);
break;
case 3:
printf(“Enter the string: “);
flushall();
gets(str);
printf(“\n Enter the second string”);
flushall();
gets(str2);
i=0;
while(str[i]!=’\0′)
i++;
for(j=0;str2[j]!=’\0′;j++,i++)//TO CONCATINATE TWO STRING
str[i]=str2[j];
str[i]=’\0′;
printf(“\nthe concatinated string is: “);
puts(str);
break;
case 4:
printf(“Enter the string: “);
flushall();
gets(str);
i=0;
while(str[i]!=’\0′)
i++;
i–;
for(j=0;str[j]!=’\0′,i>=0;j++,i–)//TO REVERSE STRING
str2[j]=str[i];
str2[j]=’\0′;
printf(“\n the reverse string is: “);
puts(str2);
break;
case 5:
printf(“Enter the string: “);
flushall();
gets(str);
i=0;
while(str[i]!=’\0′)
i++;
i–;
flag=1;
for(j=0;i>j;j++,i–)
{ 

if(str[i]!=str[j])
{
flag=0;
break;
}
}
if(flag==1)
printf(“\nthe string is palindrom.”);
else
printf(“\nthe string is not palindrom.”);
break;
case 6:
printf(“Enter the string: “);
flushall();
gets(str);
printf(“\nEnter the second string: “);  //TO FIND WETHER SUBSTRING EXISTS OR NOT
gets(str4);
for(m=0;str[m]!=’\0′;m++);
for(k=0;k<=m-1;k++)
{
for(j=0;str4[j]!=’\0′;j++)
{
if(str[k+j]!=str4[j])
{
flag=0;
break;
}
}
if(str4[j]==’\0′)
{
flag=1;break;}
}
if(flag==1)
printf(“\nsubstring found at position:%d “,j+k);
else
printf(“\n substring donot exists”);
break;
default:
printf(“\n wrong choice!!!!”);
break;
}
printf(“\nwant to continue(y/n)”);
scanf(“%c”,&wish);
}
while(wish!=’n’);
getch();
}

Other Projects to Try:

  1. Set operations – Union, Intersection, Difference, Symmetric Difference using C
  2. String Operations with Pointers
  3. String Operations in C Program
  4. Factorial,Greatest Number,String Palindrome Shell code
  5. String Operations in C Language

Set operations – Union, Intersection, Difference, Symmetric Difference using C

by Leave a Comment

Write a program to perform Set operations – Union, Intersection, Difference,
Symmetric Difference etc.
#include
#include
#include void main()
{
int i,j,k,p,ch,n1,n2,set1[10],set2[10], set3[20],flag;
char wish;
clrscr();
do
{
printf(“press 1 for union”);
printf(“\npress 2 for intersection”);
printf(“\npress 3 for subtraction”);
printf(“\n enter ur choice”);
scanf(“%d”,&ch);
switch(ch)
{
case 1://for union
printf(“\nenter the size of set1\n”);
scanf(“%d”,&n1);
printf(“enter the element of set1\n”);
for(i=0;i<n1;i++)
scanf(“%d”,&set1[i]);
printf(“enter the size of set2\n”);
scanf(“%d”,&n2);
printf(“enter the elements of set2\n”);
for(i=0;i<n2;i++)
scanf(“%d”,&set2[i]);
k=0;
for(i=0;i<n1;i++)
{
set3[k]=set1[i];
k++;
}
for(i=0;i<n2;i++)
{
flag=1;
for(j=0;j<n1;j++)
{
if(set2[i]==set1[j])
{
flag=0;
break;
}
}
if(flag==1)
{
set3[k]=set2[i];
k++;
}
}
p=k;
for(k=0;k <p;k++)
 

{
printf(” %d”,set3[k]);
} 

break;
case 2: //for intersection
printf(“enter the size of sets1”);
scanf(“%d”,&n1);
printf(“enter the element of set1”);
for(i=0;i<n1;i++)
scanf(“%d”,&set1[i]);
printf(“enter the size of sets2”);
scanf(“%d”,&n2);
printf(“enter the elements of set2”);
for(i=0;i<n2;i++)
scanf(“%d”,&set2[i]);
k=0;
for(i=0;i<n2;i++)
{
flag=1;
for(j=0;j<n1;j++)
{
if(set2[i]==set1[j])
{
flag=0;
break;
}
}
if(flag==0)
{
set3[k]=set2[i];
k++;
}
}
p=k;
for(k=0;k <p;k++)

{
printf(” %d”,set3[k]); 

}
break;
case 3://for subtraction
printf(“enter the size of sets1”);
scanf(“%d”,&n1);
printf(“enter the element of set1”);
for(i=0;i<n1;i++)
scanf(“%d”,&set1[i]);
printf(“enter the size of sets2”);
scanf(“%d”,&n2);
printf(“enter the elements of set2”);
for(i=0;i<n2;i++)
scanf(“%d”,&set2[i]);
k=0;
for(i=0;i<n1;i++)
{
flag=1;
for(j=0;j<n2;j++)
{
if(set1[i]==set2[j])
{
flag=0;
break;
}
}
if(flag==1)
{
set3[k]=set1[i];
k++;
}
}
p=k;
for(k=0;k <p;k++)

{
printf(” %d”,set3[k]); 

}
break;

}

printf(“\n want to continue: “);
flushall();
scanf(“%c”,&wish);
}
while(wish!=’n’);
} //prg terminates

Other Projects to Try:

  1. Operations on matrices like addition, multiplication, saddle point, magic square ,inverse & transpose
  2. string operations such as Copy, Length, Reversing, Palindrome, Concatenation
  3. Bitwise Operations using C++
  4. Matrix Operations with Pointers
  5. String Operations with Pointers