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

A Pose Measurement Algorithm of Space Target Based on Monocular Vision and Accuracy Analysis 期刊论文 OAI收割
Guangzi Xuebao, 2021, 卷号: 50, 期号: 11
作者: Dong, Yongying; Zhang, Gaopeng; Chang, Sansan; Zhang, Zhi; Li, Yanjie

|

收藏 | 浏览/下载：42/0 | 提交时间：2022/01/15

Pose measurement Monocular vision Improved orthogonal iteration algorithm Space target Taguchi method

Imaging of buried obstacles in a two-layered medium with phaseless far-field data 期刊论文 OAI收割
INVERSE PROBLEMS, 2021, 卷号: 37, 期号: 5, 页码: 26
作者: Li, Long; Yang, Jiansheng; Zhang, Bo; Zhang, Haiwen

|

收藏 | 浏览/下载：26/0 | 提交时间：2021/06/01

two-layered medium buried obstacle phaseless far-field data direct imaging method recursive Newton-type iteration algorithm

A two-step neutron spectrum unfolding method for fission reactors based on artificial neural network 期刊论文 OAI收割
ANNALS OF NUCLEAR ENERGY, 2020, 卷号: 139
作者: Cao, Chenglong; Gan, Quan; Song, Jing; Long, Pengcheng; Wu, Bin

|

收藏 | 浏览/下载：29/0 | 提交时间：2020/11/26

Neutron spectrum unfolding Two-step method Artificial neural network Iteration algorithm

Study of an unfolding algorithm for D-T neutron energy spectra measurement using a recoil proton method 期刊论文 OAI收割
CHINESE PHYSICS C, 2015, 卷号: 39, 期号: 7, 页码: 76201
作者: Wang, J; Lu, XL; Yan, Y; Wei, Z; Wang, JR

收藏 | 浏览/下载：19/0 | 提交时间：2016/04/18

D-T neutron source recoil proton energy spectrum D-T neutron energy spectrum iteration algorithm method

A new algorithm for solving the best-fit sphere of optical aspherical surface (EI CONFERENCE) 会议论文 OAI收割
2nd International Conference on Advances in Materials and Manufacturing, ICAMMP 2011, December 16, 2011 - December 18, 2011, Guilin, China
作者: Lin J.; Lu M.

收藏 | 浏览/下载：38/0 | 提交时间：2013/03/25

To solve the best-fit sphere (BFS) accurately is one of the technological keys for the generating and testing of optical aspherical surfaces. This paper presents a new algorithm for solving the BFS of aspherical surfaces to suppress some deficiencies in the existing BFS algorithms. In the proposed approach it is not only suitable for the conic surface a BFS is constructed but also for higher order aspheres. The obtained asphericity and material removal function is more suitable for the machining and test. (2012) Trans Tech Publications which passes through both sides of endpoints in the section o -?xy of the aspherical surfaces Switzerland. the center of the BFS is shifted along the x-axis and its radius of curvature is automatically computed. The variable step size method is proposed to speed up the convergence of the iteration. Through numerically solving the BFS of conic and cubic surface the advantages of the proposed approach are verified. The results show that the proposed approach is of rapid convergence and high accuracy

Method of tacit knowledge discovery based on domain knowledge under driven of problems (EI CONFERENCE) 会议论文 OAI收割
2012 International Conference on Computer Science and Information Processing, CSIP 2012, August 24, 2012 - August 26, 2012, Xi'an, Shaanxi, China
作者: Wang Y.-C.; Wang Y.-C.

收藏 | 浏览/下载：18/0 | 提交时间：2013/03/25

Now most of the knowledge discoveries are using the data mining technology and driven by data. This kind of knowledge discovery can't finish the discovery exploration and applying of the tacit knowledge. According to the problem above this paper proposes a domain knowledge-based of problem driven tacit knowledge discovery method. This paper designs a S-K-T algorithm and the related problem-knowledge mining algorithm to get the domain knowledge semantic tree and the problem-domain knowledge tree and based on this through the spiral iteration to finish the discovery of the tacit knowledge under the driven of problems. 2012 IEEE.

Classification of hyperspectral image based on SVM optimized by a new particle swarm optimization (EI CONFERENCE) 会议论文 OAI收割
2012 2nd International Conference on Remote Sensing, Environment and Transportation Engineering, RSETE 2012, June 1, 2012 - June 3, 2012, Nanjing, China
作者: Gao X.; Yu P.; Yu P.

收藏 | 浏览/下载：19/0 | 提交时间：2013/03/25

