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

A fast algorithm for color image enhancement with total variation regularization

Science China(Information Sciences) 2010年第9期53卷 1913-1916页

作者： LI Ming1,2 1School of computer Science and Technology,Huazhong University of Science and Technology,Wuhan 430074,China 2key laboratory of Education Ministry for image processing and intelligent Control,Wuhan 430074,China 1. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China2. Key Laboratory of Education Ministry for Image Processing and Intelligent Control Wuhan 430074 China

In this paper,a novel algorithm for color image enhancement is *** proposed method,which is based on Retinex theory and total variational framework,improves the original variational method by using a TV penalty term to force spatial smoothness on the reflectance *** split Bregman algorithm is employed to solve the proposed *** practical experiments,it is verified that our method obtains better enhancement performance and much better calculation efficiency.

关键词： color image enhancement Retinex theory total variational model split Bregman algorithm

来源：评论

学校读者我要写书评

暂无评论

An efficient and effective automatic image annotation using positive and negative example images

引用

ICIC Express Letters 2011年第8 B期5卷 2927-2932页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Bao, Cuizhu Dong, Yuying Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University No. 2699 Qianjin Avenue Changchun 130012 China Institute of Computer Graphics and Image Processing Dalian Nationalities University No. 18 Liaohe Road Eco. and Tech. Dev. Zone Dalian 116600 China College of Computer Science and Engineering Dalian Nationalities University No. 18 Liaohe Road Eco. and Tech. Dev. Zone Dalian 116600 China College of Life Science Dalian Nationalities University No. 18 Liaohe Road Eco. and Tech. Dev. Zone Dalian 116600 China

Automatic image annotation is an active topic and difficult task in computer vision domain, which has attracted more and more researchers' attention. Many approaches have been proposed to automatically annotate images. To improve the annotation quality, most of them have profound principlessophisticated modelsand high time complexities. How to efficiently annotate image is becoming one key issue in the field of computer vision. We propose a very efficient and effective approach called keyword vector classification approach, whose model is very simple. Experiments on Corel5K dataset show that the annotation performance of the our proposed approach is almost four times better than translation model and twice better than CMRM (in terms of precision, recall and F1) while the time cost of ours surprisingly decreases. In addition, to our knowledge, our proposed approach outperforms most of existing ones in terms of N+. © 2011 ISSN 1881-803X.

关键词： image retrieval

来源：评论

学校读者我要写书评

暂无评论

Block-based normalized-cut algorithm for image segmentation

Block-based normalized-cut algorithm for image segmentation

引用

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Chen, Jingrun Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Institute of Computer Graphics and Image Processing Dalian Nationalities University Dalian China State Key Laboratory of CAD and CG Zhejiang University Hangzhou China

ISBN: (纸本)9783642051722

Automatic image segmentation remains a challenging problem in the fields of computer vision, image analysis and understanding. A lot of algorithms and technologies have been proposed and developed for image segmentation, among which the N-cut has been a promising method and active research area due to better quality. But the N-cut can't process medium and large image dataset online due to incredible memory and time complexity. Moreover, the N-cut algorithm can't utilize texture information since its basic unit of clustering algorithm is pixel. To overcome the drawback and improve the description power, the paper proposes a block-based N-cut algorithm for image segmentation, whose basic unit of clustering is image block instead of individual pixel. Block-based algorithm not only decreases the time and storage complexity, but also improves the discrimination power of visual feature vector. The experiments demonstrate that proposed algorithm outperform the original N-cut algorithm in efficiency. Experiments show that the proposed block-based N-cut algorithm is more suitable for online processing large-scale data. © 2010 Springer-Verlag Berlin Heidelberg.

关键词： image segmentation

来源：评论

学校读者我要写书评

暂无评论

Extraction of human body skeleton based on silhouette images

Extraction of human body skeleton based on silhouette images

引用

2nd International Workshop on Education Technology and computer Science, ETCS 2010

作者： Ding, Jianhao Wang, Yigang Yu, Lingyun State Key Laboratory of CAD and CG Zhejiang University Hangzhou China Institute of Computer Graphics and Image Processing Hangzhou Dianzi University Hangzhou China Department of Mathematics and Computing Science University of Groningen Netherlands

ISBN: (纸本)9780769539874

Skeleton extraction is essential for general shape representation. A typical skeletonization algorithm should obtain the ability to preserve original object's topological and hierarchical properties. However, most of current methods are high memory cost, computationally intensive, and also require complex data structures. In this paper, we propose an efficient and accurate skeletonization method for the skeleton feature points extracted from human body based on silhouette images. First, the gradient of distance transform is used to detect critical points inside the foreground. Then, we converge and simplify critical points in order to generate the most important and elegant skeleton feature points. Finally, we present an algorithm which connects the skeleton feature points and estimates the position of skeleton joints. © 2010 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

引用

2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

作者： Zhang, Zhujin Wang, Shuo Zhang, Xingyi Zhang, Zheng Department of Control Science and Engineering Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan 430074 China School of Computer and Information Science University of South Australia Adelaide SA 5095 Australia Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China

ISBN: (纸本)9781424464388

