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

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： V.C. Soon L. Tong Y.F. Huang R. Liu Laboratory for Image and Signal Analysis (LISA) Department of Electrical Engineering University of Notre Dame Notre Dame IN USA Department of Electrical and Computer Engineering West Virginia University Morgantown WV USA

A novel approach to solving the problem of signal separation under model uncertainties and unknown source signal characteristics is proposed. The approach features the incorporation of blind identification with clustering techniques. The approach is capable of estimating source locations and source signals under various uncertain conditions including unknown sensor gains, unknown combinations of near-field and far-field sources, unknown combinations of wideband and narrowband sources, unknown source spectral characteristics (their spectra may be overlapping or non-overlapping), and unknown number of signals.< >

关键词： Robustness Wideband Source separation Sensor arrays Sensor phenomena and characterization Uncertainty Direction of arrival estimation Narrowband Phased arrays Speech enhancement

来源：评论

学校读者我要写书评

暂无评论

Morphological analysis of discrete random shapes

引用

Journal of Mathematical Imaging and Vision 1992年第2-3期2卷 193-215页

作者： Goutsias, John Image Analysis and Communications Laboratory Department of Electrical and Computer Engineering Johns Hopkins University Baltimore 21218 MD United States

In this paper I discuss a number of theoretical issues regarding the morphological analysis of discrete random shapes by means of Matheron's random set theory. I revisit this theory by limiting myself to the discrete case, since most image data are available in a discrete form. Although it may seem that the transition from the continuous to the discrete case is straightforward (since most of Matheron's theory is general enough to incorporate the discrete case as a special case), this transition is often challenging and full of exciting and, surprisingly, pleasant results. I introduce the concept of the cumulative-distribution functional of a discrete random set and review some fundamental properties of the capacity functional (a fundamental statistical quantity that uniquely defines a random set and relates random set theory to mathematical morphology). In analogy to a recent result and under a natural boundness condition, I show that there exists a one-to-one correspondence between the probability-mass function of a discrete binary random field and the corresponding cumulative-distribution functional. The relationship between the cumulative-distribution functional and the capacity functional of a discrete random set is also established. The cumulative-distribution and capacity functionals are related to the higher-order moments of a discrete binary random field, and, therefore, their computation is equivalent to computing these moments. A brief discussion of how to perform such computations for a certain class of discrete random sets is provided. The capacity functional of a morphologically transformed, continuous random set cannot be associated to the capacity functional of the random set itself, except in the case of dilation. I show that the derivation of such an association is possible in the discrete case and for the cases of dilation and erosion and more complicated morphological transformations, such as opening and closing. These relationships are then used

关键词： binary random fields discrete random shapes mathematical morphology random set theory shape analysis

来源：评论

学校读者我要写书评

暂无评论

IDENTIFIABILITY OF A SET OF QUADRATIC EQUATIONS WITH UNKNOWN COEFFICIENTS

IDENTIFIABILITY OF A SET OF QUADRATIC EQUATIONS WITH UNKNOWN...

引用

INTERNATIONAL SYMP ON CIRCUITS AND SYSTEMS ( ISCAS 92 )

作者： TONG, L YU, S LIU, R Department of Electrical and Computer Engineering West Virginia University Morgantown 26506 WV United States Laboratory for Image and Signal Analysis(LISA) Department of Electrical Engineering University of Notre Dame Notre Dame 46556 IN United States

ISBN: (纸本)0780305930

In this paper, the motivation for studying the simultaneous quadratic equations with unknown coefficients is first presented. Its indeterminacy and identifiability are considered. A main lemma and three theorems are then presented. A comparison with the well known simultaneous diagonalization problem is also given. © 1992 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An adaptive fuzzy system for control and clustering of arbitrary data patterns

An adaptive fuzzy system for control and clustering of arbit...

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： S.C. Newton S. Mitra Computer Vision & Image Analysis Laboratory Department of Electrical Engineering Texas Tech University Lubbock TX USA

A modular, unsupervised neural network architecture is described. It can be used for data clustering and classification. The adaptive fuzzy leader clustering (AFLC) architecture is a hybrid neural-fuzzy system which learns online in a stable and efficient manner. The system consists of a fuzzy k-means learning rule embedded within a control structure similar to that found in the adaptive resonance theory (ART-1) network. AFLC adaptively clusters analog inputs into classes without prior knowledge of the entire data set or of the number of clusters present in the data. The classification of an input takes place in a two-stage process; a simple competitive stage and a euclidean metric comparison stage. The AFLC algorithm and its operating characteristics are described. The algorithm is compared to an adaptive Bayesian classifier for some real data.< >

关键词： Adaptive systems Programmable control Adaptive control Fuzzy systems Control systems Clustering algorithms Neural networks Fuzzy control Resonance Euclidean distance

来源：评论

学校读者我要写书评

暂无评论

Identifiability of a quadratic equations with unknown coefficients

Identifiability of a quadratic equations with unknown coeffi...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： L. Tong S. Yu R. Liu Department of Electrical and Computer Engineering West Virginia University Morgantown WV USA Laboratory for Image and Signal Analysis Department of Electrical Engineering University of Notre Dame Notre Dame IN USA

A set of simultaneous quadratic equations with unknown coefficients is considered. The motivation for studying the equations is presented. Indeterminacy and identifiability are considered. A main lemma and three theor... 详细信息

关键词： Equations Bismuth Laboratories image analysis Signal analysis Array signal processing Blind equalizers Additive noise Statistics

来源：评论

学校读者我要写书评

暂无评论

