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

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

帮助

条数/页：排序方式：
	New periodically variable speed limits rule for highways with mathematical model and simulation 期刊论文 OAI收割 IET INTELLIGENT TRANSPORT SYSTEMS, 2018, 卷号: 12, 期号: 3, 页码: 227-235 作者: Wen, Jianghui; Jiang, Zewu; Zhang, Suiyuan; Wu, Chaozhong; Ran, Bin \| 收藏 \| 浏览/下载：26/0 \| 提交时间：2019/12/10 traffic engineering computing variable speed limits rule traffic safety transportation efficiency mathematical model VSL rule mathematical expectation membership functions two-lane highways three-lane highways driver satisfaction
	A high accuracy surface modeling method based on GPU accelerated multi-grid method 期刊论文 OAI收割 TRANSACTIONS IN GIS, 2016, 卷号: 20, 期号: 6, 页码: 991-1003 作者: Yan, Changqing; Liu, Jimin; Zhao, Gang; Chen, Chuanfa; Yue, Tianxiang \| 收藏 \| 浏览/下载：55/0 \| 提交时间：2019/09/25 computing speed GPU HASM multi-grid method surface modeling
	The application of symmetrical equation of diffracted wavevectors in integral theory of gratings (EI CONFERENCE) 会议论文 OAI收割 2nd International Conference on Advanced Engineering Materials and Technology, AEMT 2012, July 6, 2012 - July 8, 2012, Zhuhai, China 作者: Gao J.; Zhang F.; Zhang F. 收藏 \| 浏览/下载：17/0 \| 提交时间：2013/03/25 The integral theory for electromagnetic theory of gratings which has complex mathematical tool and long computation cost is needed to improve computing speed of the algorithm. A very shot-cut equation which is called symmetrical equation of diffracted wavevectors by us is presented. It makes the number of Green's function expansion terms shorter and simplifies the integral kernel by taking into account its symmetry. Take the grating in Littrow mount for computing example because of applying this equation the computation cost of integral theory which has good convergence is shorten to 1/2 to 2/5. This work modifies the integral theory and improves its computing speed. (2012) Trans Tech Publications Switzerland.
	Image matching using a bat algorithm with mutation (EI CONFERENCE) 会议论文 OAI收割 2012 International Conference on Mechatronic Systems and Automation Systems, MSAS 2012, July 21, 2012 - July 21, 2012, Wuhan, China 作者: Zhang J.; Wang G.; Zhang J.; Zhang J. 收藏 \| 浏览/下载：39/0 \| 提交时间：2013/03/25 Due to shortcoming of traditional image matching for computing the fitness for every pixel in the searching space a new bat algorithm with mutation (BAM) is proposed to solve image matching problem and a modification is applied to mutate between bats during the process of the new solutions updating. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. The realization procedure for this improved meta-heuristic approach BAM is also presented. To prove the performance of this proposed meta-heuristic method BAM is compared with BA and other population-based optimization methods DE and SGA. The experiment shows that the proposed approach is more effective and feasible in image matching than the other model. (2012) Trans Tech Publications Switzerland.
	The Research of real time auto-recognition of the moire fringe (EI CONFERENCE) 会议论文 OAI收割 International Symposium on Photoelectronic Detection and Imaging 2011: Advances in Imaging Detectors and Applications, May 24, 2011 - May 26, 2011, Beijing, China Wang M.-J.; Wu Z.-G. 收藏 \| 浏览/下载：19/0 \| 提交时间：2013/03/25 Measuring the movement of raster by the method of moire fringe has the advantage of high sensitivity high resolution and non-contacted measurement. The characteristic of moire fringe is that the image is white alternate with black the angle of the stripes is uniform the width of the stripes is uniform the terminators of the stripes aren't clear. A fast method that can figure out the width and angle of the moire fringe precisely is put forward in this paper. It calculates the angle the stripes firstly. According to the principle of the minimum mean squared error (MMSE) the closer a series of data is the smaller the value of the MMSE will be. The method is described as follows: It takes the image's center as the origin 180 beelines pass through the origin with the same angle interval. it calculates the value of the minimum mean squared error of the 180 beelines and find out the least one among those then the angle of the moire fringe comes out primarily. In order to improving the calculating precision of moire fringe 60 equal angles are divided in the neighborhood of the angle then a precise angle of moire fringe is calculated according to the principle of the MMSE. After getting out the angle of the moire fringe we begin to calculate the width of moire fringe. A line vertical with the moire fringe is drawn and we can get the width of the moire fringe by the vertical line. In order to get over the influence of the noise an effective area with the shape of diamond is selected in the image. The data of area is accumulated and projected according to the direction of moire fringe and a sine curve come out. The width of moire fringe can be obtained by getting the position of the first wave crest the position of the last wave crest and the number of wave crest. Experiments prove that the precision of the method put forward in this paper is enhanced in comparison with the traditional frequency method the precision of width calculation achieves to 99.6% according to the evaluation indicators of width detection error. The computing speed is boosted largely compared with traditional method and it can achieve with 15 ms that satisfying the demand of real time. 2011 SPIE.
	A GPU accelerated continuous-based discrete element method for elastodynamics analysis 会议论文 OAI收割 International Conference on Key Engineering Materials and Computer Science (KEMCS 2011), Dalian, PEOPLES R CHINA, AUG 06-07, 2011 作者: Ma ZS(马照松); Feng C(冯春); Liu TP(刘天苹); Li SH(李世海) 收藏 \| 浏览/下载：43/0 \| 提交时间：2013/02/26 DEM Discrete Element Method CUDA GPU Algorithms Cloning Finite difference method Computing speed Data independence Elasto-dynamics GPU computing Parallel executions Speedup ratio
	Fast covariance matching based on Genetic Algorithm (EI CONFERENCE) 会议论文 OAI收割 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010, September 23, 2010 - September 25, 2010, Chengdu, China 作者: Zhang X.; Zhang L.; Zhang L.; Zhang X.; Zhang X. 收藏 \| 浏览/下载：13/0 \| 提交时间：2013/03/25 This paper proposes an effective framework to boost the efficiency of covariance matching. In this framework covariance matrices are used to match object in complex environment by fusing multiple features. Then Genetic Algorithm (GA) is employed to improve the processing speed of covariance matching. To take advantage of the property of GA for the optimization in large search spaces to covariance matching a fitness function is designed using the distances between the covariance matrices of model and candidate regions. Experimental results show that the proposed approach can improve the processing speed of covariance matching observably. The computing speed of the proposed method is at least 7 times than that of exhaustive searching. 2010 IEEE.
	Adjustment computation of HASM: a high-accuracy and high-speed method 期刊论文 OAI收割 INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2010, 卷号: 24, 期号: 11, 页码: 1725-1743 Yue, T. X.(岳天祥); Wang, S. H. 收藏 \| 浏览/下载：284/75 \| 提交时间：2011/06/10 HASM adjustment computation accuracy computing speed real-time visualization
	Target track system design based on circular projection (EI CONFERENCE) 会议论文 OAI收割 ICO20: Optical Information Processing, August 21, 2005 - August 26, 2005, Changchun, China Song H.-J.; Zhu M.; Hu S.; Shen M.-L. 收藏 \| 浏览/下载：22/0 \| 提交时间：2013/03/25 Template matching is the process of searching the present and the location of a reference image or an object in a scene image. Template matching is a classical problem in a scene analysis: given a reference image of an object decide whether that object exists in a scene image under analysis and find its location if it does. The template matching process involves cross-correlating the template with the scene image and computing a measure of similarity between them to determine the displacement. The conventional matching method used the spatial cross-correlation process which is computationally expensive. Some algorithms are proposed for this speed problem such as pyramid algorithm but it still can't reach the real-time for bigger model image. Moreover the cross-correlation algorithm can't be effective when the object in the image is rotated. Therefore the conventional algorithms can't be used for practical purpose. In this paper an algorithm for a rotation invariant template matching method based on different value circular projection target tracking algorithm is proposed. This algorithm projects the model image as circular and gets the radius and the sum of the same radius pixel value. The sum of the same radius pixel value is invariable for the same image and the any rotated angle image. Therefore this algorithm has the rotation invariant property. In order to improve the matching speed and get the illumination invariance the different value method is combined with circular projection algorithm. This method computes the different value between model image radius pixel sum and the scene image radius pixel sum so that it gets the matching result. The pyramid algorithm also is been applied in order to improve the matching speed. The high speed hardware system also is been design in order to meet the real time requirement of target tracking system. The results show that this system has the good rotate invariance and real-time property.