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

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

帮助

条数/页：排序方式：
	An Improved Digital Demodulation Algorithm in Low Sampling Frequency 会议论文 OAI收割 Shenyang, China, July 27-29, 2020 作者: Wang YT(王玉涛); Diao, Fengdan; Yang G(杨钢); Wei, Xichen; Wang Z(王忠) \| 收藏 \| 浏览/下载：27/0 \| 提交时间：2020/10/10 Digital demodulation frequency fluctuation improved algorithms lower sampling frequency
	A line mapping based automatic registration algorithm of infrared and visible images 会议论文 OAI收割 5th International Symposium on Photoelectronic Detection and Imaging (ISPDI) - Infrared Imaging and Applications, Beijing, June 25-27, 2013 作者: Ai R(艾锐); Shi ZL(史泽林); Xu DJ(徐德江); Zhang CS(张程硕) 收藏 \| 浏览/下载：36/0 \| 提交时间：2013/12/26 There exist complex gray mapping relationships among infrared and visible images because of the different imaging mechanisms. The difficulty of infrared and visible image registration is to find a reasonable similarity definition. In this paper, we develop a novel image similarity called implicit linesegment similarity(ILS) and a registration algorithm of infrared and visible images based on ILS. Essentially, the algorithm achieves image registration by aligning the corresponding line segment features in two images. First, we extract line segment features and record their coordinate positions in one of the images, and map these line segments into the second image based on the geometric transformation model. Then we iteratively maximize the degree of similarity between the line segment features and correspondence regions in the second image to obtain the model parameters. The advantage of doing this is no need directly measuring the gray similarity between the two images. We adopt a multi-resolution analysis method to calculate the model parameters from coarse to fine on Gaussian scale space. The geometric transformation parameters are finally obtained by the improved Powell algorithm. Comparative experiments demonstrate that the proposed algorithm can effectively achieve the automatic registration for infrared and visible images, and under considerable accuracy it makes a more significant improvement on computational efficiency and anti-noise ability than previously proposed algorithms.
	The new approach for infrared target tracking based on the particle filter algorithm (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 作者: Sun H.; Han H.-X.; Sun H. 收藏 \| 浏览/下载：60/0 \| 提交时间：2013/03/25 Target tracking on the complex background in the infrared image sequence is hot research field. It provides the important basis in some fields such as video monitoring precision and video compression human-computer interaction. As a typical algorithms in the target tracking framework based on filtering and data connection the particle filter with non-parameter estimation characteristic have ability to deal with nonlinear and non-Gaussian problems so it were widely used. There are various forms of density in the particle filter algorithm to make it valid when target occlusion occurred or recover tracking back from failure in track procedure but in order to capture the change of the state space it need a certain amount of particles to ensure samples is enough and this number will increase in accompany with dimension and increase exponentially this led to the increased amount of calculation is presented. In this paper particle filter algorithm and the Mean shift will be combined. Aiming at deficiencies of the classic mean shift Tracking algorithm easily trapped into local minima and Unable to get global optimal under the complex background. From these two perspectives that "adaptive multiple information fusion" and "with particle filter framework combining" we expand the classic Mean Shift tracking framework.Based on the previous perspective we proposed an improved Mean Shift infrared target tracking algorithm based on multiple information fusion. In the analysis of the infrared characteristics of target basis Algorithm firstly extracted target gray and edge character and Proposed to guide the above two characteristics by the moving of the target information thus we can get new sports guide grayscale characteristics and motion guide border feature. Then proposes a new adaptive fusion mechanism used these two new information adaptive to integrate into the Mean Shift tracking framework. Finally we designed a kind of automatic target model updating strategy to further improve tracking performance. Experimental results show that this algorithm can compensate shortcoming of the particle filter has too much computation and can effectively overcome the fault that mean shift is easy to fall into local extreme value instead of global maximum value.Last because of the gray and fusion target motion information this approach also inhibit interference from the background ultimately improve the stability and the real-time of the target track. 2011 Copyright Society of Photo-Optical Instrumentation Engineers (SPIE).
	Image compression algorithm of high-speed SPIHT for aerial applications (EI CONFERENCE) 会议论文 OAI收割 2011 IEEE 3rd International Conference on Communication Software and Networks, ICCSN 2011, May 27, 2011 - May 29, 2011, Xi'an, China 作者: Zhang K.; Zhang K.; Zhang K. 收藏 \| 浏览/下载：39/0 \| 提交时间：2013/03/25 SPIHT and NLS (Not List SPIHT) are efficient compression algorithms but the algorithms application is limited by the shortcomings of the poor error resistance and slow compression speed in the aviation and other areas requiring high-speed compression. In this paper the error resilience and the compression speed are improved. The remote sensing images are decomposed by Le Gall5/3 wavelet and wavelet coefficients are indexed scanned and allocated by the means of family blocks. The bit-plane importance is predicted by bitwise OR so the N bit-planes can be encoded at the same time. Compared with the SPIHT algorithm this modified algorithm is easy implemented by hardware and the compression speed is improved. The PSNR of reconstructed images encoded by high-speed SPIHT is slightly lower than SPIHT at rate 1bpp but the speed is 4.5-6 times faster than SPIHT encoding process. The algorithm meets the high speed and reliability requirements of aerial applications. 2011 IEEE.
	An improved algorithm to generate high quality progressive animation models (EI CONFERENCE) 会议论文 OAI收割 2010 International Conference on Biomedical Engineering and Computer Science, ICBECS 2010, April 23, 2010 - April 25, 2010, Wuhan, China 作者: Zhao J.; Zhang S. 收藏 \| 浏览/下载：26/0 \| 提交时间：2013/03/25 In computer graphics investigation has been made in many years in progressive models generation to alleviate the workload of visualization processing. However most of the existing algorithms only focus on static meshes and very little works are to deal with animation models. In this paper we propose an improved method for generating progressive multiresolution animation models. By the method we first use a normal deviation parameter to improve the famous QEM method as our basic edge contraction metric to generate a base hierarchy. The sequence of the simplified models is generated progressively from the first frame to the last one. Based on the edge contraction sequence in the previous frame the contraction order in the current frame is adjusted according to the deformation degree. We demonstrate that our method works efficiently and can generate better approximations with well-preserved features than previous methods. 2010 IEEE.
	Research on radiometric calibration of interline transfer CCD camera based on TDI working mode (EI CONFERENCE) 会议论文 OAI收割 5th International Symposium on Advanced Optical Manufacturing and Testing Technologies: Optical Test and Measurement Technology and Equipment, April 26, 2010 - April 29, 2010, Dalian, China 作者: Liu J.-G.; Wu X.-X. 收藏 \| 浏览/下载：24/0 \| 提交时间：2013/03/25 Interline transfer CCD camera can be designed to work in time delay and integration mode similar to TDI CCD to obtain higher responsivity and spatial resolution under poor illumination condition. However it was found that outputs of some pixels were much lower than others' as interline transfer CCD camera work in TDI mode in laboratory radiometric calibration experiments. As a result photo response non-uniformity(PRNU) and signal noise ratio(SNR) of the system turned for the worse. This phenomenon's mechanism was analyzed and improved PRNU and SNR algorithms of interline transfer CCD camera were advanced to solve this problem. In this way TDI stage was used as a variant in PRNU and SNR algorithms and system performance was improved observably with few influences on use. In validation experiments the improved algorithms was applied in radiometric calibration of a camera with KAI-0340s as detector. Results of validation experiments proved that the improved algorithms could effectively improve SNR and lower PRNU of the system. At the same time characteristic of the system could be reflected better. As working in 16 TDI stages PRUN was reduced from 2.25% to 0.82% and SNR was improved about 2%. 2010 Copyright SPIE - The International Society for Optical Engineering.
	Image parallel processing based on GPU (EI CONFERENCE) 会议论文 OAI收割 2010 IEEE International Conference on Advanced Computer Control, ICACC 2010, March 27, 2010 - March 29, 2010, 445 Hoes Lane - P.O.Box 1331, Piscataway, NJ 08855-1331, United States 作者: Wang J.-L.; Wang J.-L. 收藏 \| 浏览/下载：31/0 \| 提交时间：2013/03/25 In order to solve the compute-intensive character of image processing based on advantages of GPU parallel operation parallel acceleration processing technique is proposed for image. First efficient architecture of GPU is introduced that improves computational efficiency comparing with CPU. Then Sobel edge detector and homomorphic filtering two representative image processing algorithms are embedded into GPU to validate the technique. Finally tested image data of different resolutions are used on CPU and GPU hardware platform to compare computational efficiency of GPU and CPU. Experimental results indicate that if data transfer time between host memory and device memory is taken into account speed of the two algorithms implemented on GPU can be improved approximately 25 times and 49 times as fast as CPU respectively and GPU is practical for image processing. 2010 IEEE.
	An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE) 会议论文 OAI收割 2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009, Nanchang, China 作者: Wang C. 收藏 \| 浏览/下载：15/0 \| 提交时间：2013/03/25 Task Assignment Problems (TAPs) in distributed computer system are general NP-hard and usually modeled as integer programming discrete problems. Many algorithms are proposed to resolve those problems. Discrete particle swarm algorithm (DPS) is a newly developed method to solve constraint satisfaction problem (CSP) which has advantage on search capacity and can find more solutions. We proposed an improved DPS to solve TAP in this paper. DPS has a special operator namely coefficient multiplying speed which is designed for CSP but does not exist in other discrete problems. Thus we redefined a coefficient multiplying speed operator with probability selection. We analyzed the speed and position updating formula then we derived a refined position updating formula. Several experiments are carried out to test our DPS. Experimental results show that our algorithm has more efficient search capacity higher success rate less running time and more robust.
	An improved discrete particle swarm optimization algorithm for TSP (EI CONFERENCE) 会议论文 OAI收割 2007 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2007, November 2, 2007 - November 5, 2007, Silicon Valley, CA, United states 作者: 收藏 \| 浏览/下载：28/0 \| 提交时间：2013/03/25 An Improved discrete particle swarm optimization (DPSO)-based algorithm for the traveling salesman problem (TSP) is proposed. In order to overcome the problem of premature convergence a novel depressor is proposed and a diversity measure to control the swarm is also introduced which can be used to switch between the attractor and depressor. The proposed algorithm has been applied to a set of benchmark problems and compared with the existing algorithms for solving TSP using swarm intelligence. The results show that it can prevent premature convergence to a high degree but still keeps a rapid convergence like the basic DPSO. 2007 IEEE.