MORPHOLOGICAL REPRESENTATION OF DISCRETE AND BINARY imageS

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1991年第6期39卷 1369-1379页

作者： GOUTSIAS, J SCHONFELD, D Department of Electrical and Computer Engineering image Analysis and Communications Labarawry. Johns Hopkins University

We present a general theory for the morphological representation of discrete and binary images. The basis of this theory relies upon the generation of a set of nonoverlapping segments of an image via repeated erosions and set transformations, which in turn produces a decomposition that guarantees exact reconstruction. We introduce a general morphological representation and we study its properties. We also investigate the relationship between the proposed representation and some existing shape analysis tools (e.g., discrete size transform, pattern spectrum, skeletons), thus introducing the representation as the basis of a unified theory for geometrical image analysis. Particular cases of the general representation scheme are shown to yield a number of useful image decompositions which are directly related to various forms of morphological skeletons. We study the relationship between the representation and the various forms of morphological skeletons. As a result of this study we develop a unified theory for the mathematical description of the morphological skeleton decomposition of discrete and binary images.

关键词： .erosions representation scheme Morphological Representation Discrete and Binary exact reconstruction unified theory useful image various forms morphological skeleton

来源：评论

学校读者我要写书评

暂无评论

UNILATERAL APPROXIMATION OF GIBBS RANDOM FIELD imageS

CVGIP-GRAPHICAL MODELS AND IMAGE PROCESSING

引用

CVGIP-GRAPHICAL MODELS AND image PROCESSING 1991年第3期53卷 240-257页

作者： GOUTSIAS, J Department of Electrical and Computer Engineering Image Analysis and Communications Laboratory The Johns Hopkins University Baltimore Maryland 21218 U.S.A.

We exploit the relationship between a general Gibbs random field and a mutually compatible Gibbs random field image, we investigate the possibility of approximating a general Gibbs random field by a mutually compatible Gibbs random field, and we study the consequences of such an approximation. This study is important, since, in some cases, various problems related to the modeling of images via Gibbs random fields may be simplified by restricting our interest to a special and convenient class of Gibbs random fields, the class of mutually compatible Gibbs random fields. A general analysis is presented, which results in some interesting conclusions about the desired relationship. We consider two approaches to the approximation problem. The first approach, which is more accurate, can be easily applied to the case of binary images. For nonbinary images this approach becomes cumbersome, since it requires the solution of a large system of nonlinear equations. The second approach, which is simpler but less accurate, is based on the direct relationship between the parameters of a general Gibbs random field and the parameters of a mutually compatible Gibbs random field. Simulation examples demonstrate various aspects of our analysis.

关键词： computer Metatheory

来源：评论

学校读者我要写书评

暂无评论

A novel method for computing the partition function of Markov random field images using Monte Carlo simulations

A novel method for computing the partition function of Marko...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： G. Potamianos J. Goutsias Department of Electrical and Computer Engineering Image Analysis and Communications Laboratory Johns Hopkins University Baltimore MD USA

The authors present a new Monte Carlo simulation technique for the estimation of the partition function of a general Markov random field (MRF), which results in unbiased, consistent and asymptotically efficient estimates. This technique gives extremely accurate results, as demonstrated by simulations. Use of more efficient algorithms can boost the performance and accuracy of the method, and yield more reliable estimates.< >

关键词： Markov random fields Monte Carlo methods Probability distribution Lattices image analysis Laboratories Closed-form solution Maximum likelihood estimation Equations Samarium

来源：评论

学校读者我要写书评

暂无评论

A NOVEL NONLINEAR FILTER FOR image-ENHANCEMENT 2

引用

CONF ON image PROCESSING ALGORITHMS AND TECHNIQUES

作者： YU, TH MITRA, SK KAISER, JF Signal and Image Processing Laboratory Department of Electrical and Computer Engineering University of California Santa Barbara 93106 CA United States Bell Communications Research Inc. Room 2A-281 445 South Street Morristown 07962-1910 NJ United States

ISBN: (纸本)0819405515

Recently, a very simple nonlinear algorithm, the so-called Teager's algorithm, has been introduced to calculate the energy of a one-dimensional sequence [1]. In this paper, this algorithm is extended to two-dimensional signals and applied to the contrast enhancement of images. Initial simulation results indicate that the proposed approach yields a superior and visually pleasing enhancement of natural images. The new algorithm is very simple and permits fast implementation. © 1991 SPIE. All rights reserved.

关键词： image enhancement

来源：评论

学校读者我要写书评

暂无评论

Optical flow for tagged MR images

Optical flow for tagged MR images

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： J.L. Prince E.R. McVeigh Image Analysis and Communications Laboratory Department of Electrical and Computer Engineering Johns Hopkins University Baltimore MD USA Division of Magnetic Resonance Imaging Department of Radiology and Radiological Sciences Johns Hopkins Medical Institutions Baltimore MD USA

A method to reconstruct motion from sequences of tagged magnetic resonance (MR) images is presented. MR tagging is used to create a spatial pattern of varying magnetization so that objects which may otherwise have constant intensity are textured; this reduces the motion ambiguity associated with the aperture problem in computer vision. To account for the decay of the tag pattern, a new optical flow algorithm is developed and implemented. Velocity fields estimated using this algorithm are used to recursively update the implied motion reference map over time, thereby tracking the motion of individual particles. If a segmentation of the object is known at the time the tag pattern is created, then an object may be selectively tracked, using the estimated reference map to update the object's position as time progresses. Results are shown for actual MR phantom data.< >

关键词： image motion analysis image reconstruction Magnetic resonance Tagging Magnetization Apertures computer vision Motion estimation Recursive estimation Particle tracking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：