Approximate Nearest Neighbour Field based Optic Disk Detection

Approximate Nearest Neighbour Field maps are commonly used by computer vision and graphics community to deal with problems like image completion, retargetting, denoising, etc. In this paper, we extend the scope of usage of ANNF maps to medical image analysis, more specifically to optic disk detection in retinal images. In the analysis of retinal images, optic disk detection plays an important role since it simplifies the segmentation of optic disk and other retinal structures. The proposed approach uses FeatureMatch, an ANNF algorithm, to find the correspondence between a chosen optic disk reference image and any given query image. This correspondence provides a distribution of patches in the query image that are closest to patches in the reference image. The likelihood map obtained from the distribution of patches in query image is used for optic disk detection. The proposed approach is evaluated on five publicly available DIARETDB0, DIARETDB1, DRIVE, STARE and MESSIDOR databases, with total of 1540 images. We show, experimentally, that our proposed approach achieves an average detection accuracy of 99% and an average computation time of 0.2 s per image. (C) 2013 Elsevier Ltd. All rights reserved.

Low complexity joint estimation of synchronization impairments in sparse channel for MIMO-OFDM system

Low complexity joint estimation of synchronization impairments and channel in a single-user MIMO-OFDM system is presented in this paper. Based on a system model that takes into account the effects of synchronization impairments such as carrier frequency offset, sampling frequency offset, and symbol timing error, and channel, a Maximum Likelihood (ML) algorithm for the joint estimation is proposed. To reduce the complexity of ML grid search, the number of received signal samples used for estimation need to be reduced. The conventional channel estimation techniques using Least-Squares (LS) or Maximum a posteriori (MAP) methods fail for the reduced sample under-determined system, which results in poor performance of the joint estimator. The proposed ML algorithm uses Compressed Sensing (CS) based channel estimation method in a sparse fading scenario, where the received samples used for estimation are less than that required for an LS or MAP based estimation. The performance of the estimation method is studied through numerical simulations, and it is observed that CS based joint estimator performs better than LS and MAP based joint estimator. (C) 2013 Elsevier GmbH. All rights reserved.

Representative seismic hazard map of Coimbatore, India

The seismic hazard value of any region depends upon three important components such as probable earthquake location, maximum earthquake magnitude and the attenuation equation. This paper presents a representative way of estimating these three important components considering region specific seismotectonic features. Rupture Based Seismic Hazard Analysis (RBSHA) given by Anbazhagan et al. (2011) is used to determine the probable future earthquake locations. This approach is verified on the earthquake data of Bhuj region. The probable earthquake location for this region is identified considering earthquake data till the year 2000. These identified locations match well with the reported locations after 2000. The further Coimbatore City is selected as the study area to develop a representative seismic hazard map using RBSHA approach and to compare with deterministic seismic hazard analysis. Probable future earthquake zones for Coimbatore are located considering the rupture phenomenon as per energy release theory discussed by Anbazhagan et at (2011). Rupture character of the region has been established by estimating the subsurface rupture length of each source and normalized with respect to the length of the source. Average rupture length of the source with respect to its total length is found to be similar for most of the sources in the region, which is called as the rupture character of the region. Maximum magnitudes of probable zones are estimated considering seismic sources close by and regional rupture character established. Representative GMPEs for the study area have been selected by carrying out efficacy test through an average log likelihood value (LLH) as ranking estimator and considering the Isoseismal map. New seismic hazard map of Coimbatore has been developed using the above regional representative parameters of probable earthquake locations, maximum earthquake magnitude and best suitable GMPEs. The new hazard map gives acceleration values at bedrock for maximum possible earthquakes. These results are compared with deterministic seismic hazard map and recently published probabilistic seismic hazard values. (C) 2014 Elsevier B.V. All rights reserved.

Lattice Reduction Aided Detection in Large-MIMO Systems

