Chao ZHANG Haitian SUN Takuya AKASHI
In this paper, we address the problem of non-parametric template matching which does not assume any specific deformation models. In real-world matching scenarios, deformation between a template and a matching result usually appears to be non-rigid and non-linear. We propose a novel approach called local rigidity constraints (LRC). LRC is built based on an assumption that the local rigidity, which is referred to as structural persistence between image patches, can help the algorithm to achieve better performance. A spatial relation test is proposed to weight the rigidity between two image patches. When estimating visual similarity under an unconstrained environment, high-level similarity (e.g. with complex geometry transformations) can then be estimated by investigating the number of LRC. In the searching step, exhaustive matching is possible because of the simplicity of the algorithm. Global maximum is given out as the final matching result. To evaluate our method, we carry out a comprehensive comparison on a publicly available benchmark and show that our method can outperform the state-of-the-art method.
Outside wireless signals often obstruct GNSS receivers from acquiring satellite signals. Traditional anti-jamming algorithms are used to suppress interference using a convex optimization method based on minimizing output power. These algorithms can reduce interference. However, these models suppress satellite signals as well as jamming interference. Under the high-dynamic condition, the output signal-to-interference-and-noise ratio (SINR) deteriorates seriously and the success rate in acquiring satellite signals falls accordingly. This paper introduces a novel, broadened model with a no-main-lobe-and-multi-virtual-null-constraints (NMLCB) method based on maximizing output power and constraining interference sources. With the new method, GNSS receivers can receive satellite signals more easily than using the power inversion (PI) and power minimization with derivative constraints null (NB) methods under the high-dynamic condition.
Masaya MURATA Hidehisa NAGANO Kaoru HIRAMATSU Kunio KASHINO Shin'ichi SATOH
In this paper, we first analyze the discriminative power in the Best Match (BM) 25 formula and provide its calculation method from the Bayesian point of view. The resulting, derived discriminative power is quite similar to the exponential inverse document frequency (EIDF) that we have previously proposed [1] but retains more preferable theoretical advantages. In our previous paper [1], we proposed the EIDF in the framework of the probabilistic information retrieval (IR) method BM25 to address the instance search task, which is a specific object search for videos using an image query. Although the effectiveness of our EIDF was experimentally demonstrated, we did not consider its theoretical justification and interpretation. We also did not describe the use of region-of-interest (ROI) information, which is supposed to be input to the instance search system together with the original image query showing the instance. Therefore, here, we justify the EIDF by calculating the discriminative power in the BM25 from the Bayesian viewpoint. We also investigate the effect of the ROI information for improving the instance search accuracy and propose two search methods incorporating the ROI effect into the BM25 video ranking function. We validated the proposed methods through a series of experiments using the TREC Video Retrieval Evaluation instance search task dataset.
Michio TAKIKAWA Yoshio INASAWA Hiroaki MIYASHITA Izuru NAITO
We investigate a phased array-fed dual reflector antenna applying one-dimensional beam-scanning of the center-fed type, using an elliptical aperture to provide wide area observation. The distinguishing feature of this antenna is its elliptical aperture shape, in which the aperture diameter differs between the forward satellite direction and the cross-section orthogonal to it. The shape in the plane of the forward satellite direction, which does not have a beam-scanning function, is a ring-focus Cassegrain antenna, and the shape in the plane orthogonal to that, which does have a beam-scanning function, is an imaging reflector antenna. This paper describes issues which arose during design of the elliptical aperture shape and how they were solved, and presents design results using elliptical aperture dimensions of 1600 mm × 600 mm, in which the beam width differs by more than two times in the orthogonal cross-section. The effectiveness of the antenna was verified by fabricating a prototype antenna based on the design results. Measurement results confirmed that an aperture efficiency of 50% or more could be achieved, and that a different beam width was obtained in the orthogonal plane in accordance with design values.
Guangteng FAN Xiaomei TANG Junwei NIE Yangbo HUANG Guangfu SUN
Global navigation satellite system (GNSS) receivers equipped with the frequency domain interference suppression (FDIS) filter can operate in environments with harsh interference. The FDIS will not cause tracking error bias for an ideal analog receiver channel as its magnitude response and phase response are constant. However, the analog receiver channel distortion is induced by RF cables, amplifiers, and mixers. The distortion of the channel caused asymmetry correlation function. The correlation function is further deformed by the FDIS filter. More seriously, since the FDIS filter is adaptive, the bias will vary with the jamming pattern, especially when the frequency of interference is varying. For precision navigation applications, this bias must be mitigated. Fortunately, to prevent power loss, the analog receiver channel filter is a real function or the imaginary part is negligible. Therefore, the magnitude response and the phase response are even functions. Based on these channel features, a new FDIS filter based on mirror frequency amplitude compensation (MFAC) method is proposed in this paper. The amplitude of the symmetry position of the notch frequency is doubled in the MFAC method in order to mitigate the tracking bias. Simulation results show that the MFAC-based FDIS method is capable of reducing the bias error to less than 0.1ns, which is significant smaller than that achieved by the traditional FDIS method.
This paper investigates target detection, barrier coverage, and path coverage with randomly deployed sensors and analyzes the performance of target detection, barrier coverage, and path coverage using integral geometry. Explicit formulas of their performance are derived. The optimal convex sensing area shape with a power consumption constraint is derived from the explicit formulas. Surprisingly, the optimal convex sensing area for target detection in a convex surveillance area can be different from that for barrier coverage. A slender sensing area is optimal for the former, but a disk-shaped sensing area can be optimal for the latter. Similar results are obtained with the Boolean and probabilistic detection models. A slender sensing area is optimal for the Boolean detection model and one of the probabilistic detection models, whereas the disk-shaped sensing area is optimal for another probabilistic detection model. This paper also derives the most difficult path and target to be detected.
Yi WANG Baofeng JI Yongming HUANG Chunguo LI Ying HU Yewang QIAN Luxi YANG
This paper considers a massive multiple-input-multiple-output (MIMO) relaying system with multi-pair single-antenna users. The relay node adopts maximum-ratio combining/maximum-ratio transmission (MRC/MRT) stratagem for reception/transmission. We analyze the spectral efficiency (SE) and power scaling laws with respect to the number of relay antennas and other system parameters. First, by using the law of large numbers, we derive the closed-form expression of the SE, based on which, it is shown that the SE per user increases with the number of relay antennas but decreases with the number of user pairs, both logarithmically. It is further discovered that the transmit power at the source users and the relay can be continuously reduced as the number of relay antennas becomes large while the SE can maintains a constant value, which also means that the energy efficiency gain can be obtained simultaneously. Moreover, it is proved that the number of served user pairs can grow proportionally over the number of relay antennas with arbitrary SE requirement and no extra power cost. All the analytical results are verified through the numerical simulations.
Wenyun GAO Xi CHEN Dexiu HU Haisheng XU
This paper presents non-iterative cooperative/parallel Kalman filtering algorithms for decentralized network navigation, in which mobile nodes cooperate in both spatial and temporal domains to infer their positions. We begin by presenting an augmented minimum-mean-square error (MMSE) estimator for centralized navigation network, and then decouple it into a set of local sub-ones each corresponding to a mobile node; all these sub-estimators work in parallel and cooperatively — with the state estimates exchanging between neighbors — to provide results similar to those obtained by the augmented one. After that, we employ the approximation methods that adopted in the conventional nonlinear Kalman filters to calculate the second-order terms involved in these sub-estimators, and propose a decentralized cooperative/parallel Kalman filtering based network navigation framework. Finally, upon the framework, we present two cooperative/parallel Kalman filtering algorithms corresponding to the extended and unscented Kalman filters respectively, and compare them with conventional decentralized methods by simulations to show the superiority.
Woo Hyun AHN Sanghyeon PARK Jaewon OH Seung-Ho LIM
In Android OS, we discover that a notification service called inotify is a new side-channel allowing malware to identify file accesses associated with the display of a security-relevant UI screen. This paper proposes a phishing attack that detects victim UI screens by their file accesses in applications and steals private information.
Takashi TAKEMOTO Yasunobu MATSUOKA Hiroki YAMASHITA Takahiro NAKAMURA Yong LEE Hideo ARIMOTO Tatemi IDO
A 50-Gb/s optical transmitter, consisting of a 25-Gb/s-class lens-integrated DFB-LD (with -3-dB bandwidth of 20GHz) and a LD-driver chip based on 0.18-µm SiGe BiCMOS technology for inter and intra-rack transmissions, was developed and tested. The DFB-LD and LD driver chip are flip-chip mounted on an alumina ceramic package. To suppress inter-symbol interference due to a shortage of the DFB-LD bandwidth and signal reflection between the DFB-LD and the package, the LD driver includes a two-tap pre-emphasis circuit and a high-speed termination circuit. Operating at a data rate of 50Gb/s, the optical transmitter enhances LD bandwidth and demonstrated an eye opening with jitter margin of 0.23UI. Power efficiency of the optical transmitter at a data rate of 50Gb/s is 16.2mW/Gb/s.
Wanghan LV Huali WANG Feng LIU Zheng DAI
In this letter, a method of wideband direction of arrival (DOA) estimation based on co-prime arrays with sub-Nyquist sampling is proposed. Previous works have employed co-prime arrays for wideband DOA estimation, which can increase the degrees of freedom (DOFs) in the spatial domain. However, they are all based on Nyquist sampling. Different from existing methods, we incorporate a sub-Nyquist sampling scheme called multicoset sampling for DOA estimation to relax hardware condition. Simulation results show the correctness and effectiveness.
To help elderly and physically disabled people to become self-reliant in daily life such as at home or a health clinic, we have developed a network-type brain machine interface (BMI) system called “network BMI” to control real-world actuators like wheelchairs based on human intention measured by a portable brain measurement system. In this paper, we introduce the technologies for achieving the network BMI system to support activities of daily living.
In a scenario-based software development, a lot of scenarios should be described in order to clarify the whole behaviors of the target software. By reusing scenarios of similar software systems, it becomes more efficient to newly describe scenarios of the target software. A differential scenario includes the difference between sequences of events of the two scenarios and the difference between nouns in the scenarios. If the nouns of the two scenarios are commonly used in the two scenarios, we regard the two scenarios specify the same or similar system. If the sequences of the events of the two scenarios are corresponding each other, we regard behavior of the two scenarios are similar. In this paper, we derive differential information including different words and events from two scenarios. Then, we propose a method of scenario retrieval using differential information between two scenarios. This method enables to detect similar scenarios for a given scenario. The proposed retrieval method and a prototype system for creating and visualizing differential scenario will be illustrated with examples.
Jie LIU Zhuochen XIE Huijie LIU Zhengmin ZHANG
In this paper, a new non-uniform weight-updating scheme for adaptive digital beamforming (DBF) is proposed. The unique feature of the letter is that the effective working range of the beamformer is extended and the computational complexity is reduced by introducing the robust DBF based on worst-case performance optimization. The robust parameter for each weight updating is chosen by analyzing the changing rate of the Direction of Arrival (DOA) of desired signal in LEO satellite communication. Simulation results demonstrate the improved performance of the new Non-Uniform Weight-Updating Beamformer (NUWUB).
Taejoon KIM Byung-Kwan KIM Heejung YU
In this letter, we present an efficient resource allocation algorithm for proportional fair schedulers in mobile multihop relay (MMR) networks. We consider a dual-hop cellular network assisted with a decode-and-forward relay station (RS). Since additional radio resources should be allocated in the wireless link between a base station (BS) and an RS, it is very important to determine the optimal amount of resources for this BS-to-RS link. The proposed resource allocation algorithm maximizes the utility of the overall MMR network in a proportionally fair point of view.
Yoshihide KATO Shigeki MATSUBARA
This paper proposes a method of incrementally constructing semantic representations. Our method is based on Steedman's Combinatory Categorial Grammar (CCG), which has a transparent correspondence between syntax and semantics. In our method, a derivation for a sentence is constructed in an incremental fashion and the corresponding semantic representation is derived synchronously. Our method uses normal form CCG derivation. This is the difference between our approach and previous ones. Previous approaches use most left-branching derivation called incremental derivation, but they cannot process coordinate structures incrementally. Our method overcomes this problem.
Aseffa DEREJE TEKILU Chin-Hsien WU
A map-reduce framework is popular for big data analysis. In the typical map-reduce framework, both master node and worker nodes can use hard-disk drives (HDDs) as local disks for the map-reduce computation. However, because of the inherit mechanical problems of HDDs, the I/O performance is a bottleneck for the map-reduce framework when I/O-intensive applications (e.g., sorting) are performed. Replacing HDDs with solid-state drives (SSDs) is not economical, although SSDs have better performance than HDDs. In this paper, we propose a virtualization-based hybrid storage system for the map-reduce framework. The objective of the paper is to combine the advantages of the fast access property of SSDs and the low cost of HDDs by realizing an economical design and improving I/O performance of a map-reduce framework in a virtualization environment. We propose three storage combinations: SSD-based, HDD-based, and a hybrid of SSD-based and HDD-based storage systems which balances speed, capacity, and lifetime. According to experiments, the hybrid of SSD-based and HDD-based storage systems offers superior performance and economy.
Meng YANG Yuehu TAN Erbing LI Cong MA Yechao YOU
The unconditionally stable (US) Laguerre-FDTD method has recently attracted significant attention for its high efficiency and accuracy in modeling fine structures. One of the most attractive characteristics of this method is its marching-on-in-order solution scheme. This paper presents Hermite-Rodriguez functions as another type of orthogonal basis to implement a new 2-D US solution scheme.
Chang Kyung SUNG Kyu-Sung HWANG
In this paper, we consider a two-hop relay network with a decode-and-forward (DF) relaying protocol where a multi-input/multi-output (MIMO) relay station (RS) is deployed in a cell edge to extend cell coverage of a base station (BS). We propose two MIMO relaying schemes to improve the quality of the BS-RS link, which is a key to improve data rates in the DF relaying: 1) spatial multiplexed MIMO antenna relaying (SM-MAR) with a uniform channel decomposition (UCD) precoder, and 2) MIMO relaying with section diversity (SD-MAR). In the SM-MAR, we greatly simplify user allocation by the UCD precoder and propose a sophisticated rate maximization technique to resolve the non-convexity of rate maximization problems. Through simulations, we show that the proposed UCD based power allocation exhibits up to two times higher achievable throughput than other techniques. In addition, the proposed SD-MAR supports the BS with a single transmit antenna and increases the signal quality of the BS-RS link with the selection diversity at the RS, which is much simpler to be implemented. For the SD-MAR, we derive a closed form expression for the achievable throughput and show that the selection diversity plays more important role on the achievable throughput than the multiuser diversity.
An organization may have two or more similar workflows as a result of workflow evolutions or mergers and acquisitions. We should grasp the common behavior of those workflows to consolidate the management of them and/or to do business process reengineering. Workflows can be modeled as a particular class of Petri nets, called workflow nets. The common behavior of two or more workflow nets can be represented as a superclass under the behavioral inheritance of those workflow nets. In this paper, we tackled a problem of extracting a superclass from two workflow nets, named Superclass Extraction problem. We first gave a definition of the problem. Next we proposed a procedure to solve the problem on the basis of process mining technique. Then we gave an application of the proposed procedure.