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

A new approach to the existence and regularity of linear equilibrium in a noisy rational expectations economy 期刊论文 OAI收割
JOURNAL OF MATHEMATICAL ECONOMICS, 2020, 卷号: 90, 页码: 119-126
作者: Lou, Youcheng; Wang, Shouyang

|

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

Existence and regularity Rational expectations equilibrium A new approach

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.

收藏 | 浏览/下载：40/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

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.

收藏 | 浏览/下载：40/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 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).

TextureGrow: Object recognition and segmentation with limit prior knowledge (EI CONFERENCE) 会议论文 OAI收割
2011 International Conference on Network Computing and Information Security, NCIS 2011, May 14, 2011 - May 15, 2011, Guilin, Guangxi, China
Yao Z.; Han Q.

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

In this paper we present a new method for automatically visual recognition and semantic segmentation of photographs. Our automatically and rapidly approach based on Cellular Automation. Most of the analysis and description of recognition and segmentation are based on statistical or structural properties of this attribute most of them need plenty of samples and prior Knowledge. In this paper within a few evident samples (not too many) we can first get the texture feature of each component and the structures then select the approximately location randomly of the objects or patches of them then we use the Cellular Automata algorithm to "grow" based on texture of different objects. The grow progress will stop When texture grow to the boundary. By this steps a new method is found which allow us use very few samples and low lever experience and get a rapidly and accuracy way to recognize and segment objects. We found that this new propose gives competitive results with limited experience and samples. 2011 IEEE.

Application of Vague set to Software rating ascertainment for space camera (EI CONFERENCE) 会议论文 OAI收割
2nd International Conference on Information Science and Engineering, ICISE2010, December 4, 2010 - December 6, 2010, Hangzhou, China
作者: Li Y.; Li Y.; Li Y.; Li Y.

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

Software rating ascertainment is very important in development of space camera software system. It can guide the software measurement and management and help designer improve system reliability finally. Fault Tree Analysis is a common method to analyze the danger reason and fix on bottom events. The most significant step is calculating the occurrence probabilistic of top event namely the occurrence probabilistic of dangerous event. Because software failure cause is anfractuous and available data are hard to get a modeling method for bottom event is proposed based on Vague set to calculate the occurrence probabilistic of top event. Experimental results show that the new approach of Vague set can guide the Software rating ascertainment which is ascertained using qualitative analysis. The results also show that the new method makes software rating ascertainment have the quantificational evidence. 2010 IEEE.

Quaternion based assessment method for color image fusion algorithms (EI CONFERENCE) 会议论文 OAI收割
2010 3rd International Congress on Image and Signal Processing, CISP 2010, October 16, 2010 - October 18, 2010, Yantai, China
作者:

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

A new approach to assess the performance of color image fusion algorithms is proposed. The color information is fully used by this method. Quaternions are used to encode the pixels in a color image into a quaternion matrix. Local variance of the luminance layer of the color image is taken as the real part of a quaternion then the three RGB channels of the color image are encoded into the three imaginary parts of a quaternion. The angle between the singular value feature vectors of the quaternion matrices corresponding to one of the source image and the fused image is used to measure their structural similarity. Edge information transferring is used to balance the sensitivity of the assessment methods. Experimental results show that the proposed assessment method is better consistent with the HVS than some of the state-of-the-art method. Accurate assessment results can be given by the proposed method for various of color image fusion algorithms by using the source images and the fused image. 2010 IEEE.

Optimal multiresolution dynamic models generation based on triangle importance (EI CONFERENCE) 会议论文 OAI收割
2nd International Conference on Image Analysis and Signal Processing, IASP'2010, April 12, 2010 - April 14, 2010, Xiamen, China
作者: Zhao J.; Zhang S.

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

In this paper we propose an efficient method to generate optimal multiresolution dynamic models. By the method we define the triangle importance degree as a weight parameter to be embedded to the edge contraction cost so the new metric can not only measure distance error but also reflect geometric variation of local areas. A deformation degree weight is appended to the aggregated edge contraction cost for the whole animation thus sharp features on areas with large deformation can be preserved. In addition a process of mesh optimization and validity check can further alleviate the geometric distortion of the approximations. Our approach is efficient in operation easy for implementation and as a result high quality of dynamic approximations with well-preserved fine details can be generated at any given frame. 2010 IEEE.

A local feature based simplification method for animated mesh sequence (EI CONFERENCE) 会议论文 OAI收割
2010 2nd International Conference on Computer Engineering and Technology, ICCET 2010, April 16, 2010 - April 18, 2010, Chengdu, China
作者: Wang B.; Wang B.; Zhao J.; Zhang S.

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

Although animated meshes are frequently used in numerous domains only few works have been proposed until now for simplifying such data. In this paper we propose a new method for generating progressive animated models based on local feature analysis and deformation area preservation. We propose the use of solid angle and height value for a non-hyperbolic vertex to define the local feature parameter. This local factor is embedded to the vertex quadric error matrix when calculating the edge collapse cost. In order to preserve the areas with large deformation we add deformation degree weight to the aggregated quadric errors when computing the unified edge contraction sequence. Finally a mesh optimization process is proposed to further reduce the geometric distortion for each frame. Our approach is fast easy to implement and as a result good quality dynamic approximations with well-preserved fine details can be generated at any given frame. 2010 IEEE.

Animated models coarsening with local area distortion and deformation degree control (EI CONFERENCE) 会议论文 OAI收割
International Conference on Image Processing and Pattern Recognition in Industrial Engineering, August 7, 2010 - August 8, 2010, Xi'an, China
作者: Zhang S.; Zhao J.

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

In computer graphics applications mesh coarsening is an important technique to alleviate the workload of visualization processing. Compared to the extensive works on static model approximation very little attentions have been paid to animated models. In this paper we propose a new method to approximate animated models with local area distortion and deformation degree control. Our method uses an improved quadric error metric guided by a local area distortion measurement as a basic hierarchy. Also we define a deformation degree parameter to be embedded into the aggregated quadric errors so areas with large deformation during the animation can be successfully preserved. Finally a mesh optimization process is proposed to further reduce the geometric distortion for each frame. Our approach is fast easy to implement and as a result good quality dynamic approximations with well-preserved sharp features can be generated at any given frame. 2010 SPIE.