Proposes a new model for characterizing the data traffic in a multi-media environment. The authors model the data traffic by a two-state doubly stochastic Poisson process, with sojourn times in each state having an in...
详细信息
Proposes a new model for characterizing the data traffic in a multi-media environment. The authors model the data traffic by a two-state doubly stochastic Poisson process, with sojourn times in each state having an independent and identical heavy tailed distribution, such as the Pareto distribution. The simulation results from the new data traffic model are presented. The new model is versatile in capturing the self-similar characteristics of traffic found in the traffic measurements. The authors also suggest that the other two types of multi-media traffic namely, voice and video may each be characterized by a 2-state doubly stochastic Poisson process with exponential sojourn times (i.e., a Markov modulated Poisson process or MMPP).
The impairment detection method (IDM) is proposed. It is an objective measurement technique of subjective image quality. Given the original and reproduced image as inputs, both images are divided into three areas: fla...
详细信息
The impairment detection method (IDM) is proposed. It is an objective measurement technique of subjective image quality. Given the original and reproduced image as inputs, both images are divided into three areas: flat area, texture area, and sharp edge area. Features are extracted from each area using gradient vector block analysis. The IDM produces three output parameters that measure blocking distortion, blurring, and spatial edge noise.
The DFT is of fundamental importance in many areas of science and engineering due to its efficient evaluation of frequently used operations such as signal analysis, convolution, and correlation. It has been shown that...
详细信息
The DFT is of fundamental importance in many areas of science and engineering due to its efficient evaluation of frequently used operations such as signal analysis, convolution, and correlation. It has been shown that radix-2 DFT (discrete Fourier transform) algorithms can be designed based on vector representation of data providing several advantages. These algorithms provide more efficient solution for the problem of DFT computation. An index mapping approach is used to derive these algorithms. This approach makes the derivation simpler and provides a better insight into the functioning of the algorithms. The signal flow graph of the algorithm is also presented.
One of the most essential tasks in the image understanding systems is shape analysis of the binary images. The effectiveness of the shape analysis process requires an accurate description of the shape of the object an...
详细信息
One of the most essential tasks in the image understanding systems is shape analysis of the binary images. The effectiveness of the shape analysis process requires an accurate description of the shape of the object and an appropriate structure of the input data. In this paper, a new method of the shape equalization is presented. The proposed approach increases the accuracy of the shape description without increasing the complexity of the input information. The method is based on the data interpolation using Fourier descriptors and takes advantage of the statistical properties of the objects found in image scenes. A 1-D filter is used for spatial filtering of the contours.
A window-sequence coding (WSC) technique suitable for improving the computational efficiency of a bit-serial implementation of 2-D stack filters is proposed. The WSC technique takes advantage of the observation that i...
详细信息
A window-sequence coding (WSC) technique suitable for improving the computational efficiency of a bit-serial implementation of 2-D stack filters is proposed. The WSC technique takes advantage of the observation that in most images, many pixels appearing in the filter-window at a certain time-instant assume non-distinct values. An algorithm that uses the bit-serial binary-tree search (BTS) architecture for stack filtering and employs the WSC technique is developed. The proposed algorithm is designated as a modified binary-tree search (MBTS) algorithm. It is shown that the computational efficiency of MBTS algorithm for 2-D stack filtering is significantly better than the efficiency of a BTS algorithm employing a recently proposed technique called the input compression. The improvement stems from the fact that in the input compression method, the samples appearing in a filter-window of size M are always mapped to the set of integers (0, 1, ..., M-1), in spite of the fact that usually in a 2-D window, several groups of pixels assume non-distinct values.
Some important issues that arise in applications involving the Radon transform (RT) of a stationary random field (SRF), specifically 2-D spectrum estimation (SE), are brought out. An expression for the RT of an SRF is...
详细信息
Some important issues that arise in applications involving the Radon transform (RT) of a stationary random field (SRF), specifically 2-D spectrum estimation (SE), are brought out. An expression for the RT of an SRF is developed based on a representation of an SRF of a given power spectrum density (PSD), valid up to second order statistics. The expression is useful in relating the autocorrelation function (ACF) of the RT with the RT of the 2-D ACF, as well as in highlighting some properties of the RT associated with an SRF. Inherent windowing that is inevitable in practice, and some of its implications on 2-D SE using the RT are discussed.
A new design of a switched-current IIR filter using digital filter synthesis is described. The filter consists of unit delays, coefficient multipliers and adders. The design methodology is simple and it gives filters ...
详细信息
A new design of a switched-current IIR filter using digital filter synthesis is described. The filter consists of unit delays, coefficient multipliers and adders. The design methodology is simple and it gives filters whose structure is very regular. The methodology is very suitable for programmable filter design and design automation. As an example, a second-order IIR filter is designed employing the developed technique and it is implemented using a new high accuracy differential switched-current memory cell.
The use of fractal theory in the area of image compression is a relatively new and intriguing concept. Its theoretical basis is well established in the theory of iterated function systems, and particularly in partitio...
详细信息
The use of fractal theory in the area of image compression is a relatively new and intriguing concept. Its theoretical basis is well established in the theory of iterated function systems, and particularly in partitioned iterated function systems. However, there are still numerous questions about its practical implementation to be answered. The main problem with this method is that of reducing the complexity of an otherwise very promising concept. We describe a simple and efficient adaptive fractal-based algorithm for image compression. The algorithm uses horizontal-vertical (HV) partitioning of an image into rectangular blocks of different sizes. The partitioning information is used in the encoding process for determining both the range and the domain image blocks. Neither the ranges nor the domains are determined in advance. Instead, the image is fully partitioned into small areas not larger than some predetermined size. The ranges and the corresponding domains are then determined in an adaptive manner, by comparing the rectangular image blocks with different scales. The proposed algorithm attempts to find a good cover for the ranges as large as possible and it then proceeds toward smaller ranges only if an optimal cover is not found with the larger scale. The method allows the total number of finally chosen ranges to be reduced, which is an essential requirement for achieving high compression ratios. The proposed algorithm gives roughly one-half the number of ranges compared to that given by the quad-tree based partitions yielding significant improvement in the compression ratio.
A method for the signal recovery from nonuniform samples based on the block rearrangement of the sample ensemble is presented. The proposed method belongs to the class of on-line procedures because of the use of block...
详细信息
A method for the signal recovery from nonuniform samples based on the block rearrangement of the sample ensemble is presented. The proposed method belongs to the class of on-line procedures because of the use of block processing that permits a fast start without waiting for additional information. The method consists of three basic stages. In the first stage, a rearrangement of the samples takes place by which they are allocated in blocks. In the second stage, an estimate of the corresponding uniform samples is obtained. The third stage consists in the successive application of an iterative procedure that improves the preliminary estimate of the uniform samples, by correcting the values of the nonuniform samples calculated from the estimate of the uniform samples. To obtain the estimate, two different methods are used: one based on the solution of systems of linear equations, and another one based on singular value decomposition.
Two new algorithms are presented for the generation of long-memory signals using lattice filter structures. Currently, the best known generation methods make use of the Levins on-Durbin recursion which requires 0(N2) ...
暂无评论