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

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Yukihiro Murakami Masao Yamagishi Masahiro Yukawa Isao Yamada Dept. of Communications and Integrated Systems Tokyo Institute of Technology Japan Mathematical Neuroscience Lab. Brain Science Institute RIKEN Japan

ISBN: (纸本)9781424442959

In this paper, we propose a novel adaptive filtering algorithm based on an iterative use of (i) the proximity operator and (ii) the parallel variable-metric projection. Our time-varying cost function is a weighted sum of squared distances (in a variable-metric sense) plus a possibly nonsmooth penalty term, and the proposed algorithm is derived along the idea of proximal forward-backward splitting in convex analysis. For application to sparse-system identification problems, we employ the (weighted) l_(1) norm as the penalty term, leading to a time-varying soft-thresholding operator. As the simple example of the proposed algorithm, we present the variable-metric affine projection algorithm composed with the time-varying soft-thresholding operator. Numerical examples demonstrate that the proposed algorithms notably outperform their counterparts without soft-thresholding both in convergence speed and steady-state mismatch, while the extra computational complexity due to the additional soft-thresholding is negligibly low.

关键词： sparse adaptive filtering proximal forward-backward splitting soft-thresholding variable metric parallel projection parallel projection Filtration time varying projection algorithms complexity classes weight sums penalty Operators Cost functions

来源：评论

学校读者我要写书评

暂无评论

Scalable Recursive Top-Down Hierarchical Clustering Approach with Implicit Model Selection for Textual Data Sets

Scalable Recursive Top-Down Hierarchical Clustering Approach...

引用

International Workshop on Database and Expert Systems Applications

作者： Markus Muhr Vedran Sabol Michael Granitzer Knowledge Relationship Discovery Know-Center Graz Graz Austria Institute of Knowledge Management Know-Center Graz Graz University of Technology Graz Austria

Automatic generation of taxonomies can be useful for a wide area of applications. In our application scenario a topical hierarchy should be constructed reasonably fast from a large document collection to aid browsing of the data set. The hierarchy should also be used by the InfoSky projection algorithm to create an information landscape visualization suitable for explorative navigation of the data. We developed an algorithm that applies a scalable, recursive, top-down clustering approach to generate a dynamic concept hierarchy. The algorithm recursively applies a workflow consisting of preprocessing, clustering, cluster labeling and projection into 2D space. Besides presenting and discussing the benefits of combining hierarchy browsing with visual exploration, we also investigate the clustering results achieved on a real world data set.

关键词： Clustering algorithms Heuristic algorithms Labeling Internet Encyclopedias projection algorithms

来源：评论

学校读者我要写书评

暂无评论

Pixel level multifocus image fusion based on variational decomposition in combination with structure tensor analysis

Pixel level multifocus image fusion based on variational dec...

引用

International Conference on Signal Processing Proceedings (ICSP)

作者： Yongping Zhang Zhongkun He Rina Su Fang Cheng Liang Ding Quanmao Mi School of Electronic and Information Engineering Ningbo University of Technology Ningbo China College of Information Engineering Taiyuan University of Technology Taiyuan Shanxi China

An image fusion Algorithm based on variational decomposition and energy of edge is presented in this paper. Firstly, each source image is decomposed into a geometrical component and a textured component by applying Rudin-Osher-Fatemi (ROF) model in combination with Chambolle's projection algorithm. Secondly, the corresponding components are fused separately. For fusing the geometrical components, a weighted average method is adopted. To construct the textured component, a reconstruction algorithm of vector field based on structure tensor analysis is adopted. Finally, the sum of the fused composites is calculated to obtain the fused result. Experiments show that the proposed algorithm works well in multi focus image fusion.

关键词： Image fusion Tensile stress Pixel projection algorithms Signal processing algorithms Reconstruction algorithms Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Adaptive channel equalization using Variable Step-Size partial rank algorithm based on unified framework

Adaptive channel equalization using Variable Step-Size parti...

引用

Iranian Conference on Electrical Engineering (ICEE)

作者： Seyed Arefe Hadei Paeiz Azmi Nushin Sonbolestan Jaber Abbasian Department of Electrical Engineering Tarbiat Moalem University Tehran Iran School of Electrical and Electronic Engineering University of Manchester Institute of Science and Technology Manchester UK

ISBN: (纸本)9781424467600

Affine projection algorithms (APA) are useful adaptive filters whose main purpose is to speed the convergence of LMS-type filers. On the other hand, by optimally selecting the step-size, during the adaptation, we can obtain both fast convergence rate and low steady-state mean square error. In this paper, we introduce a new Variable Step Size (VSS) version of affine projection algorithms based on the generic VSS adaptive filter and use it for channel equalization. The proposed algorithms perform very well in attenuating noise and inter-symbol interference (ISI) in comparison with the standard NLMS and the recently introduced ordinary AP algorithms.

关键词： Adaptive equalizers Adaptive filters Convergence Variable structure systems Steady-state Intersymbol interference Filtering algorithms projection algorithms Mean square error methods Least squares approximation

来源：评论

学校读者我要写书评

暂无评论

Implementation of Generalized Back projection Algorithm in 3D EIT Model

Implementation of Generalized Back Projection Algorithm in 3...

引用

Biennial Institute of Electrical and Electronics Engineers Conference on Electomagnetic Field Computation

作者： Hongbin Wang Guizhi Xu Shuai Zhang Duyan Geng Qingxin Yang Weili Yan Province-Ministry Joint Key Laboratory of Electromagnetic Field and Electrical Apparatus Reliability Hebei University of Technology Province-Ministry Joint Key Laboratory of Electromagnetic Field and Electrical Apparatus Reliability HebeiUniversity of Technology