Support Vector Machine (SVM) is used to classify hyperspectral remote sensing image in this paper. Radial Basis Function (RBF) which is most widely used is chosen as the kernel function of SVM. Selection of kernel function parameter is a pivotal factor which influences the performance of SVM. For this reason Particle Swarm Optimization (PSO) is provided to get a better result. In order to improve the optimization efficiency of kernel function parameter firstly larger steps of grid search method is used to find the appropriate rang of parameter. Since the PSO tends to be trapped into local optimal solutions a weight and mutation particle swam optimization algorithm was proposed in which the weight dynamically changes with a liner rule and the global best particle mutates per iteration to optimize the parameters of RBF-SVM. At last a 220-bands hyperspectral remote sensing image of AVIRIS is taken as an experiment which demonstrates that the method this paper proposed is an effective way to search the SVM parameters and is available in improving the performance of SVM classifiers. 2012 IEEE.

Multi-focus image fusion algorithm based on adaptive PCNN and wavelet transform (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
Wu Z.-G.; Wang M.-J.; Han G.-L.

收藏 | 浏览/下载：72/0 | 提交时间：2013/03/25

Being an efficient method of information fusion image fusion has been used in many fields such as machine vision medical diagnosis military applications and remote sensing.In this paper Pulse Coupled Neural Network (PCNN) is introduced in this research field for its interesting properties in image processing including segmentation target recognition et al. and a novel algorithm based on PCNN and Wavelet Transform for Multi-focus image fusion is proposed. First the two original images are decomposed by wavelet transform. Then based on the PCNN a fusion rule in the Wavelet domain is given. This algorithm uses the wavelet coefficient in each frequency domain as the linking strength so that its value can be chosen adaptively. Wavelet coefficients map to the range of image gray-scale. The output threshold function attenuates to minimum gray over time. Then all pixels of image get the ignition. So the output of PCNN in each iteration time is ignition wavelet coefficients of threshold strength in different time. At this moment the sequences of ignition of wavelet coefficients represent ignition timing of each neuron. The ignition timing of PCNN in each neuron is mapped to corresponding image gray-scale range which is a picture of ignition timing mapping. Then it can judge the targets in the neuron are obvious features or not obvious. The fusion coefficients are decided by the compare-selection operator with the firing time gradient maps and the fusion image is reconstructed by wavelet inverse transform. Furthermore by this algorithm the threshold adjusting constant is estimated by appointed iteration number. Furthermore In order to sufficient reflect order of the firing time the threshold adjusting constant is estimated by appointed iteration number. So after the iteration achieved each of the wavelet coefficient is activated. In order to verify the effectiveness of proposed rules the experiments upon Multi-focus image are done. Moreover comparative results of evaluating fusion quality are listed. The experimental results show that the method can effectively enhance the edge details and improve the spatial resolution of the image. 2011 SPIE.

Super-resolution using adaptive blur parameter estimation (EI CONFERENCE) 会议论文 OAI收割
2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010, September 23, 2010 - September 25, 2010, Chengdu, China
作者: Wang H.; Wang H.; Wang H.; Wang H.; Liu G.

收藏 | 浏览/下载：15/0 | 提交时间：2013/03/25

Super-resolution is a term for a set of methods of increasing image or video resolution. All these methods are based on the same idea: using information from several images to create one upsized image. In most of the super-resolution algorithms the blur parameter of a LR-image model is always manually set as a default value. In this paper we propose a method to adaptively estimate the blur parameter. We get the initial image of iteration by fusing all low-resolution images. When it is used in MAP algorithm three iterations are enough to get a stable solution. It is greatly reduce the computational power compared with other MAP algorithms. Experiments to real image sequences show that it well preserved the image detail and the reconstructed image is clear. 2010 IEEE.

A design of high-speed and low-consume parallel grouping RS code and simulation (EI CONFERENCE) 会议论文 OAI收割
2010 3rd International Conference on Advanced Computer Theory and Engineering, ICACTE 2010, August 20, 2010 - August 22, 2010, Chengdu, China
Chen C.; Jin G.

收藏 | 浏览/下载：22/0 | 提交时间：2013/03/25

RS code is a linear error correction codes with better error correction capability is widely used in different kinds of occasions for communications or data storage. But for its high difficulty of coding and decoding algorithm and low throughput optimization RS algorithm is always studied as one of the focus in the error-correction field. A new coding method parallel coding and decoding data into groups in lower step finite field for avoiding complex matrix iteration and Chien search computation is proposed in this paper. It is proved that the coding and decoding throughput of the parallel grouping RS coder is increased and the hardware complexity is reduced with changeless error-correction capability from the simulation results using ModelSim SE 6.0 and synthetic results using ISE 9.11. 2010 IEEE.