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

APPROXIMATION MULTIDIMENSION FUCTION WITH FUNCTIONAL NETWORK

Journal of Electronics(China) 2006年第1期23卷 81-84页

作者： Li Weibin Liu Fang Jiao Licheng Zhang Shuling Li Zongling Institute of Graphics and Image Processing Xianyang Normal University Xianyang 712000 China National Key Laboratory for Radar Signal Processing Xidian University Xi＇an 710071 China Insititute of Intelligent Information Processing Xidian University Xi＇an 710071 China

The functional network was introduced by ***, which extended the neural network. Not only can it solve the problems solved, but also it can formulate the ones that cannot be solved by traditional network. This paper applies functional network to approximate the multidimension function under the ridgelet theory. The method performs more stable and faster than the traditional neural network. The numerical examples demonstrate the performance.

关键词： Functional network Ridgelet Approximation

来源：评论

学校读者我要写书评

暂无评论

Fast registration of tabular document images using the Fourier-Mellin transform

Fast registration of tabular document images using the Fouri...

引用

International Workshop on Document image Analysis for Libraries

作者： L.A.D. Hutchison W.A. Barrett Graphics Vision and Image Processing Laboratory Brigham Young University Provo UT USA

A new technique is presented for quickly identifying global affine transformations applied to tabular document images, and to correct for those transformations. This technique, based on the Fourier-Mellin transform, is used to register (align) a set of tabular documents to each other. Each component of the affine transform is handled separately, which dramatically reduces the total parameter space of the problem. This method is robust, and deals with all components of the affine transform in a uniform way. The Fourier-Mellin transform is also extended to handle shear, which can approximate a small amount of perspective distortion, and to not need Blackman windowing for document images. In order to limit registration to foreground pixels only, and to eliminate Fourier "edge effects ", a novel, locally adaptive foreground-background segmentation algorithm is introduced, based on the median filter. An original method is also presented for automatically obtaining blank document templates from a set of registered document images. Finally, image registration is demonstrated as a tool for compression of document images which share the same template.

关键词： Fast Fourier transforms Data mining image registration Fourier transforms image processing graphics Robustness image segmentation Adaptive filters image coding

来源：评论

学校读者我要写书评

暂无评论

On Estimation Of 3D Hand Position Using Stereo Vision 19

On Estimation Of 3D Hand Position Using Stereo Vision

引用

19th International Conference on Computers and Their Applications, CATA 2004

作者： Teruel, M.B. Kubushyna, O. El-Khater, R. Yfantis, E.A. Boyle, R. Computer Graphics and Image Processing Laboratory School of Computer Science University of Nevada Las Vegas Las VegasNV89154-4019 United States NASA Ames Research Center Moffett FieldCA94035-1000 United States

ISBN: (纸本)9781618395511

In this paper an approach for reconstructing the position of an object from a pair of stereo images that allows for a fast and effective hand tracking and 3D gesture reconstruction is presented. The algorithm will serve as a building block for more advanced tasks such as the reconstructing a complete 3D hand model from multiple views using feature extraction based on color and shape. Copyright © (2004) by the International Society for Computers and Their Applications. All rights reserved.

关键词： Stereo image processing

来源：评论

学校读者我要写书评

暂无评论

Linear programming concept visualization

Linear programming concept visualization

引用

International Conference on Information Visualisation (IV)

作者： J.P. Charalambos E. Izquierdo Image Processing and Computer Graphics Research Laboratory Department of Computer Sciences National University Colombia Department of Electronic Engineering Queen Mary University of London London UK

A visualization scheme as a tool to find the solution of any 3D-linear programming problem is introduced. The presented approach is highly suitable to draw and visualize interactively the feasible region of a given 3D-linear programming problem. It can be used for a better understanding of the solution process when different methods devoted to solve the underlying problem are applied, e.g., the simplex method. The proposed technique comprises sensitive analysis during the solution process and interactive visualization of the feasible region. The analysis leading to the introduced schema also shows that the design of an appropriate and simple vertex representation is crucial to manage any order of degeneracy. To deal with this paradigm and to some extent to formalize it, the concept of adjacency invariance is introduced. Several experiments have been conducted to test and assess the performance of the introduced concepts and techniques.

关键词： Linear programming Visualization Testing Computer graphics image processing Appropriate technology Stress Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Performance of the H.263 Video Compression Standard

引用

Journal of VLSI Signal processing Systems for Signal, image, and Video Technology 1997年第2-3期17卷 101-111页

作者： Girod, Bernd Steinbach, Eckehard Färber, Nikolaus Telecommunications Institute University of Erlangen-Nuremberg 91058 Erlangen Cauerstrasse 7 Germany Georgia Institute of Technology United States University of Hannover Germany Inst. F. Theor. N. University of Hannover Germany Massachussetts Inst. of Technology Cambridge MA United States Research Laboratory of Electronics United States Department of Media Technology Media Laboratory Germany Department of Computer Graphics Germany Academy of Media Arts Cologne Germany Computer Science Section Cologne University Germany Digital Signal Processing Group Georgia Institute of Technology Atlanta GA United States Dept. of Elec. Eng./Telecom. University of Erlangen-Nuremberg Germany Telecommunications Institute Germany Vivo Software Inc. Waltham MA United States University of Karlsruhe Germany University of Essex United Kingdom ESIEE Paris France Image Communication Group Telecommunications Institute University of Erlangen-Nuremberg Germany University of Munich Germany Telecommunications Institute University of Erlangen-Nuremberg Germany Image Communication Group

