Future lithography systems must produce more dense chips with smaller feature sizes, while maintaining throughput comparable to today's optical lithography systems. This places stringent data-handling requirements...
详细信息
ISBN:
(纸本)0819436151
Future lithography systems must produce more dense chips with smaller feature sizes, while maintaining throughput comparable to today's optical lithography systems. This places stringent data-handling requirements on the design of any maskless lithography system. Today's optical lithography systems transfer one layer of data from the mask to the entire wafer in about sixty seconds. To achieve a similar throughput for a direct-write maskless lithography system with a pixel size of 25 nm, data rates of about 10 Tb/s are required. In this paper, we propose an architecture for delivering such a data rate to a parallel array of writers. In arriving at this architecture, we conclude that pixel domain compression schemes are essential for delivering these high data rates. To achieve the desired compression ratios, we explore a number of binary lossless compression algorithms, and apply them to a variety of layers of typical circuits such as memory and control. The algorithms explored include the Joint Bi-Level imageprocessing Group (JBIG), Ziv-Lempel (LZ77) as implemented by ZIP, as well as our own extension of Ziv-Lempel to two-dimensions. For all the layouts we tested, at least one of the above schemes achieves a compression ratio of 20 or larger, demonstrating the feasibility of the proposed system architecture.
Both the methodology and results of experimental research performed for the laser path images normalization by means of compact models description that describe image classes are considered in this paper. The problems...
详细信息
Both the methodology and results of experimental research performed for the laser path images normalization by means of compact models description that describe image classes are considered in this paper. The problems of preliminary imageprocessing based on the method of generalized Q-transformation are being solved. The image segmentation with the formation of connectivity matrices and the formal description of the resulting components are taken into consideration as well. The calculating algorithms based on the methodology of dichotomous balance of the images with the analysis of the shape and definition of coordinates being prepared have been used for the classification of laser path images. The research paper submitted consists of two parts. The first part deals with the change of images of a laser path, the second one deals with their coordinate definition.
Spatial data mining recently emerges from a number of real applications, such as real-estate marketing, urban planning, weather forecasting, medical image analysis, road traffic accident analysis, etc. It demands for ...
详细信息
Spatial data mining recently emerges from a number of real applications, such as real-estate marketing, urban planning, weather forecasting, medical image analysis, road traffic accident analysis, etc. It demands for efficient solutions for many new, expensive, and complicated problems. In this paper, we investigate a proximity matching problem among clusters and features. The investigation involves proximity relationship measurement between clusters and features. We measure proximity in an average fashion to address possible non-uniform data distribution in a cluster. An efficient algorithm is proposed and evaluated to solve the problem. The algorithm applies a standard multistep paradigm in combining with novel lower and upper proximity bounds. The algorithm is implemented in several different modes. Our experiment results not only give a comparison among them but also illustrate the efficiency of the algorithm. (C) 2000 Elsevier Science B.v. All rights reserved.
This work presents a new method for image compression, using Tritree decomposition (TT). TT have been originally proposed by Wille for generation of non-structured finite elements meshs, for numerical solution of diff...
详细信息
Parallel systems provide a robust approach for high performance computing. Lately the use of parallel computing has become more available as new;parallel environments have evolved. Low cost and high performance of off...
详细信息
ISBN:
(纸本)0819438626
Parallel systems provide a robust approach for high performance computing. Lately the use of parallel computing has become more available as new;parallel environments have evolved. Low cost and high performance of off-the-shelf PC processors have made PC-based multiprocessor systems popular. These systems typically contain two or four processors. Standardized POSIX-threads have formed an environment for the effective utilization of several processors, Moreover, distributed computing using networks of workstations has increased. The motivation for this work is to apply these techniques in computer vision. The Hough Transform (HT) is a well-known method for detecting global features in digital images. However, in practice, the sequential HT is a slow method with large images. We study the behavior of line detecting HT with both message passing workstation networks and shared-memory, multiprocessor systems. Parallel approaches suggested in this paper seem to decrease the computation time of HT significantly. Thus, the methods are useful for real-world applications.
Our goal is to design and to achieve a multiple purpose vision system for various robotics applications :wheeled robots (like cars for autonomous driving), legged robots (six, four (SONY's AIBO) legged robots, and...
详细信息
ISBN:
(纸本)0819438626
Our goal is to design and to achieve a multiple purpose vision system for various robotics applications :wheeled robots (like cars for autonomous driving), legged robots (six, four (SONY's AIBO) legged robots, and humanoid), flying robots (to inspect bridges for example) in various conditions: indoor or outdoor. Considering that the constraints depend on the application, we propose an edge segmentation implemented either in software, or in hardware using CPLDs (ASICs or FPGAs could be used too). After discussing the criteria of our choice, we propose a chain of imageprocessing operators constituting an edge segmentation. Although this chain is quite simple and very fast to perform, results appear satisfactory, We proposed a software implementation of it. Its temporal optimization is based on : its implementation under the pixel data flow programming model, the gathering of local processing when it is possible, the simplification of computations, and the use of fast access data structures. Then, we describe a first dedicated hardware implementation of the first part, which requires 9 CPLS in this low cost version. It is technically possible, but more expensive, to implement these algorithms using only a single FPGA.
In this paper we discuss a new implementation of a floating point based rainfalling watershed algorithm. First, we analyze and compare our proposed algorithm and its implementation with two implementations based on th...
详细信息
In this paper we discuss a new implementation of a floating point based rainfalling watershed algorithm. First, we analyze and compare our proposed algorithm and its implementation with two implementations based on the well-known discrete vincent-Soille flooding watershed algorithms. Next, we show that by carefully designing and optimizing our algorithm a memory (bandwidth) efficient and high speed implementation can be realized. We report on timing and memory usage results for different compiler settings, computer systems and algorithmic parameters. Our optimized implementation turns out to be significantly faster than the two vincent-Soille based implementations with which we compare. Finally, we include some segmentation results to illustrate that visually acceptable and almost identical segmentation results can always be obtained for all algorithms being compared. And, we also explain how, in combination with other pre- or post-processing techniques, the problem of oversegmentation (a typical problem of all raw watershed algorithms) can be (partially) overcome. All these properties make that our proposed implementation is an excellent candidate for use in various practical applications where high speed performance and/or efficient memory usage is needed.
Modern large-scale "functional genomics" projects are inconceivable without the automated processing and computer-aided analysis of images. The project we are engaged in is aimed at the construction of heuri...
详细信息
With the low cost of solid-state camera systems, it is now possible to include many cameras on a mobile robot or other machine. However, video processing is still relatively expensive. Therefore it is often desirable ...
详细信息
ISBN:
(纸本)0819438626
With the low cost of solid-state camera systems, it is now possible to include many cameras on a mobile robot or other machine. However, video processing is still relatively expensive. Therefore it is often desirable to share several cameras with a single processor. The purpose of this paper is to describe the design of a video switching system that permits eight cameras to be multiplexed with a single chip. Multiples of eight could also easily be accomplished. The heart of the system is a Maxim video switch. The user simply selects using a three-bit control signal, which camera signal is selected. The output of the video switch is then the desired camera image. One application of this video switch is a four camera input system to a mobile robot being constructed at the University of Cincinnati. Other applications include surveillance and other mobile systems. The decision as to which camera to observe can be made automatically from a computer providing a great versatility. For example, supplemental motion detectors could be used to activate the camera selection for a surveillance system. Higher-level logic has been used on our mobile robot application. Still higher-level logic could be used to fuse the video information in various ways before processing. The significance of this device is that it provides a wealth of video information to be used at the discretion of either a human viewer or automatic system.
This paper deals with joint detection and decoding techniques for coded CDMA (Code Division Multiple Access) systems. A promising approach in this context consists of combining the results of a soft output multiuser d...
详细信息
ISBN:
(纸本)0780365143
This paper deals with joint detection and decoding techniques for coded CDMA (Code Division Multiple Access) systems. A promising approach in this context consists of combining the results of a soft output multiuser detector (MUD) with single user soft-input soft-output (SISO) decoders in an iterative fashion (so called "turbo" principle). In a first part of the paper we describe the CDMA channel under the form of a probabilistic graphical model (also known as Bayesian, or belief network) which provides a very generic and natural way of deriving turbo algorithms. The structure of the algorithm is then obtained by direct application of general probability propagation rules rather than by using the context dependent notions of intrinsic and extrinsic information. It turns out however that the obtained algorithm still requires soft output multiuser detection in a pseudo model where the symbols emitted by the user are a priori independent which is not computationally feasible. The second part of the paper describes a simulation based MUD scheme which draws upon recent advances in Markov Chain Monte Carlo methods: The performance of the overall turbo multiuser decoder is compared with that of a state-of-the-art algorithm with comparable computational cost.
暂无评论