Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All

Publish in OALib Journal

ISSN: 2333-9721

APC: Only \$99

Submit

2018 ( 1 )

2017 ( 1 )

2015 ( 2 )

2014 ( 7 )

Search Results: 1 - 10 of 366 matches for " Aura Conci "
 Page 1 /366 Display every page 5 10 20 Item
 Computational & Applied Mathematics , 2005, Abstract: fractal codification of images is based on self-similar and self-affine sets. the codification process consists of construction of an operator which will represent the image to be encoded. if a complicated picture can be represented by an operator then it will be transmitted or stored very efficiently. clearly, this has many applications on data compression. the great disadvantage of the automatic form of fractal compression is its encoding time. most of the time spent in construction of such operator is due on finding the best match between parts of the image to be encoded. however, since the conception of automatic fractal image compression, researches on improvement of the compression time are widespread. this work aims to provide a new idea for decrease the encoding time: a classification of image parts based on their local fractal dimension. the idea is implemented on two steps. first, a preprocessing analysis of the image identify the complexity of each image block computing its dimension. then, only parts within the same range of complexity are used for testing the better self-affine pairs, reducing the compression time. the performance of this proposition, is compared with others fractal image compression methods. the points considered are image fidelity, encoding time and amount of compression on the image file.
 Computational and Applied Mathematics , 2005, Abstract: Fractal codification of images is based on self-similar and self-affine sets. The codification process consists of construction of an operator which will represent the image to be encoded. If a complicated picture can be represented by an operator then it will be transmitted or stored very efficiently. Clearly, this has many applications on data compression. The great disadvantage of the automatic form of fractal compression is its encoding time. Most of the time spent in construction of such operator is due on finding the best match between parts of the image to be encoded. However, since the conception of automatic fractal image compression, researches on improvement of the compression time are widespread. This work aims to provide a new idea for decrease the encoding time: a classification of image parts based on their local fractal dimension. The idea is implemented on two steps. First, a preprocessing analysis of the image identify the complexity of each image block computing its dimension. Then, only parts within the same range of complexity are used for testing the better self-affine pairs, reducing the compression time. The performance of this proposition, is compared with others fractal image compression methods. The points considered are image fidelity, encoding time and amount of compression on the image file.
 Mathematics , 2014, Abstract: In this paper, we exhibit two matrix representations of the rational roots of generalized Fibonacci polynomials (GFPs) under convolution product, in terms of determinants and permanents, respectively. The underlying root formulas for GFPs and for weighted isobaric polynomials (WIPs), which appeared in an earlier paper by MacHenry and Tudose, make use of two types of operators. These operators are derived from the generating functions for Stirling numbers of the first kind and second kind. Hence we call them Stirling operators. To construct matrix representations of the roots of GFPs, we use the Stirling operators of the first kind. We give explicit examples to show how the Stirling operators of the second kind appear in the low degree cases for the WIP-roots. As a consequence of the matrix construction, we have matrix representations of multiplicative arithmetic functions under the Dirichlet product into its divisible closure.
 Journal of the Brazilian Society of Mechanical Sciences , 1999, DOI: 10.1590/S0100-73861999000300011 Abstract: this work presents an application of fractal dimension (fd) and segmentation techniques to automated visual inspection. a system was developed for textile industries and aims at automatic failure detection. the textile industry environment presents particular characteristics in which usual morphological feature extraction cannot be used for visual quality control. basically, the implemented system compares data from digital images; the characteristics of these data depend on the method selected for analysis. two kinds of methods can be used: segmentation and fractal dimension. segmentation techniques were adapted and improved to detect variations of the textile images (indication of defect). the fractal dimension is based on a new efficient algorithm that calculates the image fractal dimension values throughout all range that is between two and three (2 ￡ fd ￡ 3). these techniques were compared by their efficiency, accuracy and applicability.