Current Search: Data compression Telecommunication (x)
View All Items
- Title
- Densely-centered uniform P-search: A fast motion estimation algorithm.
- Creator
- Greenberg, Joshua H., Florida Atlantic University, Furht, Borko
- Abstract/Description
-
Video compression technology promises to be the key to the transmission of motion video. A number of techniques have been introduced in the past few years, particularly that developed by the Motion Picture Experts Group (MPEG). The MPEG algorithm uses Motion Estimation to reduce the amount of data that is stored for each frame. Motion Estimation uses a reference frame as a codebook for a modified Vector Quantization process. While an exhaustive search for Motion Estimation Vectors is time...
Show moreVideo compression technology promises to be the key to the transmission of motion video. A number of techniques have been introduced in the past few years, particularly that developed by the Motion Picture Experts Group (MPEG). The MPEG algorithm uses Motion Estimation to reduce the amount of data that is stored for each frame. Motion Estimation uses a reference frame as a codebook for a modified Vector Quantization process. While an exhaustive search for Motion Estimation Vectors is time-consuming, various fast search algorithms have been developed. These techniques are surveyed, and the theoretical framework for a new search algorithm is developed: Densely-Centered Uniform P-Search. The time complexity of Densely-Centered Uniform P-Search is comparable to other popular Motion Estimation techniques, and shows superior results on a variety of motion video sources.
Show less - Date Issued
- 1996
- PURL
- http://purl.flvc.org/fcla/dt/15286
- Subject Headings
- Image processing--Digital techniques, Data compression (Telecommunication)
- Format
- Document (PDF)
- Title
- Information-theoretics based technoeconomic growth models: simulation and computation of forecasting in telecommunication services.
- Creator
- Yassin, Raef Rashad., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
This research is concerned with algorithmic representation of technoeconomic growth concerning modern and next-generation telecommunications including the Internet service. The goal of this study thereof is to emphasize efforts to establish the associated forecasting and, the envisioned tasks thereof include : (i) Reviewing the technoeconomic considerations prevailing in telecommunication (telco) service industry and their implicating features; (ii) studying relevant aspects of underlying...
Show moreThis research is concerned with algorithmic representation of technoeconomic growth concerning modern and next-generation telecommunications including the Internet service. The goal of this study thereof is to emphasize efforts to establish the associated forecasting and, the envisioned tasks thereof include : (i) Reviewing the technoeconomic considerations prevailing in telecommunication (telco) service industry and their implicating features; (ii) studying relevant aspects of underlying complex system evolution (akin to biological systems), (iii) pursuant co-evolution modeling of competitive business structures using dichotomous (flip-flop) states as seen in predator evolutions ; (iv) conceiving a novel algorithm based on information-theoretic principles toward technoeconomic forecasting on the basis of modified Fisher-Kaysen model consistent with proportional fairness concept of comsumers' willingness-to-pay, and (v) evaluating forecast needs on inter-office facility based congestion sensitive traffics encountered. Commensurate with the topics indicated above, necessary algorithms, analytical derivations and compatible models are proposed. Relevant computational exercises are performed with MatLab[TM] using data gathered from open-literature on the service profiles of telecommunication companies (telco); and ad hoc model verifications are performed on the results. Lastly, discussions and inferences are made with open-questions identified for further research.
Show less - Date Issued
- 2012
- PURL
- http://purl.flvc.org/FAU/3356898
- Subject Headings
- Signal theory (Telecommunication), Data compression (Computer science), Telecommunication systems, Mathematical models, Information science
- Format
- Document (PDF)
- Title
- Interactive progressive encoding system for transmission of complex images.
- Creator
- Furht, Borko, Wang, Yingli, Celli, Joseph
- Date Issued
- 1998-11
- PURL
- http://purl.flvc.org/fcla/dt/351011
- Subject Headings
- Internetworking (Telecommunication), Digital video., Image transmission., JPEG (Image coding standard), Data compression (Telecommunication) --Standards., Image compression --Standards.
- Format
- Document (PDF)
- Title
- Permutation-based data compression.
- Creator
- Mihnea, Amalya, Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
The use of permutations in data compression is an aspect that is worthy of further exploration. The work that has been done in video compression based on permutations was primarily oriented towards lossless algorithms. The study of previous algorithms has led to a new algorithm that could be either lossless or lossy, for which the amount of compression and the quality of the output can be controlled. The lossless version of our algorithm performs close to lossy versions of H.264 and it...
Show moreThe use of permutations in data compression is an aspect that is worthy of further exploration. The work that has been done in video compression based on permutations was primarily oriented towards lossless algorithms. The study of previous algorithms has led to a new algorithm that could be either lossless or lossy, for which the amount of compression and the quality of the output can be controlled. The lossless version of our algorithm performs close to lossy versions of H.264 and it improves on them for the majority of the videos that we analyzed. Our algorithm could be used in situations where there is a need for lossless compression and the video sequences are part of a single scene, e.g., medical videos, where loss of information could be risky or expensive. Some results on permutations, which may be of independent interest, arose in developing this algorithm. We report on these as well.
Show less - Date Issued
- 2011
- PURL
- http://purl.flvc.org/FAU/3333054
- Subject Headings
- Data compression (Telecommunication), Combinatorics, Network architecture and design, Computer network architectures, Mathematical optimization
- Format
- Document (PDF)
- Title
- XYZ Video Compression: An algorithm for real-time compression of motion video based upon the three-dimensional discrete cosine transform.
- Creator
- Westwater, Raymond John., Florida Atlantic University, Furht, Borko, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
XYZ Video Compression denotes a video compression algorithm that operates in three dimensions, without the overhead of motion estimation. The smaller overhead of this algorithm as compared to MPEG and other "standards-based" compression algorithms using motion estimation suggests the suitability of this algorithm to real-time applications. The demonstrated results of compression of standard motion video benchmarks suggest that XYZ Video Compression is not only a faster algorithm, but develops...
Show moreXYZ Video Compression denotes a video compression algorithm that operates in three dimensions, without the overhead of motion estimation. The smaller overhead of this algorithm as compared to MPEG and other "standards-based" compression algorithms using motion estimation suggests the suitability of this algorithm to real-time applications. The demonstrated results of compression of standard motion video benchmarks suggest that XYZ Video Compression is not only a faster algorithm, but develops superior compression ratios as well. The algorithm is based upon the three-dimensional Discrete Cosine Transform (DCT). Pixels are organized as 8 x 8 x 8 cubes by taking 8 x 8 squares out of 8 consecutive frames. A fast three-dimensional transform is applied to each cube, generating 512 DCT coefficients. The energy-packing property of the DCT concentrates the energy in the cube into few coefficients. The DCT coefficients are quantized to maximize the energy concentration at the expense of introduction of a user-determined level of error. A method of adaptive quantization that generates optimal quantizers based upon statistics gathered for the 8 consecutive frames is described. The sensitivity of the human eye to various DCT coefficients is used to modify the quantizers to create a "visually equivalent" cube with still greater energy concentration. Experiments are described that justify choice of Human Visual System factors to be folded into the quantization step. The quantized coefficients are then encoded into a data stream using a method of entropy coding based upon the statistics of the quantized coefficients. The bitstream generated by entropy coding represents the compressed data of the 8 motion video frames, and typically will be compressed at 50:1 at 5% error. The decoding process is the reverse of the encoding process: the bitstream is decoded to generate blocks of quantized DCT coefficients, the DCT coefficients are dequantized, and the Inverse Discrete Cosine Transform is performed on the cube to recover pixel data suitable for display. The elegance of this technique lies in its simplicity, which lends itself to inexpensive implementation of both encoder and decoder. Finally, real-time implementation of the XYZ Compressor/Decompressor is discussed. Experiments are run to determine the effectiveness of the implementation.
Show less - Date Issued
- 1996
- PURL
- http://purl.flvc.org/fcla/dt/12450
- Subject Headings
- Digital video, Data compression (Telecommunication), Image processing--Digital techniques, Coding theory
- Format
- Document (PDF)