The draft international standard ITU-T H.263 is closely related to the well known and widely used ITU-T Recommendation H.261. However, H.263 does provide the same subjective image quality at less than half the bit-rate. In this paper we investigate to what extend single enhancements of H.263 contribute to this performance gain, and consider the trade-off quality vs. complexity. Based on typical test sequences, H.263 with its various modes is compared to H.261 on the basis of rate distortion curves at bit-rates up to 128 kbps. At 64 kbps, the performance gain of H.263 in its default mode compared to H.261 is approximately 2 dB. This improvement is achieved with only little increase of complexity, and is mainly due to more accurate motion compensation with half-pel accuracy. Considering the trade-off quality vs. complexity, the combination of the optional coding-modes "Advanced prediction mode" and "PB-frames mode" is a good compromise, resulting in an additional performance gain of 1.5 dB PSNR at 64 kbps. The "Syntax-based arithmetic coding mode" on the other hand, offers only a very small performance gain (0.1 dB at 64 kbps) for its increased computational complexity. Results from profiling an H.263 software codec are presented in order to support complexity considerations of the optional coding-modes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automated matching experiments with different kinds of SAR imagery

Automated matching experiments with different kinds of SAR i...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： M. Gelautz G. Jakob G. Paar S. Hensley F. Leberl Institute for Computer Graphics Technical University of Graz Graz Austria JOANNEUM RESEARCH Institute of Digital Image Processing Graz Austria Jet Propulsion Laboratory California Institute of Technology Pasadena CA USA

The authors carry out tests with two readily available automated matching algorithms in their application to (a) Magellan SAR stereo images, and (b) ERS-1 and X-SAR real-simulated images. The match points are examined... 详细信息

关键词： Testing Computational modeling Pixel image matching Radar imaging Speckle Shape measurement Computer graphics Drives Digital images

来源：评论

学校读者我要写书评

暂无评论

COMPRESSION OF BINARY FACSIMILE imageS BY PREprocessing AND COLOR SHRINKING

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1990年第9期38卷 1592-1598页

作者： ALGAZI, VR KELLY, PL ESTES, RR Graphics Image and Vision Engineering Research Laboratory CIPIC Center for Image Processing Integrated Computing University of California Davis CA USA

Algorithms for preprocessing, global modeling and segmentation, local modeling and representation, and binary encoding of facsimile images are proposed, and their performance is examined. Some binary morphological operations that can be used to improve the quality and increase the compressibility of binary images and the modeling of binary images are discussed. The techniques are incorporated into a set of comprehensive encoding schemes, the PCSE codes. Their effectiveness in compressing the International Telegraphy and Telephony Consultative Committee (CCITT) binary images is demonstrated. The PCSE code using preprocessing and color shrinking prior to encoding is shown to outperform the READ code by from 7 to 42% for the standard CCITT test images with a very small change in image quality.< >

关键词： image coding Facsimile image segmentation Morphological operations Encoding Telegraphy Telephony Code standards Testing image quality

来源：评论

学校读者我要写书评

暂无评论

Report on AUSGRAPH '90, the 1990 Australian graphics Conference Melbourne, 10–14 September 1990

引用

Computer graphics Forum 1990年第5期9卷 389-389页

作者： Maeder, Anthony Computer Graphics and Image Processing Research Laboratory Department of Computer Science Monash University Clayton 3168 Australia

来源：评论

学校读者我要写书评

暂无评论

Three-dimensional image analysis and display by space-scale matching of cross sections

引用

Journal of the Optical Society of America A: Optics and image Science, and Vision 1989年第6期6卷 890-899页

作者： Algazi, V.R. Reutter, B.W. van Warmerdam, W.L.G. Liu, C.C. Graphics Image and Vision Engineering Research Laboratory Center for Image Processing and Integrated Computing University of California Davis CA 95616 United States

We present a framework and a set of techniques for the analysis and display of three-dimensional experimental data or images. We assume that the data are available in the form of two-dimensional cross sections of the three dimensional data set. We describe our approach, which has for goals to extract significant information from the three-dimensional data set and to display this information as objects that can be manipulated in three-dimensional space. The high-contrast transitions of two-dimensional cross sections are extracted first;they define a set of contours to be matched from cross section to cross section. This matching is performed by space-scale analysis of the orientation of contours on adjacent cross sections. By modeling the contours as B splines, we then make use of three-dimensional B-spline patches to generate significant surfaces that can be displayed, rendered, and rotated with standard computer graphics techniques and specialized processors. © 1989 Optical Society of America.

关键词： Computed tomography Computer simulation image analysis image processing Imaging systems Three dimensional imaging

来源：评论

学校读者我要写书评

暂无评论

Parallel conflict-free optimal access to complete extended Q-ary trees 4th

Parallel conflict-free optimal access to complete extended Q...

引用

4th International Workshop on Parallel processing by Cellular Automata and Arrays, Parcella 1988

作者： Creutzburg, Reiner Academy of Sciences of the G.D.R Central Institute of Cybernetics and Information Processes International Basic Laboratory for Image Processing and Computer Graphics Kurstrasse 33 P.O.Box 1298 BerlinDDR-1086 Germany

ISBN: (纸本)9783540506478

In this paper we investigate the parallel conflict-free access to complete extended q-ary subtrees of complete q-ary trees. Thereby the memory module assignment function S is supposed to be recursively linear and nonlinear. Known results for extended binary subtree access are generalized to the case of extended q-ary subtrees. Furthermore optimal solutions for isotropic nonlinear extended q-ary subtree access are given. © by Akademie-Verlag Berlin 1989.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：