Results 1  10
of
2,866
An Optimal Lossy Segmentation Encoding Scheme
 in Proceedings of the Conference on Visual Communications and Image Processing
, 1996
"... In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8connect chain codes. We approximate the boundary by a polygon and consider the problem of finding the polygon which can be encoded with the smallest number of bits for a given maximum ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8connect chain codes. We approximate the boundary by a polygon and consider the problem of finding the polygon which can be encoded with the smallest number of bits for a given
A volumetric method for building complex models from range images,”
 in Proceedings of the 23rd annual conference on Computer graphics and interactive techniques. ACM,
, 1996
"... Abstract A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction, ..."
Abstract

Cited by 1020 (17 self)
 Add to MetaCart
with one range image at a time, we first scanconvert it to a distance function, then combine this with the data already acquired using a simple additive scheme. To achieve space efficiency, we employ a runlength encoding of the volume. To achieve time efficiency, we resample the range image to align
Practical Network Coding
, 2003
"... We propose a distributed scheme for practical network coding that obviates the need for centralized knowledge of the graph topology, the encoding functions, and the decoding functions, and furthermore obviates the need for information to be communicated synchronously through the network. The resu ..."
Abstract

Cited by 462 (15 self)
 Add to MetaCart
We propose a distributed scheme for practical network coding that obviates the need for centralized knowledge of the graph topology, the encoding functions, and the decoding functions, and furthermore obviates the need for information to be communicated synchronously through the network
Analysis of Video Transmission over Lossy Channels
 IEEE Journal on Selected Areas in Communications
, 2000
"... A theoretical analysis of the overall mean squared error (MSE) in hybrid video coding is presented for the case of error prone transmission. Our model covers the complete transmission system including the ratedistortion performance of the video encoder, forward error correction, interleaving, and t ..."
Abstract

Cited by 232 (29 self)
 Add to MetaCart
A theoretical analysis of the overall mean squared error (MSE) in hybrid video coding is presented for the case of error prone transmission. Our model covers the complete transmission system including the ratedistortion performance of the video encoder, forward error correction, interleaving
Optimal Asymmetric Encryption
, 1994
"... Given an arbitrary kbit to kbit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string z of length slightly less than k bits can be encrypted as where r= is a simple probabilistic encoding of z depending on the hash function; and (ii) the scheme ca ..."
Abstract

Cited by 275 (14 self)
 Add to MetaCart
Given an arbitrary kbit to kbit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string z of length slightly less than k bits can be encrypted as where r= is a simple probabilistic encoding of z depending on the hash function; and (ii) the scheme
Optimal Unsupervised Learning in a SingleLayer Linear Feedforward Neural Network
, 1989
"... A new approach to unsupervised learning in a singlelayer linear feedforward neural network is discussed. An optimality principle is proposed which is based upon preserving maximal information in the output units. An algorithm for unsupervised learning based upon a Hebbian learning rule, which achie ..."
Abstract

Cited by 293 (2 self)
 Add to MetaCart
A new approach to unsupervised learning in a singlelayer linear feedforward neural network is discussed. An optimality principle is proposed which is based upon preserving maximal information in the output units. An algorithm for unsupervised learning based upon a Hebbian learning rule, which
An Optimal Segmentation Encoding Scheme In The Rate Distortion Sense
 in Proceedings of the International Symposium on Circuits and Systems
, 1996
"... In this paper, we present two fast and efficient methods for the lossy encoding of object boundaries which are given as 8connect chMn codes. We approximate the boundary by a polygon and consider the problem of finding the polygon which leads to the smallest distortion for a given number of bits. We ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
In this paper, we present two fast and efficient methods for the lossy encoding of object boundaries which are given as 8connect chMn codes. We approximate the boundary by a polygon and consider the problem of finding the polygon which leads to the smallest distortion for a given number of bits
On the achievable diversitymultiplexing tradeoff in halfduplex cooperative channels
 IEEE TRANS. INFORM. THEORY
, 2005
"... We propose novel cooperative transmission protocols for delaylimited coherent fading channels consisting of (halfduplex and singleantenna) partners and one cell site. In our work, we differentiate between the relay, cooperative broadcast (downlink), and cooperative multipleaccess (CMA) (uplin ..."
Abstract

Cited by 311 (11 self)
 Add to MetaCart
decoding/encoding at the relays. For the class of DF protocols, we develop a dynamic decode and forward (DDF) protocol that achieves the optimal tradeoff for multiplexing gains. Furthermore, with a single relay, the DDF protocol is shown to dominate the class of AF protocols for all multiplexing gains
Optimal Asymmetric Encryption – How to Encrypt with RSA
, 1995
"... Given an arbitrary kbit to kbit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string x of length slightly less than k bits can be encrypted as f(rx), where rx is a simple probabilistic encoding of x depending on the hash function; and (ii) the scheme ..."
Abstract

Cited by 224 (21 self)
 Add to MetaCart
Given an arbitrary kbit to kbit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string x of length slightly less than k bits can be encrypted as f(rx), where rx is a simple probabilistic encoding of x depending on the hash function; and (ii
An Iterative Scheme for Near Optimal and Universal Lossy Compression
"... Abstract—We present a new lossy compression algorithm for discrete sources. The encoder assigns a certain cost to each reconstruction sequence, finds the sequence that minimizes the cost, and describes it losslessly to the decoder via a universal lossless compressor. The cost of a sequence is define ..."
Abstract
 Add to MetaCart
Abstract—We present a new lossy compression algorithm for discrete sources. The encoder assigns a certain cost to each reconstruction sequence, finds the sequence that minimizes the cost, and describes it losslessly to the decoder via a universal lossless compressor. The cost of a sequence
Results 1  10
of
2,866