检索结果-内蒙古大学图书馆

2011 International Conference on Electric Information and Control Engineering, ICEICE 2011

作者： Zhang, Jing Sang, Hongshi Shen, Xubang National Key Laboratory of Science and Technology on Multi-Spectral Information Processing Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781424480395

SIFT (Scale Invariant Feature Transform) is one of most popular approach for feature detection and matching. Many parallelized algorithms have been proposed to accelerate SIFT to apply into real-time systems. This paper divides the researches into three different categories, that is, optimizing parallel algorithms based on general purpose multi-core processors, designing customized multi-core processor dedicated for SIFT and implementing SIFT based FPGA (Field Programmable Gate Arrays). Overview of the three type researches and analysis of task-level parallelism are presented in this paper. © 2011 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

An effective document image deblurring algorithm

An effective document image deblurring algorithm

引用

作者： Chen, Xiaogang He, Xiangjian Yang, Jie Wu, Qiang Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China Centre for Innovation in IT Services and Applications University of Technology Sydney Australia Key Laboratory of System Control and Information Processing Ministry of Education China

ISBN: (纸本)9781457703942

Deblurring camera-based document image is an important task in digital document processing, since it can improve both the accuracy of optical character recognition systems and the visual quality of document images. Traditional deblurring algorithms have been proposed to work for natural-scene images. However the natural-scene images are not consistent with document images. In this paper, the distinct characteristics of document images are investigated. We propose a content-aware prior for document image deblurring. It is based on document image foreground segmentation. Besides, an upper-bound constraint combined with total variation based method is proposed to suppress the rings in the deblurred image. Comparing with the traditional general purpose deblurring methods, the proposed deblurring algorithm can produce more pleasing results on document images. Encouraging experimental results demonstrate the efficacy of the proposed method. © 2011 IEEE.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Research on large-scale scene infrared simulation based on image classification

Research on large-scale scene infrared simulation based on i...

引用

International Workshop on Multi-Platform/Multi-Sensor Remote Sensing and Mapping

作者： Zou, Lamei Zhang, Tianxu Lv, Wei Ao, Guoqing Institute for Pattern Recognition and Artificial Intelligence Natl. Key Laboratory of Science and Technology on Multi-spectral Information Processing Technologies Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781424494040

Vega has been widely used in Virtual Reality (VR) field. Vega infrared (IR) module can implement IR simulation, but Vega IR imaging simulation's general approach does not apply to large-scale scene's infrared simulation problem. This article deeps into large-scale scene IR image simulation through Vega infrared module based on visible image, the scene's corresponding Digital Elevation Model (DEM) data and targets' 3D model. A real time large-scale IR simulation system is successfully designed and realized in this paper. At the aspect of image classification, a coarse to fine k-means clustering method based on the consistency of image color is proposed. The proposed automatic texture material mapping method based on the development of Vega TMM tool provides a fast and convenient way for large-scale scene's IR simulation based on Vega IR module. And finally, results of the large-scale scene infrared simulation show the effectiveness of this method. ©2011 IEEE.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

A novel approach to edge detection of color image based on quaternion fractional directional differentiation

A novel approach to edge detection of color image based on q...

引用

2011 International Conference on Automation and Robotics, ICAR 2011

作者： Gao, Chaobang Zhou, Jiliu Lang, Fangnian Pu, Qiang Liu, Chang College of Computer Science and Technology Chengdu University Chengdu 610106 China School of Computer Science Sichuan University Chengdu 610064 China Key Laboratory of Pattern Recognition and Intelligent Information Processing Sichuan Province Chengdu 610106 China

ISBN: (纸本)9783642255526

In this paper, we denote a color image by a quaternion function, then find edge points by solving the maximum of quaternion fractional directional differentiation(QFDD)'s norm. This method is called edge detection based on QFDD. Experiments indicate that the method has special advantages. Comparing with Canny, LOG, Sobel, and general fractional differentiation, we discover that QFDD has fewer false negatives in the textured regions and is also better at detecting edges which are partially defined by texture, which means we will obtain better results in the interesting regions by QFDD and these results are more consistent with the characteristics of human visual system. © 2011 Springer-Verlag.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

Line-based cascade labeling algorithm for hyper-scale issue

Line-based cascade labeling algorithm for hyper-scale issue

引用

2nd International Conference on Multimedia Technology, ICMT 2011

作者： Zhao, Hualong Sang, Hongshi Zhang, Tianxu Fan, Yebin National Key Laboratory of Science and Technology on Multi-spectral Information Processing Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan China Department of Computer Science Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781612847740

A fast and efficient algorithm is presented to label the connected components for binary image, especially for very huge images or any image larger than the available memory. The cascading style scheme compresses the algorithm's workspace to only 2 rows of image, which makes it possible to process any scale image with very low memory requirement. Two techniques are also applied for improving the performance further: the search path compression;the image data prefetching. An extensive comparison with the state-of-art algorithms is proposed, both on random and real datasets. Our algorithm shows an impressive speedup as much as 10X, while the total memory cost is significantly reduced. © 2011 IEEE.

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

Estimating the connection probability for 2-D mesh networks by Monte Carlo methods

Estimating the connection probability for 2-D mesh networks ...

引用

International Conference on Computer and Management

作者： Liang, Meilian Liang, Binmei Shao, Zehui Xu, Xiaodong School of Mathematics and Information Science Guangxi University Nanning 530004 China Key Laboratory of Pattern Recognition and Intelligent Information Processing School of Information Science and Technology Chengdu University Chengdu 610106 China Guangxi Academy of Sciences Nanning 530007 China

ISBN: (纸本)9781424492831

