An Inverse Problem for Localization Operators

A classical result of time-frequency analysis, obtained by I. Daubechies in 1988, states that the eigenfunctions of a time-frequency localization operator with circular localization domain and Gaussian analysis window are the Hermite functions. In this contribution, a converse of Daubechies' theorem is proved. More precisely, it is shown that, for simply connected localization domains, if one of the eigenfunctions of a time-frequency localization operator with Gaussian window is a Hermite function, then its localization domain is a disc. The general problem of obtaining, from some knowledge of its eigenfunctions, information about the symbol of a time-frequency localization operator, is denoted as the inverse problem, and the problem studied by Daubechies as the direct problem of time-frequency analysis. Here, we also solve the corresponding problem for wavelet localization, providing the inverse problem analogue of the direct problem studied by Daubechies and Paul.Comment: 18 pages, 1 figur

Epoxidation of Allylic Alcohols with TiO2-SiO2: Hydroxy-Assisted Mechanism and Dynamic Structural Changes During Reaction

Epoxidation of allylic alcohols and cyclohexene with TBHP and titania-silica aerogels containing 1 and 5 wt% TiO2 has been studied. For the oxidation of geraniol and cyclohexenol, the regio- and diastereoselectivities and kinetic data indicate an OH-assisted mechanism involving a dative bond between the OH group and the Ti site. This mechanism is disabled in the oxidation of cyclooctenol due to steric hindrance. The moderate regio- and diastereoselectivities of the aerogels, compared with those of TS-1 and the homogeneous model Ti(OSiMe3)4, are attributed to the presence of non-isolated Ti sites and to a "silanol-assisted” mechanism, according to which model the allylic alcohol is anchored to a neighboring SiOH group instead of the Ti-peroxo complex. Kinetic analysis of the initial transient period revealed rapid catalyst restructuring during the first few turnovers. A feasible explanation is the breaking of Si-O-Ti linkages of the carefully predried aerogels by water or TBHP, resulting in active Ti sites with remarkably different catalytic propertie

Coadsorption of Cinchona Alkaloids on Supported Palladium: Nonlinear Effects in Asymmetric Hydrogenation and Resistance of Alkaloids Against Hydrogenation

The transient behavior of the adsorption of cinchona alkaloid modifiers on Pd/TiO2 has been investigated in situ during the enantioselective hydrogenation of 4-methoxy-6-methyl-2-pyrone (1). Modifier mixtures consisting of pairs of alkaloids that alone afford the opposite enantiomers in comparable excess were applied to probe the adsorption behavior and possible nonlinear phenomena. Complementary information has been gathered from an indirect UV-vis study of the adsorption and hydrogenation of cinchonidine and quinidine on Pd/TiO2. The striking nonlinear behavior of cinchonidine-quinidine and cinchonine-quinine pairs in the hydrogenation of 1, and in the competitive saturation of the quinoline rings of the alkaloids, is attributed to differences in the adsorption strength and geometry of the alkaloids. The results are in good agreement with our former mechanistic model assuming that the quinoline ring of cinchona alkaloid and 1 adsorb parallel to the Pd surface during the enantiodifferentiating ste

Delay-Coordinates Embeddings as a Data Mining Tool for Denoising Speech Signals

In this paper we utilize techniques from the theory of non-linear dynamical systems to define a notion of embedding threshold estimators. More specifically we use delay-coordinates embeddings of sets of coefficients of the measured signal (in some chosen frame) as a data mining tool to separate structures that are likely to be generated by signals belonging to some predetermined data set. We describe a particular variation of the embedding threshold estimator implemented in a windowed Fourier frame, and we apply it to speech signals heavily corrupted with the addition of several types of white noise. Our experimental work seems to suggest that, after training on the data sets of interest,these estimators perform well for a variety of white noise processes and noise intensity levels. The method is compared, for the case of Gaussian white noise, to a block thresholding estimator

On adaptive wavelet estimation of a class of weighted densities

We investigate the estimation of a weighted density taking the form $g=w(F)f$, where $f$ denotes an unknown density, $F$ the associated distribution function and $w$ is a known (non-negative) weight. Such a class encompasses many examples, including those arising in order statistics or when $g$ is related to the maximum or the minimum of $N$ (random or fixed) independent and identically distributed (\iid) random variables. We here construct a new adaptive non-parametric estimator for $g$ based on a plug-in approach and the wavelets methodology. For a wide class of models, we prove that it attains fast rates of convergence under the $\mathbb{L}_p$ risk with $p\ge 1$ (not only for $p = 2$ corresponding to the mean integrated squared error) over Besov balls. The theoretical findings are illustrated through several simulations

Multiscale 3D Shape Analysis using Spherical Wavelets

