The SKIPSM (Separated-Kernel imageprocessing using finite-State Machines) paradigm offers fast execution of a very wide range of binary, grey-scale, 3-D, and color image-processing applications. In this paper the fin...
详细信息
The SKIPSM (Separated-Kernel imageprocessing using finite-State Machines) paradigm offers fast execution of a very wide range of binary, grey-scale, 3-D, and color image-processing applications. In this paper the finite-state-machine approach is applied to one of the `classical' problems of binary imageprocessing: connected-component analysis (`blob' analysis'). Execution-time results are presented, and compared for several examples to execution times for the very-efficient conventional method based on analysis of run-length-encoded data.
This paper presents an end-to-end system for reading handwritten page images. Five functional modules included in the system are introduced in this paper: (i) pre-processing, which concerns introducing an image repres...
详细信息
Tree matching is an important problem used for three-dimensional object recognition in image understanding and vision systems. The objective of tree matching is to find the set of nodes at which a pattern tree matches...
详细信息
Tree matching is an important problem used for three-dimensional object recognition in image understanding and vision systems. The objective of tree matching is to find the set of nodes at which a pattern tree matches a subject tree, In this paper, we describe the design and implementation of a very large scale integration (vLSI) chip for tree pattern matching. The architecture is based on an iterative algorithm that is mapped to a systolic array computational model and takes O(t(n + a)) time to process a subject of size n using n processors where a is the length of the largest substring in the pattern and t is the number of substrings in the pattern. The variables and nonvariables of the pattern tree are processed separately, which simplifies the hardware in each processing element, The proposed partitioning strategy is independent of the problem size and allows larger strings to be processed based on the array size, A prototype CMOS vLSI chip has been designed using the Cadence design tools and the simulation results indicate that it will operate at 33.3 MHz.
A demand on fast imageprocessing and multilevel pattern recognition systems exists in different spheres of science, techniques and production. A specialised video processor 'NEURON-vP100' for IBM compatible P...
详细信息
A demand on fast imageprocessing and multilevel pattern recognition systems exists in different spheres of science, techniques and production. A specialised video processor 'NEURON-vP100' for IBM compatible PC applications, capable of performing 'classical' imageprocessingalgorithms such as scaling, filtering, Fourier transforms and neural nets based pattern recognition tasks as well is presented. Several examples of video processor applications for finger prints, particle tracks, laser images 'intellectual' processing are shown.
algorithms were developed to eliminate nonparametric indeterminancy in radar images processing. The experimental verification of these algorithms on an information provided by airborne SAR 'Compact' showed the...
详细信息
algorithms were developed to eliminate nonparametric indeterminancy in radar images processing. The experimental verification of these algorithms on an information provided by airborne SAR 'Compact' showed the effectiveness of their application for improvement of a SAR equipment and evaluation of its resolution at the flight test image.
Simulations of classical molecular dynamic (MD) systems can be sped up considerably by parallelizing the existing codes for distributed memory machines, In classical MD the CPU time is typically a function of the squa...
详细信息
Simulations of classical molecular dynamic (MD) systems can be sped up considerably by parallelizing the existing codes for distributed memory machines, In classical MD the CPU time is typically a function of the square of the number of atoms, The size of the molecular system which can be solved is therefore often limited by the CPU available. There are different approaches for reducing computation time, One consists in parallelizing sequential O(N-2) algorithms. The other is replacing the calculation of non-bonding forces by a less complex algorithm which can then be parallelized. We have generated a code (MEGADYN) for the simulation of MD of large simulation ensembles (up to 10(6) atoms) on the basis of classical force field methods, A reduction of complexity of the calculation of forces and energy down to O(N) was achieved by employing Greengards fast multipole method (FMM) to the Coulomb interaction. Within the framework of FMM the periodic boundary conditions are realized in a minimum image convention type manner. Thus MEGADYN can be used to simulate NvT as weil as NPT ensembles. (C) 1999 Elsevier Science B.v. All rights reserved.
We show how to achieve better illumination estimates for color constancy by combining the results of several existing algorithms. We consider committee methods based on both linear and non-linear ways of combining the...
详细信息
We show how to achieve better illumination estimates for color constancy by combining the results of several existing algorithms. We consider committee methods based on both linear and non-linear ways of combining the illumination estimates from the original set of color constancy algorithms. Committees of grayworld, white patch and neural net methods are tested. The committee results are always more accurate than the estimates of any of the other algorithms taken in isolation.
In order to make software applications simpler to write and easier to maintain, a software digital signal-processing library that performs essential signal- and image-processing functions is an important part of every...
详细信息
In order to make software applications simpler to write and easier to maintain, a software digital signal-processing library that performs essential signal- and image-processing functions is an important part of every digital signal processor (DSP) developer's toolset. In general, such a library provides high-level interface and mechanisms, therefore, developers only need to know how to use algorithms, not the details of how they work. Complex signal transformations then become function calls, e.g., C-callable functions. Considering the two-dimensional (2-D) convolver function as an example of great significance for DSP's, this paper proposes to replace this software function by an emulation on a field-programmable gate array (FPGA) initially configured by software programming. Therefore, the exploration of the 2-D convolver's design space will provide guidelines for the development of a library of DSP-oriented hardware configurations intended to significantly speed up the performance of general DSP processors. Based on the specific convolver, and considering operators supported in the library as hardware accelerators, a series of tradeoffs for efficiently exploiting the bandwidth between the general-purpose DSP and accelerators are proposed, In terms of implementation, this paper explores the performance and architectural tradeoffs involved in the design of an FPGA-based 2-D convolution coprocessor for the TMS320C40 DSP microprocessor available from Texas Instruments Incorporated, Dallas, TX, However, the proposed concept is not limited to a particular processor.
There is a growing trend in machine color constancy research to use only image chromaticity information, ignoring the magnitude of the image pixels. This is natural because the main purpose is often to estimate only t...
详细信息
ISBN:
(纸本)0892082259
There is a growing trend in machine color constancy research to use only image chromaticity information, ignoring the magnitude of the image pixels. This is natural because the main purpose is often to estimate only the chromaticity of the illuminant. However, the magnitudes of the image pixels also carry information about the chromaticity of the illuminant. One such source of information is through image specularities. As is well known in the computational color constancy field, specularities from inhomogeneous materials (such as plastics and painted surfaces) can be used for color constancy. This assumes that the image contains specularities, that they can be identified, and that they do not saturate the camera sensors. These provisos make it important that color constancy algorithms which make use of specularities also perform well when the they are absent. A further problem with using specularities is that the key assumption, namely that the specular component is the color of the illuminant, does not hold in the case of colored metals. In this paper we investigate a number of color constancy algorithms in the context of specular and nonspecular reflection. We then propose extensions to several variants of Forsyth's CRULE algorithm(1-4) which make use of specularities if they exist, but do not rely on their presence. In addition, our approach is easily extended to include colored metals, and is the first color constancy algorithm to deal with such surfaces. Finally, our method provides an estimate of the overall brightness, which chromaticity-based methods cannot do, and other RGB based algorithms do poorly when specularities are present.
This paper reports on our experience with setting up and analyzing clinical validation studies for new or improved medical imageprocessingalgorithms. This is illustrated with two specific examples: (1) clinical vali...
详细信息
This paper reports on our experience with setting up and analyzing clinical validation studies for new or improved medical imageprocessingalgorithms. This is illustrated with two specific examples: (1) clinical validation of a motion correction algorithm to improve the image quality of digital subtraction angiography (DSA) imaging and (2) clinical validation of an overview image reconstruction algorithm for translated X-ray image sequences (bolus chase reconstruction, spine imaging, colon image map or leg bone imaging).
暂无评论