Scientific Journals and Yearbooks Published at SAS

Article List

Computing and Informatics

Volume 23, 2004, No. 3
Content:

BRITANAK, V.
A Note on the MDCT/MDST and Pseudoinverse Matrix.
In Computing and Informatics. Vol. 23, no. 3 (2004), p. 205-214.
SUN, Y. - YUAN, B. - MIAO, Z. - WU, W.
From GMM to HGMM: An Approach In Moving Object Detection.
In Computing and Informatics. Vol. 23, no. 3 (2004), p. 215-237.
BAGHERI, A. - RAZZAZI, M.
Drawing Free Trees Inside Simple Polygons Using Polygon Skeleton.
In Computing and Informatics. Vol. 23, no. 3 (2004), p. 239-254.
CHANDRA SAXENA, P. - ROY CHOUDHURY, D. - GABRANI, G.
DSTP-AN: A Distributed System for Transaction Processing Based on Data Resource Migration in ATM Networks.
In Computing and Informatics. Vol. 23, no. 3 (2004), p. 255-285.
MEDUNA, A. - KOPECEK, T.
Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism.
In Computing and Informatics. Vol. 23, no. 3 (2004), p. 287-302.

	A Note on the MDCT/MDST and Pseudoinverse Matrix VLADIMIR BRITANAK Modified discrete cosine transform, modified discrete sine transform, modulated lapped transform, modulated complex lapped transform, pseudoinverse matrix The modified discrete cosine transform (MDCT) and modified discrete sine transform (MDST) both for the evenly and oddly stacked systems are perfect reconstruction cosine/sine--modulated filter banks based on time domain aliasing cancellation (TDAC) employed in the current international audio coding standards and commercial audio compression products. Based on the matrix representation of MDCTs and MDSTs it is shown that the transposed MDCT and MDST matrices are actually the pseudoinverses of their corresponding forward transform matrices. The pseudoinverse matrix and its properties provide an elegant mathematical tool to characterize the MDCT/MDST as the analysis/synthesis filter banks in the matrix representation. Computing and Informatics. Volume 23, 2004, No. 3: 205-214.
	From GMM to HGMM: An Approach In Moving Object Detection YUNDA SUN, BAOZONG YUAN, ZHENJIANG MIAO, WEI WU Moving object detection, bacground subttraction, background model, Gaussian mixture model, hierarchical GMM Background subtraction methods are widely exploited for moving object detection in many applications. A key issue to these methods is how to model and maintain the background correctly and efficiently. This paper describes a foreground detector used in our surveillance system characterized by multiple Gaussian statistics. Compared with the existing methods, our Gaussian mixture model (GMM) differs in model initialization, matching, classification and updating. We propose a fast on-line initialization algorithm to train GMM parameters quickly and correctly. All components of the GMM are classified into three kinds: moving object model, still life model and background model, which is effective for complete detection within a certain period of time. GMMs at different scales are organized in a hierarchical manner to handle sharp illumination changes as well as gradual ones. A convenient way to combine luminance distortion with chrominance distortion is presented for shadow detection in complex scenes. Extensive experimental results are provided to highlight the advantages of our detector. Computing and Informatics. Volume 23, 2004, No. 3: 215-237.
	Drawing Free Trees Inside Simple Polygons Using Polygon Skeleton AlIREZA BAGHERI, MOHAMMADREZA RAZZAZI Graph drawing, simulated annealing, straight skeleton Most of graph drawing algorithms draw graphs on unbounded planes. In this paper we introduce a new polyline grid drawing algorithm for drawing free trees on plane regions which are bounded by simple polygons. Our algorithm uses the simulated annealing (SA) method, and by means of the straight skeletons of the bounding polygons guides the SA method to uniformly distribute the vertices of the given trees over the given regions. Our results show improvements to the previous algorithms that use the SA method to draw graphs inside rectangles. To our knowledge, this paper is the first attempt for developing algorithms that draw graphs on regions which are bounded by simple polygons. Computing and Informatics. Volume 23, 2004, No. 3: 239-254.
	DSTP-AN: A Distributed System for Transaction Processing Based on Data Resource Migration in ATM Networks PREM CHANDRA SAXENA, D. ROY CHOUDHURY, GOLDIE GABRANI ATM networks, data resource, migration, trtansaction processing The dynamic migration of data resources has become a strong tool for transaction processing in broadband networks such as ATM. In this paper, a distributed system that takes advantage of data resource migration for transaction processing in ATM networks has been proposed. The proposed system provides mechanisms to select the transaction processing method, to migrate data resources in a way that reduces the time delay and message traffic in locating and accessing them. The first mechanism selects one of the two transaction processing methods: the traditional method that uses two phase commit protocol and other new method based on data resource migration. The second mechanism attempts to improve performance by making each site follow a local policy for directing requests to locate and access data resources as well as migrating them through the system. For this, a new scheme that focuses on reducing the time delay and message traffic needed to access the migratory data resources is proposed. The performance of the proposed scheme has also been evaluated and compared with one of the existing schemes by a simulation study under different system parameters such as frequency of access to the data resources, frequency of data resource migrations, scale of network, etc. Computing and Informatics. Volume 23, 2004, No. 3: 255-285.
	Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism ALEXANDER MEDUNA, TOMAS KOPECEK Descriptional complexity, matrix grammars, simple semi-conditional grammars This paper discusses some conditional versions of matrix grammars. It establishes several characterizations of the family of the recursively enumerable languages based on these grammars. In fact, making use of the Geffert Normal forms, the present paper demonstrates these characterizations based on matrix grammars with conditions of a limited length, a reduced number of nonterminals, and a reduced number and size of matrices. Computing and Informatics. Volume 23, 2004, No. 3: 287-302.