中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页
机构
成果
学者
登录
注册
登陆
×
验证码:
换一张
忘记密码?
记住我
×
校外用户登录
CAS IR Grid
机构
长春光学精密机械与... [13]
自动化研究所 [2]
遥感与数字地球研究所 [1]
过程工程研究所 [1]
沈阳自动化研究所 [1]
软件研究所 [1]
更多
采集方式
OAI收割 [19]
内容类型
会议论文 [14]
期刊论文 [5]
发表日期
2018 [1]
2017 [1]
2014 [1]
2012 [2]
2011 [2]
2010 [3]
更多
学科主题
筛选
浏览/检索结果:
共19条,第1-10条
帮助
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
题名升序
题名降序
发表日期升序
发表日期降序
提交时间升序
提交时间降序
作者升序
作者降序
A multilevel-skin neighbor list algorithm for molecular dynamics simulation
期刊论文
OAI收割
COMPUTER PHYSICS COMMUNICATIONS, 2018, 卷号: 222, 期号: 00, 页码: 59
作者:
Zhang, Chenglong
;
Zhao, Mingcan
;
Hou, Chaofeng
;
Ge, Wei
  |  
收藏
  |  
浏览/下载:32/0
  |  
提交时间:2018/01/19
High Performance Computing
Molecular Dynamics Simulation
Neighbor-list-based Algorithm
Searching Efficiency
Tandem polymer solar cells: Simulation and optimization through a multiscale scheme
期刊论文
OAI收割
Beilstein Journal of Nanotechnology, 2017, 卷号: 8, 期号: 1, 页码: 123-133
作者:
Wei FN(魏发南)
;
Yao, Ligang
;
Lan, Fei
;
Li GY(李广勇)
;
Liu LQ(刘连庆)
收藏
  |  
浏览/下载:25/0
  |  
提交时间:2017/02/05
genetic algorithm
Monte Carlo simulation
simplex searching
tandem polymer solar cells
基于粒子群优化的测试数据生成及其实证分析
期刊论文
OAI收割
计算机研究与发展, 2014, 卷号: 51, 期号: 4, 页码: 824-837
毛澄映
;
喻新欣
;
薛云志
  |  
收藏
  |  
浏览/下载:40/0
  |  
提交时间:2014/12/16
结构性测试
测试数据生成
分支覆盖
搜索算法
粒子群优化
structural testing
test data generation
branch coverage
searching algorithm
particle swarm optimization (PSO)
A fast target recognition algorithm based on MSA and MSR (EI CONFERENCE)
会议论文
OAI收割
2012 International Conference on Industrial Control and Electronics Engineering, ICICEE 2012, August 23, 2012 - August 25, 2012, Xi'an, China
作者:
Wang Y.
;
Liu G.
;
Wang Y.
;
Wang Y.
;
Wang Y.
收藏
  |  
浏览/下载:34/0
  |  
提交时间:2013/03/25
This paper presents a new fast target recognition algorithm
the proposed method is based on Multi-scale Auto convolution(MSA) and Multi-scale Retinex(MSR). As shown by the comparison with original MSA
it appears that this new technique solves the problem that MSA algorithm is sensitive to illumination and the computational load is significantly reduced to 1/8th of that of the original MSA algorithm
it is also robust to affine transform
light projective transform
noise
thin fog
occlusion and illumination change. the performed experiments show that it has fast searching speed
and can accurately recognize and locate target in real scenes. 2012 IEEE.
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.
收藏
  |  
浏览/下载:41/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 ship-borne infrared searching and tracking system based on the inertial platform (EI CONFERENCE)
会议论文
OAI收割
International Symposium on Photoelectronic Detection and Imaging 2011: Advances in Infrared Imaging and Applications, May 24, 2011 - May 24, 2011, Beijing, China
作者:
Li Y.
;
Zhang H.
;
Zhang H.
;
Li Y.
;
Li Y.
收藏
  |  
浏览/下载:42/0
  |  
