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

recursive modified dense network for single-image deraining

JOURNAL OF ELECTRONIC IMAGING 2020年第3期29卷

作者： Chai, Guoqiang Wang, Zhaoba Guo, Guodong Chen, Youxing Jin, Yong Wang, Wei Zhao, Xia North Univ China Sch Informat & Commun Engn Taiyuan Peoples R China Shanxi Normal Univ Sch Phys & Informat Engn Linfen Shanxi Peoples R China North Univ China Natl Key Lab Elect Measurement Technol Taiyuan Shanxi Peoples R China

Blurred images caused by rain streaks can degrade the performance of many computer vision algorithms. Therefore, the single-image rain removal problem has attracted tremendous interest. Although deep learning-based deraining methods have made significant progress, there are still many issues to be addressed in terms of improving the performance. We propose a recursive modified dense network for single-image deraining. As rain streaks have different sizes and shapes, contextual information is very important for rain removal. We use a dense network to extract image features and modify the network by removing all batch normalization layers. A simple deep network cannot completely remove rain streaks from the image, while increasing the network depth will make the computing more complicated. We take a dense block with loops to remove rain streaks stage by stage. Extensive experiments on both synthetic and real-world datasets show that the proposed method can achieve competitive results in comparison with the state-of-the-art methods for single-image rain removal. (C) 2020 SPIE and IS&T

关键词： image deraining modified dense network recursive computation

来源：评论

学校读者我要写书评

暂无评论

Discrete-time level-crossing analysis of soft handoff performance in cellular networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第7期52卷 3283-3290页

作者： Leu, Alexe E. Mark, Brian L. Shared Spectrum Co Vienna VA 22182 USA George Mason Univ Fairfax VA 22030 USA

In this correspondence, we develop a formal method for solving a class of level-crossing problems in discrete-time with application to the analysis of soft handoff performance in cellular networks such as code-division multiple-access (CDMA) systems. In such networks, proper dimensioning of soft handoff parameters is critical to overcoming propagation impairments and providing a transparent radio access service for multiple user profiles. We obtain exact expressions for the cell assignment and active set update probabilities of a mobile station traveling along an arbitrary straight-line trajectory. We develop recursive algorithms to compute performance measures such as outage probability, macrodiversity gain, and signaling load. The discrete-time level-crossing analysis yields an accurate and efficient computational tool for designing and dimensioning high performance soft handoff algorithms while avoiding the need for approximations or time-consuming computer simulations.

关键词： cellular networks code-division multiple access (CDMA) level-crossing macrodiversity network dimensioning performance analysis recursive computation soft handoff

来源：评论

学校读者我要写书评

暂无评论

An Online recursive computational Approach for the Closed-Loop Stability Margin of the PnP Process Monitoring and Control Structure

An Online Recursive Computational Approach for the Closed-Lo...

引用

IEEE International Conference on Intelligent Engineering Systems (INES)

作者： Tianyu Liu Hao Luo Shen Yin Okyay Kaynak Department of Control Science and Engineering Harbin Institute of Technology Harbin P.R. China

ISBN: (数字)9781728112138

ISBN: (纸本)9781728112145

Aiming at the development of real-time control-performance-oriented fault diagnosis and fault-tolerant control, an online recursive computational approach is proposed in this paper for the closed-loop stability margin of the plug-and-play process monitoring and control architecture (PnP-PMCA). The core of the proposed approach is based on the recursive least square (RLS) technique, which avoids the online computation of the matrix inverse. With the proposed approach in this paper, real-time control-performance-oriented fault diagnosis can be achieved. The correctness and the effectiveness of the proposed approach are demonstrated through the case studies on a DC motor benchmark system.

关键词： Stability margin data-driven method recursive computation process monitoring.

来源：评论

学校读者我要写书评

暂无评论

Optimal packing of transformer coil via dynamic programming

引用

COMPUTERS & INDUSTRIAL ENGINEERING 1998年第3-4期35卷 447-450页

作者： Khater, M Zagazig Univ Fac Engn Dept Ind Engn Zagazig Egypt

One of the transformer major design elements is its core design. The good performance of the transformer requires its coil core to be laminated and composed of different - widths stepped layers of specific steel packed together. For optimum design,the cross sectional shape of the core must be as circular as possible. So, an optimal packing can be attained by maximizing the steel core coverage. The number of different widths of steel plates n is selected to compose the packed core fbr a coil of diameter d. Then,an optimum sequence of decisions, for the n widths as well as the number of thin plates of each, is required. Dynamic programming (dp) is concerned with this optimum sequential decisions. An adequate forward recursive equation is formulated, because there isn't a standard dp model for an sequential decision making problems. To implement the recursive computations, a FORTRAN program is developed. Assuming that d is given the values 150, 200, 250, 300, 400 and 500 mm. while giving n the values from 2 to 15, the program is run at different combinations of n and d. It is found that maximum core coverage is sensitive to changing of n but it is slightly affected by changing of d. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.

关键词： optimization dynamic programming recursive computation transformer coil packing stepped layers

来源：评论

学校读者我要写书评

暂无评论

On recursive oblique projectors

引用

IEEE SIGNAL PROCESSING LETTERS 2005年第6期12卷 433-436页

作者： Peng, CY Zhang, XD Tsing Hua Univ Dept Automat Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

This letter proposes a recursive oblique projector. To understand better the recursive oblique projector, we provide a geometrical interpretation of recursive computation and present a brief numerical example.

关键词： adaptive filter innovation matrix oblique projection recursive computation

来源：评论

学校读者我要写书评

暂无评论

