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

International Colloquium on Signal Processing & Its Applications, CSPA

作者： S. Keerativittayanun T. Kondo P. Sira-uksorn T. Phatrapornant M. Sato Sirindhorn Institute of Technology Thammasat University Pathum Thani Thailand Embedded System Technology Laboratory National Electronics and Computer Technology Center Pathum Thani Thailand Precision and Intelligence Laboratory Tokyo Institute of Technology Yokohama Japan

Colour structured light with spatial neighbourhood is one of the famous techniques that are used to acquire 3D information. By projecting the pattern onto the targeted object and taking the image, the structured light is measured as coded words and the corresponding points could be found. Finally, the process to reconstruct 3D information could be solved using the principle of triangulation. A major group of this technique, normally, limited to the opaque and single neutral color surfaces. However, with shiny and several neutral colors, one structured light pattern would not enough to get the correct segmentation and right decoding label. This paper aims to solve the incorrectness by adding the patterns into surface object. The selective pattern is based on De Bruijn Hybrid pattern from Pages and Salvi et al. The results have shown that the proposed method got more accuracy when compare to one shot pattern.

关键词： Image color analysis Three dimensional displays Surface treatment Pixel Image reconstruction Encoding Surface reconstruction

来源：评论

学校读者我要写书评

暂无评论

Knowledge Granulation in Interval-Valued Information systems

Knowledge Granulation in Interval-Valued Information Systems

引用

International Workshop on Intelligent systems and Applications, ISA

作者： Nan Zhang Duoqian Miao Can Gao Department of Computer Science and Technology University of Tongji Shanghai China Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada Key Laboratory of Embedded System and Service Computing of Ministry of Education University of Tongji Shanghai China

Rough set theory, proposed by Pawlak, has been proved to be a mathematical tool to deal with vagueness and uncertainty in intelligent information processing. In this paper, we propose the concept of knowledge granulation in interval-valued information systems, and discuss some important properties. From these properties, it can be shown that the proposed knowledge granulation provides important approaches to measuring the discernibility of different knowledge. It may be helpful for rule evaluation and knowledge discovery in interval-valued information systems.

关键词： Information systems Approximation methods Uncertainty Rough sets computers Entropy

来源：评论

学校读者我要写书评

暂无评论

PSO based memetic algorithm for face recognition Gabor filters selection

PSO based memetic algorithm for face recognition Gabor filte...

引用

IEEE Workshop on Memetic Computing (MC)

作者： Jiarui Zhou Zhen Ji Linlin Shen Zexuan Zhu Siping Chen Shenzhen City Key Laboratory of Embedded System Design College of Computer Science and Software Engineering Shenzhen University Shenzhen China College of Biomedical Engineering and Instrument Science University of Zhejiang Hangzhou China

A Gabor filters based face recognition algorithm named POMA-Gabor is proposed in this paper. The algorithm uses particular Gabor wavelets in the feature extraction on specific areas of the face image and a particle swarm optimization (PSO) based memetic algorithm (POMA), which combines comprehensive learning particle swarm optimizer (CLPSO) global search and self-adaptive intelligent single particle optimizer (AdpISPO) local search, is introduced to select the Gabor filter parameters. The experimental results demonstrate that POMA obtains better performance than other comparative PSO algorithms. Employing POMA for Gabor filter design, POMA-Gabor is capable of obtaining more representative information and higher recognition rate with less computational time.

关键词： Algorithm design and analysis Face recognition Feature extraction Optimization Face Equations Databases

来源：评论

学校读者我要写书评

暂无评论

3D data acquisition using active stereo based on spatial neighbourhood technique

3D data acquisition using active stereo based on spatial nei...

引用

International Conference on Electrical Engineering/Electronics, computer, Telecommunications and Information Technology, ECTI-CON

作者： S. Keerativittayanun T. Kondo P. Sira-uksorn T. Phatrapornant M. Sato School of ICT Sirindhorn Institute of Technology Thammasat University Pathum Thani Thailand Embedded System Technology Laboratory National Electronics and Computer Technology Center Pathum Thani Thailand Precision and Intelligence Laboratory Tokyo Institute of Technology Yokohama Japan

Active stereo using spatial neighbourhood of a structured light pattern is a well-known technique for acquiring 3D information of an object or scene. By projecting a pattern onto a targeted object and taking the image, the structured light is measured as coded words and the corresponding points between a pair of stereo images can be found. Finally, the 3D structure of the object is reconstructed using the principle of triangulation. Most existing techniques require a large number of colors in order to get a large number of stripes and avoid repeated coded words. However, the limitation of a DLP projector and a camera that produce incorrect colors, so called the crosstalk problem, may become a drawback. An incorrect codeword may occur and cause the problem on codification process. This paper aims to reduce the number of colors to minimize the crosstalk effect while generating a maximum number of stripes using the De Bruijn Hybrid pattern. By selecting the suitable colors and intensities that clearly match to projector and camera used, 3D information can be acquired. Dynamic and static objects were tested with peak-based, edge based strategies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SelectCast: Scalable data aggregation scheme in wireless sensor networks

SelectCast: Scalable data aggregation scheme in wireless sen...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Cheng Wang Shaojie Tang Xiang-Yang Li Changjun Jiang Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA TNLIST School of Software Tsinghua University China

In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SLH) scheme and multiple-hop-length (MLH) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MLH scheme, for a practically important set of symmetric functions called perfectly compressible functions, including the mean, max, or various kinds of indicator functions, etc., the data from Θ(n) sensors can be aggregated to the sink at the throughput of a constant order Θ(1), implying that our MLH scheme is indeed scalable.

关键词： TV Wireless sensor networks Power capacitors Blogs Lattices

来源：评论

