Global Optimal Image Reconstruction from Blurred Noisy Data by a Bayesian Approach

In this paper, a procedure is presented which allows the optimal reconstruction of images from blurred noisy data. The procedure relies on a general Bayesian approach, which makes proper use of all the available information. Special attention is devoted to the informative content of the edges; thus, a preprocessing phase is included, with the aim of estimating the jump sizes in the gray level. The optimization phase follows; existence and uniqueness of the solution is secured. The procedure is tested against simple simulated data and real data.     

Effect of stoichiometry on liquid crystalline supramolecular polymers formed with complementary nucleobase pair interactions

We report herein studies on the liquid crystalline behavior of a series of supramolecular materials that contain different ratios of two complementary symmetrically-substituted alkoxy-bis(phenylethynyl)benzene AA- and BB-type monomers. One monomer has thymine units placed at either end of the rigid mesogenic core, while the other has N⁶-(4-methoxybenzoyl)-adenine units placed on the ends. Differential scanning calorimetric and polarized optical microscopy studies have been carried out on these systems. These studies show that the material's behavior is strongly dependent on its thermal history. As a result, the materials can exhibit, on heating, either a liquid crystalline phase, a crystalline phase, or the coexistence of crystalline and liquid crystalline regions. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 5049–5059, 2006     

Bounds on Codes Derived by Counting Components in Varshamov Graphs

We are interested in improving the Varshamov bound for finite values of length n and minimum distance d. We employ a counting lemma to this end which we find particularly useful in relation to Varshamov graphs. Since a Varshamov graph consists of components corresponding to low weight vectors in the cosets of a code it is a useful tool when trying to improve the estimates involved in the Varshamov bound. We consider how the graph can be iteratively constructed and using our observations are able to achieve a reduction in the over-counting which occurs. This tightens the lower bound for any choice of parameters n, k, d or q and is not dependent on information such as the weight distribution of a code. This work is taken from the author’s thesis [10]