Feature Detection using S-Transform

Images are characterized by features. Machines identify and recognize a scene or an image by its features. Edges, objects, and textures are some of the features that distinguish one image from another. There could be many common features in similar images. But, in those commonalities there lies a distinction in terms of features known as subtle features. Numerous algorithms have been reported to extract features from images. Few of them are reliable. Some of them do well under a constrained environment. Many of them fail miserably under low intensity, noise etc. The prominent features are very well identified by many algorithms, whereas the subtle features are often overlooked. In this thesis an attempt has been made to develop an algorithm to extract very subtle features from a given image. A new method has been proposed on the principle of phase congruency to detect features in images. The proposed method uses S-Transform to calculate phase congruency. The proposed method is able to calculate the subtle features even in the very low intensity images. Finally, an application of the proposed method in fingerprint minutiae extraction has also been demonstrated

Facets for Continuous Multi-Mixing Set and Its Generalizations: Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem

The research objective of this dissertation is to develop new facet-defining valid inequalities for several new multi-parameter multi-constraint mixed integer sets. These valid inequalities result in cutting planes that significantly improve the efficiency of algorithms for solving mixed integer programming (MIP) problems involving multimodule capacity constraints. These MIPs arise in many classical and modern applications ranging from production planning to cloud computing. The research in this dissertation generalizes cut-generating methods such as mixed integer rounding (MIR), mixed MIR, continuous mixing, n-step MIR, mixed n-step MIR, migling, and n-step mingling, along with various well-known families of cuts for problems such as multi-module capacitated lot-sizing (MMLS), multi-module capacitated facility location (MMFL), and multi-module capacitated network design (MMND) problems. More specifically, in the first step, we introduce a new generalization of the continuous mixing set, referred to as the continuous multi-mixing set, where the coefficients satisfy certain conditions. For each n’ ϵ {1; : : : ; n}, we develop a class of valid inequalities for this set, referred to as the n0-step cycle inequalities, and present their facet-defining properties. We also present a compact extended formulation for this set and an exact separation algorithm to separate over the set of all n’-step cycle inequalities for a given n’ ϵ {1; : : : ; n}. In the next step, we extend the results of the first step to the case where conditions on the coefficients of the continuous multi-mixing set are relaxed. This leads to an extended formulation and a generalization of the n-step cycle inequalities, n ϵ N, for the continuous multi-mixing set with general coefficients. We also show that these inequalities are facet-defining in many cases. In the third step, we further generalize the continuous multi-mixing set (where no conditions are imposed on the coefficients) by incorporating upper bounds on the integer variables. We introduce a compact extended formulation and new families of multi-row cuts for this set, referred to as the mingled n-step cycle inequalities (n ϵ N), through a generalization of the n-step mingling. We also provide an exact separation algorithm to separate over a set of all these inequalities. Furthermore, we present the conditions under which a subset of the mingled n-step cycle inequalities are facet-defining for this set. Finally, in the fourth step, we utilize the results of first step to introduce new families of valid inequalities for MMLS, MMFL, and MMND problems. Our computational results show that the developed cuts are very effective in solving the MMLS instances with two capacity modules, resulting in considerable reduction in the integrality gap, the number of nodes, and total solution time

Ellagic Acid Administration Reverses Colchicine- Induced Dementia in Rats

The late-onset sporadic type of Alzheimer’s disease is characterised by chronic oxidative stress, neuroinflammation and cognitive dysfunction. Ellagic acid is a naturally occurring polyphenol known to possess robust antioxidant property. In the present study, memory enhancing potential of ellagic acid has been explored against ICV colchicine induced dementia in rats. Colchicine (15μg/rat) was administered to Wistar rats (200g) through intracerebroventricular (ICV) route by using stereotaxic apparatus. ICV colchicine induces Alzheimer’s disease like changes in the brain such as rampant free radical production, neuroinflammation and selective neurodegeneration in hippocampus and cortex by acting as an antitubulin agent (mitotic poison). Ellagic acid (17.5 and 35 mg/kg, p.o.) was administered to rats for 25 successive days. Morris water maze and elevated plus maze paradigms were utilized to assess the spatial memory of rats. Oxidative stress biomarkers along with TNF-α were also measured in brain of rats. Ellagic acid prevented the ICV colchicine triggered cognitive deficits as evident by a significant (p<0.05) reduction in mean escape latency during acquisition trial and increased (p<0.05) time spent in target quadrant during probe trial in Morris water maze test, and reduction (p<0.05) in transfer latency in elevated plus maze test. Furthermore, both the doses of ellagic acid attenuated ICV colchicine induced rise in brain TBARS as well as TNF-α and simultaneously enhanced the GSH content.Ellagic acid prevented the brain of rodents from dementing effects of colchicine by attenuating the oxidative damage

Manual of 3D Echocardiography Manual of 3D Echocardiography Amuthan V. ed. Jaypee brothers medical publishers [P] ltd, New Delhi 2013.

Unknow

COMPARISON OF DENOISING FILTERS ON COLOUR TEM IMAGE FOR DIFFERENT NOISE

