The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
As IC technology advances to 16/14 nm and beyond, FinFET architecture with advantage of excellent leakage performance becomes main stream in IC industry. However, it also brings big challenges for integration and processes due to its very aggressive structure and profile, CD shrinkage, shadow effect and gap-fill difficulty. In this work, atomic layer deposition (ALD) metal films, including TaN, TiN...
In this paper we propose a two-stage algorithm for robust K-subspaces recovery. In the first stage, a large number of local candidate subspaces are generated by probabilistic farthest insertion, and then the initial near-optimal K-subspaces are solved by combinatorial selection with randomized greedy method. In the second stage, the K-subspaces are further refined by assigning each data vector to...
Human action recognition in video sequences is an important research topic in computer vision, and motion history image (MHI) is widely taken for recognition due to its simplicity. However, it may be not robust to describe an action by only a single MHI. Therefore, an action recognition scheme by using multiple key MHIs (MKMHIs) is proposed. Firstly, an adaptive method for key MHIs selection is proposed...
Sparse representation based classification (SRC) method has become a hot topic in recent years. To address the alignment problem, feature-based (such as SIFT) SRC method has been proposed. But it always works not ideally for the contiguously occluded face images. After analyzing, we point it to the issue of features' reliability for multi-task recognition. Through the theoretical analysis on the sparsity...
Robust high-dimensional data processing has witnessed an exciting development in recent years, as theoretical results have shown that it is possible using convex programming to optimize data fit to a low-rank component plus a sparse outlier component. This problem is also known as Robust PCA, and it has found application in many areas of computer vision. In image and video processing and face recognition,...
It has recently been shown that only a small number of samples from a low-rank matrix are necessary to reconstruct the entire matrix. We bring this to bear on computer vision problems that utilize low-dimensional subspaces, demonstrating that subsampling can improve computation speed while still allowing for accurate subspace learning. We present GRASTA, Grassmannian Robust Adaptive Subspace Tracking...
A novel algorithm is proposed to perform object tracking with multiple cameras in the Bayesian Inference framework. The key contribution is the exploitation of Bayesian network to fuse spatial-temporal position and object template feature in multiple cameras. Firstly, Bayesian network is used to model the multiple static cameras' tracking system. Then, the high-dimensional joint posterior is propagated...
In this paper, a novel engineering oriented control system design method for multivariable processes is presented. By employing the concepts of energy transmission ratio and effective relative gain, an equivalent transfer function matrix for closed loop control system can be obtained. Based on the equivalent transfer function matrix, both off-diagonal decoupling controllers and main loop diagonal...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.