A new fast matching method for adaptive compression of stereoscopic images

@inproceedings{Ortis2015ANF,
  title={A new fast matching method for adaptive compression of stereoscopic images},
  author={Alessandro Ortis and Sebastiano Battiato},
  booktitle={Electronic Imaging},
  year={2015}
}
In the last few years, due to the growing use of stereoscopic images, much effort has been spent by the scientific community to develop algorithms for stereoscopic image compression. Stereo images represent the same scene from two different views, and therefore they typically contain a high degree of redundancy. It is then possible to implement some compression strategies devoted to exploit the intrinsic characteristics of the two involved images that are typically embedded in a MPO (Multi… 

A Benchmark Evaluation of Adaptive Image Compression for Multi Picture Object Stereoscopic Images

The problem of stereoscopic image compression is presented, with a focus on the adaptive stereoscopic compression approach, which allows for a standardized format of the compressed data and is compared with other MPO-compliant methods.

Disparities selection controlled by the compensated image quality for a given bitrate

This paper derives from the JPEG-coder, a disparity-dependent analytic expression of the distortion induced by the compensated view that is embedded into an algorithm with a reasonable numerical complexity approaching the performance obtained with the proof of concept work.

Lossless Compression of Color images using Imperialist competitive algorithm

A lossless compression method is presented using Imperialist competitive algorithm for compression and tries to achieve a more optimized color for the image color-map, so that it increases the compression rate.

JPEG-1 standard 25 years: past, present, and future reasons for a success

Abstract. Digital image capture, processing, storage, transmission, and display are now taken for granted as part of the technology of modern everyday life. Digital image compression is one of the

Parallel color image watermarking scheme for multiple picture object based on multithreading coding

A novel parallel color image watermarking scheme in the frequency domain for copyright protection of Multiple Picture Object based on multithreading coding is proposed and appears to demonstrate significant improvement in processing time though possible parallelization process when moving from serial programming to the use of threads in multicore CPUs.

Development of Control System for Robotic Surface Tracking

The new algorithm of synthesis of the robot manipulator motioncontrolling system by dynamics and perturbations compensation method has been developed and the scheme of 3D scanning on the basis of an industrial robot manipulators has been identified.

References

SHOWING 1-10 OF 11 REFERENCES

Adaptive Compression of Stereoscopic Images

This paper addresses the problem of stereoscopic images data compression proposing an innovative algorithm for compressing Multi Picture Object coded stereopairs by means of self organizing reconstruction algorithm based on image redundancy that is able to reduce the size of the enclosed JPEG images.

Joint decoding of stereo JPEG image Pairs

This paper addresses the problem of joint decoding of stereo JPEG image pairs, and proposes to use the popular JPEG compression tools in the cameras, and focus on the joint decoding problem for quality enhancement.

Data compression of stereopairs

It is proved that the rate distortion limit for coding stereopairs cannot in general be achieved by a coder that first codes and decodes the right picture sequence independently of the left picture sequence, and then codes anddecodes theleft picture sequence given the decoded right picture sequences.

Image Analysis and Processing – ICIAP 2013

  • A. Petrosino
  • Computer Science
    Lecture Notes in Computer Science
  • 2013
LPD is also used with success for classifying images other than handwritten digits and several ways of optimizing the LPD algorithm are presented, such as using a hash table to store precomputed patch distances or skipping the comparison of overlapping patches.

Template matching using fast normalized cross correlation

Depending on the approximation, the algorithm can by far outperform Fourier-transform based implementations of the normalized cross correlation algorithm and it is especially suited to problems, where many different templates are to be found in the same image f.

A Combined Corner and Edge Detector

The problem we are addressing in Alvey Project MMI149 is that of using computer vision to understand the unconstrained 3D world, in which the viewed scenes will in general contain too wide a

Multiple View Geometry in Computer Vision

  • B. Wrobel
  • Computer Science
    Künstliche Intell.
  • 2001
This book is referred to read because it is an inspiring book to give you more chance to get experiences and also thoughts and it will show the best book collections and completed collections.

The self-organizing map

A computer algorithm for reconstructing a scene from two projections

A simple algorithm for computing the three-dimensional structure of a scene from a correlated pair of perspective projections is described here, when the spatial relationship between the two

Multi-Picture format, Camera & Imaging Products Association Standardization Committee (CIPA)

  • Multi-Picture format, Camera & Imaging Products Association Standardization Committee (CIPA)
  • 2009