image fusion is the process of combining multiple images into a single image which retains the most pertinent information from each original image source. More recently, multi-scale image fusion approaches have emerge...
详细信息
ISBN:
(纸本)9781424465880
image fusion is the process of combining multiple images into a single image which retains the most pertinent information from each original image source. More recently, multi-scale image fusion approaches have emerged as a means of providing a more meaningful fusion which better reflects the human visual system. In this paper, multi-scale decomposition techniques and image fusion algorithms are adapted using the Parameterized Logarithmic imageprocessing (PLIP) model, a nonlinear imageprocessing framework which more accurately processes images. Experimental results via computer simulations illustrate the improved performance of the proposed algorithms by both qualitative and quantitative means.
Two algorithms that can obtain more accurate estimate of the fractal dimension are proposed. One is the shifting DBC (SDBC) algorithm and the other one is the scanning BC (SBC) algorithm. It is theoretically proven th...
详细信息
ISBN:
(纸本)0780370414
Two algorithms that can obtain more accurate estimate of the fractal dimension are proposed. One is the shifting DBC (SDBC) algorithm and the other one is the scanning BC (SBC) algorithm. It is theoretically proven that the SDBC algorithm approaches the estimated value closer to the exact fractal dimension than the DBC method. Simulation results show that the proposed algorithms consistently give more satisfactory results on textured images.
The current advances in hardware led to the development of the GPGPU (General-purpose computing on graphics processing units) paradigm. Thus, nowadays, the GPU (Graphics processing Unit) is used not only for graphics ...
详细信息
ISBN:
(纸本)9788394625375
The current advances in hardware led to the development of the GPGPU (General-purpose computing on graphics processing units) paradigm. Thus, nowadays, the GPU (Graphics processing Unit) is used not only for graphics programming, but also for general purpose algorithms. This paper discusses several methods regarding the use of CUDA (Compute Unified Device Architecture) for 2D and 3D imageprocessing techniques. Some general rules for writing parallel algorithms in computer vision are pointed out. A theoretic comparison between the complexity for CPU (Central processing Unit) and GPU implementations of imageprocessingalgorithms is given. Also, real computing times are provided for several algorithms in order to point out the actual performance gain of using the GPU over CPU. The factors that contribute to the difference between theoretic and real performance gain are also discussed.
In this paper, we present a circularly symmetric point spread function (PSF) estimation technique for a fully digital auto-focusing system. The proposed algorithm provides realistic, unsupervised PSF estimation by est...
详细信息
ISBN:
(纸本)9780819479259
In this paper, we present a circularly symmetric point spread function (PSF) estimation technique for a fully digital auto-focusing system. The proposed algorithm provides realistic, unsupervised PSF estimation by establishing the relationship between the one-dimensional ideal step response and the corresponding two-dimensional circularly symmetric PSF. Main advantage of the proposed algorithm is the accurate estimation of the PSF combining by using interpolation, feasible step response estimation. The proposed estimation method will serve as (i) a fundamental procedure in designing an in-house extended depth-of-field (EDoF) system, (ii) a detecting method for improperly manufactured imaging sensors in the production line, and (iii) a PSF estimation method for general image restoration algorithms.
To reduce the number of traffic accidents and to increase the drivers comfort, the thought of designing driver assistance systems rose in the past years. Fully or partly autonomously guided vehicles, particularly for ...
详细信息
ISBN:
(纸本)0780362985
To reduce the number of traffic accidents and to increase the drivers comfort, the thought of designing driver assistance systems rose in the past years. Fully or partly autonomously guided vehicles, particularly for road traffic, pose high demands on the development of reliable algorithms. Principal problems are caused by having a moving observer in predominantly natural environments. At the Institut fur Neuroinformatik methods for analyzing driving relevant scenes by computer vision are developed in cooperation with several partners from the automobile industry. In this paper we present a solution for a driver assistance system. We concentrate on the aspects of video-based scene analysis and organization of behavior.
Two algorithms are presented for the detection of gradual transitions in video sequences. The first is a dissolve detection algorithm utilizing certain properties of a dissolve's trajectory in image-space. The sec...
详细信息
ISBN:
(纸本)0780362985
Two algorithms are presented for the detection of gradual transitions in video sequences. The first is a dissolve detection algorithm utilizing certain properties of a dissolve's trajectory in image-space. The second is an algorithm to detect a wide variety of wipes based on image histogram characteristics during such transitions. Both algorithms operate in the compressed domain, requiring only partial decoding of the compressed video stream. Experiments show the algorithms perform well in detecting a wide variety of gradual transitions, and at a significant reduction in computation time when compared with full-frame methods.
A Toeplitz-block-Toeplitz (TBT) matrix is block Toeplitz with Toeplitz blocks. TBT systems of equations arise in 2-D interpolation, 2-D linear prediction and 2-D least-squares deconvolution problems. Although the doub...
详细信息
ISBN:
(纸本)0780370414
A Toeplitz-block-Toeplitz (TBT) matrix is block Toeplitz with Toeplitz blocks. TBT systems of equations arise in 2-D interpolation, 2-D linear prediction and 2-D least-squares deconvolution problems. Although the doubly Toeplitz structure should be exploitable in a fast algorithm, existing fast algorithms only exploit the block Toeplitz structure, not the Toeplitz structure of the blocks. Iterative algorithms can employ the 2-D FFT, but usually take thousands of iterations to converge. We develop a new fast algorithm that assumes a smoothness constraint (described in the text) on the matrix entries. For an M-2 X M-2 TBT matrix with M M x M Toeplitz blocks along each edge, the algorithm requires only O(6M(3)) operations to solve an M-2 X M-2 linear system of equations;parallel computing on 2M processors can be performed on the algorithm as given. Two examples show the operation and performance of the algorithm.
The discrete system mathematical model with casual chaotic structure for algorithms synthesis to radar-tracking coherent and noncoherent images of spreading surface is investigated. Discrete systems with casual chaoti...
详细信息
ISBN:
(纸本)9780819467270
The discrete system mathematical model with casual chaotic structure for algorithms synthesis to radar-tracking coherent and noncoherent images of spreading surface is investigated. Discrete systems with casual chaotic structure are understood observably in the discrete moments of time as stochastic dynamic systems which structure has final number of possible conditions, varied each other at the casual moments of time. Radar images processing (segmentation) by two new algorithms in remote distance problems applications are discussed.
The efficiency of numerical time-stepping methods for dynamical systems is greatly enhanced by automatic time step variation. In this paper we present and discuss three different approaches to step size selection: (i)...
详细信息
The efficiency of numerical time-stepping methods for dynamical systems is greatly enhanced by automatic time step variation. In this paper we present and discuss three different approaches to step size selection: (i) control theory (to keep the error in check);(ii) signal processing (to produce smooth step size sequences and improve computational stability);and (iii) adaptivity, in the sense that the time step should be covariant or contravariant with some prescribed function of the dynamical system's solution. Examples are used to demonstrate the different advantages in different applications. The main ideas are further developed to approach some open problems that are subject to special requirements. (c) 2005 IMACS. Published by Elsevier B.V. All rights reserved.
We address the problem of target segmentation and detection in coherent active polarimetric images We consider polarimetric imagers which illuminate the scene with a laser beam and which measure how this light is depo...
详细信息
ISBN:
(纸本)0780367251
We address the problem of target segmentation and detection in coherent active polarimetric images We consider polarimetric imagers which illuminate the scene with a laser beam and which measure how this light is depolarized by the scene Since they are formed with coherent light, these "depolarization" images are perturbed by strong speckle-like noise, and by the spatial nonuniformity of the illumination beam We design imageprocessingalgorithms which are adapted to the original statistical properties of these images We address object segmentation using statistical active contours and target detection using maximum-likelihood (ML) algorithms. We show that the proposed algorithms perform well on both simulated and real-world images.
暂无评论