On the compression of stereo images: Preliminary results
β Scribed by Its'hak Dinstein; Gideon Guy; Joseph Rabany; Joseph Tzelgov; Avishai Henik
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 577 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0165-1684
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Lossy transform compression of images is successful and widespread. The JPEG standard uses the discrete cosine transform on blocks of the image and a bit allocation process that takes advantage of the uneven energy distribution in the transform domain. For most images, 10:1 compression
The S-tree linear representation is an efficient structure for representing binary images which requires three bits for each disjoint binary region. We present parallel algorithms for encoding and decoding the S-tree representation from/onto a binary pixel array in a hypercube connected machine. Bot
For an approximate epipolar registration of stereo images the transformation between the images can be approximated from an affine one to a rotational and translational one. This property can be used to find the point of correspondences of stereo images in conjunction with complex moments which are
## Abstract HASTE (HAlf fourier Singleβshot Turbo spinβEcho) is a singleβsection T2βweighted sequence that acquires images in less than 1 second. Images are breathing independent and possess a variety of other features useful for imaging the abdomen. The design of this technique is described. Clini