Search results for "COMPRESSION"

Perceptually Optimized Image Rendering

2017

We develop a framework for rendering photographic images by directly optimizing their perceptual similarity to the original visual scene. Specifically, over the set of all images that can be rendered on a given display, we minimize the normalized Laplacian pyramid distance (NLPD), a measure of perceptual dissimilarity that is derived from a simple model of the early stages of the human visual system. When rendering images acquired with a higher dynamic range than that of the display, we find that the optimization boosts the contrast of low-contrast features without introducing significant artifacts, yielding results of comparable visual quality to current state-of-the-art methods, but witho…

Improving table compression with combinatorial optimization

2002

We study the problem of compressing massive tables within the partition-training paradigm introduced by Buchsbaum et al. [SODA'00], in which a table is partitioned by an off-line training procedure into disjoint intervals of columns, each of which is compressed separately by a standard, on-line compressor like gzip. We provide a new theory that unifies previous experimental observations on partitioning and heuristic observations on column permutation, all of which are used to improve compression rates. Based on the theory, we devise the first on-line training algorithms for table compression, which can be applied to individual files, not just continuously operating sources; and also a new, …

The rightmost equal-cost position problem.

2013

LZ77-based compression schemes compress the input text by replacing factors in the text with an encoded reference to a previous occurrence formed by the couple (length, offset). For a given factor, the smallest is the offset, the smallest is the resulting compression ratio. This is optimally achieved by using the rightmost occurrence of a factor in the previous text. Given a cost function, for instance the minimum number of bits used to represent an integer, we define the Rightmost Equal-Cost Position (REP) problem as the problem of finding one of the occurrences of a factor whose cost is equal to the cost of the rightmost one. We present the Multi-Layer Suffix Tree data structure that, for…

Constructing Antidictionaries in Output-Sensitive Space

2021

A word $x$ that is absent from a word $y$ is called minimal if all its proper factors occur in $y$. Given a collection of $k$ words $y_1,y_2,\ldots,y_k$ over an alphabet $\Sigma$, we are asked to compute the set $\mathrm{M}^{\ell}_{y_{1}\#\ldots\#y_{k}}$ of minimal absent words of length at most $\ell$ of word $y=y_1\#y_2\#\ldots\#y_k$, $\#\notin\Sigma$. In data compression, this corresponds to computing the antidictionary of $k$ documents. In bioinformatics, it corresponds to computing words that are absent from a genome of $k$ chromosomes. This computation generally requires $\Omega(n)$ space for $n=|y|$ using any of the plenty available $\mathcal{O}(n)$-time algorithms. This is because a…

Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform

2012

Motivation The Burrows-Wheeler transform (BWT) is the foundation of many algorithms for compression and indexing of text data, but the cost of computing the BWT of very large string collections has prevented these techniques from being widely applied to the large sets of sequences often encountered as the outcome of DNA sequencing experiments. In previous work, we presented a novel algorithm that allows the BWT of human genome scale data to be computed on very moderate hardware, thus enabling us to investigate the BWT as a tool for the compression of such datasets. Results We first used simulated reads to explore the relationship between the level of compression and the error rate, the leng…

Concrete columns confined with fibre reinforced cementitious mortars: Experimentation and modelling

2014

Abstract The structural behaviour of concrete columns strengthened with a system made up of fibre nets embedded in an inorganic stabilized cementitious matrix under an uniaxial load was investigated. Medium size specimens with circular and square cross-section were cast and subjected to monotonic uniaxial compression, to investigate the efficiency of a p-Phenylene BenzobisOxazole (PBO) Fibre Reinforced Cementitious Mortar (FRCM) system in increasing both strength and ductility. The experimental results show that the confinement system adopted produced a noticeable increment in strength and ductility, though the low mechanical ratios of fibre considered were not always able to ensure hardeni…

Influenza del confinamento del calcestruzzo con FRP sulla stabilità delle barre compresse

2009

Femtosecond pulse compression in a hollow-core photonic bandgap fiber by tuning its cross section

2012

Abstract We present a numerical study of soliton pulse compression in a seven-cell hollow-core photonic bandgap fiber. We analyze the enhancement of both the compression factor and the pulse shape quality of 360 nJ femtosecond pulses at the wavelength of 800 nm by tuning the cross section size of the fiber. We use the generalized non-linear Schrodinger equation in order to modeled the propagation of light pulses along the fiber. Our numerical results show that output compressed pulses can be obtained, in a propagation length of 31 cm, with a compression factor of 5.7 and pulse shape quality of 77% for a reduction of 4.5% of the cross section size of the fiber. The predicted compression fact…

Towards CEP stable, single-cycle pulse compression with bulk material

2010

We demonstrate both experimentally and numerically that self-steepening during propagation in a hollow-fiber followed by linear propagation through glass in the anomalous dispersion enables pulse compression down to 1.6 cycles at 1.8 µm wavelength.

All-fibered high-quality low duty-cycle 20-GHz and 40-GHz picosecond pulse sources

2007

International audience; In this work, we demonstrate all-fibered 20-GHz and 40-GHz picosecond pulse sources with duty cycles as low as 1/14. The pulse train is achieved via the high-quality compression of an initial sinusoidal beating through four segments of optical fibers. General design rules are proposed and experimental results are in agreement with numerical predictions.