TEM (Transmission Electron Microscopy) is an important morphological characterization tool for Nanomaterials. Quite often a microscopy image gets corrupted by noise, which may arise in the process of acquiring the image, or during its transmission, or even during reproduction of the image. Removal of noise from an image is one of the most important tasks in image processing. Denoising techniques aim at reducing the statistical perturbations and recovering as well as possible the true underlying signal. Depending on the nature of the noise, such as additive or multiplicative type of noise, there are several approaches towards removing noise from an image. Image De-noising improves the quality of images acquired by optical, electro-optical or electronic microscopy. This paper compares five filters on the measures of mean of image, signal to noise ratio, peak signal to noise ratio & mean square error. In this paper four types of noise (Gaussian noise, Salt & Pepper noise, Speckle noise and Poisson noise) is used and image de-noising performed for different noise by various filters (WFDWT, BF, HMDF, FDE, DVROFT). Further results have been compared for all noises. It is observed that for Gaussian Noise WFDWT & for other noises HMDF has shown the better performance results

Anxiolytic activity of Angiotensin-Receptor-Blocker in Experimental Models of Anxiety in Mice

The present study aimed to explore the role of Angiotensin- Receptor-Blocker in the management of anxiety. Male Swiss albino mice of age 6-8 weeks and weight 25-30 g were used in the present study. Candesartan (Angiotensin receptor blocker) was administered in two doses (1 and 2 mg/kg; i.p.) to mice for 14 successive days regularly. Anxiety was induced in mice by two different methods: (i) exposing the mice to immobilization stress for a period of 6 h daily for 7 consecutive days; (ii) administration of caffeine (25 mg/kg; i.p.) daily for 7 days. Elevated Zero Maze and Open Field Apparatus were used to evaluate the level of anxiety in different groups. After behavioral evaluation, the animals were sacrificed and their brains were used for estimation TBARS, GSH and Nitrite levels in the brain. Administration of Candesartan (1 and 2 mg/kg; i.p) for 14 successive days significantly (p<0.05) reduced anxiety due to immobilization stress and caffeine induced anxiety. Candesartan (1and 2 mg/kg; i.p) treated mice showed an increase (p<0.05) in GSH levels while a decrease (p<0.05) in TBARS and nitrite levels in brain. Thus, candesartan may prove to be a useful remedy for the management of anxiety owing to its neuroprotective and antioxidant activity

An Exact Algorithm for Optimal Areal Positioning Problem with Rectangular Targets and Requests

In this thesis, we introduce a new class of problems, which we call Optimal Areal Positioning (OAP), and study a special form of these problems. OAPs have important applications in earth observation satellite management, tele-robotics, multi-camera control, and surveillance. In OAP, we would like to find the optimal position of a set of floating geometric objects (targets) on a two-dimensional plane to (partially) cover another set of fixed geometric objects (requests) in order to maximize the total reward obtained from covered parts of requests. In this thesis, we consider the special form of OAP in which targets and requests are parallel axes rectangles and targets are of equal size. A predetermined reward is associated with covering an area unit of each request. Based on the number of target rectangles, we classify rectangular OAP into two categories: Single Target Problem (STP) and Multi-Target Problem (MTP). The structure of MTP can be compared to the planar p-center which is NP-complete, if p is part of the input. In fact, we conjecture that MTP is NP-complete. The existing literature does not contain any work on MTP. The research contributions of this thesis are as follows: We develop new theoretical properties for the solution of STP and devised a new solution approach for it. This approach is based on a novel branch-and-bound (BB) algorithm devised over a reduced solution space. Branching is done using a clustering scheme. Our computational results show that in many cases our approach significantly outperforms the existing Plateau Vertex Traversal and brute force algorithms, especially for problems with many requests appearing in clusters over a large region. We perform a theoretical study of MTP for the first time and prove several theoretical properties for its solution. We have introduced a reduced solution space using these properties. We present the first exact algorithm to solve MTP. This algorithm has a branch-and-bound framework. The reduced solution space calls for a novel branching strategy for MTP. The algorithm has a main branch-and-bound tree with a special structure along with two trees (one for each axis) to store the information required for branching in the main tree in an efficient format. Branching is done using a clustering scheme. We perform computational experiments to evaluate the performance of our algorithm. Our algorithm solves relatively large instances of MTP in a short time

RIFAXIMIN INDUCED HYPONATREMIA: A CASE REPORT

ABSTRACTRifaximin is one of the common drugs used in clinical practice in the management of traveler's diarrhea, irritable bowel syndrome (IBS), and hepaticencephalopathy. Hyponatremia is one of the rare side effects of this drug. We hereby present the case of a middle-aged woman who was a known caseof IBS: Diarrhea predominant who developed symptoms of hyponatremia after a short duration of rifaximin treatment, no other cause of hyponatremiawas found on evaluation, so we suspect this as a rare side effect of rifaximin therapy.Keywords: Rifaximin, Hyponatremia, Irritable bowel syndrome

Certain Mathieu-type Series Pertaining to Incomplete H-Functions

In the present article, we derive closed integral form expressions for a family of convergent Mathieu type a-series along with its alternating variants, whose terms contain incomplete H-functions, which are a notable generalization of familiar H-function. The results established herewith are very general in nature and provide an exquisite generalization of closed integral form expressions of aforementioned series whose terms contain H-function and Fox-Wright function, respectively. Next, we present some new and interesting special cases of our main results