A recursive algorithm for maximum likelihood-based identification of blur from multiple observations

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 1998年第7期7卷 1075-1079页

作者： Rajagopalan, AN Chaudhuri, S Indian Inst Technol Dept Elect Engn Bombay 400076 Maharashtra India

A maximum likelihood-based method is proposed for blur identification from multiple observations of a scene. When the relations among the blurring functions are known, the estimate of blur obtained using the proposed method is very good. Since direct computation of the likelihood function becomes difficult as the number of images increases, we propose an algorithm to compute the likelihood function recursively.

关键词： blur identification Gaussian defocus ML estimator multiple observations recursive computation

来源：评论

学校读者我要写书评

暂无评论

Analytical method for differentiation of robot Jacobian

引用

ELECTRONICS LETTERS 2017年第6期53卷 386-387页

作者： Rhee, J. -Y. Lee, B. Myongji Univ Dept Elect Engn San 38-2 Namdong Yongin 449728 Gyeonggi Do South Korea

Model-based control algorithms commonly use joint acceleration as a desired trajectory. As the velocity trajectory in the task space is converted into joint velocity by multiplying using a Jacobian matrix, to derive the acceleration in joint space, Jacobian differentiation is required. Although the numerical method for Jacobian differentiation gives sufficiently accurate approximations, it incurs a high computation cost because this method involves computing the forward kinematics twice and Jacobian derivation for every element of the Jacobian matrix. Consequently, this causes difficulties for real-time control. To resolve this, an analytical differentiation method is proposed. Through recursive computation, differentiation is performed without any approximation, in an acceptably small computational time. Performance of the proposed method was verified by comparison with numerical derivation using a computer simulation.

关键词： differentiation acceleration Jacobian matrices robot kinematics robot Jacobian differentiation model-based control algorithms joint acceleration velocity trajectory Jacobian matrix joint space forward kinematics Jacobian matrix analytical differentiation method recursive computation computer simulation numerical derivation

来源：评论

学校读者我要写书评

暂无评论

Dynamic resampling for alleviating sample impoverishment of particle filter

引用

IET RADAR SONAR AND NAVIGATION 2013年第9期7卷 968-977页

作者： Zuo, Junyi Northwestern Polytech Univ Sch Aeronaut Xian 710072 Peoples R China

In particle filter, the use of resampling technique solves the problem of particle degeneracy to some extent, but introduces a new problem of particle impoverishment. To reconcile this dilemma, a dynamic resampling strategy is proposed, where the resampling operation is only performed on part of the particles in a step-by-step manner and the number of resampled particles is determined dynamically by a termination criterion based on the effective sample size. The new-born particles produced by resampling operations are helpful in alleviating particle degeneracy, whereas particles free from being resampled is conducive to improving the diversity of particles. Thus, a tradeoff between these two problems can be achieved. Also, two techniques, that is, recursive computation of the effective sample size and improved bisection method, for improving the computational efficiency are proposed. Simulation results conducted on two typical examples show the improved performance of the proposed method.

关键词： particle filtering (numerical methods) sampling methods dynamic resampling technique sample impoverishment particle filter particle degeneracy particle impoverishment step-by-step manner termination criterion recursive computation improved bisection method effective sample size

来源：评论

学校读者我要写书评

暂无评论

Nonuniform Sampling Rate Conversion:An Efficient Approach

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2021年 69卷 2913-2922页

作者： Martinez-Nuevo, Pablo Bang & Olufsen Res Dept DK-7600 Struer Denmark

We present a discrete-time algorithm for nonuniform sampling rate conversion that presents low computational complexity and memory requirements. It generalizes arbitrary sampling rate conversion by accommodating time-varying conversion ratios, i.e., it can efficiently adapt to instantaneous changes of the input and output sampling rates. This approach is based on appropriately factorizing the time-varying discrete-time filter used for the conversion. Common filters that satisfy this factorization property are those where the underlying continuous-time filter consists of linear combinations of exponentials, e.g., those described by linear constant-coefficient differential equations. This factorization separates the computation into two parts:one consisting of a factor solely depending on the output sampling instants and the other consists of a summation-that can be computed recursively-whose terms depend solely on the input sampling instants and its number of terms is given by a relationship between input and output sampling instants. Thus, nonuniform sampling rates can be accommodated by updating the factors involved and adjusting the number of terms added. When the impulse response consists of exponentials, computing the factors can be done recursively in an efficient manner.

关键词： Nonuniform sampling Memory management Signal processing algorithms Interpolation Clocks computational complexity Transfer functions Nonuniform sampling arbitrary sampling rate conversion asynchronous sampling rate conversion recursive computation sampling and interpolation

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for the computation of axial moments and its application to the orthogonal fitting of curves

引用

PATTERN RECOGNITION 2003年第7期36卷 1519-1528页

作者： Palenichka, RM Zaremba, MB Univ Quebec Dept Informat & Ingn Hull PQ J8Y 3G5 Canada

This paper describes a fast algorithm to compute local axial moments used in the detection of objects of interest in images. The basic idea is the elimination of redundant operations while computing axial moments for two neighboring angles of orientation. The main result is that the complexity of the recursive computation of axial moments becomes independent of the total number of computed moments at a given point, i.e., it is of the order O(N) where N is the size of the data set. This result is of great importance in computer vision since many feature extraction methods rely on the computation of axial moments. The use of this algorithm for fast object skeletonization in images by orthogonal regression fitting is described in detail, with the experimental results confirming the theoretical computational complexity. (C) 2003 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

关键词： axial moment fast algorithm recursive computation primitive kernel function curve fitting orthogonal regression

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：