Various vision tasks require the computation of image statistics and aggregating them into histograms. These histograms are usually compared using the χ distance which gives a rough idea of the similarity of the two image patches. For example, in [2] a histogram of key-points is collected on a rectangular grid for the category recognition task. Other researchers, [3], have used local image stat...

MOTIVATION Species tree estimation in the presence of incomplete lineage sorting (ILS) is a major challenge for phylogenomic analysis. Although many methods have been developed for this problem, little is understood about the relative performance of these methods when estimated gene trees are poorly estimated, owing to inadequate phylogenetic signal. RESULTS We explored the performance of som...

Allowing the input auxiliary random variables to be correlated and using the binning scheme, the HanKobayashi (HK) rate region for general interference channel is partially improved. The obtained partially new achievable rate region (i) is compared to the HK region and its simplified description, i.e., Chong-Motani-Garg (CMG) region, in a detailed and favorable manner, by considering different ...

Mutual information (MI) is a powerful method for detecting relationships between data sets. There are accurate methods for estimating MI that avoid problems with "binning" when both data sets are discrete or when both data sets are continuous. We present an accurate, non-binning MI estimator for the case of one discrete data set and one continuous data set. This case applies when measuring, for...

We consider a relay network with two relays and two feedback links from the relays to the sender. To obtain the achievability results, we use the compress-and-forward and the decode-and-forward strategies to superimpose facility and cooperation analogue to what proposed by Cover and El Gamal for a relay channel. In addition to random binning, we use deterministic binning to perform restricted d...

We investigate compression of remote sensing images with a special geometry of non-square pixels. Two fundamentally different data reduction strategies are compared: a combination of pixel binning with near lossless compression and a method operating at higher compression rates. To measure the real impact of the compression, the image processing flow upto final products is included in the exper...

Allowing the input auxiliary random variables to be correlated and using the binning scheme, the HanKobayashi (HK) rate region for general interference channel is improved. The obtained new achievable rate region (i) is shown to encompass the HK region and its simplified description, i.e., Chong-Motani-Garg (CMG) region, considering a detailed and favorable comparison between different versions...

Wind turbines require methods to predict the power produced as inflow conditions change. We compare the standard method of binning with a turbulence renormalization method and a machine learning approach using a data set derived from simulations. The method of binning is unable to cope with changes in turbulence; the turbulence renormalization method cannot account for changes in shear other th...

Proving capacity for networks without feedback or cooperation usually involves two fundamental random coding techniques: superposition coding and binning. Although conceptually very different, these two techniques often achieve the same performance, suggesting an underlying similarity. In this correspondence we propose a new random coding technique that generalizes superposition coding and binn...

Motivation BioBin is an automated bioinformatics tool for the multi-level biological binning of sequence variants. Herein, we present a significant update to BioBin which expands the software to facilitate a comprehensive rare variant analysis and incorporates novel features and analysis enhancements. Results In BioBin 2.3, we extend our software tool by implementing statistical association t...