中国科学院机构知识库网格系统: 检索

浏览/检索结果: 共7条，第1-7条

帮助

条数/页：排序方式：
	Convergence of a standard adaptive nonconforming finite element method with optimal complexity 期刊论文 OAI收割 APPLIED NUMERICAL MATHEMATICS, 2010, 卷号: 60, 期号: 7, 页码: 673-688 作者: Mao, Shipeng; Zhao, Xuying; Shi, Zhongci \| 收藏 \| 浏览/下载：21/0 \| 提交时间：2018/07/30 Adaptive methods Nonconforming finite elements A posteriori error estimation Convergence rate Optimal computational complexity
	An adaptive image contrast enhancement based on differential evolution (EI CONFERENCE) 会议论文 OAI收割 2010 3rd International Congress on Image and Signal Processing, CISP 2010, October 16, 2010 - October 18, 2010, Yantai, China Yang Q. 收藏 \| 浏览/下载：17/0 \| 提交时间：2013/03/25 Tubbs proposed a regularized incomplete beta function to represent some nonlinear transform functions most commonly used in image contrast enhancement. But how to define the coefficients of the beta function adaptively is still a problem. Applying the differential evolution in image contrast enhancement we utilize the global quickly search ability of the differential evolution algorithm adaptive mutation search at last searches the optimal values of beta function and gets an adaptive contrast enhanced image. To avoid trapping into local optimum a chaotic differential evolution algorithm is proposed. Experimental results show that the proposed algorithm can find the global optimal in few iterations and save largely computational time and complexity. 2010 IEEE.
	近似骨架导向的归约聚类算法期刊论文 OAI收割电子与信息学报, 2009, 卷号: 31, 期号: 12, 页码: 2953-2957 宗瑜; 李明楚; 江贺收藏 \| 浏览/下载：24/0 \| 提交时间：2011/03/18 聚类问题 NP-难解启发式算法近似骨架 Clustering issue NP-hard Heuristic algorithm Approximate backbone 骨架导向归约聚类算法 optimal solutions 近似骨架 search space 局部最优解 clustering algorithm Reduction Algorithm 聚类问题 high quality 算法收敛速度数据集研究成果搜索空间实验结果聚类质量基本思想骨架特征 multipleCluster analysis Computational complexity Feature extraction Heuristic algorithms Heuristic methods Optimal systems
	A CONVERGENT ADAPTIVE FINITE ELEMENT METHOD WITH OPTIMAL COMPLEXITY 期刊论文 OAI收割 ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS, 2008, 卷号: 30, 页码: 291-304 作者: Becker, Roland; Mao, Shipeng; Shi, Zhong-Ci \| 收藏 \| 浏览/下载：21/0 \| 提交时间：2018/07/30 adaptive finite element method a posteriori error estimator convergence rate optimal computational complexity
	Integrated intensity, orientation code and spatial information for robust tracking (EI CONFERENCE) 会议论文 OAI收割 2007 2nd IEEE Conference on Industrial Electronics and Applications, ICIEA 2007, May 23, 2007 - May 25, 2007, Harbin, China 作者: Wang Y.; Wang Y.; Wang Y.; Wang Y.; Wang Y. 收藏 \| 浏览/下载：28/0 \| 提交时间：2013/03/25 real-time tracking is an important topic in computer vision. Conventional single cue algorithms typically fail outside limited tracking conditions. Integration of multimodal visual cues with complementary failure modes allows tracking to continue despite losing individual cues. In this paper we combine intensity orientation codes and special information to form a new intensity-orientation codes-special (IOS) feature to represent the target. The intensity feature is not affected by the shape variance of object and has good stability. Orientation codes matching is robust for searching object in cluttered environments even in the cases of illumination fluctuations resulting from shadowing or highlighting etc The spatial locations of the pixels are used which allow us to take into account the spatial information which is lost in traditional histogram. Histograms of intensity orientation codes and spatial information are employed for represent the target Mean shift algorithm is a nonparametric density estimation method. The fast and optimal mode matching can be achieved by this method. In order to reduce the compute time we use the mean shift procedure to reach the target localization. Experiment results show that the new method can successfully cope with clutter partial occlusions illumination change and target variations such as scale and rotation. The computational complexity is very low. If the size of the target is 3628 pixels it only needs 12ms to complete the method. 2007 IEEE.
	A Cell Mapping Method for General Optimum Trajectory Planning of Multiple Robotic Arms 期刊论文 OAI收割 Journal of Robotic and Autonomous Systems, 1994, 卷号: 12, 期号: 1, 页码: 15-27 作者: Fei-Yue Wang; Paul J.A. Lever 收藏 \| 浏览/下载：27/0 \| 提交时间：2017/03/17 Cell mapping Computational complexity Energy-optimal trajectory Hierarchical search Jerk-optimal trajectory Multiple arms Time-optimal trajectory Trajectory planning
	A Cell Mapping Method for General Optimum Trajectory Planning of Multiple Robotic Arms 期刊论文 OAI收割 Journal of Robotic and Autonomous Systems, 1994, 卷号: 12, 期号: 1, 页码: 15-27 作者: Fei-Yue Wang; Paul J. A. Lever \| 收藏 \| 浏览/下载：25/0 \| 提交时间：2017/07/15 Cell Mapping Computational Complexity Energy-optimal Trajectory Hierarchical Search Jerk-optimal Trajectory Multiple Arms Time-optimal Trajectory Trajectory Planning