Entropy based spatial domain image watermarking and its performance analysis

Digital image watermarking technique based on LSB Substitution and Hill Cipher is presented and examined in this paper. For better imperceptibility watermark is inserted in the spatial domain. Further the watermark is implanted in the Cover Image block having the highest entropy value. To improve the security of the watermark hill cipher encryption is used. Both subjective and objective image quality assessment technique has been used to evaluate the imperceptibility of the proposed scheme.Further, the perceptual perfection of the watermarked pictures accomplished in the proposed framework has been contrasted and some state-of-art watermarking strategies. Test results demonstrates that the displayed method is robust against different image processing attacks like Salt and Peppers, Gaussian filter attack, Median filter attacks, etc.

     

Interactive sonification to assist children with autism during motor therapeutic interventions

Personal and Ubiquitous Computing - Interactive sonification is an effective tool used to guide individuals when practicing movements. Little research has shown the use of interactive sonification...     

高速公路施工区车辆强制换道耗时生存模型

为研究高速公路施工区车辆强制换道行为及其影响因素,采用生存分析中的半参数分析方法建立强制换道耗时的乘法风险率模型.通过无人机拍摄采集高速公路施工区的车辆换道耗时及其影响因素数据,最终确立换道耗时Cox比例风险模型,对换道耗时数据进行Cox回归建模分析.结果表明:近77%的换道车辆在10 s内完成换道;小型车和中型车经养护施工区的换道耗时未发现显著性差别;对于相同的换道耗时,平峰期的累积生存率明显低于高峰期和过渡时期,而高峰期的累积生存率最高.建立的强制换道耗时生存模型可有效的定量分析车型和交通时段对高速公路施工区车辆换道行为的影响,可为高速公路施工区交通管理控制及车辆换道行为建模及仿真奠定一定的理论基础.     

Oxidation behavior of 2.25Cr-1Mo steel with prior tempering at different temperatures

The oxidation behavior of a normalized 2.25Cr-1Mo steel tempered previously for 10 hr at different temperatures between 873 and 1023 K has been studied up to a maximum duration of 1000 hr in air at 773–973 K. The oxidation resistance of the steel was found to decrease significantly with the temperature of tempering. Tempering of this steel is reported to cause microstructural changes involving precipitation of Cr as carbides and a decrease in the effective (free) Cr contents, that could influence the oxidation resistance of the Cr-containing alloys. Relative compositions across the thickness of the oxide scales, as analyzed by SEM/EDX and SIMS, suggest that a less Cr-rich (and less protective) and thicker scale on the steel formed because previous tempering caused extensive depletion of free Cr.     

The influence of heating element temperature on productivity

A study to determine the most optimal heating element for any given processing configuration yields a surprisingly simple log-linear dependence of the productivity on the heating-element temperature. Aluminum, iron, and aluminum-oxide processing efficiencies are studied for conditions that span heat treating to melting. The authors note that, in general, the highest element temperature that may effectively be used for a given heating process is the high-productivity solution.     

Modal analysis of human body vibration model for Indian subjects under sitting posture

Need and importance of modelling in human body vibration research studies are well established. The study of biodynamic responses of human beings can be classified into experimental and analytical methods. In the past few decades, plenty of mathematical models have been developed based on the diverse field measurements to describe the biodynamic responses of human beings. In this paper, a complete study on lumped parameter model derived from 50th percentile anthropometric data for a seated 54- kg Indian male subject without backrest support under free un-damped conditions has been carried out considering human body segments to be of ellipsoidal shape. Conventional lumped parameter modelling considers the human body as several rigid masses interconnected by springs and dampers. In this study, concept of mass of interconnecting springs has been incorporated and eigenvalues thus obtained are found to be closer to the values reported in the literature. Results obtained clearly establish decoupling of vertical and fore-and-aft oscillations.     

An efficient fragile watermarking scheme with multilevel tamper detection and recovery based on dynamic domain selection

Self-recoverable fragile watermarking is meant for accurate tamper localization as well as image recovery with superior visual quality. However, most of the existing state of art approaches perform authentication and recovery on block basis owing to which the entire block is categorized as tampered in case of alteration of one or more pixels of it. This, results in staircase formation of tamper detected regions, hence lacking in accuracy. Furthermore, the visual quality of the recovered image also deteriorates as an approximate value is assigned to all the block pixels corresponding to the altered region. The proposed watermarking scheme performs both authentication and recovery pixelwise. The authentication of each pixel is done via multi level tamper detection(MLTD) through three authentication bits based on value, location and neighbourhood information. The domain for image recovery is chosen dynamically based on the content of the block, may it be in spatial domain for smooth blocks or frequency domain for the rough ones. This provides high accuracy in recovery. As the embedding of recovery information is done in the frequency domain, the imperceptibility of the watermarked image scheme remains high. Also, embedding of authentication information in the spatial domain maintains its fragile nature. Even for higher tampering ratios, the lost content is rebuilt with high peak signal to noise ratio(PSNR) of the recovered image. The probabilities of false rejection and false acceptance head towards the ideal value for most of the empirical analysis. Comparative study via metric evaluation of probability of false rejection (PFR), probability of false acceptance (PFA) and PSNR of recovered image for different standard test cover images demonstrate the efficacy of the proposed scheme over other existing state of art approaches. Further, the security of the proposed scheme remains high due to usage of multi-layered secret keys and chaos based random mapping handling worst tamper scenarios.     

Approximate variational inference based on a finite sample of Gaussian latent variables

Variational methods are employed in situations where exact Bayesian inference becomes intractable due to the difficulty in performing certain integrals. Typically, variational methods postulate a tractable posterior and formulate a lower bound on the desired integral to be approximated, e.g. marginal likelihood. The lower bound is then optimised with respect to its free parameters, the so-called variational parameters. However, this is not always possible as for certain integrals it is very challenging (or tedious) to come up with a suitable lower bound. Here, we propose a simple scheme that overcomes some of the awkward cases where the usual variational treatment becomes difficult. The scheme relies on a rewriting of the lower bound on the model log-likelihood. We demonstrate the proposed scheme on a number of synthetic and real examples, as well as on a real geophysical model for which the standard variational approaches are inapplicable.     

Reputation based probabilistic resource allocation for avoiding free riding and formation of common interest groups in unstructured P2P networks

Free riding is a major problem in peer-to-peer networks. Reputation management systems are generally employed to overcome this problem. In this paper, a new reputation based scheme called probabilistic resource allocation is proposed. This strategy probabilistically decide whether to provide the resource to requesting peer or not. Aforesaid method gives selection preference to higher reputation peers and at the same time provides some finite probability of interaction between those peers who don’t have good reputation about each other. This avoids disconnection between the aforesaid peers. The proposed scheme also introduces a new mechanism for resource distribution which not only allocates resources based on peers’ reputation but simultaneously maximizes network utility also. Algorithm for formation of interest groups based upon both similarity of interests and reputation between peers is also presented.