检索结果-内蒙古大学图书馆

5th Int. workshop on Digital image processing and Computer Graphics (DIP-94)

作者： Glumov, N.I. Myasnikov, V.V. Sergeyev, Vladislav V. Image Processing Systems Inst. Samara Russia

ISBN: (纸本)0819417076

The work deals with the application of polynomial bases for digital image processing using sliding window. An algorithm is built for the parallel-recursive calculation of local moment characteristics. A parametric set of polynomial bases is introduced that yields the fastest realization of the algorithm. We consider methods of the calculation of the polynomial approximation parameters for the convolution kernel. The examples are adduced of the employment of polynomial bases for the 2-D signal filtration, and for the detection and recognition of objects on the image.

关键词： image processing

来源：评论

学校读者我要写书评

暂无评论

LEAST MEAN P-POWER ERROR CRITERION FOR ADAPTIVE FIR FILTER

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1994年第9期12卷 1540-1547页

作者： PEI, SC TSENG, CC Department of Electrical Engineering National Taiwan University Taipei Taiwan

An adaptive FIR filter based on the feast mean p-power error (MPE) criterion is investigated, First, some useful properties of MPE function are studied. Three main results are as follows: 1) MPE function is a convex function of filter coefficients;so it has no local minima, 2) When input process and desired process are both Gaussian processes, then MPE function has the same optimum solution as conventional Wiener solution for any p. 3) When input process and desired process are non-Gaussian processes, then MPE function may have better optimum solution than Wiener solution, Next, a least mean p-power (LMP) error adaptive algorithm is derived and some application examples are presented, Consequently, when the signal is corrupted by an impulsive noise, the adaptive algorithm with p = 1 is preferred, Furthermore, when the signal is corrupted by noise or interference, the adaptive algorithm with proper choice of p mag be preferred,

关键词： Finite impulse response filter Least squares approximation Adaptive algorithm Adaptive filters Signal processing algorithms IIR filters Minimization Gaussian processes Signal processing Interference

来源：评论

学校读者我要写书评

暂无评论

Euclidean input mapping in a N-tuple approximation network

Euclidean input mapping in a N-tuple approximation network

引用

IEEE Digital Signal processing workshop

作者： A. Kolcz N.M. Allinson Dept. of Electron. York Univ. UK Department of Electronics Image Engineering Laboratory University of York York UK

A type of the N-tuple neural architecture can be shown to perform function approximation based on local interpolation, similar that performed by RBF networks. Since the size and speed of operation in this implementation are independent of the training set size, it is attractive for practical adaptive solutions. However, the kernel function used by the network is non-Euclidean, which can cause performance losses for high-dimensional input data. The authors investigate methods for realising more isotropic kernel basis functions by use of special data encoding techniques.< >

关键词： Intelligent networks Kernel Retina Function approximation Electronic mail Interpolation Sampling methods Laboratories Radial basis function networks Performance loss

来源：评论

学校读者我要写书评

暂无评论

Reconfiguration in 3D meshes

Reconfiguration in 3D meshes

引用

IEEE international Symposium on Defect and Fault Tolerance in VLSI Systems

作者： Anuj Chandra Rami Melhem Department of Electrical Engineering University of Pittsburgh Pittsburgh PA USA Department of Computer Science University of Pittsburgh Pittsburgh PA USA

ISBN: (纸本)0818663073

The 1 1/2 track model for fault tolerant 2D processor arrays is extended to 3D mesh architectures. non-intersecting, continuous, straight and non-near miss compensation paths are considered. It is shown that when six directions in the 3D mesh are allowed for compensation paths, then switches with 13 states are needed to preserve the 3D mesh topology after faults. It is also shown that switch reconfiguration after faults is local in the sense that the state of each switch is uniquely determined by the state of the processors connected to it.

关键词： Switches Fault tolerance image processing Computer science Topology Magnetic resonance Labeling Parallel processing Nearest neighbor searches

来源：评论

学校读者我要写书评

暂无评论

DCT QUANTIZATION MATRICES VISUALLY OPTIMIZED FOR INDIVIDUAL imageS 4

DCT QUANTIZATION MATRICES VISUALLY OPTIMIZED FOR INDIVIDUAL ...

引用

CONF ON HUMAN VISION, VISUAL processing, AND DIGITAL DISPLAY 4

作者： WATSON, AB NASA Ames Research Ctr. (United States)

ISBN: (纸本)0819411469

Several image compression standards (JPEG, MPEG, H.261) are based on the Discrete Cosine Transform (DCT). These standards do not specify the actual DCT quantization matrix. Ahumada & Peterson and Peterson, Ahumada & Watson provide mathematical formulae to compute a perceptually lossless quantization matrix. Here I show how to compute a matrix that is optimized for a particular image. The method treats each DCT coefficient as an approximation to the local response of a visual `channel.' For a given quantization matrix, the DCT quantization errors are adjusted by contrast sensitivity, light adaptation, and contrast masking, and are pooled non-linearly over the blocks of the image. This yields an 8 X 8 `perceptual error matrix.' A second non-linear pooling over the perceptual error matrix yields total perceptual error. With this model we may estimate the quantization matrix for a particular image that yields minimum bit rate for a given total perceptual error, or minimum perceptual error for a given bit rate. Custom matrices for a number of images show clear improvement over image-independent matrices. Custom matrices are compatible with the JPEG standard, which requires transmission of the quantization matrix.

关键词： Quantization Matrices Visualization image compression Visibility image quality Error analysis image quality standards Contrast sensitivity Visual compression

来源：评论

学校读者我要写书评

暂无评论