ISBN: (纸本)9781424470594

Electrical Impedance Tomography (EIT) is an attractive method for clinical detection. A new method called Generalized Back projection Algorithm (GBPA) is proposed in this paper, which developed from Node Back projection Algorithm (NBPA). This algorithm extends projection range to aggregate of arbitrary node in the subject. Compared with each other it is indicated the images reconstructed by GBPA contained more information and better characterization following several defined evaluation parameters than those of conventional Back projection Algorithm (BPA) and NBPA.

关键词： backprojection projection algorithms EIT Line of nodes algorithms

来源：评论

学校读者我要写书评

暂无评论

Image Stabilization by Combining Gray-Scale projection and Block Matching Algorithm

Image Stabilization by Combining Gray-Scale Projection and B...

引用

IEEE International Symposium on IT in Medicine and Education

作者： Yin Bin Duan Hui-chuan Shandong Normal Univ Sch Informat Sci & Engn Jinan 250014 Peoples R China

ISBN: (纸本)9781424439294

The effect of accuracy and efficiency play an important part in the process of image stabilization. In this paper, by. analyzing image stabilization principles and commonly used algorithms, a new algorithm which combined gray-scale projection with block-matching algorithm is proposed. The algorithm uses gray-scale projection algorithm to perform the first matching and rough compensation, in which a new scheme of searching called Splite Half Search (SHS) and other methods are used to decrease computation. Here, gray-scale projection plays a role of making assistance for the next steps. Then it uses block-matching algorithm for the second matching and precise compensation, which Diamond Search (DS) algorithm is employed for greatly improving efficiency. Therefore the algorithm is a coarse-to-fine process for image stabilization. The combination of Gray-scale projection and block matching algorithm can work very well. Experimental results show that the new algorithm well preserves high stabilization accuracy, at a dramatic reduction of computational complexity.

关键词： Gray-scale Motion estimation projection algorithms Jitter Motion compensation Frequency selective surfaces Video sequences Information science Image analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Affine projection algorithms with Adaptive Regularization Matrix

Affine Projection Algorithms with Adaptive Regularization Ma...

引用

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

作者： Young-Seok Choi Hyun-Chool Shin Woo-Jin Song Department of Electronics and Computer Engineering Pohang University of Science and Technology South Korea Department of Biomedical Engineering Johns Hopkins School of Medicine USA

We propose a family of novel affine projection algorithms (APA) with adaptive regularization matrix. Conventional regularized APA (R-APA) uses a fixed and weighted identity matrix for regularization. The proposed algorithms incorporate a non-identity regularization matrix which is also dynamically updated. The matrix adaptation is based on the normalized stochastic-gradient of mean-square error. As a result, the efficient and robust algorithms are derived. Throughout experiments, we illustrate that the proposed algorithms show better performance than the conventional R-APA and comparable to the RLS algorithm in terms of the convergence rate and the misadjustment error

关键词： projection algorithms Convergence Biomedical engineering Robustness Resonance light scattering Biomedical computing Adaptive algorithm Terminology Error correction Educational programs

来源：评论

学校读者我要写书评

暂无评论

On the regularity condition in a convex feasibility problem

引用

NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS 2009年第5期70卷 1923-1928页

作者： Maruster, Stefan Popirlan, Cristina W Univ Timisoara Timisoara Romania Univ Craiova Craiova Romania

The regularity properties of a family of closed convex sets with nonempty intersection are investigated in the frame of a real Hilbert space. The significant role of these properties in solving convex feasibility prob... 详细信息

关键词： Convex feasibility problem projection algorithms Regularity properties

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of a global optimization algorithm using stochastic differential equations

引用

JOURNAL OF GLOBAL OPTIMIZATION 2009年第1期45卷 95-110页

作者： Parpas, Panos Rustem, Berc Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2AZ England

We establish the convergence of a stochastic global optimization algorithm for general non-convex, smooth functions. The algorithm follows the trajectory of an appropriately defined stochastic differential equation (SDE). In order to achieve feasibility of the trajectory we introduce information from the Lagrange multipliers into the SDE. The analysis is performed in two steps. We first give a characterization of a probability measure (I ) that is defined on the set of global minima of the problem. We then study the transition density associated with the augmented diffusion process and show that its weak limit is given by I .

关键词： Stochastic global optimization Simulated annealing Stochastic differential equations Fokker-Planck equation Laplace's method projection algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparing relaxed and non-relaxed fast affine projection adaptation algorithms

Comparing relaxed and non-relaxed fast affine projection ada...

引用

12th IEEE Digital Signal Processing Workshop/4th IEEE Signal Processing Education Workshop

作者： Ding, Heping Natl Res Council Canada Inst Microstruct Sci Ottawa ON Canada

ISBN: (纸本)1424405343

In order to provide a guideline to designers of practical adaptation systems that are based on the family of affine projection algorithms, this paper derives and verifies certain simple formulation for learning curves of relaxed and non-relaxed affine projection algorithms (APAs), to which the fast affine projection (FAP) algorithms approximate. It is observed that the formulation accurately predicts the behavior of the algorithms when the input is independent and identically distributed (i.i.d.), and gives a reasonable estimate when the input is speech - not satisfying the i.i.d. condition.

关键词： Financial advantage program Adaptive filters projection algorithms Echo cancellers Speech Noise cancellation Filtering algorithms Equations Linear systems Sampling methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：