Multimedia application integrates a variety of media, namely, audio, video, images, graphics, text and data. The ATM (Asynchronous Transfer Mode) technique has been recommended by the CCITT as the transport vehicle fo...
详细信息
Multimedia application integrates a variety of media, namely, audio, video, images, graphics, text and data. The ATM (Asynchronous Transfer Mode) technique has been recommended by the CCITT as the transport vehicle for BISDN (Broadband Integrated Service Digital networks) which is designed to provide multimedia traffic services. In this work we study some of the ATM-compatible multiple access MAN (Metropolitan Area Network) protocols, including DQDB (Distributed Queue Dual Bus, also known as IEEE 802.6), CRMA (Cyclic Reservation Multiple Access), DQMA (Distributed Queue Multiple Access), and FDQ (Fair Distributed Queue), and their performance for different kinds of multimedia application, including interactive education, on-line medical information system, and video conferences. We found that all four protocols achieve maximum throughput even at extremely high data rate, which make them suitable for carrying multimedia traffic in high speed networks.
A scheme for recognizing 3D objects from single 2D images is introduced. The scheme proceeds in two stages. In the categorization stage, the image is matched against prototype objects, and in the identification stage,...
详细信息
A scheme for recognizing 3D objects from single 2D images is introduced. The scheme proceeds in two stages. In the categorization stage, the image is matched against prototype objects, and in the identification stage, the observed object is matched against the individual models of its class, where classes are expected to contain objects with relatively similar shapes. The advantage of categorizing the object before it is identified is twofold. First, the image is compared to a smaller number of models, since only models that belong to the object's class need to be considered. Second, the cost of comparing the image to each model in a class is very low, because correspondence is computed once for the whole class. The correspondence and object pose computed in the categorization stage to align the prototype with the image are reused in the identification stage to align the individual models with the image. As a result, identification is reduced to a series of simple template comparisons.< >
Clustering is employed in information retrieval systems to enhance the efficiency and effectiveness of the retrieval process. Clustering is achieved by partitioning the documents in a collection into classes such that...
详细信息
The availability of freeness and sharing information for logic programs has proven useful in a wide variety of applications. However, deriving correct freeness and sharing information turns out to be a complex task. I...
详细信息
The author introduces the theory of pattern recognition using class 2 dynamical systems. In particular, the theory of fractal learning is considered, and fractal learning theory is applied to character recognition. Fr...
详细信息
The author introduces the theory of pattern recognition using class 2 dynamical systems. In particular, the theory of fractal learning is considered, and fractal learning theory is applied to character recognition. Fractal image encoding, that is storing image in stable configurations of dynamical systems, is discussed. Image encoding and decoding algorithms are presented. Several types of fractal equations and their solution are also discussed. Some primary results of fractal learning are demonstrated.< >
Image compression using stochastic artificial neural networks (SANNs) is studied. The ideal is to store an image in a stable distribution of a stochastic neural network. Given an input image f epsilon F, one can find ...
详细信息
Image compression using stochastic artificial neural networks (SANNs) is studied. The ideal is to store an image in a stable distribution of a stochastic neural network. Given an input image f epsilon F, one can find a SANN t epsilon T such that the equilibrium distribution of this SANN is the given image f. Therefore, the input image, f, is encoded into a specification of a SANN, t. This mapping from F (image space) to T (parameter space of SANN) defines the SANN transformation. It is shown that the compression ratio R of the SANN transformation is R=O(n/(K (log n)/sup 2/)) where n is the number of pixels. To complete a SANN transformation, SANN equations must be solved. Two SANN equations are presented. The solution of SANN is briefly discussed.< >
A system for performing highly parallel, predictable real-time image filtration is described. The application software was developed using a special class of abstract data types (ADT) constructed in the RT-X language ...
详细信息
The theory of worm routing (rather than packet routing) recently attracts an increased attention as an abstraction of the underlying communication mechanisms in many parallel machines. Routing the worms in the hot-pot...
详细信息
The theory of worm routing (rather than packet routing) recently attracts an increased attention as an abstraction of the underlying communication mechanisms in many parallel machines. Routing the worms in the hot-potato style is a desired form of communication in high-speed optical interconnection networks. The authors develop a simple method for the design of parallel hot-potato worm routing algorithms. The basic approach is to simulate known packet routing algorithms, so that in each step worms are moved around instead of packets. For hot-potato permutation routing of worms of size k the authors have the following results. They get a O(k/sup 2.5/n) algorithm for the n*n mesh, and a O(k/sup 1.5/n) algorithm for the corresponding offline problem. For the 2/sup n/-nodes hypercube they get a O(k/sup 3/n log /sup 2/n) deterministic algorithm, and a O(k/sup 3/n) randomized algorithm. Although the results are given for permutation routing on the mesh and the hypercube, the general method can be applied to many other networks and to more general communication patterns as well. Moreover, once better routing algorithms are found for the underlying network, the worm routing algorithm improves, too.< >
Infinite, recursive versions of NP optimization problems are defined. For example, MAX CLIQUE becomes the question of whether a recursive graph contains an infinite clique. The work was motivated by trying to understa...
详细信息
Infinite, recursive versions of NP optimization problems are defined. For example, MAX CLIQUE becomes the question of whether a recursive graph contains an infinite clique. The work was motivated by trying to understand what makes some NP problems highly undecidable in the infinite case, while others remain on low levels of the arithmetical hierarchy. Two results are proved; one enables using knowledge about the infinite case to yield implications to the finite case, and the other enables implications in the other direction. Taken together, the two results provide a method for proving (finitary) problems to be outside the syntactic class MAX NP, hence outside MAX SNP too. The technique is illustrated with many examples.< >
暂无评论