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

4th International Symposium on Precision Mechanical Measurements

作者： Wang, Lei Gao, Jun Eckstein, Johannes Ott, Peter Dept. of Mechanical and Electrical Engineering Xiamen University Xiamen 361005 China Lab. of Image Information Processing School of Computer and Information Hefei University of Technology Hefei 230009 China Optical Engineering Lab. Heilbronn University Heilbronn 74081 Germany

As one kind of anamorphic laser triangulation displacement sensor, rotationally symmetric triangulation (RST) has a lot of advantages comparing to traditional ones. Laser speckle and CCD noise are also two fundamental uncertainty factors in this kind of sensors. The analytic expression of centroid uncertainty limit from speckle in RST sensor is derived in this paper. It is shown that the uncertainty limit in RST, and also in anamorphic triangulation, is dependent on the solid angle subtended by entrance pupil as seen from the illuminated laser spot, as well as the laser wavelength. Because it's very easy to get a bigger entrance pupil in RST than in traditional laser triangulation, the centroid uncertainty limit from speckle in RST is much smaller. The CCD noise in RST and anamorphic laser triangulation is dependent on photon shot noise, dark current, photo-response non-uniformity, and cross talk. The centroid uncertainty limit from CCD noise in this case is described by 1-D Cramer-Rao lower bound, and is also smaller than in traditional triangulation. By using more CCD pixels, RST is less sensitive to noise level. Results of simulation and experiments verify the result of deriving. © 2008 SPIE.

关键词： Speckle

来源：评论

学校读者我要写书评

暂无评论

Approaches to image retrieval using fuzzy set theory

Approaches to image retrieval using fuzzy set theory

引用

2008 IEEE International Conference Neural Networks and signal processing, ICNNSP

作者： Li, Yang Xuelong, Hu Jun, Pan School of Information Engineering Yangzhou University Yangzhou Jiangsu 225009 China Jiangsu Province Key Lab. for Image Processing and Image Communication Nanjing University of Posts and Communications Nanjing Jiangsu 210003 China Jiangsu Prov. Key Lab. for Computer Information Processing Technology Suzhou University Suzhou Jiangsu 215006 China

ISBN: (纸本)9781424423118

This paper mainly presents two approaches for image retrieval. There is some faintness in color locating in quantification boundary when image color is quantized. The membership function in fuzzy set theory can describe the fuzzy transition preferably. In this paper, the membership function in HSI color space is adopted to solve the problem above. At the same time, spatial information is integrated with color feature to describe the image content more truly. Due to the importance of texture feature, gray concurrence matrix is extracted. In the second part of this paper, retrieval scheme combining four image feature descriptors is presented, and then follows Fuzzy Hamming Distance (FHD) which is used as a fuzzy similarity measure. We have performed an experiment on a 1000 images database and our results show higher retrieval accuracy. © 2008 IEEE.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

Modelling with relational calculus of object and component systems - RCOS

Modelling with relational calculus of object and component s...

引用

作者： Chen, Zhenbang Hannousse, Abdel Hakim Van Hung, Dang Knoll, Istvan Li, Xiaoshan Liu, Zhiming Liu, Yang Nan, Qu Okika, Joseph C. Ravn, Anders P. Stolz, Volker Yang, Lu Zhan, Naijun International Institute for Software Technology United Nations University China Faculty of Science and Technology University of Macau Department of Computer Science Aalborg University Denmark Lab. of Computer Science Institute of Software CAS China National Laboratory for Parallel and Distributed Processing China

ISBN: (纸本)3540852883

This chapter presents a formalization of functional and behavioural requirements, and a refinement of requirements to a design for CoCoME using the Relational Calculus of Object and Component Systems (rCOS). We give a model of requirements based on an abstraction of the use cases described in Chapter 3.2. Then the refinement calculus of rCOS is used to derive design models corresponding to the top level designs of Chapter 3.4. We demonstrate how rCOS supports modelling different views and their relationships of the system and the separation of concerns in the development. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

GEMI: A high performance and high flexibility memory interface architecture for complex embedded SOC

GEMI: A high performance and high flexibility memory interfa...

引用

International Conference on computer Science and Software Engineering, CSSE 2008

