The Experts below are selected from a list of 2346 Experts worldwide ranked by ideXlab platform
P M Makila - One of the best experts on this subject based on the ideXlab platform.
-
when is a Linear Convolution system stabilizable
Systems & Control Letters, 2002Co-Authors: P M MakilaAbstract:Lack of operator closedness and closability arguments are used to discuss the impossibility of finite lp/Lp gain stabilization of unstable finite-dimensional Linear (Convolution operator) systems in the doubly infinite time-axis case for any 1⩽p⩽∞. The presented analysis generalizes and refines a result due to Georgiou and Smith (IEEE Trans. Automat. Control 40 (1995) 516) for the L2(−∞,∞) setting.
M. Benaissa - One of the best experts on this subject based on the ideXlab platform.
-
ISCAS - Fault-tolerant Linear Convolution using residue number systems
Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94, 1994Co-Authors: M.g. Parker, M. BenaissaAbstract:This paper proposes a fault-tolerant Linear Convolution architecture using Residue Number Systems (RNS) and Polynomial Residue Number Systems (PRNS). The RNS and PRNS are both given error-detection capability by the addition of redundant residue channels, and the combined redundancy enables error-correction without explicit error-decoding. The method is simple, fast, and amenable to VLSI implementation. >
-
Fault-tolerant Linear Convolution using residue number systems
Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94, 1994Co-Authors: M.g. Parker, M. BenaissaAbstract:This paper proposes a fault-tolerant Linear Convolution architecture using Residue Number Systems (RNS) and Polynomial Residue Number Systems (PRNS). The RNS and PRNS are both given error-detection capability by the addition of redundant residue channels, and the combined redundancy enables error-correction without explicit error-decoding. The method is simple, fast, and amenable to VLSI implementation.
Ching-tsorng Tsai - One of the best experts on this subject based on the ideXlab platform.
-
SMC - A piecewise Linear Convolution interpolation with third-order approximation for real-time image processing
2010 IEEE International Conference on Systems Man and Cybernetics, 2010Co-Authors: Chishyan Liaw, Ching-tsorng TsaiAbstract:This paper presents a high-performance architecture of a piecewise Linear Convolution interpolation for digital image. The kernel of the proposed method is built up of piecewise Linear polynomial and approximates the ideal sinc-function in interval [−2, 2]. The proposed architecture reduces the computational complexity of generating weighting coefficients and provides a simple hardware architecture design, low computation cost and is easy to meet real-time requirement. The architecture is implemented on the Virtex-II FPGA, and the VLSI architecture has been successfully designed and implemented with TSMC 0.13µm standard cell library. The simulation results indicate that the interpolation quality of the proposed architecture is better than cubic Convolution interpolations mostly, which is able to process various-ratio image scaling for HDTV in real-time.
-
A piecewise Linear Convolution interpolation with third-order approximation for real-time image processing
2010 IEEE International Conference on Systems Man and Cybernetics, 2010Co-Authors: Chishyan Liaw, Ching-tsorng TsaiAbstract:This paper presents a high-performance architecture of a piecewise Linear Convolution interpolation for digital image. The kernel of the proposed method is built up of piecewise Linear polynomial and approximates the ideal sinc-function in interval [-2, 2]. The proposed architecture reduces the computational complexity of generating weighting coefficients and provides a simple hardware architecture design, low computation cost and is easy to meet real-time requirement. The architecture is implemented on the Virtex-II FPGA, and the VLSI architecture has been successfully designed and implemented with TSMC 0.13μm standard cell library. The simulation results indicate that the interpolation quality of the proposed architecture is better than cubic Convolution interpolations mostly, which is able to process various-ratio image scaling for HDTV in real-time.
R.k. Ward - One of the best experts on this subject based on the ideXlab platform.
-
Reduction of boundary artifacts in image restoration
IEEE Transactions on Image Processing, 1996Co-Authors: Farhad Aghdasi, R.k. WardAbstract:The abrupt boundary truncation of an image introduces artifacts in the restored image. The traditional solution is to smooth the image data using special window functions such as Hamming or trapezoidal windows. This is followed by zero-padding and Linear Convolution with the restoration filter. This method improves the results but still distorts the image, especially at the margins. Instead of the above method, we propose a different procedure. This procedure is simple and exploits the natural property of "circular" or periodic Convolution of the discrete Fourier transform (DFT). Instead of padding the image by zeros, it is padded by a reflected version of it. This is followed by "circular" Convolution with the restoration filter. This procedure is shown to lead to better restoration results than the windowing and Linear Convolution techniques. The computational effort is also improved since our method requires half the number of computations required by the conventional Linear deConvolution method.
V. A. Lomazov - One of the best experts on this subject based on the ideXlab platform.
-
estimation of the Linear Convolution sensitivity of particular criteria during the expert determination of weight factors
Scientific and Technical Information Processing, 2014Co-Authors: M.g. Dmitriev, V. A. LomazovAbstract:A method for solving the problems of multicriterion optimization on the basis of the use of aggregated criterion in the form of the Linear Convolution of particular criteria, where the weight factors are obtained by ranking the particular criteria by their significance degree, is discussed. A procedure that allows one to estimate a change in the optimal solution with the elementary variation of expert judgments is proposed. A numerical example is presented.
-
ITQM - Sensitivity of Linear Convolution from Expert Judgments
Procedia Computer Science, 2014Co-Authors: M.g. Dmitriev, V. A. LomazovAbstract:Abstract It is suggested an approach to solving optimization problems for aggregated criterion as a Linear Convolution of partial criteria, where the weights are obtained on the basis of ranking partial criteria in order of importance. The procedure, based on the method of small parameter, is proposed in order to estimate the change of optimal solutions when there is an elementary change of expert judgments.
-
Sensitivity of Linear Convolution from expert judgments
Procedia Computer Science, 2014Co-Authors: M.g. Dmitriev, V. A. LomazovAbstract:It is suggested an approach to solving optimization problems for aggregated criterion as a Linear Convolution of partial criteria, where the weights are obtained on the basis of ranking partial criteria in order of importance. The procedure, based on the method of small parameter, is proposed in order to estimate the change of optimal solutions when there is an elementary change of expert judgments. © 2014 Published by Elsevier B.V.
