Category: CSE Seminar Topics

Introduction: 

This paper describes about a Image steganography technique to hide information into a cover page based on Block-DCT, and Huffman coding. Huffman encoding is on the secret messages/images before embedding and each bit of secret message/image is embedded in the frequency domain by modifying the least significant bit of cover image blocks DCT coefficients. This algorithm has a good invisibility and capacity. Peak signal to Noise Radio of cover image with stego-image gives better results when compared to that of existing steganography approaches. The secret message/image cannot be extracted without knowing Huffman table and decoding rules. 

Image Steganography Algorithm: 

The main objective of Steganography is the true message cannot able to observe by an observer. Unauthorized users are not supports to differentiate a cover-image i.e., an image does not contain an secret message and stego-mage i.e., cover-image is modified and results a stego-image with secret message.  Now-a-days steganograhpy is widely used in computer where digital data acts as carriers and networks acts as speed delivery channels.  

 Image steganography schemes are classified spatial-domain based category and transform-domain based category.  In spatial domain approaches, the embedding of secret messages takes place directly. The simplest stegonographic method in spatial domain is Least Significant Bits Insertion method.   Secret image is encoded using Huffman coding and then the secret image is embedded into cover image. Huffman codes are optimal codes in which one symbol maps to one code word. 

Conclusion: 

In spatial domain, a steganography process improved security and image quality, compared to that of existing algorithms. It is very difficult to differentiate original image with the steganography algorithm resultant stego-image.  This algorithm also provides 3 layers of security to cover image transformation. But the demand for image robustness in steganography is not as much as in watermarking field.  Image in steganography process neglects the basic demand of robustness. This algorithm performs few operations and Huffman encoding of secret image helps to protect the images from stealing or misuse by unintended users. 

 Download  Image Steganography Technique -Based On Block-DCT and Huffman Encoding.

Introduction to A Novel Algorithm for Hiding Sensitive Frequent Item Sets Project:

This paper discussed about fast hiding sensitive frequent itemsets (FHSFI) approach to hide sensitive frequent itemsets with one database scan and generate limited side effects. 

Overview: 

In a database, with an association analyzer, if an itemset with support above a given minimal support then that itemset is called a frequent itemset.  There is a need to analyze the correlations between the sensitive itemsets and each transaction in a database.  The transactions order to be altered can be decided based on the each transaction weight which is given by heuristic function. 

So by this there is a possibility of saving time by only consider the actual required transactions to modified and then hide the given sensitive frequent itemsets. There is no need to deal with all the transactions to hide the sensitive frequent itemsets.  FHSFI provides the facility to hide the SFI without generating many side effects but still there is loss in rule sets, so researches have been takes place to overcome this issue. The main goal of FHSFI is to hide sensitive frequent itemsets by allowing minimum support thresholds, by limited side effects and by executed only one database scan. 

Conclusions: 

In network and data mining world, there is a severe need to protect the confidentiality of sensitive information in a database. The relationships hidden among large data sets are in a form of frequent item sets or association rules.  Privacypreserving data mining is an important issue which needs the immediate attentions in the current industry. 

When the support of each given sensitive itemsets are reduced then it will help to hide sensitive frequent itemsets, and this can be achieved by modifying transaction in database but at the same time will have enough side effects due to it.  So FHSFI emerged to hide sensitive frequent itemsets with limited side effects.

 Download  A Novel Algorithm for Hiding Sensitive Frequent Item Sets.

Introduction to An Efficient Wireless Architecture to Connect Rural Regions Project:

This paper discussed about a new wireless network architecture WiRE (Wi-Fi-based Rural Extensions), which provides connectivity to rural regions at very low costs. To enhance the features of WiRE architectural, this paper also addressed the challenges at various protocols. Operations costs of WiMAX and cellular networks are higher in rural areas, because significant power consumption requires covering large areas with low user densities. So there is a need of WiRE network to provide connectivity to rural areas at low cost. 

WiRE Network Architecture: 

The main working principle of WiRE is to provide coverage to specific rural regions where connectivity is more required rather than providing broad coverage. The six important network components of WiRE are wireless nodes, point-to-multipoint links, low cost computing devices, point-to-point links, multi-radio mesh links and large local storage.  The scope of WiRE network architecture is much broader when compared to that of WiLD networks. A wiRE network provides rural connectivity, supports wide range of applications and also focuses on challenges across different protocol layers. WiRE network provider uses unlicensed spectrum so there is no need to pay spectrum costs.

As the manufactures of Wi-Fi chipsets supports open source drivers which help to tailor the protocol in order to meet our needs.  Low power single board computers are used by every wireless router in a WiRE network. PCs/ kiosks or the cell phones are the end-devices of WiRE. WiRE architecture is helpful to enable specific services like telephony services, tele consultation and telemedicine services, interactive distance learning service and mobile banking services to rural regions. But in order to provide the above mentioned services, WiRE network has to face some challenges which come across network and transport layers.  WiRE network is designed in a way to tolerate all failures and address all challenges in these two layers. 

