Probabilistic Approach to an Image Reconstruction Problem

Gzyl, Henryk; Zeev, Noam
September 2002
Methodology & Computing in Applied Probability;Sep2002, Vol. 4 Issue 3, p279
Academic Journal
This aim of this note is to present a probabilistic approach to an algebraic problem in image reconstruction. The role of probability theory is to identify the relevant variables that characterize the solutions and to provide alternative variational methods of reconstruction.


Related Articles

  • RECURSIVE FILTERS FOR PARTIALLY OBSERVABLE FINITE MARKOV CHAINS. Ledoux, James // Journal of Applied Probability;Sep2005, Vol. 42 Issue 3, p684 

    In this note, we consider discrete-time finite Markov chains and assume that they are only partly observed. We obtain finite-dimensional normalized filters for basic statistics associated with such processes. Recursive equations for these filters are derived by means of simple computations...

  • Two-Commodity Markovian Inventory System with Compliment and Retrial Demand. Anbazhagan, N.; Jeganathan, K. // British Journal of Mathematics & Computer Science;Apr-Jun2013, Vol. 3 Issue 2, p115 

    In this article, we consider a stochastic inventory system with two different items in stock, one is major item (I- commodity) and other is gift item (II- commodity). The maximum storage capacity for the i th commodity is Si(i = 1,2) . The demand time points for each commodity are assumed to...

  • A Single Server Queueing Loss Model with Heterogeneous Arrival and Service. Shun-Chen Niu // Operations Research;May/Jun80 Part 1 of 2, Vol. 28 Issue 3, p584 

    A heterogeneous arrival and service single server queueing loss model is analyzed. The arrival process of customers is assumed to be a nonstationary Poisson process with an intensity function whose evolution is governed by a two-state continuous time Markov chain. Different service distributions...

  • THE MAXIMUM-SOJOURN DISTRIBUTION FOR A SEMI-MARKOV PROCESS. Fabens, Augustus J. // CORS Journal;Nov68, Vol. 6 Issue 3, p171 

    The probability of the event that a semi-Markov process spends a length of time R or longer continuously in a particular state is determined by identifying it with the state distribution of an auxiliary process which jumps to a special state when that event occurs.

  • Decomposition of Queueing Networks with Dependent Service and Negative Customers. Bocharov, P. P.; Gavrilov, E. V.; D'Apice, C.; Pechinkin, A. V. // Automation & Remote Control;Jan2004, Vol. 65 Issue 1, p86 

    Queueing networks with negative customers (C-networks) and dependent service at different nodes are studied. Every customer arriving at the network is defined by a set of random parameters: his route over the network (a sequence of nodes visited by the customers), route length, and volume and...

  • PAIR FORMATION IN A MARKOVIAN ARRIVAL PROCESS WITH TWO EVENT LABELS. Neuts, Marcel F.; Alfa, Attahiru Sule // Journal of Applied Probability;Dec2004, Vol. 41 Issue 4, p1124 

    The stochastic process resulting when pairs of events are formed from two point processes is a rich source of questions. When the two point processes have different rates, the resulting stochastic process has a mean drift towards either -8 + 8. However, when the two processes have equal rates,...

  • ON THE SUBEXPONENTIAL PROPERTIES IN STATIONARY SINGLE-SERVER QUEUES: A PALM-MARTINGALE APPROACH. Miyoshi, Naoto // Advances in Applied Probability;Sep2004, Vol. 36 Issue 3, p872 

    This paper studies the subexponential properties of the stationary workload, actual waiting time and sojourn time distributions in work-conserving single-sewer queues when the equilibrium residual service time distribution is subexponential. This kind of problem has been previously investigated...

  • A Monte Carlo method for filtering a marked doubly stochastic Poisson process. Varini, Elisa // Statistical Methods & Applications;2008, Vol. 17 Issue 2, p183 

    The author provides an approximated solution for the filtering of a state-space model, where the hidden state process is a continuous-time pure jump Markov process and the observations come from marked point processes. Each state k corresponds to a different marked point process, defined by its...

  • A Multiserver Queue with Thresholds for the Acceptance of Customers into Service. Neuts, Marcel F.; Nadarajan, R. // Operations Research;Sep/Oct82, Vol. 30 Issue 5, p948 

    A queue with Poisson arrivals is served by N identical exponential servers. When a server becomes free, a group of customers of size at most b can be served. The server is not allowed to process a group of size less than a, 1 a less than or equal to b. The actual size of each group served...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics