著者
Saho YAGYU Akie SAKIYAMA Yuichi TANAKA
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E99-A, no.9, pp.1646-1654, 2016-09-01

We propose an edge-preserving multiscale image decomposition method using filters for non-equispaced signals. It is inspired by the domain transform, which is a high-speed edge-preserving smoothing method, and it can be used in many image processing applications. One of the disadvantages of the domain transform is sensitivity to noise. Even though the proposed method is based on non-equispaced filters similar to the domain transform, it is robust to noise since it employs a multiscale decomposition. It uses the Laplacian pyramid scheme to decompose an input signal into the piecewise-smooth components and detail components. We design the filters by using an optimization based on edge-preserving smoothing with a conversion of signal distances and filters taking into account the distances between signal intervals. In addition, we also propose construction methods of filters for non-equispaced signals by using arbitrary continuous filters or graph spectral filters in order that various filters can be accommodated by the proposed method. As expected, we find that, similar to state-of-the-art edge-preserving smoothing techniques, including the domain transform, our approach can be used in many applications. We evaluated its effectiveness in edge-preserving smoothing of noise-free and noisy images, detail enhancement, pencil drawing, and stylization.
著者
Osamu UCHIDA Masafumi KOSUGI Gaku ENDO Takamitsu FUNAYAMA Keisuke UTSU Sachi TAJIMA Makoto TOMITA Yoshitaka KAJITA Yoshiro YAMAMOTO
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E99-A, no.8, pp.1551-1554, 2016-08-01

It is important to collect and spread accurate information quickly during disasters. Therefore, utilizing Twitter at the time of accidents has been gaining attention in recent year. In this paper, we propose a real-time information sharing system during disaster based on the utilization of Twitter. The proposed system consists of two sub-systems, a disaster information tweeting system that automatically attaches user's current geo-location information (address) and the hashtag of the form “#(municipality name) disaster,” and a disaster information mapping system that displays neighboring disaster-related tweets on a map.
著者
KIMURA Shigetomo EBIHARA Yoshihiko
出版者
電子情報通信学会
雑誌
IEICE transactions on fundamentals of electronics, communications and computer sciences (ISSN:09168508)
巻号頁・発行日
vol.E79.A, no.11, pp.1768-1773, 1996-11

Fairness is one of the important notion for programming language, such as process algebras like CCS, that includes con[currency (or parallelism) and nondeterminism. This ensures that while repeatedly choosing among a set of alterna-tives, no alternative will be postponed forever. However, the fairness does not mention at what frequency these alternatives are selected. In this paper, we propose a quantitative fairness,which is called economic-oriented fairness, to each alternatives.This fairness ensures that the expected number of selection for each alternatives are same. We give a condition for probability assignment of selection of each alternative to be satisfied for economic-oriented fairness. First we show a simple probability assignment rule. In this assignment, between any two alternatives,if an alternative is selected TL times and the other m times then the probability to select the former alternative is (m+1)/(n+1) times the probability for the latter. We prove that this assignment satisfies the condition of economic-oriented fairness. For a model of the economic-oriented fairness, we adopt a probabilistic process algebra. Finally, we elaborate with two process models of the economic-oriented fairness. The first one is a server and client model, where each client communicates only with the server, but not among them. In this model, the expected number of communication by each client are equal. The second model considers communication between two processes. In practice, a process has several subprocesses. Each subprocess communicates via a communication port. In the second model, there is economic-oriented fairness where the expected number of communications via each communication port are equal.
著者
Masaki ONUKI Yuichi TANAKA
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E97-A, no.9, pp.1907-1917, 2014-09-01

Decimation and interpolation methods are utilized in image coding for low bit rate image coding. However, the decimation filter (prefilter) and the interpolation filter (postfilter) are irreversible with each other since the prefilter is a wide matrix (a matrix whose number of columns are larger than that of rows) and the postfilter is a tall one (a matrix whose number of rows are larger than that of columns). There will be some distortions in the reconstructed image even without any compression. The method of interpolation-dependent image downsampling (IDID) was used to tackle the problem of producing optimized downsampling images, which led to the optimized prefilter of a given postfilter. We propose integrating the IDID with time-domain lapped transforms (TDLTs) to improve image coding performance.
著者
Ben HACHIMORI Tetsuo SHIBUYA
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E92-A, no.8, pp.1750-1756, 2009-08-01

In this paper, an idea for improvement of suffix array construction using lazy evaluation is presented. Evaluation of the suffix array is based on the searching queries; only the necessary part of the suffix array is built when unevaluated part of the suffix array is referred during the searching process. This is less time consuming than constructing complete suffix array. We propose lazy evaluation of Schürmann-Stoye algorithm. Experimental results show that lazy Schürmann-Stoye algorithm runs faster than Maniscalco, which is well-recognized as the fastest suffix sorting algorithm, under the constraint of small LCP (longest common prefix) and a limited number of searching queries.
著者
Tomotaka WADA Hiroyuki TAKAHASHI Kouichi MUTSUURA Hiromi OKADA
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E95-A, no.1, pp.313-316, 2012-01-01

Many researchers have recently studied various applications such as Inter-Vehicle Communications (IVC) and Road-to-Vehicle Communications (RVC) for Intelligent Transport Systems (ITS). RVC is a key technology that can connect vehicles with the internet through Road Side Units (RSUs). Relative positions between vehicles vary within short periods of time. Neighboring vehicles and barriers cause shadowing that blocks communication for extended periods of time between RSUs and vehicles. We propose a fast scheme of Mobile IPv6 handover using dual-band communications in RVC. This scheme uses ISM and UHF dual bands. It switches to the UHF band during handover or in the shadowing period. We demonstrate that the proposed scheme can establish continuous communications through computer simulations.
著者
TERAMURA Ryoichi ASAKURA Yasuo OHIGASHI Toshihiro KUWAKADO Hidenori MORII Masakatu
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE transactions on fundamentals of electronics, communications and computer sciences (ISSN:09168508)
巻号頁・発行日
vol.93, no.1, pp.164-171, 2010-01-01
被引用文献数
11 9

Conventional efficient key recovery attacks against Wired Equivalent Privacy (WEP) require specific initialization vectors or specific packets. Since it takes much time to collect the packets sufficiently, any active attack should be performed. An Intrusion Detection System (IDS), however, will be able to prevent the attack. Since the attack logs are stored at the servers, it is possible to prevent such an attack. This paper proposes an algorithm for recovering a 104-bit WEP key from any IP packets in a realistic environment. This attack needs about 36, 500 packets with a success probability 0.5, and the complexity of our attack is equivalent to about 2<sup>20</sup> computations of the RC4 key setups. Since our attack is passive, it is difficult for both WEP users and administrators to detect our attack.
著者
Aorui GOU Jingjing LIU Xiaoxiang CHEN Xiaoyang ZENG Yibo FAN
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E107-A, no.1, pp.141-156, 2024-01-01

Convolutional Neural Networks (CNNs) and Transformers have achieved remarkable performance in detection and classification tasks. Nevertheless, their feature extraction cannot consider both local and global information, so the detection and classification performance can be further improved. In addition, more and more deep learning networks are designed as more and more complex, and the amount of computation and storage space required is also significantly increased. This paper proposes a combination of CNN and transformer, and designs a local feature enhancement module and global context modeling module to enhance the cascade network. While the local feature enhancement module increases the range of feature extraction, the global context modeling is used to capture the feature maps' global information. To decrease the model complexity, a shared sublayer is designed to realize the sharing of weight parameters between the adjacent convolutional layers or cross convolutional layers, thereby reducing the number of convolutional weight parameters. Moreover, to effectively improve the detection performance of neural networks without increasing network parameters, the optimal transport assignment approach is proposed to resolve the problem of label assignment. The classification loss and regression loss are the summations of the cost between the demander and supplier. The experiment results demonstrate that the proposed Combination of CNN and Transformer with Shared Sublayer (CCTSS) performs better than the state-of-the-art methods in various datasets and applications.
著者
Serdar BOZTA&Scedil; Ferruh ÖZBUDAK Eda TEK&Idot;N
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E106-A, no.12, pp.1461-1469, 2023-12-01

In this paper we obtain a new method to compute the correlation values of two arbitrary sequences defined by a mapping from F4n to F4. We apply this method to demonstrate that the usual nonbinary maximal length sequences have almost ideal correlation under the canonical complex correlation definition and investigate some decimations giving good cross correlation. The techniques we develop are of independent interest for future investigation of sequence design and related problems, including Boolean functions.
著者
Shuichi FUKUNAGA
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E106.A, no.12, pp.1580-1584, 2023-12-01 (Released:2023-12-01)
参考文献数
14

The robust recursive identification method of ARX models is proposed using the beta divergence. The proposed parameter update law suppresses the effect of outliers using a weight function that is automatically determined by minimizing the beta divergence. A numerical example illustrates the efficacy of the proposed method.
著者
Tsubasa SASAKI Kenji SAWADA Seiichi SHIN Shu HOSOKAWA
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E100-A, no.10, pp.2086-2094, 2017-10-01
被引用文献数
12

This paper aims to propose a Fallback Control System isolated from cyber-attacks against networked control systems. The fallback control system implements maintaining functionality after an incident. Since cyber-attacks tamper with the communication contents of the networked control systems, the fallback control system is installed in a control target side. The fallback control system detects the incident without the communication contents on field network. This system detects an incident based on a bilinear observer and a switched Lyapunov function. When an incident is detected, normal operation is switched to fallback operation automatically. In this paper, a practical experiment with Ball-Sorter simulating a simple defective discriminator as a part of Factory Automation systems is shown. Assumed cyber-attacks against Ball-Sorter are Man In The Middle attack and Denial of Service attack.
著者
Hong LI Wenjun CAO Chen WANG Xinrui ZHU Guisheng LIAO Zhangqing HE
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E106-A, no.10, pp.1311-1321, 2023-10-01

The configurable Ring oscillator Physical unclonable function (CRO PUF) is the newly proposed strong PUF based on classic RO PUF, which can generate exponential Challenge-Response Pairs (CRPs) and has good uniqueness and reliability. However, existing proposals have low hardware utilization and vulnerability to modeling attacks. In this paper, we propose a Novel Configurable Dual State (CDS) PUF with lower overhead and higher resistance to modeling attacks. This structure can be flexibly transformed into RO PUF and TERO PUF in the same topology according to the parity of the Hamming Weight (HW) of the challenge, which can achieve 100% utilization of the inverters and improve the efficiency of hardware utilization. A feedback obfuscation mechanism (FOM) is also proposed, which uses the stable count value of the ring oscillator in the PUF as the updated mask to confuse and hide the original challenge, significantly improving the effect of resisting modeling attacks. The proposed FOM-CDS PUF is analyzed by building a mathematical model and finally implemented on Xilinx Artix-7 FPGA, the test results show that the FOM-CDS PUF can effectively resist several popular modeling attack methods and the prediction accuracy is below 60%. Meanwhile it shows that the FOM-CDS PUF has good performance with uniformity, Bit Error Rate at different temperatures, Bit Error Rate at different voltages and uniqueness of 53.68%, 7.91%, 5.64% and 50.33% respectively.
著者
Hiroshi FUJIWARA Masaya KAWAGUCHI Daiki TAKIZAWA Hiroaki YAMAMOTO
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E106-A, no.9, pp.1100-1110, 2023-09-01

The bin packing problem is a problem of finding an assignment of a sequence of items to a minimum number of bins, each of capacity one. An online algorithm for the bin packing problem is an algorithm that irrevocably assigns each item one by one from the head of the sequence. Gutin, Jensen, and Yeo (2006) considered a version in which all items are only of two different sizes and the online algorithm knows the two possible sizes in advance, and gave an optimal online algorithm for the case when the larger size exceeds 1/2. In this paper we provide an optimal online algorithm for some of the cases when the larger size is at most 1/2, on the basis of a framework that facilitates the design and analysis of algorithms.
著者
Yuya USHIODA Mineo KANEKO
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
pp.2023VLP0020, (Released:2023-09-04)

Adiabatic logic circuits are regarded as one of the most attractive solutions for low-power circuit design. This study is dedicated to optimizing the design of the Two-Level Adiabatic Logic (2LAL) circuit, which boasts a relatively simple structure and superior low-power performance among many asymptotically adiabatic or quasi-adiabatic logic families, but suffers from a large number of timing buffers for “decompute”. Our focus is on the “early decompute” technique for fully pipelined 2LAL, and we propose two ILP approaches for minimizing hardware cost through optimization of early decompute. In the first approach, the problem is formulated as a kind of scheduling problem, while it is reformulated as node selection problem (stable set problem). The performance of the proposed methods are evaluated using several benchmark circuits from ISCAS-85, and the maximum 70 % hardware reduction is observed compared with an existing method.
著者
Hiroki MAYUMI Keigo TAKEUCHI
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E103-A, no.12, pp.1666-1669, 2020-12-01
被引用文献数
1

Expectation propagation (EP) decoding is proposed for sparse superposition coding in orthogonal frequency division multiplexing (OFDM) systems. When a randomized discrete Fourier transform (DFT) dictionary matrix is used, the EP decoding has the same complexity as approximate message-passing (AMP) decoding, which is a low-complexity and powerful decoding algorithm for the additive white Gaussian noise (AWGN) channel. Numerical simulations show that the EP decoding achieves comparable performance to AMP decoding for the AWGN channel. For OFDM systems, on the other hand, the EP decoding is much superior to the AMP decoding while the AMP decoding has an error-floor in high signal-to-noise ratio regime.
著者
Yixuan ZHANG Meiting XUE Huan ZHANG Shubiao LIU Bei ZHAO
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E106-A, no.8, pp.1037-1042, 2023-08-01

Network traffic control and classification have become increasingly dependent on deep packet inspection (DPI) approaches, which are the most precise techniques for intrusion detection and prevention. However, the increasing traffic volumes and link speed exert considerable pressure on DPI techniques to process packets with high performance in restricted available memory. To overcome this problem, we proposed dual cuckoo filter (DCF) as a data structure based on cuckoo filter (CF). The CF can be extended to the parallel mode called parallel Cuckoo Filter (PCF). The proposed data structure employs an extra hash function to obtain two potential indices of entries. The DCF magnifies the superiority of the CF with no additional memory. Moreover, it can be extended to the parallel mode, resulting in a data structure referred to as parallel Dual Cuckoo filter (PDCF). The implementation results show that using the DCF and PDCF as identification tools in a DPI system results in time improvements of up to 2% and 30% over the CF and PCF, respectively.
著者
Di YAO Qifeng ZHANG Qiyan TIAN Hualong DU
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E106-A, no.7, pp.998-1001, 2023-07-01

A super-resolution algorithm is proposed to solve the problem of measuring the thin thickness of oil slick using compressed sensing theory. First, a mathematical model of a single pulse underwater ultrasonic echo is established. Then, the estimation model of the transmit time of flight (TOF) of ultrasonic echo within oil slick is given based on the sparsity of echo signals. At last, the super-resolution TOF value can be obtained by solving the sparse convex optimization problem. Simulations and experiments are conducted to validate the performance of the proposed method.
著者
Koichi SAKAI
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E103-A, no.1, pp.226-230, 2020-01-01
被引用文献数
8

Promoting the use of public transport (PT) is considered to be an effective way to reduce the number of passenger cars. The concept of Mobility-as-a-Service (MaaS), which began in Europe and is now spreading rapidly around the world, is expected to help to improve the convenience of PT on the viewpoint of users, using the latest information communication technology and Internet of Things technologies. This paper outlines the concept of MaaS in Europe and the efforts made at the policy level. It also focuses on the development of MaaS from the viewpoint of promoting the use of PT in Japan.
著者
Shuntaro TAKEKUMA Shun-ichi AZUMA Ryo ARIIZUMI Toru ASAI
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)
巻号頁・発行日
vol.E106-A, no.5, pp.715-720, 2023-05-01

A hopping rover is a robot that can move in low gravity planets by the characteristic motion called the hopping motion. For its autonomous explorations, the so-called SLAM (Simultaneous Localization and Mapping) is a basic function. SLAM is the combination of estimating the position of a robot and creating a map of an unknown environment. Most conventional methods of SLAM are based on odometry to estimate the position of the robot. However, in the case of the hopping rover, the error of odometry becomes considerably large because its hopping motion involves unpredictable bounce on the rough ground on an unexplored planet. Motivated by the above discussion, this paper addresses a problem of finding an optimal movement of the hopping rover for the estimation performance of the SLAM. For the problem, we first set the model of the SLAM system for the hopping rover. The problem is formulated as minimizing the expectation of the estimation error at a pre-specified time with respect to the sequence of control inputs. We show that the optimal input sequence tends to force the final position to be not at the landmark but in front of the landmark, and furthermore, the optimal input sequence is constant on the time interval for optimization.