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

Two secret sharing schemes based on Boolean operations

PATTERN RECOGNITION 2007年第10期40卷 2776-2785页

作者： Wang, Daoshun Zhang, Lei Ma, Ning Li, Xiaobo Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Univ Alberta Dept Comp Sci Edmonton AB Canada

Traditional secret sharing schemes involve complex computation. A visual secret sharing (VSS) scheme decodes the secret without computation, but each shadow is m times as big as the original. Probabilistic VSS solved the computation complexity and space complexity problems at once. In this paper we propose a probabilistic (2, n) scheme for binary images and a deterministic (n, n) scheme for grayscale images. Both use simple Boolean operations and both have no pixel expansion. The (2, n) scheme provides a better contrast and significantly smaller recognized areas than other methods. The (n, n) scheme gives an exact reconstruction. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

关键词： secret sharing scheme visual secret sharing visual cryptography computation complexity pixel expansion

来源：评论

学校读者我要写书评

暂无评论

computational Scheme of Ordinary Differential Equations Integration on the Basis of Differential Taylor Transformation with Automatic Step and Order Selection

引用

JOURNAL OF AUTOMATION AND INFORMATION SCIENCES 2012年第12期44卷 12-22页

作者： Rakushev, M. Yu. Natl Aviat Univ Zhitomir SP Korolev Mil Inst Kiev Ukraine

The computational scheme of ordinary differential equations integration with the automatic step size and order selection of the scheme developed on the basis of differential Taylor transformation is offered. The adapt ation at each step of integration is conducted based on providing the desired precision at the minimum computational efforts. The results of simulation are presented.

关键词： ordinary differential equations differential Taylor transformation computation complexity automatic step size and order selection

来源：评论

学校读者我要写书评

暂无评论

Improved square root adaptive cubature Kalman filter

引用

IET SIGNAL PROCESSING 2019年第7期13卷 641-649页

作者： Zhang, Lei Li, Sheng Zhang, Enze Chen, Qingwei Guo, Jian Nanjing Univ Sci & Technol Sch Automat Nanjing 210094 Jiangsu Peoples R China Yangzhou Univ Coll Informat Engn Yangzhou 225009 Jiangsu Peoples R China

In this study, an improved square root adaptive cubature Kalman filter (ISRACKF) is proposed to improve the filter performance in terms of accuracy, computation efficiency, and robustness. Through the evaluated measure of non-linearity value, the cubature rule under different accuracy levels can be adaptively selected in the dynamic process or measurement model. In this way, high accuracy can be maintained without sacrificing computation efficiency. Furthermore, the maximum correntropy criterion cost function can help improve the robustness of ISRACKF. The measure of non-Gaussianity value is utilised to control the computation complexity of the robust iterative process as well. The stability proof of estimated state error and covariance is given. The comparison results of the target tracking problem and integrated navigation system demonstrate the superior performance of the proposed ISRACKF in this study.

关键词： iterative methods computational complexity target tracking adaptive Kalman filters covariance analysis integrated navigation system target tracking problem estimated covariance estimated state error robust iterative process computation complexity nonGaussianity value correntropy criterion cost function cubature rule nonlinearity value ISRACKF improved square root adaptive cubature Kalman filter

来源：评论

学校读者我要写书评

暂无评论

Efficient move blocking strategy for multiple shooting-based non-linear model predictive control

引用

IET CONTROL THEORY AND APPLICATIONS 2020年第2期14卷 343-351页

作者： Chen, Yutao Scarabottolo, Nicolo Bruschetta, Mattia Beghi, Alessandro Eindhoven Univ Technol Dept Elect Engn Eindhoven Netherlands Univ Padua Dept Informat Engn Padua Italy

Move blocking (MB) is a widely used strategy to reduce the degrees of freedom (DoFs) of the optimal control problem (OCP) arising in receding horizon control. The size of the OCP is reduced by forcing the input variables to be constant over multiple discretisation steps. In this study, the authors focus on developing computationally efficient MB schemes for multiple shooting-based non-linear model predictive control (NMPC). The DoFs of the OCP is reduced by introducing MB in the shooting step, resulting in a smaller but sparse OCP. Therefore, the discretisation accuracy and level of sparsity are maintained. A condensing algorithm that exploits the sparsity structure of the OCP is proposed, that allows to reduce the computation complexity of condensing from quadratic to linear in the number of discretisation nodes. As a result, active-set methods with warm-start strategy can be efficiently employed, thus allowing the use of a longer prediction horizon. A detailed comparison between the proposed scheme and the non-uniform grid NMPC is given. Effectiveness of the algorithm in reducing computational burden while maintaining optimisation accuracy and constraints fulfilment is shown by means of simulations with two different problems.

关键词： computational complexity optimisation predictive control optimal control nonlinear control systems efficient move blocking strategy DoFs optimal control problem receding horizon control multiple discretisation steps shooting step discretisation accuracy warm-start strategy prediction horizon nonuniform grid NMPC multiple shooting-based nonlinear model predictive control computation complexity MB schemes