Conclusions:

The WiRE architecture is developed for the typical rural regions to connect them to the city. WiRE is a wireless distribution network which extends connectivity from the city to village.

 Download  An Efficient Wireless Architecture to Connect Rural Regions Project.

Introduction to Property Management System Implementation for a Organization Project:

This paper discussed about the how to manage the property in an organization and discussed about the importance of Property management system. Locating, tracking and controlling fixed assets can be called as Property Management. Solid Benefits can be obtained by an organization with the help of effective Controlling and Tracking of Property.

Overview:

When there is a tracking of fixed assets then can obtain benefits with the proper utilization of those fixed assets.  Property Managements includes few tasks like controlling the property, accounting the fixed asset, managing the maintenance, control the inventory, security control, Warranty control, Calibration system control, billing and invoicing and tool control. A Property Management Program helps in accurate accounting and efficient compilation.  Ultimately, the success of a Property Management Program depends on the support of top management and the commitment of an entire organization. 

Across a wide range of organizational activities and concerns, using Property identification Program yields effective and numerous benefits. For implementing an effective tracking and controlling program there is a need to gather inputs from the employees during planning of the program and whose support is needed for implementing and perpetuating the program.  

NPMA and ASTM organizations can assist the organization employees in implementing property management Program. Need to determine what property information records are needed and also determine what are the rules and regulations that applies to that organization.  Determine the number of assets to be located recorded and estimate the cost for identification and protection of those assets from unauthorized usage. 

There is a need to define which software should use for organization property identification. Should prepare a detailed written copy about the assets and must make it as a part of company’s policy.  A Property Management program with procedures documents will help the organization to meet ISO standards.  Each asset should be recorded in a detailed manner with necessary details like when the assets is purchased , from where it is purchased,  current cost and asset benefits.

 Download  Property Management System Implementation for a Organization Project.

Introduction: 

This paper discussed about a distributed algorithm to compute all best swap edges for a minimum diameter spanning tree.   A Minimum Diameter Spanning Tree minimizes the largest distance between any pair of nodes, even if edge lengths are not uniform. 

Overview: 

One drawback of a spanning tree is that a single link failure disconnects the network. Whenever link failures occur, it has to replace by a single other link called swap link to reconnect the network. Among all possible swap links, there is a need to choose a best swap to minimize the resulting swap tree diameter.

Swap tree does not use the failed link like a minimum diameter spanning tree. The reason for preferring a swap tree is only one edge goes into service and routing can be managed with less effort. There is a moderate loss in diameter in choosing swap tree against adjusting an entire tree. When compared to that of the diameter of an entire adjusted tree which is a factor of 2.5 smaller than the swap tree diameter. There is a need to pre-compute each edge of the tree to get a best swap edge. Distributed computation of all best swaps has more efficiency as dependencies between the computations for failing edges can be exploited.  When a failing edge is replaced by a best swap edge, we have a compact routing scheme for trees which can quickly and inexpensively adapt routing in distributed algorithm.  

Distributed algorithm computes the best swap edge for every failing edge depends on the information available after the pre processing phase. To compute all best swap edges of a tree there is a need to execute this algorithm for each edge of tree independently. 

Conclusions: 

When computing best swap edges for a minimum diameter spanning tree, the solution obtained by this paper is asynchronous, needs a unique identifiers from a linearly ordered universe also uses time, small messages or messages size.

Introduction to Domain Visible Watermarking Technique on Images Project:

To protect publicly available image, there is a need to use visible watermarking, which is one type of digital watermarking. This paper discussed about how a visible watermarking technique applies to a host image in the DCT domain.  Few significant modifications done to the algorithm in order to make the watermark robust.

Overview:

Digital watermarking is a process of inserting watermark into a multimedia object to protect the object’s owner’s right. The original and watermark images are divided into blocks and the corresponding DCT coefficients are also need to be observed. For each block of original image, some mathematical calculations need to be done as per algorithm. After all the modifications done to each block of the image, watermarked image will get generated. To protect the quality of watermarked image there is a need to consider and manage both embedding and scaling factors. 

Modification to watermark: 

The algorithm proposed to generate a watermark image from an original image is not robust for images having few objects and more uniform areas. So, if we apply this algorithm for such images then it is easier for a digital thief to remove the watermark from a watermarked image. So modifications need to be done to watermark insertion technique.   

Conclusions: 

In the DCT Domain, a visible watermarking technique has proposed. To exploit the HVS texture sensitivity a mathematical model has developed. This paper discusses about few modifications which need to be done for watermark insertion algorithm to make it more effective for all images and also to increase the robustness of the watermark. Watermark should be used in different portions in different sizes and for different images also it should not available publicly for more robustness.  Even when images are printed on paper, to make the watermark more prominent by consider lower values of amin and amax, also higher values of bmin and bmax.  Visible watermark is a technique which is used in current digital TV, ecommerce and digital library etc.

 Download  Domain Visible Watermarking Technique on Images Base Paper.