http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Weiyong Yu (검색결과 4 건)
- 무료
- 기관 내 무료
- 유료
-
Global Output Feedback Regulation of Uncertain Nonlinear Systems with Unknown Time Delay
Weiyong Yu,Shutang Liu,Fangfang Zhang 제어·로봇·시스템학회 2015 International Journal of Control, Automation, and Vol.13 No.2
This paper investigates the problem of global output feedback regulation for a class of nonlinear systems with unknown time delay. It is also allowed to contain uncertain functions of all the states and input as long as the uncertainties satisfying certain bounded condition for the considered systems. In this paper, a constructive control technique has been proposed for controlling the systems. By using dynamic high-gain scaling approach and choosing an appropriate Lyapunov-Krasovskii functional, a delay-independent robust adaptive output feedback controller is constructed such that the states of the considered systems achieve global regulation. Two simulation examples are provided to demonstrate the effectiveness of the proposed design scheme.
-
OSCILLATORY BEHAVIOR AND COMPARISON FOR HIGHER ORDER NONLINEAR DYNAMIC EQUATIONS ON TIME SCALES
Sun, Taixiang,Yu, Weiyong,Xi, Hongjian The Korean Society for Computational and Applied M 2012 Journal of applied mathematics & informatics Vol.30 No.1
In this paper, we study asymptotic behaviour of solutions of the following higher order nonlinear dynamic equations $$S_n^{\Delta}(t,x)+{\delta}p(t)f(x(g(t)))=0$$ and $$S_n^{\Delta}(t,x)+{\delta}p(t)f(x(h(t)))=0$$ on an arbitrary time scale $\mathbb{T}$ with sup $\mathbb{T}={\infty}$, where n is a positive integer, ${\delta}=1$ or -1 and $$S_k(t,x)=\{\array x(t),\;if\;k=0,\\a_k(t)S_{{\kappa}-1}^{\Delta}(t),\;if\;1{\leq}k{\leq}n-1,\\a_n(t)[S_{{\kappa}-1}^{\Delta}(t)]^{\alpha},\;if\;k=n,$$ with ${\alpha}$ being a quotient of two odd positive integers and every $a_k$ ($1{\leq}k{\leq}n$) being positive rd-continuous function. We obtain some sufficient conditions for the equivalence of the oscillation of the above equations.
-
OSCILLATORY BEHAVIOR AND COMPARISON FOR HIGHER ORDER NONLINEAR DYNAMIC EQUATIONS ON TIME SCALES
Taixiang Sun,Weiyong Yu,Hongjian Xi 한국전산응용수학회 2012 Journal of applied mathematics & informatics Vol.30 No.1
In this paper, we study asymptotic behaviour of solutions of the following higher order nonlinear dynamic equations [수식] and [수식] on an arbitrary time scale T with sup T = ∞ , where n is a positive integer, where n is a positive integer, [수식] and [수식] with a being quotient of two odd positive integers and every ak (1≤k≤n) being positive rd-continuous function. We obtain some sufficient conditions for the equivalence of the oscillation of the above equations.
-
PatchMatch Filter: Edge-Aware Filtering Meets Randomized Search for Visual Correspondence
Lu, Jiangbo,Li, Yu,Yang, Hongsheng,Min, Dongbo,Eng, Weiyong,Do, Minh N. IEEE 2017 IEEE transactions on pattern analysis and machine Vol.39 No.9
<P>Though many tasks in computer vision can be formulated elegantly as pixel-labeling problems, a typical challenge discouraging such a discrete formulation is often due to computational efficiency. Recent studies on fast cost volume filtering based on efficient edge-aware filters provide a fast alternative to solve discrete labeling problems, with the complexity independent of the support window size. However, these methods still have to step through the entire cost volume exhaustively, which makes the solution speed scale linearly with the label space size. When the label space is huge or even infinite, which is often the case for (subpixel-accurate) stereo and optical flow estimation, their computational complexity becomes quickly unacceptable. Developed to search approximate nearest neighbors rapidly, the PatchMatch method can significantly reduce the complexity dependency on the search space size. But, its pixel-wise randomized search and fragmented data access within the 3D cost volume seriously hinder the application of efficient cost slice filtering. This paper presents a generic and fast computational framework for general multi-labeling problems called PatchMatch Filter (PMF). We explore effective and efficient strategies to weave together these two fundamental techniques developed in isolation, i.e., PatchMatch-based randomized search and efficient edge-aware image filtering. By decompositing an image into compact superpixels, we also propose superpixel-based novel search strategies that generalize and improve the original PatchMatch method. Further motivated to improve the regularization strength, we propose a simple yet effective cross-scale consistency constraint, which handles labeling estimation for large low-textured regions more reliably than a single-scale PMF algorithm. Focusing on dense correspondence field estimation in this paper, we demonstrate PMF's applications in stereo and optical flow. Our PMF methods achieve top-tier correspondence accuracy but run much faster than other related competing methods, often giving over 10-100 times speedup.</P>
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