学校读者我要写书评

暂无评论

Verification of web service protocols by logic of knowledge

引用

Journal of Information and Computational Science 2011年第6期8卷 921-932页

作者： Chen, Qingliang Su, Kaile Cao, Ying Liu, Chanjuan School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200000 China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia

Web services is a popular distributed systems technology and its effectiveness and efficiency rely badly on the underlying protocols. And web service protocols are designed in XML formats so the message structures within are quite different from the conventional ones. Therefore, the well-established formal verification techniques for conventional protocols, which have gained substantial achievements in practice, cannot be applied directly to them because of the inherently different syntax. In this paper, we propose a justification-oriented and automatic formal approach to verify, in the standard Dolev-Yao model, concerned security properties expressed as epistemic notions, i. e., logic of knowledge, for web service protocols, based on a fault-preserving mapping tool called SuD (SOAP under Dolev-Yao). Our approach is significant because, instead of finding flaws in finite number of protocol sessions, the specifications we are to verify can hold in arbitrary number of sessions. © 2011 Binary Information Press.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets

Extracting all minimal siphons from maximal unmarked siphons...

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： ShouGuang Wang MengChu Zhou ChengYing Wang College of Information & Electronic Engineering Zhejiang Gongshang University Hangzhou China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA MoE Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Deadlock control is an important research issue in automated manufacturing systems that have a high degree of resource sharing and concurrency. Since minimal siphons are closely tied with deadlocks in Petri net models, their efficient extraction is fundamentally important. The existing methods can rapidly extract one minimal siphon given a maximal unmarked siphon that is obtained by using a mixed integer programming approach. This paper for the first time presents an extraction algorithm that can efficiently extract all minimal ones. The idea is based on the generation and use of a subnet tree structure given the places in a maximal unmarked siphon. Several Petri net models of automated manufacturing systems are used to illustrate the proposed concepts and methods.

关键词： system recovery Algorithm design and analysis Petri nets Educational institutions Manufacturing systems Software algorithms Image edge detection

来源：评论

学校读者我要写书评

暂无评论

Polynomial-time hierarchy of computable reals

引用

Journal of Computational Information systems 2011年第4期7卷 1108-1115页

作者： Chen, Qingliang Su, Kaile Wu, Lijun Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Key Laboratory of High Confidence Software Technologies Ministry of Education Peking University Beijing China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia School of Computer Science and Engineering University of Electronic Science and Technology Chengdu 610054 China

In mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these representations lead to the same class of "computable real numbers". However, when subrecursive (such as primitive recursive) is taken into account, these representations can lead to different notions of "computable real numbers". This paper will look into the polynomial-time version of the problem for computable real numbers under different representations. We will summarize the known results to exhibit the comprehensive hierarchy they form. Our goal is to clarify systematically how the polynomial-time computability depends on the representations of the real numbers. Copyright © 2011 Binary Information Press.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Memetic figure selection for cluster expansion in binary alloy systems

Memetic figure selection for cluster expansion in binary all...

引用

IEEE Workshop on Memetic Computing (MC)

作者： Zexuan Zhu Zhen Ji Xiaofeng Fan Jer-Lai Kuo Shenzhen City Key Laboratory of Embedded System Design College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Physical and Mathematical Sciences Nanyang Technological University Singapore Institute of Atomic and Molecular Sciences Academia Sinica Taipei Taiwan

Cluster expansion provides a powerful tool in materials modeling. It has enabled an efficient prediction of the atomic properties of materials with the combination of the modern quantum calculation theory. To construct an accurate cluster expansion model, a few important cluster figures should be identified. This paper proposes a novel figure selection method based on memetic algorithm (MA), which is a synergy of genetic algorithm (GA) and orthogonal matching pursuit (OMP) based memetic operation. The memetic operation is designed to fine-tunes the solutions of GA and accelerate the convergence of the search. The performance of the proposed method is evaluated on two binary alloy datasets. Comparative study to other state-of-the-art figure selection methods demonstrates that the proposed method is capable of obtaining better or competitive prediction accuracy and searching the figure space efficiently.

关键词： Memetics Genetic algorithms Gallium Biological cells Matching pursuit algorithms

来源：评论

学校读者我要写书评

暂无评论

Construction-and-extraction based index for images retrieval

IEEJ Transactions on Electronics, Information and Systems

引用

IEEJ Transactions on Electronics, Information and systems 2011年第7期131卷 1377-1383页

作者： Zhang, Junqi Ni, Lina Tian, Chunqi Gao, Shangce Tang, Zheng Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 200092 China College of Info Sci and Engi Shandong University of Science and Technology Qingdao 266510 China Department of Intellectual Information Systems Engineering University of Toyama Toyama-shi 930-8555 Japan

The past recent years have witnessed more and more applications on image retrieval. As searching a large image database is often costly, to improve the efficiency, high dimensional indexes may help. This paper proposes an adaptive hybrid index (AHI) supported by a construction-and-extraction technique to support image retrieval. First, the image clusters are further partitioned into sub-clusters to reduce the overlap between clusters and indexed into an iDistance index. Then, the query sampling statistically extracts some sub-cluster from the iDistance index into a sequential file. Finally, the users' queries are accurately returned by searching both the iDistance index and the sequential file. It's proved that the proposed AHI never performs worse than the sequential scan. Particularly, the experimental results demonstrate that the proposed index AHI is beneficial and achieves better performance than some exiting methods. It is about 2 times faster than iDistance, almost three times than Omni-sequential, more than four times faster than sequential file and more than 10 times faster than M-tree on the benchmark images set. The effect of the proposed AHI is also investigated by our implemented content based images retrieval system. © 2011 The Institute of Electrical Engineers of Japan.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：