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

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

帮助

条数/页：排序方式：
	Centroid localization algorithm based on bicubic interpolation gray square weighted (EI CONFERENCE) 会议论文 OAI收割 2012 3rd International Conference on Advances in Materials and Manufacturing Processes, ICAMMP 2012, December 22, 2012 - December 23, 2012, Beihai, China 作者: Zhou J. 收藏 \| 浏览/下载：152/0 \| 提交时间：2013/03/25 The 3D coordinates of measured point is embodied in 2D image coordinate of the optical characteristic point via the visual measurement system. Based on the gray square weighted centroid localization algorithm the paper presents bicubic interpolation gray square weighted centroid localization algorithm increases the number of effective pixels around the optical characteristic point imaging center and reduces noise error via the gray square weighted improves the imaging center location accuracy of optical characteristic point realizes the accurate location of the optical characteristic points. Results indicate application of the proposed algorithm to location the standard tolerance along the direction of x is 0.0022 Pixel the standard tolerance along the direction of y is 0.0023 Pixel compared with the others the standard tolerance is minimum and discrete to a lesser degree distancing ideal image point that is the proposed algorithm has higher location accuracy. The maximum tolerance along the direction of x is 0.008 Pixel the one along the direction of y is 0.007 Pixel compared with the other two algorithms the maximum tolerance is minimum.Results indicate that the stability of the proposed algorithm is better. (2013) Trans Tech Publications Switzerland.
	基于动态项集计数的加权频繁项集算法期刊论文 OAI收割 Computer Engineering, 2012, 卷号: 38, 期号: 3, 页码: 31-33 秦丽君; 罗雄飞 \| 收藏 \| 浏览/下载：15/0 \| 提交时间：2012/11/12 data mining weighted frequent itemset mining dynamic itemset counting weighted support degree weighted trie tree downward closure property maximum weight
	Adjacent vertex-distinguishing edge colorings of K-4-minor free graphs 期刊论文 OAI收割 APPLIED MATHEMATICS LETTERS, 2011, 卷号: 24, 期号: 12, 页码: 2034-2037 作者: Wang, Weifan; Wang, Yiqiao \| 收藏 \| 浏览/下载：18/0 \| 提交时间：2018/07/30 K-4-minor free graph Adjacent vertex-distinguishing edge coloring Maximum degree
	Chronosequence of paddy soils and phosphorus sorption-desorption properties 期刊论文 iSwitch采集 JOURNAL OF SOILS AND SEDIMENTS, 2011, 卷号: 11, 期号: 2, 页码: 249-259 作者: Zou, Ping 收藏 \| 浏览/下载：48/0 \| 提交时间：2019/10/10 Degree of phosphorus saturation Maximum phosphorus sorption capacity Non-point pollution Paddy soil chronosequence
	Computer simulation research on cognitive mechanism of human vision (EI CONFERENCE) 会议论文 OAI收割 International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2010, March 13, 2010 - March 14, 2010, Changsha, China Ke H.; You W. 收藏 \| 浏览/下载：38/0 \| 提交时间：2013/03/25 The development of intelligent system which accorded with human cognitive mechanism will exert a profound influence on national defense economy education culture and etc. A computer simulation method according with cognitive mechanism of human vision was proposed on the basis of Structural Decomposition Theory. Many basic shape feature information tables of similar object from different side can determine a kind of object uniquely. System weighted basic shape features in two different information tables by membership degree and then calculated similarity. The identifying object which had the maximum similarity with it in system was what we needed. The system used 83 pictures of 6 kinds of objects with different side for training and testing. The experiment results demonstrated task of basic shape extraction object recognition and others can be completed effectively with the method in paper. The method in paper can be a new attempt on computer simulation method according with cognitive mechanism of human vision from cognitive field. 2010 Crown Copyright.
	An improved upper bound for the Laplacian spectral radius of graphs 期刊论文 OAI收割 DISCRETE MATHEMATICS, 2009, 卷号: 309, 期号: 21, 页码: 6318-6321 作者: Lu, Mei; Liu, Huiqing; Tian, Feng \| 收藏 \| 浏览/下载：9/0 \| 提交时间：2018/07/30 Graph Laplacian spectral radius Maximum and minimum degree
	Study on color model conversion for camera with neural network based on the combination between second general revolving combination design and genetic algorithm (EI CONFERENCE) 会议论文 OAI收割 ICO20: Illumination, Radiation, and Color Technologies, August 21, 2005 - August 26, 2005, Changchun, China 作者: Li Z.; Zhou F.; Wang C.; Li Z. 收藏 \| 浏览/下载：36/0 \| 提交时间：2013/03/25 Munsell color system is selected to establish the mutual conversion between RGB and Lab* color model for camera. The color luminance meter and CCD camera synchronously measure the same color card XYZ value is gotten from the color luminance meter the training error is 0.000748566 it can show that the method combining second general revolving combination design with genetic algorithm can optimize the hidden-layer structure of neural network. Using the data of testing set to test this network and calculating the color difference between forecast value and true value the color picture captured from CCD camera is expressed for RGB value as the input of neural network and the Lab* value converted from XYZ value is regarded as the real color value of target card which the difference is not obvious comparing with forecast result the maximum is 5.6357 NBS namely the output of neural network. The neural network of two hidden-layers is considered the minimum is 0.5311 NBS so the second general revolving combination design is introduced into optimizing the structure of neural network and the average of color difference is 3.1744 NBS. which can carry optimization through unifying project design data processing and the precision of regression equation. Their mathematics model of encoding space is gained and the significance inspection shows the confidence degree of regression equation is 99%. The mathematics model is optimized by genetic algorithm optimization solution is gotten and function value of the goal is 0.0007168. The neural network of the optimization solution is trained
	On the Laplacian spectral radius of a graph 期刊论文 OAI收割 LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 卷号: 376, 页码: 135-141 作者: Liu, HQ; Lu, M; Tian, F \| 收藏 \| 浏览/下载：19/0 \| 提交时间：2018/07/30 Laplacian spectral radius minimum degree maximum degree