Browsing by Subject "Computer Programming - Algorithms"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Generating connected textured fractal patterns using Markov random fields
    (Institute of Electrical and Electronics Engineers, 1991) Onural, L.
    An algorithm that yields textured and connected binary fractals is presented. The texture is imposed by modeling the fractal as a Markov random field (MRF) at every resolution level. The model size and the parameters specify the texture. The generation starts at a coarser level and continues at finer levels. Connectivity, which is a global property, is maintained by restricting the flow of the sample generating Markov chain within a limited subset of all possible outcomes of the Markov random field. The texture is controlled by the parameters of the MRF model being used. Sample patterns are shown.
  • Thumbnail Image
    ItemOpen Access
    An Iterative Algorithm for Signal Reconstruction from Bispectrum
    (1991) Çtin, A.E.
    This paper presents a procedure to reconstruct a (minimum or nonminimum phase) discrete-time signal from its bispectrum. The algorithm is iterative and based on using the method of projections onto convex sets (POCS) in an inner product space in which the vector space consists of real sequences, and vector addition is defined in terms of the convolution operation. Prior information, such as an energy bound on the signal, can be incorporated into this algorithm. An algorithm that employs energy information was found to produce better results in simulation than one that ignores energy constraints. © 1991 IEEE