Clutter within information visualization (infovis) systems is an area of continuing concern and is receiving increasing research interest. Solutions to the problem vary in their approach, ranging from novel visualizations designed specifically to cope with high data density, through to statistical methodologies such as binning. This paper presents a flexible method that allows interactive place...

This study investigates ways to improve the performance of rice productivity prediction model by employing the infrequent data binning method. Binning in this study is a technique to reassign infrequent data outside a specific scope, back in to the boundary value of the scope. The main findings of this study include: first, the binning method based on reassigning infrequent data contributes to ...

Noisy network coding is recently proposed for the general multi-source network by Lim, Kim, El Gamal and Chung. This scheme builds on compress-forward (CF) relaying but involves three new ideas, namely no Wyner-Ziv binning, relaxed simultaneous decoding and message repetition. In this paper, using the two-way relay channel as the underlining example, we analyze the impact of each of these ideas...

................................................................................................................................ 1 Declaration ............................................................................................................................ 2 Copyright ........................................................................................................................

Pixel binning refers to the concept of combining the electrical charges of neighboring pixels together to form a superpixel. The main benefit of this technique is that the combined charges would overcome the read noise at the sacrifice of spatial resolution. Binning in color image sensors results in superpixel Bayer pattern data, and subsequent demosaicking yields the final, lower resolution, l...

This paper investigates the optimality of the binning approach in distributed source coding for both uniform and nonuniform sources. While the algebraic binning scheme is optimal for uniform sources both asymptotically and at finite lengths, it is shown that the optimality holds only asymptotically for nonuniform sources. Highperformance turbo codes are used with the binning scheme on several s...

MOTIVATION Metagenomic binning remains an important topic in metagenomic analysis. Existing unsupervised binning methods for next-generation sequencing (NGS) reads do not perform well on (i) samples with low-abundance species or (ii) samples (even with high abundance) when there are many extremely low-abundance species. These two problems are common for real metagenomic datasets. Binning method...

BACKGROUND Rapid advancement of next generation sequencing technologies such as whole genome sequencing (WGS) has facilitated the search for genetic factors that influence disease risk in the field of human genetics. To identify rare variants associated with human diseases or traits, an efficient genome-wide binning approach is needed. In this study we developed a novel biological knowledge-bas...