Fault tolerance is a central issue in the design and implementation of interconnection networks for large parallel systems. Connection probability of a network is a good network fault tolerance measure. For a mesh of given size and node failure probability, the gap between the known upper and lower bounds on the connection probability is often very large. In this paper we design algorithms to estimate the connection probability for 2-D meshes by Monte Carlo methods. The experiment is carefully designed and performed, and the simulation results give good estimates of the connection probability for 2-D meshes and can be used to evaluate the known lower and upper bounds on connection probability for 2-D meshes. ©2011 IEEE.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Interactive object segmentation using iterative adjustable graph cut

Interactive object segmentation using iterative adjustable g...

引用

2011 IEEE Visual Communications and Image processing, VCIP 2011

作者： Shi, Ran Liu, Zhi Xue, Yinzhu Zhang, Xiang School of Communication and Information Engineering Shanghai University Shanghai 200072 China Key Laboratory of Advanced Display and System Application Shanghai University Ministry of Education Shanghai 200072 China Institute of Image Processing and Pattern Recognition Shanghai Jiaotong University Shanghai 200240 China

ISBN: (纸本)9781457713200

Interactive object segmentation is widely used for extracting any user-interested objects from natural images. A common problem with many interactive segmentation approaches is that the object segmentation quality is degraded due to inaccurate object/background seeds provided by the user. This paper proposes an iterative adjustable graph cut to efficiently solve this problem. First, object/background seeds are initialized based on the object segmentation result obtained with the user-specified scribbles as the interactive input. Then, an iterative seed adjustment scheme is exploited to correct inaccurate seeds and extract new suitable seeds via graph cut, in which the balancing weight between energy terms are adaptively updated to protect stable seeds and speedup the iteration process. Finally, suitable seeds are obtained and graph cut is used to segment the objects. Experimental results demonstrate the better segmentation performance of our approach even if user provides rather rough seeds. © 2011 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

New lower bounds for two multicolor vertex Folkman numbers

New lower bounds for two multicolor vertex Folkman numbers

引用

International Conference on Computer and Management

作者： Shao, Zehui Liang, Meilian He, Jiandong Xu, Xiaodong School of Information Science and Technology Chengdu University Chengdu 610106 China Key Laboratory of Pattern Recognition and Intelligent Information Processing Sichuan Province China School of Mathematics and Information Science Guangxi University Nanning 530004 China Guangxi Academy of Sciences Nanning 530007 China

For a graph G, G → (a1, a2, · · ·, ar)v means that in every r-coloring of the vertices in G, there exists a monochromatic ai-clique of color i for some i∈{1, 2, · · ·, r}. The vertex Fo... 详细信息

ISBN: (纸本)9781424492831

For a graph G, G → (a1, a2, · · ·, ar)v means that in every r-coloring of the vertices in G, there exists a monochromatic ai-clique of color i for some i∈{1, 2, · · ·, r}. The vertex Folkman number is defined as Fv(a1, a2, ···, ar;k) = min{|V(G)|: G → (a1, a2, ···, ar)v and Kk G}. In general, computing lower and upper bounds for vertex Folkman numbers is difficult. In this note, based on theoretical analysis and computation, we show that Fv(2, 3, 3;4) ≥ 19 and Fv(3, 3, 3;4) ≥ 24, and suggest a cyclic graph of order 91 which may give an upper bound for Fv(3, 3, 3;4). ©2011 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Threshold selection using partial structural similarity

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2011年第7期5卷 397-407页

作者： Lu, Haifeng Zhang, Tianxu Yan, Luxin State Key Laboratory for Multi spectral Information Processing Technologies Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan 430074 China

A novel image threshold selection approach based on structural similarity (SSIM) is proposed. The thresholded image is obtained first, then comparison regions are extracted based on the local variance of the neighborhood of the thresholded image. Due to the characteristic of comparison regions, the conventional SSIM expression is simplified as a nonparametric form, and the partial SSIM (PSSIM) is defined. The optimal threshold is selected by maximizing the PSSIM criterion function at last. Besides the introduction of a novel approach, this is also the first attempt to expand the application scope of SSIM to range image thresholding in general. The proposed approach has an advantage over thresholding methods based on the histogram. The method was tested on a variety of images including the synthetic image and real images. Experimental results show that the proposed approach achieves better applicability, preferable ability for extracting object and better anti-noise capability than popular methods.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A new circle targets extraction method from high resolution remote sensing imagery

A new circle targets extraction method from high resolution ...

引用

International Workshop on Advanced Computational Intelligence (IWACI)

作者： Z. Chen J. G. Liu G. Y. Wang Intelligence Control Institute for Pattern Recognition and Artificial Intelligence and Multi-Spectral Information Processing State Key Laboratory Huazhong University of Science and Technology China Intelligence Control Institute for Pattern Recognition and Artificial Intelligence and Multi-Spectral Information Processing State Key Laboratory Huazhong University of Science and Technology China

According to the drawback of the traditional circle target extraction algorithm from high resolution remote sensing imagery used by Hough Transform, such as computation complexity, low efficiency and etc, a new circle target extraction method is proposed in this paper which can extract multiple circle targets with different radius at one time. First, the Average Absolute Difference is implemented to enhance the edge of the circle targets and suppress the noise of the background. Secondly, the locally self-adaptive segmentation algorithm is implemented to obtain the binary image. Thirdly, the thinning algorithm based on model computation is implanted to obtain the single pixel edge of the circle targets and in order to reduce the computation times in the following process. Furthermore, a pruning algorithm is necessary; finally, a modified Hough transform algorithm is proposed to obtain the circle targets. The experimental results demonstrate that the new circle targets algorithm can extract the multiple circle targets quickly and accurately, which has three advantages: low time consuming, high detection rate, robust to noise and fragmentary boundaries.

关键词： Transforms Image edge detection Noise Skeleton Image segmentation Remote sensing Accuracy

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：