©2005 Springer. The original publication is available at www.springerlink.com: http://dx.doi.org/10.1007/11566489_57DOI: 10.1007/11566489_57Shape priors attempt to represent biological variations within a population. When variations are global, Principal Component Analysis (PCA) can be used to learn major modes of variation, even from a limited training set. However, when significant local variations exist, PCA typically cannot represent such variations from a small training set. To address this issue, we present a novel algorithm that learns shape variations from data at multiple scales and locations using spherical wavelets and spectral graph partitioning. Our results show that when the training set is small, our algorithm significantly improves the approximation of shapes in a testing set over PCA, which tends to oversmooth data

Quasi-local evolution of cosmic gravitational clustering in the weakly non-linear regime

We investigate the weakly non-linear evolution of cosmic gravitational clustering in phase space by looking at the Zel'dovich solution in the discrete wavelet transform (DWT) representation. We show that if the initial perturbations are Gaussian, the relation between the evolved DWT mode and the initial perturbations in the weakly non-linear regime is quasi-local. That is, the evolved density perturbations are mainly determined by the initial perturbations localized in the same spatial range. Furthermore, we show that the evolved mode is monotonically related to the initial perturbed mode. Thus large (small) perturbed modes statistically correspond to the large (small) initial perturbed modes. We test this prediction by using QSO Ly$\alpha$ absorption samples. The results show that the weakly non-linear features for both the transmitted flux and identified forest lines are quasi-localized. The locality and monotonic properties provide a solid basis for a DWT scale-by-scale Gaussianization reconstruction algorithm proposed by Feng & Fang (Feng & Fang, 2000) for data in the weakly non-linear regime. With the Zel'dovich solution, we find also that the major non-Gaussianity caused by the weakly non-linear evolution is local scale-scale correlations. Therefore, to have a precise recovery of the initial Gaussian mass field, it is essential to remove the scale-scale correlations.Comment: 22 pages, 13 figures. Accepted for publication in the Astrophysical Journa

A survey of parallel algorithms for fractal image compression

This paper presents a short survey of the key research work that has been undertaken in the application of parallel algorithms for Fractal image compression. The interest in fractal image compression techniques stems from their ability to achieve high compression ratios whilst maintaining a very high quality in the reconstructed image. The main drawback of this compression method is the very high computational cost that is associated with the encoding phase. Consequently, there has been significant interest in exploiting parallel computing architectures in order to speed up this phase, whilst still maintaining the advantageous features of the approach. This paper presents a brief introduction to fractal image compression, including the iterated function system theory upon which it is based, and then reviews the different techniques that have been, and can be, applied in order to parallelize the compression algorithm

Deep Regionlets for Object Detection

In this paper, we propose a novel object detection framework named "Deep Regionlets" by establishing a bridge between deep neural networks and conventional detection schema for accurate generic object detection. Motivated by the abilities of regionlets for modeling object deformation and multiple aspect ratios, we incorporate regionlets into an end-to-end trainable deep learning framework. The deep regionlets framework consists of a region selection network and a deep regionlet learning module. Specifically, given a detection bounding box proposal, the region selection network provides guidance on where to select regions to learn the features from. The regionlet learning module focuses on local feature selection and transformation to alleviate local variations. To this end, we first realize non-rectangular region selection within the detection framework to accommodate variations in object appearance. Moreover, we design a "gating network" within the regionlet leaning module to enable soft regionlet selection and pooling. The Deep Regionlets framework is trained end-to-end without additional efforts. We perform ablation studies and conduct extensive experiments on the PASCAL VOC and Microsoft COCO datasets. The proposed framework outperforms state-of-the-art algorithms, such as RetinaNet and Mask R-CNN, even without additional segmentation labels.Comment: Accepted to ECCV 201

Quantitative Regular Expressions for Arrhythmia Detection Algorithms

Motivated by the problem of verifying the correctness of arrhythmia-detection algorithms, we present a formalization of these algorithms in the language of Quantitative Regular Expressions. QREs are a flexible formal language for specifying complex numerical queries over data streams, with provable runtime and memory consumption guarantees. The medical-device algorithms of interest include peak detection (where a peak in a cardiac signal indicates a heartbeat) and various discriminators, each of which uses a feature of the cardiac signal to distinguish fatal from non-fatal arrhythmias. Expressing these algorithms' desired output in current temporal logics, and implementing them via monitor synthesis, is cumbersome, error-prone, computationally expensive, and sometimes infeasible. In contrast, we show that a range of peak detectors (in both the time and wavelet domains) and various discriminators at the heart of today's arrhythmia-detection devices are easily expressible in QREs. The fact that one formalism (QREs) is used to describe the desired end-to-end operation of an arrhythmia detector opens the way to formal analysis and rigorous testing of these detectors' correctness and performance. Such analysis could alleviate the regulatory burden on device developers when modifying their algorithms. The performance of the peak-detection QREs is demonstrated by running them on real patient data, on which they yield results on par with those provided by a cardiologist.Comment: CMSB 2017: 15th Conference on Computational Methods for Systems Biolog