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

Chinese Intelligent Automation Conference (CIAC)

作者： Deng, Changshou Zhao, Bingyan Yang, Yanlin Zhang, Hai Jiujiang Univ Sch Informat Sci & Technol Jiujiang Jiangxi Peoples R China

ISBN: (纸本)9783642384608;9783642384592

Differential Evolution algorithm is a new competitive heuristic optimization algorithm in the continuous field. The operators in the original Differential Evolution are simple;however, these operators make it impossible to use the Differential Evolution in the binary space directly. Based on the analysis of problems led by the mutation operator of the original Differential Evolution in the binary space, a new mutation operator was proposed to enable this optimization technique can be used in binary space. The new mutation operator, which is called semi-probability mutation operator, is a combination of the original mutation operator and a new probability-based defined operator. Initial experimental results of two different combinatorial optimization problems show its effectiveness and validity.

关键词： Combinatorial optimization problem Differential evolution binary encoding Semi-probability mutation operator

来源：评论

学校读者我要写书评

暂无评论

Enhanced accuracy in 3D structured illumination microscopy through binary encoding with accelerated speed using sampling Moiré

引用

OPTICS AND LASERS IN ENGINEERING 2024年 180卷

作者： He, Zhoumiao Zhou, Pei Zhang, Jianwei Zhu, Jiangping Sichuan Univ Coll Comp Sci Chengdu 610065 Peoples R China Sichuan Univ Natl Key Lab Fundamental Sci Synthet Vis Chengdu 610065 Peoples R China

Structured Illumination Microscopy (SIM) is widely recognized as a precise and stable technique for threedimensional inspection. However, efficiently achieving precise results still poses a challenge to be addressed. This research paper presents significant advancements aimed at enhancing the precision and efficiency of the SIM system. We leverage the defocus sensitivity of binary fringes, which yields more accurate height mapping, reducing the error by an outstanding 5% to 20%. Additionally, we introduce a novel technique called sampling Moire (SM) for modulation decoding from a single shot, resulting in a reduction of camera exposure time by (N - 1)/N compared to the N-step phase shift technique and a minimum 20% reduction in error compared to the Fourier transform (FT). These advancements elevate the system's precision and increase efficiency, making SIM an even more powerful tool for high-quality three-dimensional (3D)inspections.

关键词： SIM Fringe modulation binary encoding Sampling Moir & eacute

来源：评论

学校读者我要写书评

暂无评论

Novel binary encoding water cycle algorithm for solving Bayesian network structures learning problem

引用

KNOWLEDGE-BASED SYSTEMS 2018年 150卷 95-110页

作者： Wang, Jingyun Liu, Sanyang Xidian Univ Sch Math & Stat Xian 710126 Shaanxi Peoples R China

Constructing Bayesian network structures from data is a computationally hard task. One important method to learn Bayesian network structures uses the meta-heuristic algorithms. In this paper, a novel binary encoding water cycle algorithm is proposed for the first time to address the Bayesian network structures learning problem. In this study, the sea, rivers and streams correspond to the candidate Bayesian network structures. Since it is a discrete problem to find an optimal structure, the logic operators have been used to calculate the positions of the individuals. Meanwhile, to balance the exploitation and exploration abilities of the algorithm, the ways how rivers and streams flow to the sea and the evaporation process have been designed with the new strategies. Experiments on well-known benchmark networks demonstrate that the proposed algorithm is capable of identifying the optimal or near-optimal structures. In the comparison to the use of the other algorithms, our method performs well and turns out to have the better solution quality. (C) 2018 Published by Elsevier B.V.

关键词： Water cycle algorithm binary encoding Heuristic algorithm Bayesian network Structure learning

来源：评论

学校读者我要写书评

暂无评论

Dynamic Event-Triggered Terminal Sliding Mode Control Under binary encoding: Analysis and Experimental Validation

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2022年第9期69卷 3772-3782页

作者： Song, Jun Wang, Yu-Kun Niu, Yugang Anhui Univ Sch Artificial Intelligence Hefei 230601 Peoples R China East China Univ Sci & Technol Key Lab Smart Mfg Energy Chem Proc Minist Educ Shanghai 200237 Peoples R China

This paper designs a novel nonsingular terminal sliding mode control (TSMC) scheme for a class of nonlinear systems under binary encoding transmission. To further ease the communication overheads between the plant and the controller, a dynamic event-triggered mechanism is also introduced to the TSMC design. Sufficient conditions are proposed, respectively, for guaranteeing the reachability to a practical sliding mode and the ultimate boundedness of the closed-loop system, in which the effects from the binary encoding and the dynamic event-triggered protocol are quantified clearly. The Zeno phenomena for the developed dynamic event-triggered mechanism is excluded via an explicit analysis. Finally, the feasibility and effectiveness of the proposed scheme are demonstrated by a numerical example and a real experiment on permanent magnet synchronous motor speed regulation system.

