Steganography based image compression

The intention of image compression is to discard worthless data from image so as to shrink the quantity of data bits favored for image depiction, to lessen the storage space, broadcast bandwidth and time. Likewise, data hiding convenes scenarios by implanting the unfamiliar data into a picture in invisibility manner. The review offers, a method of image compression approaches by using DWT transform employing steganography scheme together in combination of SPIHT to compress an image

Synthesis and physico-chemical studies of some Bisphenol Derrivatives, Polymers and Composites

Not availabl

Combination of a Probabilistic-Based and a Rule-Based Approach for Genealogical Record Linkage

Record linkage is the task of identifying records within one or multiple databases that refer to the same entity. Currently, there exist many different approaches for record linkage. Some approaches incorporate the use of heuristic rules, mathematical models, Markov models, or machine learning. This thesis focuses on the application of record linkage to genealogical records within family trees. Today, large collections of genealogical records are stored in databases, which may contain multiple records that refer to a single individual. Resolving duplicate genealogical records can extend our knowledge on who has lived and more complete information can be constructed by combining all information referring to an individual. Simple string matching is not a feasible option for identifying duplicate records due to inconsistencies such as typographical errors, data entry errors, and missing data. Record linkage algorithms can be classified under two broad categories, a rule-based or heuristic approach, or a probabilistic-based approach. The Cocktail Approach, presented by Shirley Ong Ai Pei, combines a probabilistic-based approach with a rule-based approach for record linkage. This thesis discusses a re-implementation and adoption of the Cocktail Approach to genealogical records

Improving Mix-CLAHE with ACO for Clearer Oceanic Images

Oceanic pictures have poor visibility attributable to various factors; weather disturbance, particles in water, lightweight frames and water movement which results in degraded and low contrast pictures of underwater. Visibility restoration refers to varied ways in which aim to decline and remove the degradation that have occurred whereas the digital image has been obtained. The probabilistic Ant Colony Optimization (ACO) approach is presented to solve the problem of designing an optimal route for hard combinatorial problems. It\u27s found that almost all of the prevailing researchers have neglected several problems i.e. no technique is correct for various reasonably circumstances. the prevailing strategies have neglected the utilization of hymenopter colony optimization to cut back the noise and uneven illuminate downside. The main objective of this paper is to judge the performance of ANT colony optimization primarily based haze removal over the obtainable MIX-CLAHE (Contrast Limited adaptive histogram Equalization) technique. The experiment has clearly showed the effectiveness of the projected technique over the obtainable strategies

Offline Signature Verification based on Euclidean distance using Support Vector Machine

In this project, a support vector machine is developed for identity verification of offline signature based on the matrices derived through Euclidean distance. A set of signature samples are collected from 35 different people. Each person gives his 15 different copies of signature and then these signature samples are scanned to have softcopy of them to train SVM. These scanned signature images are then subjected to a number of image enhancement operations like binarization, complementation, filtering, thinning, edge detection and rotation. On the basis of 15 original signature copies from each individual, Euclidean distance is calculated. And every tested image is compared with the range of Euclidean distance. The values from the ED are fed to the support vector machine which draws a hyper plane and classifies the signature into original or forged based on a particular feature value

Tunnelling Characteristics of Stone-Wales Defects in Monolayers of Sn and Group-V Elements

Topological defects in ultrathin layers are often formed during synthesis and processing, thereby, strongly influencing their electronic properties . In this paper, we investigate the role of Stone-Wales (SW) defects in modifying the electronic properties of the monolayers of Sn and group-V elements. The calculated results find the electronic properties of stanene (monolayer of Sn atoms) to be strongly dependent on the concentration of SW-defects e.g., defective stanene has nearly zero band gap (~ 0.03 eV) for the defect concentration of 2.2 x 10^13 cm^-2 which opens up to 0.2 eV for the defect concentration of 3.7 x 10^13 cm^-2. In contrast, SW-defects appear to induce conduction states in the semiconducting monolayers of group-V elements. These conduction states act as channels for electron tunnelling, and the calculated tunnelling characteristics show the highest differential conductance for the negative bias with the asymmetric current-voltage characteristics. On the other hand, the highest differential conductance was found for the positive bias in stanene. Simulated STM topographical images of stanene and group-V monolayers show distinctly different features in terms of their cross-sectional views and distance-height profiles which can serve as fingerprints to identify the topological defects in the monolayers of group-IV and group-V elements in experiments.Comment: 18 pages, 5 figures, 1 tabl