Results 1 - 10 of 5,738

Compressive sensing

by Richard Baraniuk - IEEE Signal Processing Mag , 2007
"... The Shannon/Nyquist sampling theorem tells us that in order to not lose information when uniformly sampling a signal we must sample at least two times faster than its bandwidth. In many applications, including digital image and video cameras, the Nyquist rate can be so high that we end up with too m ..."
Abstract - Cited by 696 (62 self) - Add to MetaCart
many samples and must compress in order to store or transmit them. In other applications, including imaging systems (medical scanners, radars) and high-speed analog-to-digital converters, increasing the sampling rate or density beyond the current state-of-the-art is very expensive. In this lecture, we

Compressive sampling

by Emmanuel J. Candès , 2006
"... Conventional wisdom and common practice in acquisition and reconstruction of images from frequency data follow the basic principle of the Nyquist density sampling theory. This principle states that to reconstruct an image, the number of Fourier samples we need to acquire must match the desired res ..."
Abstract - Cited by 1441 (15 self) - Add to MetaCart
Conventional wisdom and common practice in acquisition and reconstruction of images from frequency data follow the basic principle of the Nyquist density sampling theory. This principle states that to reconstruct an image, the number of Fourier samples we need to acquire must match the desired

High performance scalable image compression with EBCOT

by David Taubman - IEEE Trans. Image Processing , 2000
"... A new image compression algorithm is proposed, based on independent Embedded Block Coding with Optimized Truncation of the embedded bit-streams (EBCOT). The algorithm exhibits state-of-the-art compression performance while producing a bit-stream with a rich feature set, including resolution and SNR ..."
Abstract - Cited by 586 (11 self) - Add to MetaCart
A new image compression algorithm is proposed, based on independent Embedded Block Coding with Optimized Truncation of the embedded bit-streams (EBCOT). The algorithm exhibits state-of-the-art compression performance while producing a bit-stream with a rich feature set, including resolution and SNR

Model Checking Programs

by Willem Visser, Klaus Havelund, GUILLAUME BRAT, SEUNGJOON PARK, FLAVIO LERDA , 2003
"... The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers. In this pape ..."
Abstract - Cited by 592 (63 self) - Add to MetaCart
environment for Java, called Java PathFinder (JPF), which integrates model checking, program analysis and testing. Part of this work has consisted of building a new Java Virtual Machine that interprets Java bytecode. JPF uses state compression to handle big states, and partial order and symmetry reduction

Image Quality Assessment: From Error Visibility to Structural Similarity

by Zhou Wang, Alan C. Bovik, Hamid R. Sheikh, Eero P. Simoncelli - IEEE TRANSACTIONS ON IMAGE PROCESSING , 2004
"... Objective methods for assessing perceptual image quality have traditionally attempted to quantify the visibility of errors between a distorted image and a reference image using a variety of known properties of the human visual system. Under the assumption that human visual perception is highly adapt ..."
Abstract - Cited by 1499 (114 self) - Add to MetaCart
of intuitive examples, as well as comparison to both subjective ratings and state-of-the-art objective methods on a database of images compressed with JPEG and JPEG2000.

State Compression in SPIN:

by Recursive Indexing And, Gerard J. Holzmann - In Proceedings of Third International SPIN Workshop , 1997
"... The verification algorithm of SPIN is based on an explicit enumeration of a subset of the reachable state-space of a system that is obtained through the formalization of a correctness requirement as an -automaton. This -automaton restricts the state-space to precisely the subset that may contain ..."
Abstract - Add to MetaCart
The verification algorithm of SPIN is based on an explicit enumeration of a subset of the reachable state-space of a system that is obtained through the formalization of a correctness requirement as an -automaton. This -automaton restricts the state-space to precisely the subset that may contain

Parallel Recursive State Compression for Free

by Alfons Laarman, Jaco Van De Pol, Michael Weber - Proc. 18th Int. Spin Workshop on Model Checking Software, Springer Verlag, LNCS , 2011
"... Abstract. State space exploration is a basic solution to many verification problems, but is limited by time and memory usage. Due to physical limits in modern CPUs, sequential exploration algorithms do not benefit automatically from the next generation of processors anymore, hence the need for multi ..."
Abstract - Cited by 6 (5 self) - Add to MetaCart
for multi-core solutions. This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a tree-based multi-core compression method, which works by leveraging sharing among sub-vectors of state vectors

Efficient Implementation of Weighted ENO Schemes

by Guang-shan Jiang, Chi-wang Shu , 1995
"... In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially non-oscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order accur ..."
Abstract - Cited by 412 (38 self) - Add to MetaCart
waves. We also prove that, for conservation laws with smooth solutions, all WENO schemes are convergent. Many numerical tests, including the 1D steady state nozzle flow problem and 2D shock entropy waveinteraction problem, are presented to demonstrate the remarkable capability of the WENO schemes

Evaluation of State Caching and State Compression Techniques

by Radek Pelánek, Václav Rosecký, Jaroslav Šeděnka , 2008
"... ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Abstract not found

State Compression in SPIN: Recursive Indexing And Compression Training Runs

by Gerard J. Holzmann - IN PROCEEDINGS OF THIRD INTERNATIONAL SPIN WORKSHOP , 1997
"... The verification algorithm of SPIN is based on an explicit enumeration of a subset of the reachable state-space of a system that is obtained through the formalization of a correctness requirement as an -automaton. This -automaton restricts the state-space to precisely the subset that may contain ..."
Abstract - Cited by 50 (1 self) - Add to MetaCart
The verification algorithm of SPIN is based on an explicit enumeration of a subset of the reachable state-space of a system that is obtained through the formalization of a correctness requirement as an -automaton. This -automaton restricts the state-space to precisely the subset that may contain
Results 1 - 10 of 5,738