Randí et al. proposed a significant graphical representation for DNA sequences, which is very compact and avoids loss of information. In this paper, we build a fast algorithm for this graphical representation with time complexity O(n2), and find another important advantage in the representation: no degeneracy. Moreover, we propose a new method to do similarity analysis of DNA sequences based on the representation. The approach adopts four elements of covariance matrix as a descriptor, and is illustrated on the first exon of beta-globin genes from 11 different species. © 2010 IEEE.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

Virtual housing design experience platform

Virtual housing design experience platform

引用

International Conference on Multimedia Technology

作者： Dai, Dameng Ding, Jianhao Wang, Yigang College of Physics and Electronic Information and Engineering Wenzhou University Wenzhou China Institute of Computer Graphics and Image Processing Hangzhou Dianzi University Hangzhou China State Key Laboratory of CAD and CG Zhejiang University Hangzhou China

ISBN: (纸本)9781424478743

Traditional display fashions of housing design mainly depend on static pictures, which are short of the intuition of house space and do not support interaction during design periods. This paper proposes a virtual housing design experience platform consist of a cheap hardware VR environment and housing design software system we developed. With this design platform, a fast generating virtual house permits intuitive and precise interaction in the VR environment. Customers can modify the design of their home and have a pseudo experience of their virtual house in real time. The system will give advice on layout design, providing a complete and precise house space representation and the support for real time visualization. ©2010 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Algorithm for elliptic curve diffie-hellman key exchange based on DNA tile self-assembly

Algorithm for elliptic curve diffie-hellman key exchange bas...

引用

作者： Cheng, Zhen Huang, Yufang Chen, Zhihua Shi, Xiaolong Xu, Jin Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology 430074 Wuhan China School of Electronics Engineering and Computer Science Peking University 100871 Beijing China

DNA tile self-assembly is a promising paradigm for nanotechnology. Recently, many researches show that computation by DNA tile self-assembly maybe scalable. In this paper, we propose the algorithm for elliptic curve Diffie-Hellman key exchange based on DNA tile self-assembly. First we give the DNA tile self-assembly model to compute the scalar multiplication, then we can successfully implement the Diffie-Hellman key exchange over elliptic curve by extracting the result strand of the scalar multiplication. Copyright © 2010 American Scientific Publishers. All rights reserved.

关键词： Self assembly

来源：评论

学校读者我要写书评

暂无评论

Algorithmic tile assembly for solution of the maximum clique problem

Algorithmic tile assembly for solution of the maximum clique...

引用

作者： Huang, Yufang Xu, Jin Cheng, Zhen Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 Hubei China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

The maximum clique problem has diverse applications in the field of pattern recognition, computer vision, information processing etc. The connection between self-assembly and computation has implied that the tile assembly can perform arithmetical computation. Approaches to algorithmic self- assembly require the use of DNA nanostructures, called tiles, which have efficient computational power, and convenient input and output mechanisms. We present a theoretical tile assembly model for the maximum clique problem. We take some transformation to the maximum clique problem and convert it into the 0-1 programming problem. By use of the huge parallelism inherent in the arithmetic tile assembly, it outputs a reporter strand which includes the solution to the problem. It is proved that this method can be extended to the maximum independent set problem and 0-1 programming problem. The arithmetic tile assembly model proposed here can give the answer by use of 0(2n2 + 2mn+ 12n) tile types in time linear with the input size. Copyright © 2010 American Scientific Publishers. All right resered.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A uniform solution to subset sum by tissue P systems with cell separation

A uniform solution to subset sum by tissue P systems with ce...

引用

作者： Jiang, Yun Zhang, Xingyi Zhang, Zheng Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 Hubei China School of Computer Science and Technology Anhui University Hefei 230601 Anhui China

Membrane systems, also called P systems, are biologically inspired theoretical models of distributed and parallel computing. Tissue P system with cell separation is a computing model in the frame work of membrane computing based on the intercellular communication and cooperation between neurons. Tissue P systems with cell separation have the ability to create an exponential space in a linear time, and can be used to solve computationally hard problems by a space-time trade-off. A polynomial-time solution to the NP-complete problem Subset Sum via a family of such devices is present in this paper. Further research topics and open problems are discussed too. Copyright © 2010 American Scientific Publishers. All right reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Spectral representation of DNA sequences and its application

Spectral representation of DNA sequences and its application

引用

2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

作者： Zhang, Zhujin Liu, Lin Li, Jiuyong Zhang, Zheng Department of Control Science and Engineering Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan 430074 China School of Computer and Information Science University of South Australia Adelaide SA 5095 Australia

ISBN: (纸本)9781424464388

Randí;et al. proposed a famous spectral graphical representation of DNA sequences, and claimed that it avoids loss of information. In this paper we build two mathematical models for this graphical representation and prove that the claim is correct, and that it also avoids degeneracy. Moreover, we propose a new method to do similarity analysis of DNA sequences based on the spectral representation. The method adopts M value to characterize a graphical representation and uses 24-component vector as descriptor. The approach is illustrated on the complete coding sequence of beta-globin genes from 7 different species. © 2010 IEEE.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：