The reaction-diffusion cellular neural network 2

The reaction-diffusion cellular neural network

引用

2nd international workshop on Cellular Neural Networks and their Applications, CNNA 1992

作者： Price, C.B. Wambacq, P. Oosterlinck, A. Katholieke Universiteit Leuven Departement Elektrotechniek Afdeling ESAT Kardinaal Mercierlaan 94 HeverleeB-3001 Belgium

ISBN: (纸本)0780308751

Reaction-Diffusion equations used to model biological patterning and structure contain useful principles of processing hi space;local nonlinear computation plus information spread by diffusion. Some years ago we introduced the use of Reaction-Diffusion Equations as a computational paradigm in image enhancement and analysis, in particular texture-defect analysis. In this paper we desire to bring the Reaction-Diifusion processing paradigm to the attention of the CNN-community. We discuss two classes of processing: First, non-cqulibrium systems which form periodic 'Turing' structures allowing analysis of textile images. Second, systems which are able to smooth and segment grey-level images. © 1992 IEEE.

关键词： image enhancement

来源：评论

学校读者我要写书评

暂无评论

nonLINEAR-REGRESSION FOR SIGNAL-processing

NONLINEAR-REGRESSION FOR SIGNAL-PROCESSING

引用

CONF ON nonLINEAR image processing 2

作者： RESTREPO, A Univ. de los Andes (Colombia)

ISBN: (纸本)0819405507

A nonlinear regression is a signal that has a specified property (which may be different from linearity) and that optimally approximates a given signal. Such properties are given in the domain of the signal (e.g. time, space) and are called shape constraints. The optimality of the approximation is measured with a semimetric defined on the space of signals under consideration. Finite-length discrete signals are well modeled as point in n-dimensional real space Rn. Thus, for example, a linear regression of a signal is a signal, in the subspace of linear signals, that is closest (usually under the Euclidean metric) to the given signal. Four shape constraints considered in the paper; piecewise constancy, local monotonicity, piecewise linearity and local convex/concavity. They are constraints of smoothness and in this respect, local convex/concavity has the advantage over local monotonicity that a sine wave of small frequency may be locally concave/convex but not locally monotonic. 2D signals defined on quadrille tessellations and on hexagonal tessellations are considered briefly; local monotonicity of degree 3 is defined for 2D signals. A technique for obtaining locally monotonic approximations of 2D signals is presented.

关键词： Signal processing nonlinear image processing nonlinear optics Digital filtering Electronic filtering Radon Smoothing image processing Complex systems Systems modeling

来源：评论

学校读者我要写书评

暂无评论

image coding by adaptive vector quantization with least squares approximation

Image coding by adaptive vector quantization with least squa...

引用

Piece Recognition and image processing 1988

作者： Sun, H. Hsu, H. Department of Electrical Engineering Fairleigh Dickinson University TeaneckNJ07666 United States

An image may have different local statistics, or different local properties of detailed content. According to the information theory, a fixed bit rate coding scheme will result in more distortion in higher-detail (or active) areas than in lower-detail (or non-active) areas. Consequently, an edge degradation occurs. In this paper, an adaptive vector quantization with least squares approximation method is proposed to address this problem. The scheme is based upon a variable block size. The basic idea is to partition the image blocks into two parts;high-detail and low-detail or active and non-active, according to the activity index measurement. The active blocks are further divided into smaller blocks. The values of pixels in the non-active block are approximated by a smaller number of samples with least spuares method. The two sets which are designed to have same dimensionality are used to form a vector set and vector quantized. Therefore, the non-active blocks can be coded with the same codebook as for the high-detailed subblocks, but less bits are needed. Experimental results show that the quality of reconstructed images is improved in this algorithm over non-adaptive VQ because the bits saved in two low-detailed areas are allocated to the high-detailed area where the edge could be found. © 1988 Proceedings of SPIE - The international Society for Optical Engineering. All rights reserved.

关键词： Least squares approximations

来源：评论

学校读者我要写书评

暂无评论

Synthetic IR cloud image model

Synthetic IR cloud image model

引用

Multispectral image processing and Enhancement 1988

作者： Conant, J. Dvore, D. Gruninger, J. Aerodyne Research Inc. Advanced Systems Group 45 Manning Road BillericaMA01821 United States

The presence of clouds affects most infrared (IR) military sensors. Foreground clouds degrade or occult target signatures and background clouds clutter a scene. Models used to assess or predict system performance must include important features of clouds: absorption, single and multiple scattering, thermal emission, partial transmission and spatial non-uniformity. Exact models which account for the details of cloud microphysics require large computation times and inputs which are difficult to obtain. Aerodyne has developed an approximate model which produces realistic cloud scenes in a reasonable amount of computer time. An average optical depth for the cloud is first calculated by use of L0WTRAN6 with specified aerosol optical properties. These properties are combined with a multiple scattering model which uses a two stream approximation. This model assumes that 1) the cloud layer is a parallel plane and infinite, 2) there is a constant single scattering albedo which may be wavelength dependent, 3) there is local thermodynamic equilibrium between particles and atmospheric gases, and 4) there is a uniform cloud temperature and emissivity. The result is an average cloud radiance spectrum along a specified line-of-sight. The line-of-sight may be up-looking or down-looking, and up to two cloud layers may be present. Spatial non-uniformities are incorporated by use of a cloud texture model based on a 1/f spectral shaping of spatial variations. The final scene including the effect of the atmospheric path from the cloud to the observer is in-band integrated and recorded as a grid of radiances with an associated depth map for use in a target/background interface model. © 1988 SPIE. All rights reserved.

关键词： Optical properties

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：