DCT Implementation on GPU

There has been a great progress in the field of graphics processors. Since, there is no rise in the speed of the normal CPU processors; Designers are coming up with multi-core, parallel processors. Because of their popularity in parallel processing, GPUs are becoming more and more attractive for many applications. With the increasing demand in utilizing GPUs, there is a great need to develop operating systems that handle the GPU to full capacity. GPUs offer a very efficient environment for many image processing applications. This thesis explores the processing power of GPUs for digital image compression using Discrete cosine transform

Fractal face representation and recognition

This paper presents a face representation and recognition scheme based on the theory of fractals. Each face image is represented by its fractal model which is a small collection of transformation parameters. The transformation is carried out once for known face images. For recognition, the input face image is transformed and its fractal model is then compared against the database of fractal models of known faces. Feedforward neural networks are utilised to implement the compression and recognition parts. Some experimental results are presented. The maximum compression ratio obtained for the successful recognition of known faces was observed to be 89:1 (for a compression threshold of 0.002)

Fractal Analysis

Fractal analysis is becoming more and more common in all walks of life. This includes biomedical engineering, steganography and art. Writing one book on all these topics is a very difficult task. For this reason, this book covers only selected topics. Interested readers will find in this book the topics of image compression, groundwater quality, establishing the downscaling and spatio-temporal scale conversion models of NDVI, modelling and optimization of 3T fractional nonlinear generalized magneto-thermoelastic multi-material, algebraic fractals in steganography, strain induced microstructures in metals and much more. The book will definitely be of interest to scientists dealing with fractal analysis, as well as biomedical engineers or IT engineers. I encourage you to view individual chapters

Driven by Compression Progress: A Simple Principle Explains Essential Aspects of Subjective Beauty, Novelty, Surprise, Interestingness, Attention, Curiosity, Creativity, Art, Science, Music, Jokes

I argue that data becomes temporarily interesting by itself to some self-improving, but computationally limited, subjective observer once he learns to predict or compress the data in a better way, thus making it subjectively simpler and more beautiful. Curiosity is the desire to create or discover more non-random, non-arbitrary, regular data that is novel and surprising not in the traditional sense of Boltzmann and Shannon but in the sense that it allows for compression progress because its regularity was not yet known. This drive maximizes interestingness, the first derivative of subjective beauty or compressibility, that is, the steepness of the learning curve. It motivates exploring infants, pure mathematicians, composers, artists, dancers, comedians, yourself, and (since 1990) artificial systems.Comment: 35 pages, 3 figures, based on KES 2008 keynote and ALT 2007 / DS 2007 joint invited lectur

Visual complexity modelling based on image features fusion of multiple kernels

[Abstract] Humans’ perception of visual complexity is often regarded as one of the key principles of aesthetic order, and is intimately related to the physiological, neurological and, possibly, psychological characteristics of the human mind. For these reasons, creating accurate computational models of visual complexity is a demanding task. Building upon on previous work in the field (Forsythe et al., 2011; Machado et al., 2015) we explore the use of Machine Learning techniques to create computational models of visual complexity. For that purpose, we use a dataset composed of 800 visual stimuli divided into five categories, describing each stimulus by 329 features based on edge detection, compression error and Zipf’s law. In an initial stage, a comparative analysis of representative state-of-the-art Machine Learning approaches is performed. Subsequently, we conduct an exhaustive outlier analysis. We analyze the impact of removing the extreme outliers, concluding that Feature Selection Multiple Kernel Learning obtains the best results, yielding an average correlation to humans’ perception of complexity of 0.71 with only twenty-two features. These results outperform the current state-of-the-art, showing the potential of this technique for regression.Xunta de Galicia; GRC2014/049Portuguese Foundation for Science and Technology; SBIRC; PTDC/EIA EIA/115667/2009Xunta de Galicia; Ref. XUGA-PGIDIT-10TIC105008-PRMinisterio de Ciencia y Tecnología; TIN2008-06562/TINMinisterio de Ecnomía y Competitividad; FJCI-2015-2607

Fractal Image Compression Using Modified Operator (IFS)

Image data Compression based on fractal theory is fundamentally dierent from conventional compression methods, its idea is to generate a contraction operator whose fixed point approximates the original image in a complete metric space of images. The specication of such operator can be stored as the fractal code for the original image. The contraction mapping principle implies that the iteration of the stored operator starting from arbitrary initial image will recover its xed point which is an approximation for the original image. This Contraction mapping is usually constructed using the partitioned IFS(PIFS) technique which relies on the assertion that parts of the image resemble other parts of the same image. It then, nds the fractal code for each part by searching for another larger similar part. This high costly search makes fractal image compression dicult to be implemented in practice, even it has the advantages of a high compression ratio, a low loss ratio, and the resolution independence of the compression rate. In this paper, we investigate fractal image compression(FIC) using Iterated Function Systems(IFS). After reviewing the standard scheme, we state a mathematical formulation for the practical aspect. We then propose a modied IFS that relies on the fact  that, there are very smooth parts in certain images. From the view point of mathematics, we present the modied operator, proving its properties that make it not only a fractal operator but also more eective than the standard one. The experimental results are presented and the performance of the proposed algorithm is discussed