著者

Arata KAWAMURA Hiro IGARASHI Youji IIGUNI

出版者

一般社団法人 電子情報通信学会

雑誌

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)

巻号頁・発行日

vol.E100.A, no.3, pp.893-895, 2017-03-01 (Released:2017-03-01)

参考文献数

11

被引用文献数

2

---

Image-to-sound mapping is a technique that transforms an image to a sound signal, which is subsequently treated as a sound spectrogram. In general, the transformed sound differs from a human speech signal. Herein an efficient image-to-sound mapping method, which provides an understandable speech signal without any training, is proposed. To synthesize such a speech signal, the proposed method utilizes a multi-column image and a speech spectral phase that is obtained from a long-time observation of the speech. The original image can be retrieved from the sound spectrogram of the synthesized speech signal. The synthesized speech and the reconstructed image qualities are evaluated using objective tests.

著者

SUGIYAMA Kenji SAGARA Naoya OKAWA Ryo

出版者

一般社団法人 電子情報通信学会

雑誌

IEICE transactions on fundamentals of electronics, communications and computer sciences (ISSN:09168508)

巻号頁・発行日

vol.94, no.2, pp.519-524, 2011-02-01

参考文献数

12

被引用文献数

3 1

---

The non-reference method is widely useful for picture quality estimation on the decoder side. In other work, we discussed pure non-reference estimation using only the decoded picture, and we proposed quantitative estimation methods for mosquito noise and block artifacts. In this paper, we discuss the estimation method as it applies to the degradation of the temporal domain. In the proposed method, motion compensated inter-picture differences and motion vector activity are the basic parameters of temporal degradation. To obtain these parameters, accurate but unstable motion estimation is used with a 1/16 reduction of processing power. Similar values of the parameters in the pictures can be seen in the stable original picture, but temporal degradation caused by the coding increases them. For intra-coded pictures, the values increase significantly. However, for inter-coded pictures, the values are the same or decrease. Therefore, by taking the ratio of the peak frame and other frames, the absolute value of the temporal degradation can be estimated. In this case, the peak frame may be intra-coded. Finally, we evaluate the proposed method using coded pictures with different quantization.

著者

Guoliang LI Lining XING Zhongshan ZHANG Yingwu CHEN

出版者

一般社団法人 電子情報通信学会

雑誌

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)

巻号頁・発行日

vol.E100.A, no.7, pp.1541-1551, 2017-07-01 (Released:2017-07-01)

参考文献数

34

被引用文献数

4

---

Bayesian networks are a powerful approach for representation and reasoning under conditions of uncertainty. Of the many good algorithms for learning Bayesian networks from data, the bio-inspired search algorithm is one of the most effective. In this paper, we propose a hybrid mutual information-modified binary particle swarm optimization (MI-MBPSO) algorithm. This technique first constructs a network based on MI to improve the quality of the initial population, and then uses the decomposability of the scoring function to modify the BPSO algorithm. Experimental results show that, the proposed hybrid algorithm outperforms various other state-of-the-art structure learning algorithms.

著者

Taizo SUZUKI Masaaki IKEHARA

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)

巻号頁・発行日

vol.E100-A, no.5, pp.1109-1118, 2017-05-01

---

We present a lifting-based lapped transform (L-LT) and a reversible symmetric extension (RSE) in the boundary processing for more effective lossy-to-lossless image coding of data with various qualities from only one piece of lossless compressed data. The proposed dual-DCT-lifting-based LT (D2L-LT) parallel processes two identical LTs and consists of 1-D and 2-D DCT-liftings which allow the direct use of a DCT matrix in each lifting coefficient. Since the DCT-lifting can utilize any existing DCT software or hardware, it has great potential for elegant implementations that are dependent on the architecture and DCT algorithm used. In addition, we present an improved RSE (IRSE) that works by recalculating the boundary processing and solves the boundary problem that the DCT-lifting-based L-LT (DL-LT) has. We show that D2L-LT with IRSE mostly outperforms conventional L-LTs in lossy-to-lossless image coding.

著者

Rong-Long WANG Xiao-Fan ZHOU Kozo OKAZAKI

出版者

一般社団法人 電子情報通信学会

雑誌

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)

巻号頁・発行日

vol.E92.A, no.5, pp.1368-1372, 2009-05-01 (Released:2009-05-01)

参考文献数

15

被引用文献数

1 3 1

---

Ant colony optimization (ACO) algorithms are a recently developed, population-based approach which has been successfully applied to optimization problems. However, in the ACO algorithms it is difficult to adjust the balance between intensification and diversification and thus the performance is not always very well. In this work, we propose an improved ACO algorithm in which some of ants can evolve by performing genetic operation, and the balance between intensification and diversification can be adjusted by numbers of ants which perform genetic operation. The proposed algorithm is tested by simulating the Traveling Salesman Problem (TSP). Experimental studies show that the proposed ACO algorithm with genetic operation has superior performance when compared to other existing ACO algorithms.

著者

IWAMOTO Chuzo MATSUI Yuta

出版者

一般社団法人 電子情報通信学会

雑誌

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)

巻号頁・発行日

vol.99, no.6, pp.1145-1148, 2016

被引用文献数

1

---

The Building puzzle is played on an N×N grid of cells. Initially, some numbers are given around the border of the grid. The object of the puzzle is to fill out blank cells such that every row and column contains the numbers 1 through N. The number written in each cell represents the height of the building. The numbers around the border indicate the number of buildings which a person can see from that direction. A shorter building behind a taller one cannot be seen by him. It is shown that deciding whether the Building puzzle has a solution is NP-complete.

著者

Ai ISHIDA Keita EMURA Goichiro HANAOKA Yusuke SAKAI Keisuke TANAKA

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)

巻号頁・発行日

vol.E98-A, no.12, pp.2446-2455, 2015-12-01

---

The primitive called public key encryption with non-interactive opening (PKENO) is a class of public key encryption (PKE) with additional functionality. By using this, a receiver of a ciphertext can prove that the ciphertext is an encryption of a specified message in a publicly verifiable manner. In some situation that a receiver needs to claim that a ciphertext is NOT decrypted to a specified message, if he/she proves the fact by using PKENO straightforwardly, the real message of the ciphertext is revealed and a verifier checks that it is different from the specified message about which the receiver wants to prove. However, this naive solution is problematic in terms of privacy. Inspired by this problem, we propose the notion of disavowable public key encryption with non-interactive opening (disavowable PKENO) where, with respect to a ciphertext and a message, the receiver of the ciphertext can issue a proof that the plaintext of the ciphertext is NOT the message. Also, we give a concrete construction. Specifically, a disavowal proof in our scheme consists of 61 group elements. The proposed disavowable PKENO scheme is provably secure in the standard model under the decisional linear assumption and strong unforgeability of the underlying one-time signature scheme.

著者

Tanaka Mamoru Crounse Kenneth R. Roska Tamas

出版者

一般社団法人電子情報通信学会

雑誌

IEICE transactions on fundamentals of electronics, communications and computer sciences (ISSN:09168508)

巻号頁・発行日

vol.77, no.8, pp.1387-1395, 1994-08-25

被引用文献数

6

---

This paper describes highly parallel analog image coding and decoding by cellular neural networks (CNNs). The communication system in which the coder (C-) and decoder (D-) CNNs are embedded consists of a differential transmitter with an internal receiver model in the feedback loop. The C-CNN encodes the image through two cascaded techniques: structural compression and halftoning. The D-CNN decodes the received data through a reconstruction process, which includes a dynamic current distribution, so that the original input to the C-CNN can be recognized. The halftoning serves as a dynamic quantization to convert each pixel to a binary value depending on the neighboring values. We approach halftoning by the minimization of error energy between the original gray image and reconstructed halftone image, and the structural compression from the viewpoints of topological and regularization theories. All dynamics are described by CNN state equations. Both the proposed coding and decoding algorithms use only local image information in a space invariant manner, therefore errors are distributed evenly and will not introduce the blocking effects found in DCT-based coding methods. In the future, the use of parallel inputs from on-chip photodetectors would allow direct dynamic quantization and compression of image sequences without the use of multiple bit analog-to-digital converters. To validate our theory, a simulation has been performed by using the relaxation method on an 150 frame image sequence. Each input image was 256× pixels with 8 bits per pixel. The simulated fixed compression rate, not including the Huffman coding, was about 1/16 with a PSNR of 31[dB]〜35[dB].

著者

MITSUNARI Shigeo SAKAI Ryuichi KASAHARA Masao

出版者

一般社団法人電子情報通信学会

雑誌

IEICE transactions on fundamentals of electronics, communications and computer sciences (ISSN:09168508)

巻号頁・発行日

vol.85, no.2, pp.481-484, 2002-02-01

被引用文献数

35

---

A traitor tracing scheme is a broadcast encryption scheme in which a provider can trace malicious authorized users who illegally gave their personal keys to unauthorized users. The conventional schemes have some problems; one of them is that there exists an upper bound on the sizes of keys to certify the security of the scheme against a collusion attack by many traitors, and so that the size of the header increases according to the increase of the bound. We shall propose a new traitor tracing scheme where the header size is independent of the number of traitors.

著者

KIDA Yuichi KIDA Takuro

出版者

一般社団法人電子情報通信学会

雑誌

IEICE transactions on fundamentals of electronics, communications and computer sciences (ISSN:09168508)

巻号頁・発行日

vol.82, no.8, pp.1592-1607, 1999-08-25

被引用文献数

23 14

---

In the literature [9], the optimum discrete inter polation of one-dimensional signals is presented which minimizes various measures of approximation error simultaneously. In the discussion, the ratio λ of the weighted norm of the approximation error and that of the corresponding input signal plays an essential role to determine the structure of the set of signals. However, only the upper bound of λ is provided in [9]. In this paper, we will present more exact and systematic discussion of the optimum discrete interpolation of one-dimensional signals which minimizes various measures of approximation error at the same time. In this discussion, we will prove that the exact value of λ is identical with the upper limit, for ω(|ω|≦π), of the largest eigen value of a matrix including the weighting function W(ω) and the Fourier transforms of the optimum interpolation functions. Further, we will give a sufficient condition for W(ω) under which the ratio λ is equal to one, where the approximation error, if it is interpolated by sinc, is included in the set of band-limited signals defined by W(ω). Finally, as application of the presented approximation, we will propose a direction to interactive signal processing on Internet and a transmultiplexer system included in it. The transmultiplexer system included in this discussion can realize flexible arrangement of sub-bands which is inevitable in realizing the above proposal on interactive signal processing.

著者

Kenta IWAI Yoshinobu KAJIKAWA

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)

巻号頁・発行日

vol.E97-A, no.11, pp.2189-2199, 2014-11-01

---

In this paper, we propose a parameter estimation method using Volterra kernels for the nonlinear IIR filters, which are used for the linearization of closed-box loudspeaker systems. The nonlinear IIR filter, which originates from a mirror filter, employs nonlinear parameters of the loudspeaker system. Hence, it is very important to realize an appropriate estimation method for the nonlinear parameters to increase the compensation ability of nonlinear distortions. However, it is difficult to obtain exact nonlinear parameters using the conventional parameter estimation method for nonlinear IIR filter, which uses the displacement characteristic of the diaphragm. The conventional method has two problems. First, it requires the displacement characteristic of the diaphragm but it is difficult to measure such tiny displacements. Moreover, a laser displacement gauge is required as an extra measurement instrument. Second, it has a limitation in the excitation signal used to measure the displacement of the diaphragm. On the other hand, in the proposed estimation method for nonlinear IIR filter, the parameters are updated using simulated annealing (SA) according to the cost function that represents the amount of compensation and these procedures are repeated until a given iteration count. The amount of compensation is calculated through computer simulation in which Volterra kernels of a target loudspeaker system is utilized as the loudspeaker model and then the loudspeaker model is compensated by the nonlinear IIR filter with the present parameters. Hence, the proposed method requires only an ordinary microphone and can utilize any excitation signal to estimate the nonlinear parameters. Some experimental results demonstrate that the proposed method can estimate the parameters more accurately than the conventional estimation method.

著者

Nobuhiro MIYAZAKI Yoshinobu KAJIKAWA

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)

巻号頁・発行日

vol.E97-A, no.10, pp.2021-2032, 2014-10-01

---

In this paper, we propose a modified-error adaptive feedback active noise control (ANC) system using a linear prediction filter. The proposed ANC system is advantageous in terms of the rate of convergence, while maintaining stability, because it can reduce narrowband noise while suppressing disturbance, including wideband components. The estimation accuracy of the noise control filter in the conventional system is degraded because the disturbance corrupts the input signal to the noise control filter. A solution of this problem is to utilize a linear prediction filter. The linear prediction filter is utilized for the modified-error feedback ANC system to suppress the wideband disturbance because the linear prediction filter can separate narrowband and wideband noise. Suppressing wideband noise is important for the head-mounted ANC system we have already proposed for reducing the noise from a magnetic resonance imaging (MRI) device because the error microphones are located near the user's ears and the user's voice consequently corrupts the input signal to the noise control filter. Some simulation and experimental results obtained using a digital signal processor (DSP) demonstrate that the proposed feedback ANC system is superior to a conventional feedback ANC system in terms of the estimation accuracy and the rate of convergence of the noise control filter.

著者

Tomonori ANDO Yoshiyuki KABASHIMA Hisanao TAKAHASHI Osamu WATANABE Masaki YAMAMOTO

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)

巻号頁・発行日

vol.E94-A, no.6, pp.1247-1256, 2011-06-01

---

We study nn random symmetric matrices whose entries above the diagonal are iid random variables each of which takes 1 with probability p and 0 with probability 1-p, for a given density parameter p=α/n for sufficiently large α. For a given such matrix A, we consider a matrix A ' that is obtained by removing some rows and corresponding columns with too many value 1 entries. Then for this A', we show that the largest eigenvalue is asymptotically close to α+1 and its eigenvector is almost parallel to all one vector (1,...,1).

著者

Meiqin WANG Xiaoyun WANG Kam Pui CHOW Lucas Chi Kwong HUI

出版者

一般社団法人 電子情報通信学会

雑誌

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)

巻号頁・発行日

vol.E93.A, no.12, pp.2744-2754, 2010-12-01 (Released:2010-12-01)

参考文献数

10

被引用文献数

3

---

CAST-128 is a block cipher used in a number of products, notably as the default cipher in some versions of GPG and PGP. It has been approved for Canadian government use by the Communications Security Establishment. Haruki Seki et al. found 2-round differential characteristics and they can attack 5-round CAST-128. In this paper, we studied the properties of round functions F1 and F3 in CAST-128, and identified differential characteristics for F1 round function and F3 round function. So we identified a 6-round differential characteristic with probability 2-53 under 2-23.8 of the total key space. Then based on 6-round differential characteristic, we can attack 8-round CAST-128 with key sizes greater than or equal to 72bits and 9-round CAST-128 with key sizes greater than or equal to 104bits. We give the summary of attacks on reduced-round CAST-128 in Table 10.

著者

Ryo TAKAHASHI Ken UMENO

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)

巻号頁・発行日

vol.E97-A, no.7, pp.1619-1622, 2014-07-01

---

In this study, a performance of a synchronous code division multiple access (CDMA) using the chaotic spreading sequences with constant power is estimated in indoor power line fading channels. It is found that, in the fading channels, as the number of simultaneous users increases, the chaotic spreading sequences realize better performance than the Walsh-Hadamard sequences in the synchronous CDMA.

著者

Masayuki ABE Tatsuaki OKAMOTO Koutarou SUZUKI

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (ISSN:09168508)

巻号頁・発行日

vol.E96-A, no.1, pp.92-100, 2013-01-01

---

In this paper, we present a framework to construct message recovery signature schemes from Sigma-protocols. The key technique of our construction is the redundancy function that adds some redundancy to the message only legitimately signed and recovered message can have. We provide a characterization of the redundancy functions that make the resulting message recovery signature scheme proven secure. Our framework includes known schemes when the building blocks are given concrete implementations, i.e., random oracles and ideal ciphers, hence presents insightful explanation to their structure.

著者

ARIMURA Mitsuharu KOGA Hiroki IWATA Ken-ichi

出版者

電子情報通信学会

雑誌

IEICE transactions on fundamentals of electronics, communications and computer sciences (ISSN:09168508)

巻号頁・発行日

vol.E96.A, no.12, pp.2443-2446, 2013-12

---

In this letter, we first introduce a stronger notion of the optimistic achievable coding rate and discuss a coding theorem. Next, we give a necessary and sufficient condition under which the coding rates of all the optimal FF codes asymptotically converge to a constant.

著者

ARIMURA Mitsuharu KOGA Hiroki IWATA Ken-ichi

出版者

電子情報通信学会

雑誌

IEICE transactions on fundamentals of electronics, communications and computer sciences (ISSN:09168508)

巻号頁・発行日

vol.E96.A, no.12, pp.2332-2342, 2013-12

被引用文献数

1

---

In this paper we consider fixed-to-fixed length (FF) coding of a general source X with vanishing error probability and define two kinds of optimalities with respect to the coding rate and the redundancy, where the redundancy is defined as the difference between the coding rate and the symbolwise ideal codeword length. We first show that the infimum achievable redundancy coincides with the asymptotic width W(X) of the entropy spectrum. Next, we consider the two sets $\mCH(\bX)$ and $\mCW(\bX)$ and investigate relationships between them, where $\mCH(\bX)$ and $\mCW(\bX)$ denote the sets of all the optimal FF codes with respect to the coding rate and the redundancy, respectively. We give two necessary and sufficient conditions corresponding to $\mCH(\bX) \subseteq \mCW(\bX)$ and $\mCW(\bX) \subseteq \mCH(\bX)$, respectively. We can also show the existence of an FF code that is optimal with respect to both the redundancy and the coding rate.

著者

OKADA Kazuhisa YAMADA Akihisa KAMBE Takashi

出版者

一般社団法人電子情報通信学会

雑誌

IEICE transactions on fundamentals of electronics, communications and computer sciences (ISSN:09168508)

巻号頁・発行日

vol.85, no.4, pp.835-841, 2002-04-01

被引用文献数

35

---

The Bach compiler is a behavioral synthesis tool, which synthesizes RT-level circuits from behavioral descriptions written in the Bach C language. It shortens the design period of LSI and helps designers concentrate on algorithm design and refinement. In this paper, we propose methods for optimizing the area and performance of algorithms described in Bach C. In our experiments, we optimized a Viterbi decoder algorithm using our proposed methods and synthesized the circuit using the Bach compiler. The conclusion is that the circuit produced using Bach is both smaller and faster than the hand-coded register transfer level (RTL) design. This proves that the Bach compiler produces high-quality results and the Bach C language is effective for describing the behavior of hardware at a high-level.

著者

SOUFIANE Ayad ITOKAWA Tsuyoshi NAKAMURA Ryozo

出版者

一般社団法人電子情報通信学会

雑誌

IEICE transactions on fundamentals of electronics, communications and computer sciences (ISSN:09168508)

巻号頁・発行日

vol.86, no.5, pp.1075-1081, 2003-05-01

---

The linear hashing is a well-known dynamic hashing algorithm designed for internal main memory as well as external secondary memory. Traditional analysis of this search algorithm has been proposed under the assumption that all keys are uniformly accessed. In this paper, we present a discrete analysis of the average search cost of the linear dynamic hashing algorithm for internal main memory in consideration of the frequency of access on each key. In the proposed discrete analysis, the number of probes itself is regarded as a random variable and its probability distribution is derived concretely. Furthermore, the evaluate formula derived from the proposed analysis can exactly evaluate the average search cost in conformity with any probability distribution of the frequency of access. The proposed analysis is compared to the traditional one provided that the frequency of access on each key is uniform, and the differences are discussed.