Search results for "Compres"
showing 10 items of 1107 documents
Perceptual adaptive insensitivity for support vector machine image coding.
2005
Support vector machine (SVM) learning has been recently proposed for image compression in the frequency domain using a constant epsilon-insensitivity zone by Robinson and Kecman. However, according to the statistical properties of natural images and the properties of human perception, a constant insensitivity makes sense in the spatial domain but it is certainly not a good option in a frequency domain. In fact, in their approach, they made a fixed low-pass assumption as the number of discrete cosine transform (DCT) coefficients to be used in the training was limited. This paper extends the work of Robinson and Kecman by proposing the use of adaptive insensitivity SVMs [2] for image coding u…
An efficient hardware implementation of MQ decoder of the JPEG2000
2014
Abstract JPEG2000 is an international standard for still images intended to overcome the shortcomings of the existing JPEG standard. Compared to JPEG image compression techniques, JPEG2000 standard has not only better not only has better compression ratios, but it also offers some exciting features. As it’s hard to meet the real-time requirement of image compression systems by software, it is necessary to implement compression system by hardware. The MQ decoder of the JPEG2000 standard is an important bottleneck for real-time applications. In order to meet the real-time requirement we propose in this paper a novel architecture for a MQ decoder with high throughput which is comparable to tha…
A GPU-Based DVC to H.264/AVC Transcoder
2010
Mobile to mobile video conferencing is one of the services that the newest mobile network operators can offer to users With the apparition of the distributed video coding paradigm which moves the majority of complexity from the encoder to the decoder, this offering can be achieved by introducing a transcoder This device has to convert from the distributed video coding paradigm to traditional video coding such as H.264/AVC which is formed by simpler decoders and more complex encoders, and allows to the users to execute only the low complex algorithms In order to deal with this high complex video transcoder, this paper introduces a graphics processing unit based transcoder as base station The…
Complex networks : application for texture characterization and classification
2008
This article describes a new method and approch of texture characterization. Using complex network representation of an image, classical and derived (hierarchical) measurements, we presente how to have good performance in texture classification. Image is represented by a complex networks : one pixel as a node. Node degree and clustering coefficient, using with traditionnal and extended hierarchical measurements, are used to characterize ”organisation” of textures.
Masonry Compressive Strength Prediction Using Artificial Neural Networks
2019
The masonry is not only included among the oldest building materials, but it is also the most widely used material due to its simple construction and low cost compared to the other modern building materials. Nevertheless, there is not yet a robust quantitative method, available in the literature, which can reliably predict its strength, based on the geometrical and mechanical characteristics of its components. This limitation is due to the highly nonlinear relation between the compressive strength of masonry and the geometrical and mechanical properties of the components of the masonry. In this paper, the application of artificial neural networks for predicting the compressive strength of m…
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment.
2007
Abstract Background Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. However, the alignment methods seem inadequate for post-genomic studies since they do not scale well with data set size and they seem to be confined only to genomic and proteomic sequences. Therefore, alignment-free similarity measures are actively pursued. Among those, USM (Universal Similarity Metric) has gained prominence. It is based on the deep theory of Kolmogorov Complexity and universality is its most novel striking feature. Since it can only be approximated via data compression, USM is a methodology rath…
A multi-domain approach for smoothed particle hydrodynamics simulations of highly complex flows
2018
Abstract An efficient and accurate method is proposed to solve the incompressible flow momentum and continuity equations in computational domains partitioned into subdomains in the framework of the smoothed particle hydrodynamics method. The procedure does not require any overlap of the subdomains, which would result in the increase of the computational effort. Perfectly matching solutions are obtained at the surfaces separating neighboring blocks. The block interfaces can be both planar and curved surfaces allowing to easily decompose even geometrically complex domains. The smoothing length of the kernel function is maintained constant in each subdomain, while changing between blocks where…
Improving Lossless Image Compression with Contextual Memory
2019
With the increased use of image acquisition devices, including cameras and medical imaging instruments, the amount of information ready for long term storage is also growing. In this paper we give a detailed description of the state-of-the-art lossless compression software PAQ8PX applied to grayscale image compression. We propose a new online learning algorithm for predicting the probability of bits from a stream. We then proceed to integrate the algorithm into PAQ8PX&rsquo
«Motion Estimation Accelerator with User Search Strategy in an RVC Context»
2009
Motion estimation represents a key module in video compression. The RVC context requires proposing a flexible solution for motion estimation. According to the nature of the application, a full search is sometimes not suitable, hence, alternative fast/reduced solutions should be considered. This paper proposes a model and implementation of a flexible motion estimation engine, which can be configured to support any user-defined search strategy. Typically, the computational requirements of the search strategy can be traded with the RD-performance of the obtained video encoder. A CAL dataflow description of the accelerator is proposed so that it can be easily handled in the RVC context. An auto…
Optimal Filter Estimation for Lucas-Kanade Optical Flow
2012
Optical flow algorithms offer a way to estimate motion from a sequence of images. The computation of optical flow plays a key-role in several computer vision applications, including motion detection and segmentation, frame interpolation, three-dimensional scene reconstruction, robot navigation and video compression. In the case of gradient based optical flow implementation, the pre-filtering step plays a vital role, not only for accurate computation of optical flow, but also for the improvement of performance. Generally, in optical flow computation, filtering is used at the initial level on original input images and afterwards, the images are resized. In this paper, we propose an image filt…