关键词： encoding Nonlinear dynamical systems Protocols Sliding mode control Convergence Bit rate Manipulator dynamics Terminal sliding mode control binary encoding dynamic event-triggered mechanism permanent magnet synchronous motor

来源：评论

学校读者我要写书评

暂无评论

Hybrid encoding method by assembling the magic-matrix scrambling method and the binary encoding method in image hiding

引用

OPTICS COMMUNICATIONS 2011年第7期284卷 1778-1784页

作者： Lin, Kuang Tsan St Johns Univ Dept Mech & Comp Aided Engn New Taipei City 25135 Taiwan

The magic-matrix scrambling method and the binary encoding method are combined to form a hybrid encoding method for hiding digital covert images. For this hybrid encoding method, a covert image is encoded into a host image to form an overt image. First, the magic-matrix scrambling method is used to rearrange all the pixels of the covert image by using a specified magic matrix modified from a magic square to form a scrambled matrix. Then, all the pixels of the scrambled matrix are denoted by binary data. Finally, the binary data are encoded into the host image to form the overt image. The pixels of the overt image contain nine groups of codes used for decoding the covert image, i.e. identification codes, covert-image dimension codes, scrambling-time codes, magic-square dimension codes, corner codes, shifting codes, arrangement codes. graylevel codes, and information codes. The overt image and the host image look almost the same for eyes. Furthermore, the covert image can be decoded directly from the overt image without using the host image. The most important feature is that the decoded covert image is identical to the original covert image, i.e. there is no distortion in the decoding work. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Magic square Image scrambling binary encoding Magic matrix

来源：评论

学校读者我要写书评

暂无评论

PROOF COMPLEXITY AND THE binary encoding OF COMBINATORIAL PRINCIPLES

引用

SIAM JOURNAL ON COMPUTING 2024年第3期53卷 764-802页

作者： Dantchev, Stefan Galesi, Nicola Ghani, Abdul Martin, Barnaby Univ Durham Dept Comp Sci Durham England Sapienza Univ Roma Dipartimento Ingn Informat Automat & Gest A Rubert Rome Italy

We consider proof complexity in light of the unusual binary encoding of certain combinatorial principles. We contrast this proof complexity with the normal unary encoding in several refutation systems, based on Resolution and Sherali-Adams. We first consider Res(s), which is an extension of Resolution working on s-DNFs (Disjunctive Normal Form formulas). We prove an exponential lower bound of n(Omega(k)/d(s)) for the size of refutations of the binary version of the k-Clique Principle in Res(s), where s = o ((log log n)(1/3)) and d(s) is a doubly exponential function. Our result improves that of Lauria et al., who proved a similar lower bound for Res(1), i.e., Resolution. For the k-Clique and other principles we study, we show how lower bounds in Resolution for the unary version follow from lower bounds in Res(log n) for the binary version, so we start a systematic study of the complexity of proofs in Resolution-based systems for families of contradictions given in the binary encoding. We go on to consider the binary version of the (weak) Pigeonhole Principle Bin-PHPnm. We prove that for any delta, epsilon > 0, Bin-PHPnm requires refutations of size 2(n1-delta) in Res(s) for s = O(log(1/2-epsilon) n). Our lower bound cannot be improved substantially with the same method since for m >= 2(root n) (log) (n) we can prove there are 2(O) ((root n) (log) (n)) size refutations of Bin-PHPnm in Res (log n). This is a consequence of the same upper bound for the unary weak Pigeonhole Principle of Buss and Pitassi. We contrast unary versus binary encoding in the Sherali-Adams (SA) refutation system where we prove lower bounds for both rank and size. For the unary encoding of the Pigeonhole Principle and the Ordering Principle, it is known that linear rank is required for refutations in SA, although both admit refutations of polynomial size. We prove that the binary encoding of the (weak) Pigeonhole Principle Bin-PHPnm requires exponentially sized (in n) SA refutations, whereas th

关键词： propositional proof complexity resolution lift-and-project methods Sherali-Adams binary encoding

来源：评论

学校读者我要写书评

暂无评论

A Joint Transform Correlator Encryption System Based on binary encoding for Grayscale Images

引用

CURRENT OPTICS AND PHOTONICS 2019年第6期3卷 548-554页

作者： Peng, Kaifei Shen, Xueju Huang, Fuyu He, Xuan Army Engn Univ Dept Optoelect Engn Shhiazhuang Campus Shijiazhuang 050003 Hebei Peoples R China

A binary encoding method for grayscale images is proposed to address their unsatisfactory decryption results from joint transform correlator (JTC) encryption systems. The method converts the encryption and decryption of grayscale images into that of binary images, and effectively improves decrypted-image quality. In the simulation, we replaced unencoded grayscale images with their binary encoded counterparts in the JTC encryption and decryption processes, then adopted a median filter to suppress saturation noise while keeping other settings unchanged. Accordingly, decrypted-image quality was clearly enhanced as the correlation coefficient (CC) between a decrypted image and its original rose from 0.8237 to 0.9473 initially, and then further to 0.9937, following the above two steps respectively. Finally, optical experimental results confirmed that the proposed encryption system works correctly.

