{"title":"Transanal Total Mesorectal Excision and Fluorescence Ureteral Navigation for En Bloc Resection of Rectal Cancer With Pelvic Abscess.","authors":"Shunjin Ryu, Keisuke Goto, Takahiro Kitagawa, Atsushi Nagashima, Takehiro Kobayashi, Junichi Shimada, Ryusuke Ito, Yukio Nakabayashi","doi":"10.1097/DCR.0000000000002905","DOIUrl":"10.1097/DCR.0000000000002905","url":null,"abstract":"","PeriodicalId":54514,"journal":{"name":"Radioengineering","volume":"24 1","pages":"e5-e6"},"PeriodicalIF":3.9,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88349806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
. This paper presents a new multi-bit pulse latch design that places innovative emphasis on the integration of scan input for automatic test pattern generation (ATPG). Two different designs have been developed in ONK65 technology (65 nm process): the first with standard threshold voltage (SVT) tailored for consumer products and the second with high threshold voltage (HVT) for automotive, each addressing specific aspects of process, voltage, and temperature (PVT). Multi-bit pulse latches offer a more efficient alternative to multi-bit flip-flop circuits and promise significant power and area savings. However, the efficiency of these latches depends on the technology, library type and customer requirements. A multi-bit pulse latch consists of a pulse generator and a pulsed latch. Each component is carefully designed for its specific purpose and the most appropriate topology is selected. Furthermore, the paper serves as a comprehensive guide to the design of low-power digital cells. It rethinks the topology design approach by emphasizing the scan input and presents simulation results for both components of the multi-bit pulse latch, highlighting their advantages. The results show that a less strict PVT offers greater benefits than a strict PVT.
{"title":"Design of Multi-bit Pulsed Latches with Scan Input in CMOS ONK65 Technology","authors":"V. Kral","doi":"10.13164/re.2023.0557","DOIUrl":"https://doi.org/10.13164/re.2023.0557","url":null,"abstract":". This paper presents a new multi-bit pulse latch design that places innovative emphasis on the integration of scan input for automatic test pattern generation (ATPG). Two different designs have been developed in ONK65 technology (65 nm process): the first with standard threshold voltage (SVT) tailored for consumer products and the second with high threshold voltage (HVT) for automotive, each addressing specific aspects of process, voltage, and temperature (PVT). Multi-bit pulse latches offer a more efficient alternative to multi-bit flip-flop circuits and promise significant power and area savings. However, the efficiency of these latches depends on the technology, library type and customer requirements. A multi-bit pulse latch consists of a pulse generator and a pulsed latch. Each component is carefully designed for its specific purpose and the most appropriate topology is selected. Furthermore, the paper serves as a comprehensive guide to the design of low-power digital cells. It rethinks the topology design approach by emphasizing the scan input and presents simulation results for both components of the multi-bit pulse latch, highlighting their advantages. The results show that a less strict PVT offers greater benefits than a strict PVT.","PeriodicalId":54514,"journal":{"name":"Radioengineering","volume":"215 S705","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138621100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
. Non-orthogonal multiple access technique (NOMA) is based on the principle of sharing the same physical resource, over several power levels, where user’s signals are transmitted by using the superposition-coding scheme at the transmitter and these users signals are de-coded by the receiver by means of successive interference cancellation technique (SIC). In this work, performance of NOMA Downlink network under Rayleigh fading distribution is studied, in the power domain where a power beacon (PB) is used to help a base station (BS) to serve distant users, by Wireless Power Transfer (WPT). The harvested energy permits by the BS, supports information signal transmission to NOMA users. This concept can be an effective way to power Internet of Things (IoT) devices, reduce battery dependency, and promote energy sustainability and may be used in SWIPT systems and vehicular networks. To improve the key performance indicators of the system expressed by the outage performance of NOMA users and system throughput, a Multi-Objective Grey Wolf Optimizer algorithm (MOGWO) is used to find optimal values of several influencing parameters. These parameters are partition time expressing the harvesting energy time, the power conversion factor and power allocation coefficients
{"title":"Optimization of NOMA Downlink Network Parameters under Harvesting Energy Strategy Using Multi-Objective GWO","authors":"F. Titel, M. Belattar","doi":"10.13164/re.2023.0492","DOIUrl":"https://doi.org/10.13164/re.2023.0492","url":null,"abstract":". Non-orthogonal multiple access technique (NOMA) is based on the principle of sharing the same physical resource, over several power levels, where user’s signals are transmitted by using the superposition-coding scheme at the transmitter and these users signals are de-coded by the receiver by means of successive interference cancellation technique (SIC). In this work, performance of NOMA Downlink network under Rayleigh fading distribution is studied, in the power domain where a power beacon (PB) is used to help a base station (BS) to serve distant users, by Wireless Power Transfer (WPT). The harvested energy permits by the BS, supports information signal transmission to NOMA users. This concept can be an effective way to power Internet of Things (IoT) devices, reduce battery dependency, and promote energy sustainability and may be used in SWIPT systems and vehicular networks. To improve the key performance indicators of the system expressed by the outage performance of NOMA users and system throughput, a Multi-Objective Grey Wolf Optimizer algorithm (MOGWO) is used to find optimal values of several influencing parameters. These parameters are partition time expressing the harvesting energy time, the power conversion factor and power allocation coefficients","PeriodicalId":54514,"journal":{"name":"Radioengineering","volume":" 14","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138619878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
. This paper introduces two novel emulator circuits that employ a single active block. The first circuit utilizes a Voltage Differencing Transconductance Amplifier (VDTA) to emulate the behavior of a floating/grounded incremental/decremental flux-controlled meminductor. The second circuit, based on a Voltage Differencing Current Conveyor (VDCC), emulates the characteristics of mem-capacitance. Both emulation circuits are constructed using capacitors as the only type of grounded passive element. Notably, these circuits possess electronic tunability, enabling control over the realized inverse meminduct-ance/memcapacitance. The theoretical analysis of the proposed emulators includes an investigation into potential non-idealities and parasitic effects. By carefully selecting the passive circuit elements, efforts were made to minimize the impact of these unwanted effects. In comparison to existing designs documented in the literature, the proposed circuits demonstrate remarkable simplicity. Additionally, they exhibit wide frequency operability (up to 50 MHz) and successfully pass the non-volatility test. Simulation results conducted using 0.18 μm CMOS technology and a ±0.9 V supply voltage align closely with the theoretical predictions. Furthermore, Monte Carlo simulations and corner analysis are employed to evaluate the circuit's robustness. To validate the feasibility of the proposed solution, experimental tests are performed using commercially available components.
{"title":"Single Active Block-Based Emulators for Electronically Controllable Floating Meminductors and Memcapacitors","authors":"M. Tatović, P. B. Petrovic","doi":"10.13164/re.2023.0568","DOIUrl":"https://doi.org/10.13164/re.2023.0568","url":null,"abstract":". This paper introduces two novel emulator circuits that employ a single active block. The first circuit utilizes a Voltage Differencing Transconductance Amplifier (VDTA) to emulate the behavior of a floating/grounded incremental/decremental flux-controlled meminductor. The second circuit, based on a Voltage Differencing Current Conveyor (VDCC), emulates the characteristics of mem-capacitance. Both emulation circuits are constructed using capacitors as the only type of grounded passive element. Notably, these circuits possess electronic tunability, enabling control over the realized inverse meminduct-ance/memcapacitance. The theoretical analysis of the proposed emulators includes an investigation into potential non-idealities and parasitic effects. By carefully selecting the passive circuit elements, efforts were made to minimize the impact of these unwanted effects. In comparison to existing designs documented in the literature, the proposed circuits demonstrate remarkable simplicity. Additionally, they exhibit wide frequency operability (up to 50 MHz) and successfully pass the non-volatility test. Simulation results conducted using 0.18 μm CMOS technology and a ±0.9 V supply voltage align closely with the theoretical predictions. Furthermore, Monte Carlo simulations and corner analysis are employed to evaluate the circuit's robustness. To validate the feasibility of the proposed solution, experimental tests are performed using commercially available components.","PeriodicalId":54514,"journal":{"name":"Radioengineering","volume":"115 25","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138608574","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
. The network services present diversity as the continuous evolution of communication scenarios, which brings a great challenge to the efficient utilization of resources. The ALOHA access mechanism is considered as an effective solution to deal with multi services for its feature of shared bandwidth. However, the collision problem of ALOHA degrades the quality of service ( QoS ) seriously. The multi packet reception ( MPR ) technology could mitigate collision and improve network performance. Considering ALOHA mechanism with MPR capability, we pro-pose a novel random access scheme for aggregate traffic based on deep fusion of supermartingale and improved sparrow search algorithm ( SSA ) to provide delay QoS guarantee. Firstly, we construct a complicated queuing model with heterogeneous arrivals and ALOHA-type service. Secondly, we derive the tighter delay-violation probability bound relying on supermartingale theory, and the optimization problem is constructed with the goal of minimizing the service rate and the constraint of supermartin-gale bound. Finally, we improve the SSA by combining Circle chaotic map, nonlinear inertia weight and Lévy flight strategy, then the scheme is designed by applying the improved SSA and supermartingale constraint. Simulation results show that the proposed algorithm has faster convergence speed and the scheme is more bandwidth-saving.
{"title":"A Random Access Scheme for Aggregate Traffic Based on Deep Fusion of Supermartingale and Improved SSA","authors":"H. L. Sun, Z. H. Liao, W. D. Shen","doi":"10.13164/re.2023.0625","DOIUrl":"https://doi.org/10.13164/re.2023.0625","url":null,"abstract":". The network services present diversity as the continuous evolution of communication scenarios, which brings a great challenge to the efficient utilization of resources. The ALOHA access mechanism is considered as an effective solution to deal with multi services for its feature of shared bandwidth. However, the collision problem of ALOHA degrades the quality of service ( QoS ) seriously. The multi packet reception ( MPR ) technology could mitigate collision and improve network performance. Considering ALOHA mechanism with MPR capability, we pro-pose a novel random access scheme for aggregate traffic based on deep fusion of supermartingale and improved sparrow search algorithm ( SSA ) to provide delay QoS guarantee. Firstly, we construct a complicated queuing model with heterogeneous arrivals and ALOHA-type service. Secondly, we derive the tighter delay-violation probability bound relying on supermartingale theory, and the optimization problem is constructed with the goal of minimizing the service rate and the constraint of supermartin-gale bound. Finally, we improve the SSA by combining Circle chaotic map, nonlinear inertia weight and Lévy flight strategy, then the scheme is designed by applying the improved SSA and supermartingale constraint. Simulation results show that the proposed algorithm has faster convergence speed and the scheme is more bandwidth-saving.","PeriodicalId":54514,"journal":{"name":"Radioengineering","volume":" 34","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138614823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
. In compressive sensing theory, the measurement matrix plays a crucial role in compressive observation of sparse signals. The bipolar Toeplitz measurement matrix constructed based on chaotic map has advantages such as generating fewer free elements and supporting fast algorithms, making it widely used. While optimizing the measurement matrix can effectively improve its compressive sensing reconstruction performance, existing optimization algorithms are not suitable for the bipolar Toeplitz measurement matrix due to its structural and bipolar properties. To address this issue, this paper proposes an optimization method for the bipolar Toeplitz measurement matrix based on cosine-exponential (CE) chaotic map sequences and an improved Abolghasemi algorithm. Using an enhanced CE chaotic map to generate chaotic sequences with greater chaos and randomness, we construct the measurement matrix and optimize it using the structure matrix and the improved Abolghasemi algorithm, which preserves the matrix's bipolarity without altering its structure. We also introduce constraints on the generated sequence values during the optimization process. Through simulation experiments, the effectiveness of our optimization algorithm is verified, as the optimized bipolar Toeplitz measurement matrix significantly reduces reconstruction error and improves reconstruction probability.
{"title":"Optimization of Bipolar Toeplitz Measurement Matrix Based on Cosine-Exponential Chaotic Map and Improved Abolghasemi Algorithm","authors":"S. Meng, C. Meng, C. Wang, Q. Wang","doi":"10.13164/re.2023.0583","DOIUrl":"https://doi.org/10.13164/re.2023.0583","url":null,"abstract":". In compressive sensing theory, the measurement matrix plays a crucial role in compressive observation of sparse signals. The bipolar Toeplitz measurement matrix constructed based on chaotic map has advantages such as generating fewer free elements and supporting fast algorithms, making it widely used. While optimizing the measurement matrix can effectively improve its compressive sensing reconstruction performance, existing optimization algorithms are not suitable for the bipolar Toeplitz measurement matrix due to its structural and bipolar properties. To address this issue, this paper proposes an optimization method for the bipolar Toeplitz measurement matrix based on cosine-exponential (CE) chaotic map sequences and an improved Abolghasemi algorithm. Using an enhanced CE chaotic map to generate chaotic sequences with greater chaos and randomness, we construct the measurement matrix and optimize it using the structure matrix and the improved Abolghasemi algorithm, which preserves the matrix's bipolarity without altering its structure. We also introduce constraints on the generated sequence values during the optimization process. Through simulation experiments, the effectiveness of our optimization algorithm is verified, as the optimized bipolar Toeplitz measurement matrix significantly reduces reconstruction error and improves reconstruction probability.","PeriodicalId":54514,"journal":{"name":"Radioengineering","volume":"311 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138626042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rending Lu, Hayder Natiq, A. M. A. Ali, H. Abdolmohammadi, S. Jafari
. The synchronization of dynamical systems has been extensively studied across various scientific disciplines, including secure communication, providing insights into the collective behavior of complex systems. This paper investigated the synchronization of diffusively coupled dissipative Nosé-Hoover (DNH) systems analytically and experimentally. This system exhibits a variety of fascinating dynamical phenomena, including multistable or monostable chaotic solutions and attractive torus. The DNH circuit is implemented in OrCAD–PSpice, focusing on chaotic dynamics. The DNH system is thus said to be diffusively coupled by considering a passive resistor to link the corresponding states of two DNH circuits. The coupling scheme and strength (re-sistor value) under which two circuits can be synchronized are attained using the master stability function method and are then confirmed by computing the synchronization error. The correlation of coupled circuits’ outputs (time evolutions) demonstrates complete synchronization, which is consistent with the analytical and experimental results.
{"title":"Synchronization of Dissipative Nose–Hoover Systems: Circuit Implementation","authors":"Rending Lu, Hayder Natiq, A. M. A. Ali, H. Abdolmohammadi, S. Jafari","doi":"10.13164/re.2023.0511","DOIUrl":"https://doi.org/10.13164/re.2023.0511","url":null,"abstract":". The synchronization of dynamical systems has been extensively studied across various scientific disciplines, including secure communication, providing insights into the collective behavior of complex systems. This paper investigated the synchronization of diffusively coupled dissipative Nosé-Hoover (DNH) systems analytically and experimentally. This system exhibits a variety of fascinating dynamical phenomena, including multistable or monostable chaotic solutions and attractive torus. The DNH circuit is implemented in OrCAD–PSpice, focusing on chaotic dynamics. The DNH system is thus said to be diffusively coupled by considering a passive resistor to link the corresponding states of two DNH circuits. The coupling scheme and strength (re-sistor value) under which two circuits can be synchronized are attained using the master stability function method and are then confirmed by computing the synchronization error. The correlation of coupled circuits’ outputs (time evolutions) demonstrates complete synchronization, which is consistent with the analytical and experimental results.","PeriodicalId":54514,"journal":{"name":"Radioengineering","volume":"140 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138622305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
. Energy is seen as a significant factor in wireless sensor networks (WSNs). It is a challenge to balance be-tween battery lifetime of the different sensors and network lifetime. The main contribution of the proposed approach is to decrease the energy consumption of each sensor node, overcome unbalanced energy usage among sensor nodes, reduce the data gathering time and enhance the network life-time. To achieve these goals, we combine the Hierarchical Agglomerative algorithm and an optimal path selection method. First, the suitable cluster heads (CHs) are elected based on the Euclidean distance and the residual energy of each sensor node. Then, the base station is situated at the center of the field, which will be partitioned into equal sub-areas, one for every mobile data collector (MDC). Second, the Kruskal algorithm is used to create an optimal data gathering path from each subset of elected cluster heads. Finally, each mobile data collector travels the optimal path to collect the data from the set of cluster heads of each subarea and returns periodically to the base station to upload gathered data. Computer simulation proves that the proposed approach outperforms existing ones in terms of data gathering time, residual energy and network lifetime.
{"title":"Energy-Efficient Path Construction for Data Gathering Using Mobile Data Collectors in Wireless Sensor Networks","authors":"W. Jlassi, R. Haddad, R. Bouallegue","doi":"10.13164/re.2023.0502","DOIUrl":"https://doi.org/10.13164/re.2023.0502","url":null,"abstract":". Energy is seen as a significant factor in wireless sensor networks (WSNs). It is a challenge to balance be-tween battery lifetime of the different sensors and network lifetime. The main contribution of the proposed approach is to decrease the energy consumption of each sensor node, overcome unbalanced energy usage among sensor nodes, reduce the data gathering time and enhance the network life-time. To achieve these goals, we combine the Hierarchical Agglomerative algorithm and an optimal path selection method. First, the suitable cluster heads (CHs) are elected based on the Euclidean distance and the residual energy of each sensor node. Then, the base station is situated at the center of the field, which will be partitioned into equal sub-areas, one for every mobile data collector (MDC). Second, the Kruskal algorithm is used to create an optimal data gathering path from each subset of elected cluster heads. Finally, each mobile data collector travels the optimal path to collect the data from the set of cluster heads of each subarea and returns periodically to the base station to upload gathered data. Computer simulation proves that the proposed approach outperforms existing ones in terms of data gathering time, residual energy and network lifetime.","PeriodicalId":54514,"journal":{"name":"Radioengineering","volume":" 9","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138618807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
. To address the challenges of increasing complexity and larger number of training samples required for high-accuracy spectrum prediction, we propose a novel lightweight model, leveraging a temporal convolutional network (TCN) and knowledge distillation. First, the prediction accuracy of TCN is enhanced via a self-transfer method. Then, we design a two-branch network which can extract the spectrum features efficiently. By employing knowledge distillation, we transfer the knowledge from TCN to the two-branch network, resulting in improved accuracy for spectrum prediction of the lightweight network. Experimental results show that the proposed model can improve accuracy by 19.5% compared to the widely-used LSTM model with sufficient historical data and reduces 71.1% parameters to be trained. Furthermore, the prediction accuracy is improved by 17.9% compared to Gated Recurrent Units (GRU) in the scenarios with scarce historical data.
{"title":"Lightweight Spectrum Prediction Based on Knowledge Distillation","authors":"R. Cheng, J. Zhang, J. Deng, Y. Zhu","doi":"10.13164/re.2023.0469","DOIUrl":"https://doi.org/10.13164/re.2023.0469","url":null,"abstract":". To address the challenges of increasing complexity and larger number of training samples required for high-accuracy spectrum prediction, we propose a novel lightweight model, leveraging a temporal convolutional network (TCN) and knowledge distillation. First, the prediction accuracy of TCN is enhanced via a self-transfer method. Then, we design a two-branch network which can extract the spectrum features efficiently. By employing knowledge distillation, we transfer the knowledge from TCN to the two-branch network, resulting in improved accuracy for spectrum prediction of the lightweight network. Experimental results show that the proposed model can improve accuracy by 19.5% compared to the widely-used LSTM model with sufficient historical data and reduces 71.1% parameters to be trained. Furthermore, the prediction accuracy is improved by 17.9% compared to Gated Recurrent Units (GRU) in the scenarios with scarce historical data.","PeriodicalId":54514,"journal":{"name":"Radioengineering","volume":"37 S165","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138622936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
. Coverless image steganography typically extracts feature sequences from cover images to map information. Once the extracted features have high similarity, it is challenging to construct a complete mapping sequence set, which places a heavy burden on the underlying storage and computation. In order to improve database utilization while increasing the data-hiding capacity, we propose a coverless steganography model based on low-similarity feature selection in the DCT domain. A mapping algorithm is presented based on an 8000-dimensional feature termed CS-DCTR extracted from each image to convert into binary sequences. The high feature dimension leads to a high capacity, ranging from 8 to 25 bits per image. Furthermore, scrambling is employed for feature mapping before building an inverted index tree, considerably enhancing security against steganal-ysis. Experimental results show that CS-DCTR features exhibit high diversity, averaging 49.3% complete mapping sequences, which indicates lower similarity among CS-DCTR features. The technique also demonstrates resistance to normal operations and benign attacks. The information extraction accuracy rises to 96.7% on average under typical noise attacks. Moreover, our technique achieves excellent performance in terms of hiding capacity, image utilization, and transmission security.
{"title":"Coverless Steganography Based on Low Similarity Feature Selection in DCT Domain","authors":"L. Tan, J. Liu, Y. Zhou, R. Chen","doi":"10.13164/re.2023.0603","DOIUrl":"https://doi.org/10.13164/re.2023.0603","url":null,"abstract":". Coverless image steganography typically extracts feature sequences from cover images to map information. Once the extracted features have high similarity, it is challenging to construct a complete mapping sequence set, which places a heavy burden on the underlying storage and computation. In order to improve database utilization while increasing the data-hiding capacity, we propose a coverless steganography model based on low-similarity feature selection in the DCT domain. A mapping algorithm is presented based on an 8000-dimensional feature termed CS-DCTR extracted from each image to convert into binary sequences. The high feature dimension leads to a high capacity, ranging from 8 to 25 bits per image. Furthermore, scrambling is employed for feature mapping before building an inverted index tree, considerably enhancing security against steganal-ysis. Experimental results show that CS-DCTR features exhibit high diversity, averaging 49.3% complete mapping sequences, which indicates lower similarity among CS-DCTR features. The technique also demonstrates resistance to normal operations and benign attacks. The information extraction accuracy rises to 96.7% on average under typical noise attacks. Moreover, our technique achieves excellent performance in terms of hiding capacity, image utilization, and transmission security.","PeriodicalId":54514,"journal":{"name":"Radioengineering","volume":"107 41","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138607916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：