Qiaochu ZHAO Ittetsu TANIGUCHI Makoto NAKAMURA Takao ONOYE
Vision systems are widely adopted in industrial fields for monitoring and automation. As a typical example, industrial vision systems are extensively implemented in vibrator parts feeder to ensure orientations of parts for assembling are aligned and disqualified parts are eliminated. An efficient parts orientation recognition and counting method is thus critical to adopt. In this paper, an integrated method for fast parts counting and orientation recognition using industrial vision systems is proposed. Original 2D spatial image signal of parts is decomposed to 1D signal with its temporal variance, thus efficient recognition and counting is achievable, feeding speed of each parts is further leveraged to elaborate counting in an adaptive way. Experiments on parts of different types are conducted, the experimental results revealed that our proposed method is both more efficient and accurate compared to other relevant methods.
Masahiro TAKIGAWA Shinsuke IBI Seiichi SAMPEI
This paper proposes a successive interference cancellation (SIC) of independent component analysis (ICA) aided spatial division multiple access (SDMA) for Gaussian filtered frequency shift keying (GFSK) in Bluetooth low energy (BLE) systems. The typical SDMA scheme requires estimations of channel state information (CSI) using orthogonal pilot sequences. However, the orthogonal pilot is not embedded in the BLE packet. This fact motivates us to add ICA detector into BLE systems. In this paper, focusing on the covariance matrix of ICA outputs, SIC can be applied with Cholesky decomposition. Then, in order to address the phase ambiguity problems created by the ICA process, we propose a differential detection scheme based on the MAP algorithm. In practical scenarios, it is subject to carrier frequency offset (CFO) as well as symbol timing offset (STO) induced by the hardware impairments present in the BLE peripherals. The packet error rate (PER) performance is evaluated by computer simulations when BLE peripherals simultaneously communicate in the presence of CFO and STO.
In this letter, we adopt two multi-carrier relay selections, i.e., bulk and per-subcarrier (PS), to the multi-hop decode-and-forward relaying orthogonal frequency-division multiplexing with index modulation (OFDM-IM) system. Particularly, in the form of average outage probability (AOP), the influence of joint selection and non-joint selection acting on the last two hops on the system is analyzed. The closed-form expressions of AOPs and the asymptotic AOPs expressions at high signal-to-noise ratio are given and verified by numerical simulations. The results show that both bulk and PS can achieve full diversity order and that PS can provide additional power gain compared to bulk when JS is used. The theoretical analyses in this letter provide an insight into the combination of OFDM-IM and cooperative communication.
This paper proposes a simple source data exchange method for channel switching in space-time block code. If one transmits source data on another antenna, then the receiver should change combining method in order to adapt it. No one except knowing the channel switching sequence can decode the received data correctly. In case of exchanging data for channel switching, four orthogonal frequency division multiplexing symbols are exchanged according to a format of space-time block code. In this paper, I proposes two simple sign exchanges without exchanging four orthogonal-frequency division multiplexing symbols which occurs a different combining and channel switching method in the receiver.
One goal in stack-queue mixed layouts of a graph subdivision is to obtain a layout with minimum number of subdivision vertices per edge when the number of stacks and queues are given. Dujmović and Wood showed that for every integer s, q>0, every graph G has an s-stack q-queue subdivision layout with 4⌈log(s+q)q sn(G)⌉ (resp. 2+4⌈log(s+q)q qn(G)⌉) division vertices per edge, where sn(G) (resp. qn(G)) is the stack number (resp. queue number) of G. This paper improves these results by showing that for every integer s, q>0, every graph G has an s-stack q-queue subdivision layout with at most 2⌈logs+q-1sn(G)⌉ (resp. at most 2⌈logs+q-1qn(G)⌉ +4) division vertices per edge. That is, this paper improves previous results more, for graphs with larger stack number sn(G) or queue number qn(G) than given integers s and q. Also, the larger the given integer s is, the more this paper improves previous results.
In this letter, the performance of a state-of-the-art deep learning (DL) algorithm in [5] is analyzed and evaluated for orthogonal frequency-division multiplexing (OFDM) receivers, in the presence of harmonic spur interference. Moreover, a novel spur cancellation receiver structure and algorithm are proposed to enhance the traditional OFDM receivers, and serve as a performance benchmark for the DL algorithm. It is found that the DL algorithm outperforms the traditional algorithm and is much more robust to spur carrier frequency offset.
Yuki FUNABIKI Yosuke TODO Takanori ISOBE Masakatu MORII
HIGHT is a 64-bit block lightweight cipher, which adopts the ARX-based generalized Feistel network, and it accepts a 128-bit key. It is a standard encryption algorithm in South Korea and also is internationally standardized by ISO/IEC 18033-3. Therefore, many third-party cryptanalyses have been proposed against HIGHT. Impossible differential and integral attacks are applied to reduced-round HIGHT, and especially, the impossible differential attack causes the 27-round attack, which is the current best attack under the single-key setting. In this paper, we propose some improved integral attacks against HIGHT. We first apply the division property to HIGHT and find new 19-round integral characteristics, which are improved by two rounds compared with the previous best ones. We append 9-round key recovery to these characteristics and it enables us to attack 28-round HIGHT. Its time complexity is 2127.02 where 263 chosen plaintexts and 2117 memory are required. Moreover, we can attack 29-round HIGHT if the full codebook is used, where its time and memory complexities are 2126.07 and 2118, respectively. It improves by two rounds compared with the previous best attack.
Eiji OKAMOTO Manabu MIKAMI Hitoshi YOSHINO
In fifth-generation mobile communications systems (5G), grant-free non-orthogonal multiple access (NOMA) schemes have been considered as a way to accommodate the many wireless connections required for Internet of Things (IoT) devices. In NOMA schemes, both system capacity enhancement and transmission protocol simplification are achieved, and an overload test of more than one hundred percent of the transmission samples over conducted. Multi-user shared multiple access (MUSA) has been proposed as a representative scheme for NOMA. However, the performance of MUSA has not been fully analyzed nor compared to other NOMA or orthogonal multiple access schemes. Therefore, in this study, we theoretically and numerically analyze the performance of MUSA in uplink fading environments and compare it with orthogonal frequency division multiple access (OFDMA), space division multiple access-based OFDMA, low-density signature, and sparse code multiple access. The characteristics and superiority of MUSA are then clarified.
Karthikeyan PANJAPPAGOUNDER RAJAMANICKAM Sakthivel PERIYASAMY
Background subtraction algorithms generate a background model of the monitoring scene and compare the background model with the current video frame to detect foreground objects. In general, most of the background subtraction algorithms fail to detect foreground objects when the scene illumination changes. An entropy based background subtraction algorithm is proposed to address this problem. The proposed method adapts to illumination changes by updating the background model according to differences in entropy value between the current frame and the previous frame. This entropy based background modeling can efficiently handle both sudden and gradual illumination variations. The proposed algorithm is tested in six video sequences and compared with four algorithms to demonstrate its efficiency in terms of F-score, similarity and frame rate.
Fei GUO Yuan YANG Yang XIAO Yong GAO Ningmei YU
Currently, visual perceptions generated by visual prosthesis are low resolution with unruly color and restricted grayscale. This severely restricts the ability of prosthetic implant to complete visual tasks in daily scenes. Some studies explore existing image processing techniques to improve the percepts of objects in prosthetic vision. However, most of them extract the moving objects and optimize the visual percepts in general dynamic scenes. The application of visual prosthesis in daily life scenes with high dynamic is greatly limited. Hence, in this study, a novel unsupervised moving object segmentation model is proposed to automatically extract the moving objects in high dynamic scene. In this model, foreground cues with spatiotemporal edge features and background cues with boundary-prior are exploited, the moving object proximity map are generated in dynamic scene according to the manifold ranking function. Moreover, the foreground and background cues are ranked simultaneously, and the moving objects are extracted by the two ranking maps integration. The evaluation experiment indicates that the proposed method can uniformly highlight the moving object and keep good boundaries in high dynamic scene with other methods. Based on this model, two optimization strategies are proposed to improve the perception of moving objects under simulated prosthetic vision. Experimental results demonstrate that the introduction of optimization strategies based on the moving object segmentation model can efficiently segment and enhance moving objects in high dynamic scene, and significantly improve the recognition performance of moving objects for the blind.
Ming LI Li SHI Xudong CHEN Sidan DU Yang LI
The large computational complexity makes stereo matching a big challenge in real-time application scenario. The problem of stereo matching in a video sequence is slightly different with that in a still image because there exists temporal correlation among video frames. However, no existing method considered temporal consistency of disparity for algorithm acceleration. In this work, we proposed a scheme called the dynamic disparity range (DDR) to optimize matching cost calculation and cost aggregation steps by narrowing disparity searching range, and a scheme called temporal cost aggregation path to optimize the cost aggregation step. Based on the schemes, we proposed the DDR-SGM and the DDR-MCCNN algorithms for the stereo matching in video sequences. Evaluation results showed that the proposed algorithms significantly reduced the computational complexity with only very slight loss of accuracy. We proved that the proposed optimizations for the stereo matching are effective and the temporal consistency in stereo video is highly useful for either improving accuracy or reducing computational complexity.
We report our recent progress in silicon photonics integrated device technology targeting on-chip-level large-capacity optical interconnect applications. To realize high-capacity data transmission, we successfully developed on-package-type silicon photonics integrated transceivers and demonstrated simultaneous 400 Gbps operation. 56 Gbps pulse-amplitude-modulation (PAM) 4 and wavelength-division-multiplexing technologies were also introduced to enhance the transmission capacity.
In super-Nyquist wavelength division multiplexed systems, performance of forward error correction (FEC) can be improved by an iterative decoder between a maximum likelihood decoder for polybinary shaping and an FEC decoder. The typical iterative decoder includes not only the iteration between the first and second decoders but also the internal iteration within the FEC decoder. Such two-fold loop configuration would increase the computational complexity for decoding. In this paper, we propose the simplified iterative decoder, where the internal iteration in the FEC decoder is not performed, reducing the computational complexity. We numerically evaluate the bit-error rate performance of polybinary-shaped QPSK signals in the simplified iterative decoder. The numerical results show that the FEC performance can be improved in the simplified scheme, compared with the typical iterative decoder. In addition, the performance of the simplified iterative decoder has been investigated by the extrinsic information transfer (EXIT) chart.
Takuya KUWAHARA Takayuki KURODA Manabu NAKANOYA Yutaka YAKUWA Hideyuki SHIMONISHI
As IT systems, including network systems using SDN/NFV technologies, become large-scaled and complicated, the cost of system management also increases rapidly. Network operators have to maintain their workflow in constructing and consistently updating such complex systems, and thus these management tasks in generating system update plan are desired to be automated. Declarative system update with state space search is a promising approach to enable this automation, however, the current methods is not enough scalable to practical systems. In this paper, we propose a novel heuristic approach to greatly reduce computation time to solve system update procedure for practical systems. Our heuristics accounts for structural bottleneck of the system update and advance search to resolve bottlenecks of current system states. This paper includes the following contributions: (1) formal definition of a novel heuristic function specialized to system update for A* search algorithm, (2) proofs that our heuristic function is consistent, i.e., A* algorithm with our heuristics returns a correct optimal solution and can omit repeatedly expansion of nodes in search spaces, and (3) results of performance evaluation of our heuristics. We evaluate the proposed algorithm in two cases; upgrading running hypervisor and rolling update of running VMs. The results show that computation time to solve system update plan for a system with 100 VMs does not exceed several minutes, whereas the conventional algorithm is only applicable for a very small system.
Longfei CHEN Yuichi NAKAMURA Kazuaki KONDO Walterio MAYOL-CUEVAS
This paper presents an approach to analyze and model tasks of machines being operated. The executions of the tasks were captured through egocentric vision. Each task was decomposed into a sequence of physical hand-machine interactions, which are described with touch-based hotspots and interaction patterns. Modeling the tasks was achieved by integrating the experiences of multiple experts and using a hidden Markov model (HMM). Here, we present the results of more than 70 recorded egocentric experiences of the operation of a sewing machine. Our methods show good potential for the detection of hand-machine interactions and modeling of machine operation tasks.
In parallel computing systems, the interconnection network forms the critical infrastructure which enables robust and scalable communication between hundreds of thousands of nodes. The traditional packet-switched network tends to suffer from long communication time when network congestion occurs. In this context, we explore the use of circuit switching (CS) to replace packet switches with custom hardware that supports circuit-based switching efficiently with low latency. In our target CS network, a certain amount of bandwidth is guaranteed for each communication pair so that the network latency can be predictable when a limited number of node pairs exchange messages. The number of allocated time slots in every switch is a direct factor to affect the end-to-end latency, we thereby improve the slot utilization and develop a network topology generator to minimize the number of time slots optimized to target applications whose communication patterns are predictable. By a quantitative discrete-event simulation, we illustrate that the minimum necessary number of slots can be reduced to a small number in a generated topology by our design methodology while maintaining network cost 50% less than that in standard tori topologies.
Suguru KAMEDA Kei OHYA Tomohide TAKAHASHI Hiroshi OGUMA Noriharu SUEMATSU
For capacity expansion of the Quasi-Zenith Satellite System (QZSS) safety confirmation system, frame slotted ALOHA with flag method has previously been proposed as an access control scheme. While it is always able to communicate in an optimum state, its maximum channel efficiency is only 36.8%. In this paper, we propose adding a reservation channel (R-Ch) to the frame slotted ALOHA with flag method to increase the upper limit of the channel efficiency. With an R-Ch, collision due to random channel selection is decreased by selecting channels in multiple steps, and the channel efficiency is improved up to 84.0%. The time required for accommodating 3 million mobile terminals, each sending one message, when using the flag method only and the flag method with an R-Ch are compared. It is shown that the accommodating time can be reduced to less than half by adding an R-Ch to the flag method.
Takahiro MATSUMOTO Hideyuki TORII Yuta IDA Shinya MATSUFUJI
In this paper, we propose a generation method of new mutually zero-correlation zone set of optical orthogonal sequences (MZCZ-OOS) consisting of binary and bi-phase sequence pairs based on the optical zero-correlation zone (ZCZ) sequence set. The MZCZ-OOS is composed of several small orthogonal sequence sets. The sequences that belong to same subsets are orthogonal, and there is a ZCZ between the sequence that belong to different subsets. The set is suitable for the M-ary quasi-synchronous optical code-division multiple access (M-ary/QS-OCDMA) system. The product of set size S and family size M of proposed MMZCZ-OOS is more than the upper bound of optical ZCZ sequence set, and is fewer than the that of optical orthogonal sequence set.
Yubo LI Shuonan LI Hongqian XUAN Xiuping PENG
In this letter, a generic method to construct mutually orthogonal binary zero correlation zone (ZCZ) sequence sets from mutually orthogonal complementary sequence sets (MOCSSs) with certain properties is presented at first. Then MOCSSs satisfying conditions are generated from binary orthogonal matrices with order N×N, where N=p-1, p is a prime. As a result, mutually orthogonal binary ZCZ sequence sets with parameters (2N2,N,N+1)-ZCZ can be obtained, the number of ZCZ sets is N. Note that each single ZCZ sequence set is optimal with respect to the theoretical bound.
Jorge AGUILAR-TORRENTERA Gerardo GARCÍA-SÁNCHEZ Ramón RODRÍGUEZ-CRUZ Izzat Z. DARWAZEH
In this paper, the analog code modulation characteristics of distributed-based transversal filters (DTFs) suitable for use in spectrally encoded CDMA systems are presented. The DTF is verified as an appropriate method to use in high-speed CDMA systems as opposed to previously proposed methods, which are intended for Direct Sequence (DS) CDMA systems. The large degree of freedom of DTF design permits controlling the filter pulse response to generate well specified temporal phase-coded signals. A decoder structure that performs bipolar detection of user subbands giving rise to a Spectral-Amplitude Encoded CDMA system is considered. Practical implementations require truncating the spreading signals by a time window of duration equal to the span time of the tapped delay line. Filter functions are chosen to demodulate the matched channel and achieve improved user interference rejection avoiding the need for transversal filters featuring a large number of taps. As a proof-of-concept of the electronic SAE scheme, practical circuit designs are developed at low speeds (3-dB point at 1 GHz) demonstrating the viability of the proposal.