作者： Hualong, Zhao Hongshi, Sang Tianxu, Zhang Yebin, Fan State Key Lab. for Multi-spectral Information Processing Technologies 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: (纸本)9780769533360

Two of the most significant factors in the success of today's system-on-chip (SoC) designs are the ability to deliver efficient access to off-chip high speed memory and the ability to be compatible with several different interface-timings of several different sorts of memories. And the scheduling scheme of data streams for multi-master and multi-outstanding requests situation in complex SoC should be considered carefully, too. This paper introduces a novel general external memory interface (GEMI) architecture for the high performance and high flexibility memory interface. Several techniques and methods, i.e. data and command buffers based on asynchronous FIFO, optimized bank management, multi-port access scheduler, request reorder unit, are proposed in this paper for fulfilling the requirements mentioned above. Some techniques are specially proposed for data streams scheduling in complex SoC. At the end of the paper, the simulation and tape-out results are provided. The whole implementation of architecture is proven to be not only functional and efficient, but also flexible and reusable by simulation and silicon verification. © 2008 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Automatic sign language recognition: Vision based feature extraction and probabilistic recognition scheme from multiple cues 08

Automatic sign language recognition: Vision based feature ex...

引用

1st International Conference on Pervasive Technologies Related to Assistive Environments, PETRA 2008

作者： Caridakis, George Diamanti, Olga Karpouzis, Kostas Maragos, Petros Image Video and Multimedia Systems Lab. National Technical University of Athens Iroon Polytexneiou 9 15780 Athens Greece Computer Vision Speech Communication and Signal Processing Group National Technical University of Athens Iroon Polytexneiou 9 15780 Athens Greece

ISBN: (纸本)9781605580678

This work focuses on two of the research problems comprising automatic sign language recognition, namely robust computer vision techniques for consistent hand detection and tracking, while preserving the hand shape contour which is useful for extraction of features related to the handshape and a novel classification scheme incorporating Self-organizing maps, Markov chains and Hidden Markov Models. Geodesic Active Contours enhanced with skin color and motion information are employed for the hand detection and the extraction of the hand silhouette, while features extracted describe hand trajectory, region and shape. Extracted features are used as input to separate classifiers, forming a robust and adaptive architecture whose main contribution is the optimal utilization of the neighboring characteristic of the SOM during the decoding stage of the Markov chain, representing the sign class. Copyright 2008 ACM.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Video object matching based on sift algorithm

Video object matching based on sift algorithm

引用

2008 IEEE International Conference Neural Networks and signal processing, ICNNSP

作者： Xuelong, Hu Yingcheng, Tang Zhenghua, Zhang School of Information Engineering Yangzhou University Yangzhou Jiangsu 225009 China Jiangsu Prov. Key Lab for Image Processing and Image Communication Nanjing University of Posts and Communications Nanjing Jiangsu 210003 China Jiangsu Prov. Key Lab. for Computer Information Processing Technology Suzhou University Suzhou Jiangsu 215006 China

ISBN: (纸本)9781424423118

SIFT (Scale Invariant Feature Transform) is used to solve visual tracking problem, where the appearances of the tracked object and scene background change during tracking. The implementation of this algorithm has five major stages: scale-space extrema detection;keypoint localization;orientation assignment;keypoint descriptor;keypoint matching. From the beginning frame, object is selected as the template, its SIFT features are computed. Then in the following frames, the SIFT features are computed. Euclidean distance between the object's SIFT features and the frames' SIFT features can be used to compute the accurate position of the matched object. The experimental results on real video sequences demonstrate the effectiveness of this approach and show this algorithm is of higher robustness and real-time performance. It can solve the matching problem with translation, rotation and affine distortion between images. It plays an important role in video object tracking and video object retrieval. © 2008 IEEE.

关键词： Tracking (position)

来源：评论

学校读者我要写书评

暂无评论

SAR image despeckling based on edge detection and nonsubsampled second generation bandelets

引用

Journal of Systems Engineering and Electronics 2009年第3期000卷

作者： Zhang Wenge Liu Fang Jiao Licheng Gao Xinbo School of Computer Science and Technology Xidian Univ. Xi'an 710071 P. R. China Key Lab. of Intelligent Perception and Image Understanding of Ministry of Education of China Xi'an 710071 P. R. China Key Lab. of Intelligent Perception and Image Understanding of Ministry of Education of China Xi'an 710071 P. R. China Inst. of Intelligent Information Processing Xidian Univ. Xi'an 710071 P. R. China

