Optimal weighed Holoentropy for video compression: an advanced HEVC

ABSTRACT

In recent times, the applications of multimedia are rising in a greedy mode and hence the amount of video transactions is also increasing exponentially. This has shouted great demands on effective models on video encoding and also for reducing the transmission channel congestion. This research work introduces a managing technique termed weighted encoding for High-Efficiency Video Coding (HEVC). HEVC, also termed as MPEG-H Part 2 and H.265 is a video compression standard that is widely utilized AVC (H.264 or MPEG-4 Part 10). When compared to AVC, HEVC grants double the ratio of data compression at a similar level of quality of the video or considerably enhanced video quality at a similar bit rate. This work intends to optimize the weight that adopted in HEVC for encoding. For this, this paper proposes a new Iterative based propagation update in the water wave Optimization Algorithm (IPU-WWO), which is the improved form of Water wave Optimization (WWO). The performance of proposed IPU-WWO is compared over other conventional methods like Artificial Bee Colony (ABC), Firefly (FF), Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) with respect to Peak Signal to Noise Ratio (PSNR). By doing the encoding process, it minimizes the video size with perceptually better quality video or PSNR.     

Face verification across age progression.

Human faces undergo considerable amounts of varialions with aging. While face recognition systems have been proven to be sensitive to factors such as illumination and pose, their sensitivity to facial aging effects is yet to be studied. How does age progression affect the similarity between a pair of face images of an individual? What is the confidence associated with establishing the identity between a pair of age separated face images? In this paper, we develop a Bayesian age difference classifier that classifies face images of individuals based on age differences and performs face verification across age progression. Further, we study the similarity of faces across age progression. Since age separated face images invariably differ in illumination and pose, we propose preprocessing methods for minimizing such variations. Experimental results using a database comprising of pairs of face images that were retrieved from the passports of 465 individuals are presented. The verification system for faces separated by as many as nine years, attains an equal error rate of 8.5%.     

Antihyperglycemic activity of phenolics from Pterocarpus marsupium

Glucose levels in rats with hyperglycemia induced by streptozotocin were determined after i.p. administration of marsupsin (1), pterosupin (2), and pterostilbene (3), three important phenolic constituents of the heartwood of Pterocarpus marsupium. Marsupsin and pterostilbene significantly lowered the blood glucose level of hyperglycemic rats, and the effect was comparable to that of 1,1-dimethylbiguanide (metformin).     

Control of volatile organic compounds by an AC energizedferroelectric pellet reactor and a pulsed corona reactor

Two laboratory-scale plasma reactors, an alternating current (AC) energized ferroelectric (high dielectric ceramic) packed bed reactor and a nanosecond pulsed corona reactor, were constructed. This study was done to develop baseline engineering data to demonstrate the feasibility of the application of plasma reactors to the destruction of various volatile organic compounds (VOCs) at PPM levels. Complete destruction was obtained for toluene. Conversions of methylene chloride at 95% and trichlorotrifluoroethane (known as CFC-113) at 67% were achieved for the plasma reactors used. The conversion was dependent on the mean electron energy in the reactor and was also related to how strongly halogen species were bonded with carbon     

Multicast tree generation in networks with asymmetric links

We formulate the problem of multicast tree generation as one of computing a directed Steiner tree of minimal cost. In this context, we present a polynomial-time algorithm that provides for trade-off selection, using a single parameter κ, between the tree-cost (Steiner cost) and the run time efficiency. Further, the same algorithm may be used for delay optimization or tree-cost minimization simply by configuring the value of κ appropriately. We present theoretical and experimental analysis characterizing the problem and the performance of our algorithm. Theoretically, we show that it is highly unlikely that there exists a polynomial-time algorithm with a performance guarantee of constant times optimum cost, introduce metrics for measuring the asymmetry of graphs, and show that the worst-case cost of the tree produced by our algorithm is, at most, twice the optimum cost times the asymmetry, for two of these asymmetry metrics. For graphs with bounded asymmetry, this gives constant times optimum performance guarantee. We also show that three well-known algorithms for (undirected) Steiner trees are but particular cases of our algorithm. Our experimental study shows that operating at a low κ gives nearly best possible expected tree cost while maintaining acceptable run-time efficiency     

A mathematical model for predicting the soil nitrogen status under varying fertilizer practices in a continuous cropping sequence

A mathematical model has been proposed for predicting the changes in soil nitrogen status due to continuous fertilization in a continuous cropping sequence. The model also enabled the prediction of the steady state of soil nitrogen for a specified fertilizer practice.The model was applied to six years nitrogen availability data of four fertilizer practices in finger millet-maize-cowpea sequence followed in the Long Term Fertilizer Experiments conducted at Tamil Nadu Agricultural University, Coimbatore, India. The agreement between the predicted soil nitrogen status by the model and the actuals was proved by employing reliability index.     

Pixel rearrangement based statistical restoration scheme reducing embedding noise

In this paper, a block based steganographic algorithm has been proposed where a sequence of secret bits are embedded into a set of pixels by rearranging the pixel locations. This algorithm has been devised as an improvement over existing statistical restoration based algorithms in order to reduce the additive noise which occurs due to embedding. It is shown that the proposed scheme substantially reduces the additive noise compared to existing statistical restoration based schemes.