提交时间:2013/03/25
As a result of the radar system got interferenced or in the state of half silent
it can cause the guided precision drop badly In the modern electronic warfare
therefore it can lead to the equipment depended on electronic guidance cannot strike the incoming goals exactly. It will need to rely on optoelectronic devices to make up for its shortcomings
but when interference is in the process of radar leading
especially the electro-optical equipment is influenced by the roll
pitch and yaw rotation
it can affect the target appear outside of the field of optoelectronic devices for a long time
so the infrared optoelectronic equipment can not exert the superiority
and also it cannot get across weapon-control system "reverse bring" missile against incoming goals. So the conventional ship-borne infrared system unable to track the target of incoming quickly
the ability of optoelectronic rivalry declines heavily.Here we provide a brand new controlling algorithm for the semi-automatic searching and infrared tracking based on inertial navigation platform. Now it is applying well in our XX infrared optoelectronic searching and tracking system. The algorithm is mainly divided into two steps: The artificial mode turns into auto-searching when the deviation of guide exceeds the current scene under the course of leading for radar.When the threshold value of the image picked-up is satisfied by the contrast of the target in the searching scene
the speed computed by using the CA model Least Square Method feeds back to the speed loop. And then combine the infrared information to accomplish the closed-loop control of the infrared optoelectronic system tracking. The algorithm is verified via experiment. Target capturing distance is 22.3 kilometers on the great lead deviation by using the algorithm. But without using the algorithm the capturing distance declines 12 kilometers. The algorithm advances the ability of infrared optoelectronic rivalry and declines the target capturing time by using semi-automatic searching and reliable capturing-tracking
when the lead deviation of the radar is great. 2011 Copyright Society of Photo-Optical Instrumentation Engineers (SPIE).
Automatic bridge extraction for optical images (EI CONFERENCE)
会议论文
OAI收割
6th International Conference on Image and Graphics, ICIG 2011, August 12, 2011 - August 15, 2011, Hefei, Anhui, China
Gu D.-Y.
;
Zhu C.-F.
;
Shen H.
;
Hu J.-Z.
;
Chang H.-X.
收藏
  |  
浏览/下载:37/0
  |  
提交时间:2013/03/25
This paper describes a novel hierarchy algorithm for extracting bridges over water in optical images. To reduce the omission of bridges by searching the edge
we extract the river regions which the bridges are included in. Firstly
we segment the optical image to get the coarse water bodies using iterative threshold
eliminate the noise regions and add the missing regions based on k-means clustering with texture information and spatial coherence. Then
the blanks are connected based on shape features and candidate bridge regions are segmented from river regions. Finally
the bridges are verified by geometric information and the ubiety between bridges and river. The results show that this approach is efficient and effective for extracting bridges in satellite image from Google Earth and in aerial optical images acquired by unmanned aerial vehicle. 2011 IEEE.
The registration of aerial infrared and visible images (EI CONFERENCE)
会议论文
OAI收割
2010 International Conference on Educational and Information Technology, ICEIT 2010, September 17, 2010 - September 19, 2010, Chongqing, China
作者:
Liu J.
;
Wang Y.
;
Wang Y.
;
Wang Y.
;
Wang Y.
收藏
  |  
浏览/下载:30/0
  |  
提交时间:2013/03/25
In order to solve the registration problem of different source image existed on aerial image fusion
algorithms based on Particle Swarm Optimization (PSO) are applied as search strategy in this paper
and Alignment Metric (AM) is used as judgment. This study has realized the different source image registration of infrared and visible light with high speed
high accuracy and high reliability. Basically
with little restriction of gray level properties
a new alignment measure is applied
which can efficiently measure the image registration extent and tolerate noise well. Even more
the intelligent optimization algorithm - Particle Swarm Optimization (PSO) is combined to improve the registration precision and rate of infrared and visible light. Experimental results indicate that
the study attains the registration accuracy of pixel level
and every registration time is cut down over 40 percent compared to traditional method. The match algorithm based on AM
solves the registration problem that greater differences between different source images are existed on gray and characteristic. At the same time
the adoption of combining the intelligent optimization algorithms significantly improves the searching efficiency and convergence speed of the algorithms
and the registration result has higher accuracy and stability
which builds up solid foundation for different source image fusion. The method in this paper has a magnificent effect
and is easy for application and very suitable for engineering use. 2010 IEEE.
The application of TMS320c64x DSP assembly language in correlation tracking algorithms (EI CONFERENCE)
会议论文
OAI收割
2010 3rd International Congress on Image and Signal Processing, CISP 2010, October 16, 2010 - October 18, 2010, Yantai, China
Huang D.
;
Wu Z.
;
Liang M.
;
Dong Y.
;
Peng T.
收藏
  |  
浏览/下载:23/0
  |  
提交时间:2013/03/25
In order to improve the real-time performance of the conventional correlation tracking algorithm based on full search method
for its huge computation amount and vast correlation matching times in the process of searching an optimal matching position
a method of combining the TMS320C64x DSP assembly language and software pipelining is proposed to realize template matching which costs the most time of the algorithm. Choose high performance DSP chip TMS320DM642 as the core processor of the hardware platform
and schedule each one of the instruction in the algorithm to maximize performance using the instruction-level parallelism of the DSP. The experimental results indicate the time of template image matching implemented in assembly language has decreased from 49.36ms to 0.62ms. It is concluded that the correlation tracking adopting proposed method can meet the real-time and stability requirement of the target tracking. 2010 IEEE.
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.
收藏
  |  
浏览/下载:18/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.