Lattice reduction (LR) aided detection algorithms are known to achieve the same diversity order as that of maximum-likelihood (ML) detection at low complexity. However, they suffer SNR loss compared to ML performance. The SNR loss is mainly due to imperfect orthogonalization and imperfect nearest neighbor quantization. In this paper, we propose an improved LR-aided (ILR) detection algorithm, where we specifically target to reduce the effects of both imperfect orthogonalization and imperfect nearest neighbor quantization. The proposed ILR detection algorithm is shown to achieve near-ML performance in large-MIMO systems and outperform other LR-aided detection algorithms in the literature. Specifically, the SNR loss incurred by the proposed ILR algorithm compared to ML performance is just 0.1 dB for 4-QAM and < 0.5 dB for 16-QAM in 16 x 16 V-BLAST MIMO system. This performance is superior compared to those of other LR-aided detection algorithms, whose SNR losses are in the 2 dB to 9 dB range.

On the systematic position of some Asian enigmatic genera of Asclepiadoideae (Apocynaceae)

The phylogenetic structure of Asclepiadoideae (Apocynaceae) has been elucidated at the tribal and subtribal levels in the last two decades. However, to date, the systematic positions of seven Asian genera, Cosmostigma, Graphistemma, Holostemma, Pentasachme, Raphistemma, Seshagiria and Treutlera, have not been investigated. In this study, we examine the evolutionary relationships among these seven small enigmatic Asian genera and clarify their positions in Asclepiadoideae, using a combination of plastid sequences of rbcL, rps16, trnL and trnL- F regions. Cosmostigma and Treutlera are resolved as members of the non-Hoya clade of Marsdenieae with strong support (maximum parsimony bootstrap support value BSMP = 96, maximum likelihood bootstrap support value BSML = 98, Bayesian-inferred posterior probability PP = 1.0). Pentasachme is resolved as sister of Stapeliinae to Ceropegieae with moderate support (BSMP = 64, BSML = 66, PP = 0.94). Graphistemma, Holostemma, Raphistemma and Seshagiria are all nested in the Asclepiadeae-Cynanchinae clade (BSMP = 97, BSML = 100, PP = 1.0). The study confirms the generally accepted tribal and subtribal structure of the subfamily. One exception is Eustegia minuta, which is placed here as sister to all Asclepiadeae (BSMP = 58, BSML = 76, PP = 0.99) and not as sister to the Marsdenieae + Ceropegieae clade. The weak support and conflicting position indicate the need for a placement of Eustegia as an independent tribe. In Asclepiadeae, a sister group position of Cynanchinae to the Asclepiadinae + Tylophorinae clade is favoured (BSMP = 84, BSML = 88, PP = 1.0), whereas Schizostephanus is retrieved as unresolved. Oxystelma appears as an early-branching member of Asclepiadinae with weak support (BSMP = 52, BSML = 74, PP = 0.69). Calciphila and Solenostemma are also associated with Asclepiadinae with weak support (BSMP = 37, BSML = 45, PP = 0.79), but all alternative positions are essentially without support. The position of Indian Asclepiadoideae in the family phylogeny is discussed. (c) 2014 The Linnean Society of London, Botanical Journal of the Linnean Society, 2014, 174, 601-619.

Group behaviour in physical, chemical and biological systems

