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

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

帮助

条数/页：排序方式：
	Rotation and scaling invariant feature lines for image matching (EI CONFERENCE) 会议论文 OAI收割 2011 International Conference on Mechatronic Science, Electric Engineering and Computer, MEC 2011, August 19, 2011 - August 22, 2011, Jilin, China 作者: Wang Y.; Wang Y.; Wang Y.; Wang Y.; Wang Y. 收藏 \| 浏览/下载：38/0 \| 提交时间：2013/03/25 Image matching has been one of the most fundamental issues computer vision over the decades. In this paper we propose a novel method based on making use of feature lines in order to achieve more robust image matching. The feature lines have the properties of rotation and scaling invariance coined RIFLT(Rotation invariant feature line transform). Experimental results demonstrate the effectiveness and efficiency of the proposed method. Compare with the famous powerful algorithm Scale Invariant Feature Transform(SIFT) the proposed method is more insensitive to noise. And for certain sequence of images which contain clear lines the proposed method is more efficiency. Using the feature lines obtained by our method it is possible to matching two scene images with different rotation angles scale and light distort. 2011 IEEE.
	Scene matching based on directional keylines and polar transform (EI CONFERENCE) 会议论文 OAI收割 2010 IEEE 10th International Conference on Signal Processing, ICSP2010, October 24, 2010 - October 28, 2010, Beijing, China 作者: Wang Y.; Wang Y.; Wang Y.; Wang Y.; Wang Y. 收藏 \| 浏览/下载：37/0 \| 提交时间：2013/03/25 Scene matching under complex background is a priority and difficulty in the field of computer vision it has the characteristics of rotation and scaling invariance commonly used in matching real-time collected images and photos for navigation. Scene matching techniques are faced with complex natural scenes anti-light and anti-slight-distortion the image distortion exist applicable for complex scene matching. The project has a new idea: combining the keylines with the vectors description based on polar image translation such as light and utilize the rotation-scale-invariance vectors to describe the extracted keylines change of gray levels this method includes three steps: keylines extraction perspective description and matching. Preliminary experiments show that this keylines-based scene matching algorithm is applicable for image matching under complex background. 2010 IEEE. scaling and other differences which cause matching difficult. This paper aims to find a scene matching algorithm
	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. 收藏 \| 浏览/下载：28/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.
	An image matching algorithm based on sub-block coding (EI CONFERENCE) 会议论文 OAI收割 2nd International Workshop on Computer Science and Engineering, WCSE 2009, October 28, 2009 - October 30, 2009, Qingdao, China 作者: Li S. 收藏 \| 浏览/下载：50/0 \| 提交时间：2013/03/25 In order to improve the speed of matching algorithm and simplify the processing of existing sub-block coding matching a new template matching method combined local gray value encoding matching and phase correlation is proposed. Matching process is divided into rough matching and fine matching. Rough matching divides the image into certain size blocks called R-block sums the gray value of each R-block pixel encodes the R-block according to the gray value distribution of R-block with the adjacent R-block and matches by step between the template and each search sub-image. Then fine matching results are obtained using phase correlation according to initial match parameters. The time complexity of the proposed method is (M2) .The new algorithm is faster than traditional algorithm by two orders of magnitude and the speed has improved twice compared with existing sub-block coding method. Experiments demonstrate that the new algorithm is robust to the linear transformation of pixel grey value and image noise and it also has the stability of small-angle rotation. 2009 IEEE.
	A new method for number recognition based on feature extract (EI CONFERENCE) 会议论文 OAI收割 ICO20: Optical Information Processing, August 21, 2005 - August 26, 2005, Changchun, China Zhou H.; Li G.; Xiao C.; Hao Z. 收藏 \| 浏览/下载：39/0 \| 提交时间：2013/03/25 In this paper the authors put forward a new method for print number recognition when we research on the OCR (Optical Character Recognition). It's different from the traditional method such as NN (Neural Networks) recognition or model matching. By this method the number waiting for recognizing was treated as the fingerprint lines then defined and extracted the features about the number for recognition. At end of the paper an experiment result is given.
	The Engine Performance Prediction by Quasi-Steady Method 期刊论文 OAI收割 JOURNAL OF THERMAL SCIENCE, 1995, 卷号: 4, 期号: 1, 页码: 49,53 Ye Ai-Yun; Zhang Yanqin 收藏 \| 浏览/下载：21/0 \| 提交时间：2013/03/13 diesel engine quasi-steady turbocharger matching.