来源：评论

学校读者我要写书评

暂无评论

Symmetric Private Polynomial computation From Lagrange Encoding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2022年第4期68卷 2704-2718页

作者： Zhu, Jinbao Yan, Qifa Tang, Xiaohu Li, Songze Southwest Jiaotong Univ Informat Coding & Transmiss Key Lab Sichuan Prov CSNMT Int Cooperat Res Ctr Most Chengdu 611756 Peoples R China Hong Kong Univ Sci & Technol Thrust Internet Things Guangzhou 511458 Peoples R China

The problem of X-secure T-colluding symmetric Private Polynomial computation (PPC) from coded storage system with B Byzantine and U unresponsive servers is studied in this paper. Specifically, a dataset consisting of M files is stored across N distributed servers according to (N, K + X) Maximum Distance Separable (MDS) codes such that any group of up to X colluding servers can not learn anything about the data files. A user wishes to privately evaluate one out of a set of candidate polynomial functions over the M files from the system, while guaranteeing that any T colluding servers can not learn anything about the identity of the desired function and the user can not learn anything about the M data files more than the desired polynomial function evaluations, in the presence of B Byzantine servers that can send arbitrary responses maliciously to confuse the user and U unresponsive servers that will not respond any information at all. A novel symmetric PPC scheme using Lagrange encoding is proposed. This scheme achieves a PPC rate of 1 - G(K+X-1)+T +2B/N-U with secrecy rate G(K+X-1)+T/N-(G(K+X-1)+T +2B+U) and finite field size N + max{K, N-( G(K+X-1)+ T +2B U)}, where G is the maximum degree over all the candidate polynomial functions. Moreover, to further measure the efficiency of PPC schemes, upload cost, query complexity, server computation complexity and decoding complexity required to implement the scheme are analyzed. Remarkably, the PPC setup studied in this paper generalizes all the previous MDS coded PPC setups and the degraded schemes strictly outperform the best known schemes in terms of (asymptotical) PPC rate, which is the main concern of the PPC schemes.

关键词： Private computation symmetric private polynomial computation Lagrange encoding computation complexity

来源：评论

学校读者我要写书评

暂无评论

FACE CONTOUR EXTRACTION FROM FRONT-VIEW IMAGES

引用

PATTERN RECOGNITION 1995年第8期28卷 1167-1179页

作者： LI, XB ROEDER, N Department of Computing Science University of Alberta Edmonton Alberta T6G 2H1 Canada

Facial feature detection is crucial for visual recognition of human faces. This paper reports on a study in detecting face contours from front-view ID-type pictures. Based on the eye and mouth positions, which can be detected by the algorithms proposed in Ref. 1 [G. Chow and X. Li, Pattern Recognition 26, 1739-1755(1993)], a simplified adaptive Hough transform (AHT) technique is used to identify straight cheek lines which are approximately vertical from the edge image. Independently, parabolas forming the chin are detected by another AHT procedure. The location and curvature of the chin line, together with the cheek lines, characterize the shape of the face. This method was tested on over 70 different face images and is shown to produce results with a high degree of accuracy. We discuss in detail the specific issues involved in the detections, such as the definition of relevant subimage, parameter ranges, resolution of the accumulator array, peak cells, and end point determination.

关键词： FACIAL FEATURE DETECTION ADAPTIVE HOUGH TRANSFORM PARAMETER SPACE SEARCHING computation complexity

来源：评论

学校读者我要写书评

暂无评论

Spectrum sidelobe suppression for discrete Fourier transformation-based orthogonal frequency division multiplexing using adjacent subcarriers correlative coding

引用

IET COMMUNICATIONS 2012年第11期6卷 1374-1381页

作者： Xu, R. Chen, M. Zhang, J. Wu, B. Wang, H. Nanjing Inst Commun Engn Nanjing Jiangsu Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing Jiangsu Peoples R China

The large spectrum sidelobes of orthogonal frequency division multiplexing (OFDM) signal lead to the interference with the licensed user working on the adjacent band in spectrum pooling. The power spectral leakage of discrete Fourier transformation (DFT)-based OFDM systems can be divided into two parts, in-band-out-of-subband (IBOSB) spectral leakage and out-of-band (OOB) spectral leakage. A correlative coding technique is proposed to suppress the IBOSB leakage and redistribute the OOB leakage of DFT-based OFDM signal through the subcarrier coding in the frequency domain with appropriate weighting. The correlation is introduced between adjacent subcarriers and mutual cancellation of the spectrum sidelobes reshapes the spectrum of DFT-based OFDM signal. The optimum weighting factor is obtained through optimisation. Analytical results and simulation show that the proposed coding scheme significantly suppresses the IBOSB leakage in contrast with the common OFDM system and introduces least interference with the licensed user. Furthermore, the carrier-interference ratio (CIR) of OFDM system with correlative coding increases by 3 dB. At the same time, maximum likelihood sequence detection (MLSD) can mostly compensate the bit error rate (BER) degradation caused by error propagation at the expense of introducing a little computation complexity.

