We propose a procedure that can improve the coding efficiency of bilevel image compression schemes that are based on chain coding techniques and entropy coders. The two chain coding techniques analyzed in this study employ three and eight symbols, respectively, to code the outline of object shapes in bilevel images. Once we have the chain code representation of a contour, we group the original chain symbols in blocks of two or more symbols to build new extended alphabets from which we can obtain more efficient compression rates by using a statistical model that best represents our new alphabets and entropy coding. The coding efficiency of every new alphabet is measured by its entropy, average length in bits per original source symbol, and the total length in bits that represent the compressed image. We compare the compression efficiency between our two chain coding techniques using our three entropy coding parameters for symbol groupings of different sizes. In our experiments, we also show how our blocking approach produces an entropy value that is lower than its expected theoretical counterpart for a given order of symbol groupings and, as a consequence, the average and total lengths are expected to follow a decreasing pattern as well. Finally, we compare our best encoding model against the Joint Bilevel Image Experts Group's JBIG and JBIG2 bilevel image compression standards.
The reconstruction of an image from its projections through filtered backprojection is not new and has gained popularity since its application on computerized tomography (CT) for medical imaging. However, the number of projections to reconstruct a single image can be in the thousands. Thus, significant computational power is required. Today's digital signal processors (DSPs) offer an alternative for implementations of a backprojector to process large amounts of data. We demonstrate an implementation in a fixed-point DSP. This implementation is optimized for cache memory to reduce CPU stalls, and we achieved up to 99.6% of effective CPU cycles. With a DSP running at 1 GHz, an image of 1200×1200 pixels can be reconstructed from 180 projections in 1 s.
Handover (or handoff) management is the set of actions that allows a wireless network to maintain a
mobile user's connection as it moves through different cells during a call. The handover is typically
done during a cell boundary crossing and all of the mobile terminal's connection information must
be transferred into the new cell (or new base station). So, it is important to count the number of
handovers made by a user during a call for proper network resources dimensioning and performance
prediction. Location management is the set of actions aimed to find the current location of an inactive mobile
user for call delivery. It implies the transmission of signaling messages for dynamic databases updates, paging, and so on. This problem is formulated in terms of cost optimization and it is mathematically related to handover counting. In this paper, we summarize many of the proposed model to deal with these problems, and we will be mainly focussed on the renewal process approach.
We carried out a comparative study between different entropy coding schemes applied to bilevel images. The study was centered on their application to reduce existing redundancies in the three-bit chain code used to compress bilevel images. We propose a variant of the run-length codes using joint runs of two symbols at the same time. According to our results, the number of bits needed to store chain codes is reduced more than 50% over the case that is not compressed, and a 45% improvement is achieved over the results obtained with classical Huffman coding.
Intensity distributions of linearly polarized (LP) propagation modes of several orders are plotted for a step-index elliptical-core dielectric waveguide. A simplified characteristic equation is obtained through the weakly guiding approximation, which can be used to find the propagation constants and the cutoff frequencies of each LP mode. These constants are then applied to the solution of the scalar wave equation, which is expanded in series of ordinary and modified Mathieu functions, to obtain the intensity patterns of the LP modes. Results are compared with previous work, and it is found that when the elliptical core tends to a circle (ratio of semimajor to semiminor axis equal to 1.0001) our cutoff frequencies are closer to the LP-mode cutoffs of the circular fiber than are the cutoffs obtained in other papers on elliptical fibers.
Location of mobile users is a common implemented issue in modern personal communication networks (PCN). Location may have several purposes in a wireless network, for example authentication of users to deliver incoming calls to destination users, and to make a more efficient use of network resources. In a practical wireless network the location algorithms need to keep track of mobile users in a dynamic manner. In this paper, we present an analytic model for the dynamic movement-based location algorithm for PCN's. Our model is based on renewal theory arguments and it is general enough to include a variety of probability distributions for modelling residence times in location areas and intercall times.
We propose a lossless compression method based on a chain code composed of only three symbols. The method is applicable to compress 2-D binary object shapes, and it consists of representing the orthogonal direction changes of the discrete contour, corresponding to each object binary shape, by three bits of a chain code. According to our experimental results, we find that this method is suitable for the representation of bilevel images. The results are about 25% more efficient in compression than the Freeman chain code method, and an average of 29% better than the Joint Bilevel Image Experts Group (JBIG) compressor.
Many analytic and numerical techniques have appeared in literature
to evaluate performance measures of queueing systems with
heavy-tail distributed interarrival times. In this paper, we take
the advantage of having a closed-form expression for the Laplace
transform of Pareto probability distributions in order to have a
better setting to evaluate the different performance measures of
Pareto queueing systems. We consider the Pareto distributed
interarrival times as a particular case of general and independent
arrivals queueing systems with exponentially distributed service
times, i.e. {\sc GI/M/...} queueing systems.
In this paper, we propose analytical models to capture the
statistical behavior of real traces of MPEG-4 encoded variable bit
rate (VBR) video data in a video server. We study the scattered
disk storage of video frames and periodic scheduling policies and
we calculate the user disk service rate, buffer size, and the
maximum number of simultaneous subscribers by using the Chernoff bound asymptotic technique. We have included a self-similar
Gamma model which seems to be very close to the actual data
behavior.
KEYWORDS: 3D image processing, Wavelet transforms, Wavelets, Spatial frequencies, 3D displays, Pixel resolution, 3D vision, 3D metrology, Eye, Image processing
In this paper we propose a monoscopic 2D to stereo 3D conversion system. Our process of producing a stereo 3D system from 2D images requires to estimate a relative depth map of the objects in the image that comprises the real world 3D geometry of the scene initially captured. Subsequently, we map the estimated depth into two
perspective image views, left and right, with an artificially synthesized parallax between them. We present a depth estimation method based on measuring focus cues, which consists of a local spatial frequency measurement using multiresolution wavelet analysis and a Lipschitz regularity estimation of significant edges; resulting in a pixel resolution depth map. Based on this relative depth map, the stereo 3D image is synthesized with a method that uses interpolated image row sections to artificially generate parallax in the left and right perspective views, and thus when viewed with a stereo 3D display system induce a sense of stereopsis to the observer.
KEYWORDS: Digital signal processing, Signal processing, Field programmable gate arrays, Joint transforms, Optical correlators, Electro optical systems, Electro optical design, Optical signal processing
We present the design of an hybrid opto-digital joint transform correlator using a Fourier optical processor in combination of an electronic system based in a digital signal processor (DSP) or a field programmable gate arrays (FPGA).
KEYWORDS: Asynchronous transfer mode, Probability theory, Mobile communications, CRTs, Internet, Multimedia, Data communications, Image retrieval, Local area networks, Control systems
Modern wireless networks are evolving to provide data and multimedia services, in addition to the basic voice service. In this environment most of the traffic sources are bursty in their nature (e.g. internet). It means, they alternate from a random-length Talkspurt (On) period to a random-length Silence (Off) period several times during a random session time. In a wireless cell, the proper dimensioning of network resources may depend on the handover statistics, as well as on the bandwidth needed for each service. This bandwidth requirement is a function of the statistical behavior of On-Off length periods.
In this paper, we consider different probability distributions for the session time such as exponential, k-Erlang, and Pareto; whereas the Talkspurt and Silence periods are exponentially distributed. Thus, we compare the probability distribution and statistical moments for counting the number of cell crossings (handovers) and the random number of On-Off pairs in a session.
Nowadays, there is a growing interest in providing internet to mobile users. For instance, NTT DoCoMo in Japan deploys an important mobile phone network with that offers the Internet service, named 'i-mode', to more than 17 million subscribers. Internet traffic measurements show that the session duration of Call Holding Time (CHT) has probability distributions with heavy-tails, which tells us that they depart significantly from the traffic statistics of traditional voice services. In this environment, it is particularly important to know the number of handovers during a call for a network designer to make an appropriate dimensioning of virtual circuits for a wireless cell. The handover traffic has a direct impact on the Quality of Service (QoS); e.g. the service disruption due to the handover failure may significantly degrade the specified QoS of time-constrained services. In this paper, we first study the random behavior of the number of handovers during a call, where we assume that the CHT are Pareto distributed (heavy-tail distribution), and the Cell Residence Times (CRT) are exponentially distributed. Our approach is based on renewal theory arguments. We present closed-form formulae for the probability mass function (pmf) of the number of handovers during a Pareto distributed CHT, and obtain the probability of call completion as well as handover rates. Most of the formulae are expressed in terms of the Whittaker's function. We compare the Pareto case with cases of $k(subscript Erlang and hyperexponential distributions for the CHT.
We present a new class of invariant optical fields that we named Mathieu beams because they are described by radial and angular Mathieu functions. The angular spectrum of these beams when mapped on the McCutchen sphere gives the clue to create them in the laboratory. The corresponding experimental setup is described and the results obtained corroborated our theoretical predictions. The experimental parameters can be easily adjusted to obtain a variety of transverse intensity patterns that range from cosine to Bessel. There are two main families of higher order Mathieu beams, one of them are confocal elliptically ringed and can present phase rotating characteristics that are interesting for creating elliptical rotating waves. The other family of these high order beams have bowtie shapes. Mathieu beams are a variant of superposition of uniform conical waves, i.e. Bessel beams, and for these reason they have also the capability of self-reconstruction after finite obstructions.
In this paper we are considering a mixed platform wireless environment. It means that the mobile spent a Cell Residence Time (CRT) in the originating cell which is a random variable with different statistics from the CRT's in the remaining cells. We model this situation by using a delayed renewal process and we present closed-form mathematical expressions for the probability mass function of the number of handovers during the random interval of a Call Holding Time (CHT). We have modeled the CHT as a mixture of exponential distributions and any distribution for the CRT's, and we establish an interesting relationship between them. In particular, we have considered generalized gamma and circularly distributed CRT's. We also present results for the probability of no completing a call and estimates for the handover rates.
There are many studies dealing with handover statistics for voice wireless calls, however handovers of multimedia traffic is still in its early stage of investigation. A major difference is that neither the Call Holding Times (CHT) nor the Cell Residence Times (CRT) can be longer assumed as exponentially distributed. In this paper, we obtain analytical expressions for a variety of handoff rates for Erlang-based call holding times and cell residence times. In particular, we present closed-form analytical results for the handoff cell arrival rate in the following cases: (1) mixtures of exponential distributions for the CHT and any distribution for the CRT, (2) mixtures of k-Erlang distributions for the CHT and exponential CRT, and (3) 2- Erlang distributions for CHT and CRT. We match parameters with the birth-and-death stochastic process model and we give some insights for simulations.
Multimedia wireless networks are being considered as a natural evolution of the present radio networks. In most of the case, these networks will be connected to an ATM high sped backbone network, and the evaluation of the network performance under users mobility activity demands for new analyses. In this environment, it is particularly important to know the number of handoffs or handovers during a call to make an appropriate dimensioning of virtual circuits for a wireless cell. In this paper we study the handover distributions and their statistical moments for a variety of cell residence times and call holding times distributions. The pmf of the number of handoffs is then used to evaluate the probability of a call completion as a function of the call forced terminated probability due to unavailability of channels in the handoff event.
KEYWORDS: Switches, Video, Asynchronous transfer mode, Data modeling, Performance modeling, Mathematical modeling, Computer programming, Solar concentrators, Networks, Video processing
Performance studies of ATM switches typically consider the binomial distribution to model the traffic behavior at the input of the switch. For instance, the basic knockout principle for the packet loss performance measure, has been solved by considering the binomial assumption in most of the cases. In this paper, we have found that the binomial distribution remains essentially valid for modeling MPEG video traces at the input of the switch, however, in video- on-demand applications with multicasting, the binomial assumption is no longer valid. In this case we have found that the beta-binomial model for the knockout switch gives a better cell loss performance prediction.
In this paper we present the behavior of the Sunshine ATM switch for variable bit rate MPEG video sources. The Sunshine switch is the main distribution element of our near video-on-demand (NVOD) system. We are adding a copy network to the basic Sunshine architecture in order to provide it with a multicasting capability. Basically, our system consists of a cascade of a NVOD server, a copy network, a Sunshine switch, and the users. Requests for new movies can be served each 5 minutes. We investigate, by making extensive simulations, the complexity of the switch for light, medium, and heavy MPEG traffic. Important dimensioning parameters investigated are the number of recirculators and the number of banyan networks in the switch for a cell blocking probability of 10-6. Our video traffic simulator generates MPEG video traffic for a videoconference-type of sources with a few different scenes and Gamma distributed holding times.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.