Groups exhibit properties that either are not perceived to exist, or perhaps cannot exist, at the individual level. Such `emergent' properties depend on how individuals interact, both among themselves and with their surroundings. The world of everyday objects consists of material entities. These are, ultimately, groups of elementary particles that organize themselves into atoms and molecules, occupy space, and so on. It turns out that an explanation of even the most commonplace features of this world requires relativistic quantum field theory and the fact that Planck's constant is discrete, not zero. Groups of molecules in solution, in particular polymers ('sols'), can form viscous clusters that behave like elastic solids ('gels'). Sol-gel transitions are examples of cooperative phenomena. Their occurrence is explained by modelling the statistics of inter-unit interactions: the likelihood of either state varies sharply as a critical parameter crosses a threshold value. Group behaviour among cells or organisms is often heritable and therefore can evolve. This permits an additional, typically biological, explanation for it in terms of reproductive advantage, whether of the individual or of the group. There is no general agreement on the appropriate explanatory framework for understanding group-level phenomena in biology.

K-plane regression

In this paper, we present a novel algorithm for piecewise linear regression which can learn continuous as well as discontinuous piecewise linear functions. The main idea is to repeatedly partition the data and learn a linear model in each partition. The proposed algorithm is similar in spirit to k-means clustering algorithm. We show that our algorithm can also be viewed as a special case of an EM algorithm for maximum likelihood estimation under a reasonable probability model. We empirically demonstrate the effectiveness of our approach by comparing its performance with that of the state of art algorithms on various datasets. (C) 2014 Elsevier Inc. All rights reserved.

Combinatorial Crystal Synthesis: Structural Landscape of Phloroglucinol:1,2-bis(4-pyridyl)ethylene and Phloroglucinol:Phenazine

A large number of crystal forms, polymorphs and pseudopolymorphs, have been isolated in the phloroglucinol-dipyridylethylene (PGL:DPE) and phloroglucinol-phenazine (PGL:PHE) systems. An understanding of the intermolecular interactions and synthon preferences in these binary systems enables one to design a ternary molecular solid that consists of PGL, PHE, and DPE, and also others where DPE is replaced by other heterocycles. Clean isolation of these ternary cocrystals demonstrates synthon amplification during crystallization. These results point to the lesser likelihood of polymorphism in multicomponent crystals compared to single-component crystals. The appearance of several crystal forms during crystallization of a multicomponent system can be viewed as combinatorial crystal synthesis with synthon selection from a solution library. The resulting polymorphs and pseudopolymorphs that are obtained constitute a crystal structure landscape.

Adaptive evolution of a novel avian-origin influenza A/H7N9 virus

In China, the recent outbreak of novel influenza A/H7N9 virus has been assumed to be severe, and it may possibly turn brutal in the near future. In order to develop highly protective vaccines and drugs for the A/H7N9 virus, it is critical to find out the selection pressure of each amino acid site. In the present study, six different statistical methods consisting of four independent codon-based maximum likelihood (CML) methods, one hierarchical Bayesian (HB) method and one branch-site (BS) method, were employed to determine if each amino acid site of A/H7N9 virus is under natural selection pressure. Functions for both positively and negatively selected sites were inferred by annotating these sites with experimentally verified amino acid sites. Comprehensively, the single amino acid site 627 of PB2 protein was inferred as positively selected and it function was identified as a T-cell epitope (TCE). Among the 26 negatively selected amino acid sites of PB2, PB1, PA, HA, NP, NA, M1 and NS2 proteins, only 16 amino acid sites were identified to be involved in TCEs. In addition, 7 amino acid sites including, 608 and 609 of PA, 480 of NP, and 24, 25, 109 and 205 of M1, were identified to be involved in both B-cell epitopes (BCEs) and TCEs. Conversely, the function of positions 62 of PA, and, 43 and 113 of HA was unknown. In conclusion, the seven amino acid sites engaged in both BCEs and TCEs were identified as highly suitable targets, as these sites will be predicted to play a principal role in inducing strong humoral and cellular immune responses against A/H7N9 virus. (C) 2014 Elsevier Inc. All rights reserved.

Multispectral Bayesian reconstruction technique for real-time two color fluorescence microscopy

We have developed a real-time imaging method for two-color wide-field fluorescence microscopy using a combined approach that integrates multi-spectral imaging and Bayesian image reconstruction technique. To enable simultaneous observation of two dyes (primary and secondary), we exploit their spectral properties that allow parallel recording in both the channels. The key advantage of this technique is the use of a single wavelength of light to excite both the primary dye and the secondary dye. The primary and secondary dyes respectively give rise to fluorescence and bleed-through signal, which after normalization were merged to obtain two-color 3D images. To realize real-time imaging, we employed maximum likelihood (ML) and maximum a posteriori (MAP) techniques on a high-performance computing platform (GPU). The results show two-fold improvement in contrast while the signal-to-background ratio (SBR) is improved by a factor of 4. We report a speed boost of 52 and 350 for 2D and 3D images respectively. Using this system, we have studied the real-time protein aggregation in yeast cells and HeLa cells that exhibits dot-like protein distribution. The proposed technique has the ability to temporally resolve rapidly occurring biological events.

Using long time series of agricultural-derived nitrates for estimating catchment transit times

The estimation of water and solute transit times in catchments is crucial for predicting the response of hydrosystems to external forcings (climatic or anthropogenic). The hydrogeochemical signatures of tracers (either natural or anthropogenic) in streams have been widely used to estimate transit times in catchments as they integrate the various processes at stake. However, most of these tracers are well suited for catchments with mean transit times lower than about 4-5 years. Since the second half of the 20th century, the intensification of agriculture led to a general increase of the nitrogen load in rivers. As nitrate is mainly transported by groundwater in agricultural catchments, this signal can be used to estimate transit times greater than several years, even if nitrate is not a conservative tracer. Conceptual hydrological models can be used to estimate catchment transit times provided their consistency is demonstrated, based on their ability to simulate the stream chemical signatures at various time scales and catchment internal processes such as N storage in groundwater. The objective of this study was to assess if a conceptual lumped model was able to simulate the observed patterns of nitrogen concentration, at various time scales, from seasonal to pluriannual and thus if it was relevant to estimate the nitrogen transit times in headwater catchments. A conceptual lumped model, representing shallow groundwater flow as two parallel linear stores with double porosity, and riparian processes by a constant nitrogen removal function, was applied on two paired agricultural catchments which belong to the Research Observatory ORE AgrHys. The Global Likelihood Uncertainty Estimation (GLUE) approach was used to estimate parameter values and uncertainties. The model performance was assessed on (i) its ability to simulate the contrasted patterns of stream flow and stream nitrate concentrations at seasonal and inter-annual time scales, (ii) its ability to simulate the patterns observed in groundwater at the same temporal scales, and (iii) the consistency of long-term simulations using the calibrated model and the general pattern of the nitrate concentration increase in the region since the beginning of the intensification of agriculture in the 1960s. The simulated nitrate transit times were found more sensitive to climate variability than to parameter uncertainty, and average values were found to be consistent with results from others studies in the same region involving modeling and groundwater dating. This study shows that a simple model can be used to simulate the main dynamics of nitrogen in an intensively polluted catchment and then be used to estimate the transit times of these pollutants in the system which is crucial to guide mitigation plans design and assessment. (C) 2015 Elsevier B.V. All rights reserved.

B-Spline potential function for maximum a-posteriori image reconstruction in fluorescence microscopy

An iterative image reconstruction technique employing B-Spline potential function in a Bayesian framework is proposed for fluorescence microscopy images. B-splines are piecewise polynomials with smooth transition, compact support and are the shortest polynomial splines. Incorporation of the B-spline potential function in the maximum-a-posteriori reconstruction technique resulted in improved contrast, enhanced resolution and substantial background reduction. The proposed technique is validated on simulated data as well as on the images acquired from fluorescence microscopes (widefield, confocal laser scanning fluorescence and super-resolution 4Pi microscopy). A comparative study of the proposed technique with the state-of-art maximum likelihood (ML) and maximum-a-posteriori (MAP) with quadratic potential function shows its superiority over the others. B-Spline MAP technique can find applications in several imaging modalities of fluorescence microscopy like selective plane illumination microscopy, localization microscopy and STED. (C) 2015 Author(s).

Jet substructure and probes of CP violation in Vh production

We analyse the hVV (V = W, Z) vertex in a model independent way using Vh production. To that end, we consider possible corrections to the Standard Model Higgs Lagrangian, in the form of higher dimensional operators which parametrise the effects of new physics. In our analysis, we pay special attention to linear observables that can be used to probe CP violation in the same. By considering the associated production of a Higgs boson with a vector boson (W or Z), we use jet substructure methods to define angular observables which are sensitive to new physics effects, including an asymmetry which is linearly sensitive to the presence of CP odd effects. We demonstrate how to use these observables to place bounds on the presence of higher dimensional operators, and quantify these statements using a log likelihood analysis. Our approach allows one to probe separately the hZZ and hWW vertices, involving arbitrary combinations of BSM operators, at the Large Hadron Collider.

Wireless scheduling with partial channel state information: large deviations and optimality

We consider a server serving a time-slotted queued system of multiple packet-based flows, where not more than one flow can be serviced in a single time slot. The flows have exogenous packet arrivals and time-varying service rates. At each time, the server can observe instantaneous service rates for only a subset of flows ( selected from a fixed collection of observable subsets) before scheduling a flow in the subset for service. We are interested in queue length aware scheduling to keep the queues short. The limited availability of instantaneous service rate information requires the scheduler to make a careful choice of which subset of service rates to sample. We develop scheduling algorithms that use only partial service rate information from subsets of channels, and that minimize the likelihood of queue overflow in the system. Specifically, we present a new joint subset-sampling and scheduling algorithm called Max-Exp that uses only the current queue lengths to pick a subset of flows, and subsequently schedules a flow using the Exponential rule. When the collection of observable subsets is disjoint, we show that Max-Exp achieves the best exponential decay rate, among all scheduling algorithms that base their decision on the current ( or any finite past history of) system state, of the tail of the longest queue. To accomplish this, we employ novel analytical techniques for studying the performance of scheduling algorithms using partial state, which may be of independent interest. These include new sample-path large deviations results for processes obtained by non-random, predictable sampling of sequences of independent and identically distributed random variables. A consequence of these results is that scheduling with partial state information yields a rate function significantly different from scheduling with full channel information. In the special case when the observable subsets are singleton flows, i.e., when there is effectively no a priori channel state information, Max-Exp reduces to simply serving the flow with the longest queue; thus, our results show that to always serve the longest queue in the absence of any channel state information is large deviations optimal.

Generalized Spatial Modulation in Large-Scale Multiuser MIMO Systems

Generalized spatial modulation (GSM) uses n(t) transmit antenna elements but fewer transmit radio frequency (RF) chains, n(rf). Spatial modulation (SM) and spatial multiplexing are special cases of GSM with n(rf) = 1 and n(rf) = n(t), respectively. In GSM, in addition to conveying information bits through n(rf) conventional modulation symbols (for example, QAM), the indices of the n(rf) active transmit antennas also convey information bits. In this paper, we investigate GSM for large-scale multiuser MIMO communications on the uplink. Our contributions in this paper include: 1) an average bit error probability (ABEP) analysis for maximum-likelihood detection in multiuser GSM-MIMO on the uplink, where we derive an upper bound on the ABEP, and 2) low-complexity algorithms for GSM-MIMO signal detection and channel estimation at the base station receiver based on message passing. The analytical upper bounds on the ABEP are found to be tight at moderate to high signal-to-noise ratios (SNR). The proposed receiver algorithms are found to scale very well in complexity while achieving near-optimal performance in large dimensions. Simulation results show that, for the same spectral efficiency, multiuser GSM-MIMO can outperform multiuser SM-MIMO as well as conventional multiuser MIMO, by about 2 to 9 dB at a bit error rate of 10(-3). Such SNR gains in GSM-MIMO compared to SM-MIMO and conventional MIMO can be attributed to the fact that, because of a larger number of spatial index bits, GSM-MIMO can use a lower-order QAM alphabet which is more power efficient.