关键词： discrete Fourier transforms MLSD spectrum pooling adjacent subcarriers correlative coding DFT-based OFDM systems Optimisation techniques error statistics CIR spectrum sidelobe suppression frequency domain Codes maximum likelihood detection IBOSB leakage orthogonal frequency division multiplexing signal OOB leakage optimisation maximum likelihood sequence detection OFDM modulation codes error propagation Signal detection discrete Fourier transformation computation complexity out-of-band spectral leakage frequency-domain analysis maximum likelihood sequence estimation Integral transforms computational complexity BER in-band-out-of-subband spectral leakage power spectral leakage bit error rate degradation licensed user carrier-interference ratio optimum weighting factor Other topics in statistics

来源：评论

学校读者我要写书评

暂无评论

An efficient group key agreement protocol for secure P2P communication

引用

SECURITY AND COMMUNICATION NETWORKS 2016年第17期9卷 3952-3965页

作者： Vijayakumar, Pandi Naresh, Ramu Deborah, Lazarus Jegatha Islam, Sk Hafizul Univ Coll Engn Tindivanam Dept Comp Sci & Engn Melpakkam 604001 Tamil Nadu India Birla Inst Technol & Sci Dept Comp Sci & Informat Syst Pilani Campus Pilani 333031 Rajasthan India

The efficient design of a distributed group key management for a peer to peer (P2P) network with minimal computation complexity in dynamic secure group communication is a challenging issue. This is because of the absence of a centralized coordinator. In order to provide this facility, a self-composed distributed group key management framework is proposed for secure P2P communication. In this proposed work, group key computation is performed using Chinese remainder theorem and secure communication is performed through RSA encryption algorithm. This self-composed key management is a one round protocol in which a shared group key is generated using the public key of each individual user, and it is derived from the respective private key. The main advantage of the group key management scheme proposed in this paper is that it reduces the computation complexity of the peer users to O(1). This reduction in computation complexity is achieved by performing one addition and multiplication operation during a single member join and one subtraction operation during a single member leave operation. The proposed algorithm has been implemented and analyzed with well-known existing distributed group key management protocols and observed that it reduces the computation complexity significantly. Copyright (C) 2016 John Wiley & Sons, Ltd.

关键词： Chinese remainder theorem computation complexity one round protocol peer to peer network storage complexity

来源：评论

学校读者我要写书评

暂无评论

Invisible and Steganalysis-Resistant Deep Image Hiding Based on One-Way Adversarial Invertible Networks

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2024年第7期34卷 6128-6143页

作者： Hu, Xinjue Fu, Zhangjie Zhang, Xiang Chen, Yanyu Nanjing Univ Informat Sci & Technol Engn Res Ctr Digital Forens Minist Educ Nanjing 210044 Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China

Deep image hiding is a challenging image processing task that aims to hide a secret image into a cover image of equal size perfectly. How to improve the imperceptibility of deep image hiding while ensuring high computational efficiency is a primary challenge. Where imperceptibility means not being visually perceived while not being perceived by the steganalysis model. In this paper, we propose a novel deep image hiding framework called DIH-OAIN (Deep Image Hiding based on One-way Adversarial Invertible Networks) to address it. Firstly, an image cascade framework is introduced to extract image semantics and details with dual-resolution branches, and reduces computation complexity by balancing image resolution and model complexity. Secondly, a hidden probability guided module is designed to constrain the secret image to be hidden in the texture region, utilizing the image texture complexity as prior knowledge. The above two points can effectively improve visual imperceptibility. Finally, a one-way adversarial training strategy is proposed to enhance the model imperceptibility. A series of experimental results show that the proposed method is significantly improved in imperceptibility comparing to state-of-the-art deep image hiding algorithms, while maintaining a low computation complexity.

关键词： Visualization Steganography computational modeling Couplings Feature extraction Task analysis Distortion Anti-steganalysis ability computation complexity deep image hiding invertible neural networks invisibility steganalysis

来源：评论

学校读者我要写书评

暂无评论

Multi-server blind quantum computation protocol with limited classical communication among servers

引用

QUANTUM INFORMATION PROCESSING 2022年第3期21卷 1-13页

作者： Sano, Yuichi Kyoto Univ Dept Nucl Engn Nishikyo Ku Kyoto Kyoto 6158540 Japan

A user who does not have a quantum computer but wants to perform quantum computations may delegate his/her computation to a quantum cloud server. For users securely using the service, it must be assured that no malicious server can access any vital information about the computation. The blind protocol was proposed as a mechanism for users to secure their information from unauthorized actions of the server. Among the blind protocols proposed thus far, a protocol with two servers sharing entanglement does not require any quantum resource from the user but does not allow the servers to interact even after the computation. We propose a protocol in this paper that extends this two-server protocol to multiple servers and is secure even if some servers communicate with each other after the computation. Dummy gates and a circuit modeled after brickwork states play a crucial role in the new protocol.

关键词： Quantum computation Quantum blind computing computation complexity Quantum application

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：