To preserve the sharp features and details of the synthetic aperture radar (SAR) image effectively when despeckling, a despeckling algorithm with edge detection in nonsubsampled second generation bandelet transform (NSBT) domain is proposed. First, the Canny operator is utilized to detect and remove edges from the SAR image. Then the NSBT which has an optimal approximation to the edges of images and a hard thresholding rule are used to approximate the details while despeckling the edge-removed image. Finally, the removed edges are added to the reconstructed image. As the edges are detected and protected, and the NSBT is used, the proposed algorithm reaches the state-of-the-art effect which realizes both despeckling and preserving edges and details simultaneously. Experimental results show that both the subjective visual effect and the mainly objective performance indexes of the proposed algorithm outperform that of both Bayesian wavelet shrinkage with edge detection and Bayesian least square-Ganssian scale mixture (BLS-GSM).

关键词： computer image processing synthetic aperture radar speckle edge detection nonsubsampled secondgeneration bandelet transform Canny operator threshold shrinkage

来源：评论

学校读者我要写书评

暂无评论

A cascaded linear model for joint Chinese word segmentation and part-of-speech tagging

A cascaded linear model for joint Chinese word segmentation ...

引用

46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT

作者： Jiang, Wenbin Huang, Liang Liu, Qun Lü, Yajuan Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Department of Computer and Information Science Levine Hall University of Pennsylvania 3330 Walnut Street Philadelphia PA 19104 United States

ISBN: (纸本)9781932432046

We propose a cascaded linear model for joint Chinese word segmentation and partof- speech tagging. With a character-based perceptron as the core, combined with realvalued features such as language models, the cascaded model is able to efficiently utilize knowledge sources that are inconvenient to incorporate into the perceptron directly. Experiments show that the cascaded model achieves improved accuracies on both segmentation only and joint segmentation and part-of-speech tagging. On the Penn Chinese Treebank 5.0, we obtain an error reduction of 18.5% on segmentation and 12% on joint segmentation and part-of-speech tagging over the perceptron-only baseline. © 2008 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Forest-based translation

Forest-based translation

引用

46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT

作者： Mi, Haitao Huang, Liang Liu, Qun Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Department of Computer and Information Science Levine Hall University of Pennsylvania 3330 Walnut Street Philadelphia PA 19104 United States

ISBN: (纸本)9781932432046

Among syntax-based translation models, the tree-based approach, which takes as input a parse tree of the source sentence, is a promising direction being faster and simpler than its string-based counterpart. However, current tree-based systems suffer from a major drawback: they only use the 1-best parse to direct the translation, which potentially introduces translation mistakes due to parsing errors. We propose a forest-based approach that translates a packed forest of exponentially many parses, which encodes many more alternatives than standard n-best lists. Large-scale experiments show an absolute improvement of 1.7 BLEU points over the 1-best baseline. This result is also 0.8 points higher than decoding with 30-best parses, and takes even less time. © 2008 Association for Computational Linguistics.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Forest-based translation rule extraction

Forest-based translation rule extraction

引用

2008 Conference on Empirical Methods in Natural Language processing, EMNLP 2008, Co-located with AMTA 2008 and the International Workshop on Spoken Language Translation

作者： Mi, Haitao Huang, Liang Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Dept. of Computer and Information Science University of Pennsylvania Levine Hall 3330 Walnut St. Philadelphia PA 19104 United States

Translation rule extraction is a fundamental problem in machine translation, especially for linguistically syntax-based systems that need parse trees from either or both sides of the bitext. The current dominant practice only uses 1-best trees, which adversely affects the rule set quality due to parsing errors. So we propose a novel approach which extracts rules from a packed forest that compactly encodes exponentially many parses. Experiments show that this method improves translation quality by over 1 BLEU point on a state-of-the-art tree-to-string system, and is 0.5 points better than (and twice as fast as) extracting on 30- best parses. When combined with our previous work on forest-based decoding, it achieves a 2.5 BLEU points improvement over the baseline, and even outperforms the hierarchical system of Hiero by 0.7 points. © 2008 Association for Computational Linguistics.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：