关键词： Optical communications Optical image encryption Joint transform correlator Grayscale image binary encoding

来源：评论

学校读者我要写书评

暂无评论

Encrypting image by assembling the fractal-image addition method and the binary encoding method

引用

OPTICS COMMUNICATIONS 2012年第9期285卷 2335-2342页

作者： Lin, Kuang Tsan Yeh, Sheng Lih St Johns Univ Dept Mech & Comp Aided Engn New Taipei City 25135 Taiwan Lunghwa Univ Sci & Technol Dept Mech Engn Kueishan Taoyuan County Taiwan

The fractal-image addition method and the binary encoding method are assembled to form a hybrid method for encrypting a digital covert image. For this hybrid method, a host image is used to create an overt image with the information of the covert image. First, the fractal-image addition method is used to add some fractal images and the covert image to form an image-mixing matrix. Then, all the pixel values of the image-mixing matrix are transferred into binary data. Finally, the binary data are encoded into the host image to create an overt image. The pixels of the overt image contain eight groups of codes used for reconstructing the covert image. The eight groups of codes are identification codes, row amount codes, covert-image dimension codes, fractal-image amount codes, starting-pixel codes, character amount codes, character codes, and information codes. The overt image and the host image look almost the same for eyes. Furthermore, the covert image can be directly reconstructed from the overt image without using the host image. The most important feature is that the reconstructed covert image is identical to the original covert image, i.e. there is no distortion in the decoding work. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Image encrypting binary encoding Fractal image

来源：评论

学校读者我要写书评

暂无评论

Improved Detection of Abnormality in Grayscale Breast Thermal Images using binary encoding

Improved Detection of Abnormality in Grayscale Breast Therma...

引用

IEEE International Symposium on Medical Measurements and Applications (MeMeA)

作者： Dey, Ankita Rajan, Sreeraman Dansereau, Richard Carleton Univ Dept Syst & Comp Engn Ottawa ON Canada

ISBN: (纸本)9798350308006;9798350307993

Breast cancer is one of the most frequently diagnosed cancers among women. Thermography is an adjunct tool to mammography that facilitates early abnormality detection. The temperature matrices recorded during thermography are pseudo-colored to form RGB images using user-defined color palettes and these color palettes must be chosen cautiously for accurate abnormality detection. Grayscale breast thermal images linearly mapped from temperature matrices are independent of the choice of user-defined color palettes;however, the absence of distinct gradients of tumors in grayscale breast thermal images deteriorates the performance of abnormality detection. Therefore, this work introduces the concept of gradient enhancement of grayscale breast thermal images using local non-parametric binary encoding transforms, namely, census transform (CT) and local binary pattern (LBP) for enhanced abnormality detection. A comparative analysis of the performance of abnormality detection using different types of features (statistical and textural) with binary encoded breast thermal images as inputs is presented. Breast thermal images encoded using CT achieve higher abnormality detection as compared to breast thermal images encoded using LBP. The proposed methodology achieves a balanced accuracy of 94.26% with CT-transformed breast thermal images which is approximately 6% higher than the balanced accuracy achieved by non-binary encoded grayscale breast thermal images when textural features were employed for abnormality detection. The influence of the number of neighboring pixels of the CT and LBP transforms on the performance of abnormality detection is also investigated.

关键词： Breast cancer asymmetry analysis thermograms binary encoding census transform local binary pattern

来源：评论

学校读者我要写书评

暂无评论

Designing Passive Indoor Distributed Antenna System with Practical Constraints Using binary encoding

Designing Passive Indoor Distributed Antenna System with Pra...

引用

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

作者： Poon, K. F. Shakya, S. Shanqiti, K. M. A. Ouali, A. Sleptchenko, A. Khalifa Univ EBTIC Emirates ICT Innovat Ctr Abu Dhabi U Arab Emirates Khalifa Univ Dept Engn Syst & Management Abu Dhabi U Arab Emirates

ISBN: (纸本)9781728138046

With the continuous increase in data traffic in buildings, there is an increasing demand for good cellular network coverage in indoor environments. Passive In-Building Distributed Antenna System (IB-DAS) has been widely used as a dedicated indoor solution for the required coverage. In IB-DAS, spatially separated antennas are connected to a base station through coaxial cables and splitters. Due to the consideration of many factors such as types of splitters and the solution structure of IB-DAS, many different approaches to produce optimal or near optimal design have been reported in the literature. However, some of them encounter the scalability issue, while others require a dedicated representation of the problem with highly customized operations. In this paper, a general binary tree representation based on Genetic Algorithm (GA) for designing IB-DAS has been devised. The experimental results illustrate that this representation enhances the computational performance and yields lower costs for buildings with higher floors. In addition, it produces neater cabling solutions due to the intrinsic grouping mechanism, which is highly required in practical scenarios.

关键词： binary encoding distributed Antenna System Genetic Algorithm splitters tappers tree representation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：