As the number of surveillance cameras keeps increasing, the demand for automated traffic-monitoring systems is growing. In this paper, we propose a practical vehicle detection method for such systems. In the last decade, vehicle detection mainly has been performed by employing an image scan strategy based on sliding windows whereby a pre-trained appearance model is applied to all image areas. In this approach, because the appearance models are built from vehicle sample images, the normalization of the scales and aspect ratios of samples can significantly influence the performance of vehicle detection. Thus, to successfully apply sliding window schemes to detection, it is crucial to select the normalization sizes very carefully in a wise manner. To address this, we present a novel vehicle detection technique. In contrast to conventional methods that determine the normalization sizes without considering given scene conditions, our technique first learns local region-specific size models based on scene-contextual clues, and then utilizes the obtained size models to normalize samples to construct more elaborate appearance models, namely local size-specific classifiers (LSCs). LSCs can provide advantages in terms of both accuracy and operational speed because they ignore unnecessary information on vehicles that are observable in faraway areas from each sliding window position. We conduct experiments on real highway traffic videos, and demonstrate that the proposed method achieves a 16% increased detection accuracy with at least 3 times faster operational speed compared with the state-of-the-art technique.
Chaiyaporn PANYINDEE Chuchart PINTAVIROOJ
This paper introduces a reversible watermarking algorithm that exploits an adaptable predictor and sorting parameter customized for each image and each payload. Our proposed method relies on a well-known prediction-error expansion (PEE) technique. Using small PE values and a harmonious PE sorting parameter greatly decreases image distortion. In order to exploit adaptable tools, Gaussian weight predictor and expanded variance mean (EVM) are used as parameters in this work. A genetic algorithm is also introduced to optimize all parameters and produce the best results possible. Our results show an improvement in image quality when compared with previous conventional works.
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.
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.
Koichiro SAWA Masatoshi TSURUOKA Makito MORII
Various DC power supply systems such as photovoltaic power generation, fuel cell and others have been gradually spreading, so that DC power distribution systems are expected as one of energy-saving technologies at houses and business-related buildings as well as data centers and factories. Under such circumstances switches for electric appliances are requested to interrupt DC current safely in DC power systems (DC 300-400V). It is well-known that DC current is much more difficult to be interrupted than AC current with current-zero. In this paper a model switch is developed and fundamental characteristics of DC current interruption in a resistive circuit is experimentally and theoretically examined. Consequently arc duration is found to be approximately a function of interrupted power rather than source voltage and circuit current. In addition arc length at its extinction is obtained by the observation of a high-speed camera. Then the arc length is found to be decided only by interrupted power like the gap length, independent of separation velocity. From these results it can be made clear that the arc form becomes arc-shaped at its extinction when the interrupted power is larger than about 500W. In addition the effect of magnetic blow-out on arc extinction is examined.
Negative group delay characteristics can be used to improve signal-integrity performance such as equalizer for compensation of the group delay of transmission line (TL). This brief-paper newly attempts to propose a concept of the embedded Folded-Stepped Impedance Resonator (F-SIR) structure with open-stub resonator, for negative group delay and slope characteristics at high-frequency as well as low-insertion loss. The concept of the proposed TL is based on the combination of resonance and anti-resonance due to open-stub resonator in order to establish wideband negative group delay and negative slope characteristics. The proposed TL is fabricated on PCB, and then the concept is validated by measurement and simulation.
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.
Hisanao AKIMA Yasuhiro KATAYAMA Masao SAKURABA Koji NAKAJIMA Jordi MADRENAS Shigeo SATO
Majority logic is quite important for various applications such as fault tolerant systems, threshold logic, spectrum spread coding, and artificial neural networks. The circuit implementation of majority logic is difficult when the number of inputs becomes large because the number of transistors becomes huge and serious delay would occur. In this paper, we propose a new majority circuit with large fan-in. The circuit is composed of ordinary CMOS transistors and the total number of transistors is approximately only 4N, where N is the total number of inputs. We confirmed a correct operation by using HSPICE simulation. The yield of the proposed circuit was evaluated with respect to N under the variations of device parameters by using Monte Carlo simulation.
ThienLuan HO Seung-Rohk OH HyunJin KIM
This paper proposes a circular bit-vector-mismatches (CBVM) algorithm for approximate circular string matching with k-mismatches. We develop the proposed CBVM algorithm based on the rotation feature of the circular pattern. By reusing the matching information of the previous substring, the next substring of the input string can be processed in parallel.
Yong ZHANG Wanqiu ZHANG Dunwei GONG Yinan GUO Leida LI
Considering an uncertain multi-objective optimization system with interval coefficients, this letter proposes an interval multi-objective particle swarm optimization algorithm. In order to improve its performance, a crowding distance measure based on the distance and the overlap degree of intervals, and a method of updating the archive based on the acceptance coefficient of decision-maker, are employed. Finally, results show that our algorithm is capable of generating excellent approximation of the true Pareto front.
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.
Takanobu KOBORI Hironori WASHIZAKI Yoshiaki FUKAZAWA Daisuke HIRABAYASHI Katsutoshi SHINTANI Yasuko OKAZAKI Yasuhiro KIKUSHIMA
To achieve overall business goals, GQM+Strategies is one approach that aligns business goals at each level of an organization to strategies and assesses the achievement of goals. Strategies are based on rationales (contexts and assumptions). Because extracting all rationales is an important process in the GQM+Strategies approach, we propose the Context-Assumption-Matrix (CAM), which refines the GQM+Strategies model by extracting rationales based on analyzing the relationships between stakeholders, and the process of using GQM+Strategies with CAM effectively. To demonstrate the effectiveness of the CAM and the defined process, we conducted three experiments involving students majoring in information sciences at two different Japanese universities. Moreover, we applied the GQM+Strategies approach with CAM to the Recruit Sumai Company in Japan. The results reveal that compared to GQM+Strategies alone, GQM+Strategies with CAM can extract rationales of the same quality more efficiently and exhaustively.
Mahmoud EMAM Qi HAN Liyang YU Hongli ZHANG
The copy-move or region duplication forgery technique is a very common type of image manipulation, where a region of the image is copied and then pasted in the same image in order to hide some details. In this paper, a keypoint-based method for copy-move forgery detection is proposed. Firstly, the feature points are detected from the image by using the Förstner Operator. Secondly, the algorithm extracts the features by using MROGH feature descriptor, and then matching the features. Finally, the affine transformation parameters can be estimated using the RANSAC algorithm. Experimental results are presented to confirm that the proposed method is effective to locate the altered region with geometric transformation (rotation and scaling).
Dongming WANG Heping GU Hao WEI Xiaoxia DUAN Chunguo LI Xiaohu YOU
In this paper, we study the spectral efficiency of the uplink multi-user large-scale distributed antenna systems (DAS) with imperfect channel state information. We propose the system model of multi-user DAS and illustrate the necessity of pilot reuse. Then, we derive the sum-rate of the system under pilot contamination. Furthermore, we investigate the asymptotical performance when the number of antennas goes to infinity. To reduce the pilot contamination, we present two novel pilot assignment algorithms to improve the spectral efficiency. Finally, we evaluate our proposed strategies through extensive simulations which show that compared with random pilot reuse, the min-max algorithm shows impressive performance with low complexity.
Yong-Jo AHN Xiangjian WU Donggyu SIM Woo-Jin HAN
In this letter, fast intra mode decision algorithms for HEVC Screen Contents Coding (SCC) are proposed. HEVC SCC has been developed to efficiently code mixed contents consisting of natural video, graphics, and texts. Comparing to HEVC version 1, the SCC encoding complexity significantly increases due to the newly added intra block copy mode. To reduce the heavy encoding complexity, the evaluation orders of multiple intra modes are rearranged and several early termination schemes based on intermediate coding information are developed. Based on our evaluation, it is found that the proposed method can achieve encoding time reduction of 13∼30% with marginal coding gain or loss, compared with HEVC SCC test model 2.0 in all intra (AI) case.
In this letter, we present a spectrally efficient multicast method which enables a transmitter to simultaneously transmit multiple multicast streams without any interference among multicast groups. By using unique combiners at receivers with multiple antennas within each multicast group, the proposed method simplifies multiple channels between the transmitter and the receivers to an equivalent channel. In addition, we establish the sufficient condition for the system configuration which should be satisfied for the channel simplification and provide a combiner design technique for the receivers. To remove interference among multicast groups, the precoder for the transmitter is designed by utilizing the equivalent channels. By exploiting time resources efficiently, the channel simplification (CS) based method achieves a higher sum rate than the time division multiplexing (TDM) based method, which the existing multicast techniques fundamentally employ, at high signal-to-noise ratio (SNR) regime. Furthermore, we present a multicast method combining the CS based method with the TDM based method to utilize the benefits of both methods. Simulation results successfully demonstrate that the combined multicast method obtains a better sum rate performance at overall SNR regime.
Hiroyuki NAKAGAWA Tatsuhiro TSUCHIYA
Pair-wise testing is an effective test planning technique for finding interaction faults using a small set of test cases. Constraint elicitation is an important process in the pair-wise testing design since constraints determine the test space; however, the constraint elicitation process has not been well studied. It usually requires manual capturing and precise definition of constraints. In this paper, we propose a constraint elicitation process that helps combinatorial test design. Our elicitation process consists of two steps: parameter combination identification and value pair determination. We conduct experiments on some test models, and demonstrate that some extracted rules match constraints and others helps to define constraints.
Satoshi MASUDA Tohru MATSUODANI Kazuhiko TSUDA
In the early phases of the system development process, stakeholders exchange ideas and describe requirements in natural language. Requirements described in natural language tend to be vague and include logical inconsistencies, whereas logical consistency is the key to raising the quality and lowering the cost of system development. Hence, it is important to find logical inconsistencies in the whole requirements at this early stage. In verification and validation of the requirements, there are techniques to derive logical formulas from natural language requirements and evaluate their inconsistencies automatically. Users manually chunk the requirements by paragraphs. However, paragraphs do not always represent logical chunks. There can be only one logical chunk over some paragraphs on the other hand some logical chunks in one paragraph. In this paper, we present a practical approach to detecting logical inconsistencies by clustering technique in natural language requirements. Software requirements specifications (SRSs) are the target document type. We use k-means clustering to cluster chunks of requirements and develop semantic role labeling rules to derive “conditions” and “actions” as semantic roles from the requirements by using natural language processing. We also construct an abstraction grammar to transform the conditions and actions into logical formulas. By evaluating the logical formulas with input data patterns, we can find logical inconsistencies. We implemented our approach and conducted experiments on three case studies of requirements written in natural English. The results indicate that our approach can find logical inconsistencies.
DDoS remains a major threat to Software Defined Networks. To keep SDN secure, effective detection techniques for DDoS are indispensable. Most of the newly proposed schemes for detecting such attacks on SDN make the SDN controller act as the IDS or the central server of a collaborative IDS. The controller consequently becomes a target of the attacks and a heavy loaded point of collecting traffic. A collaborative intrusion detection system is proposed in this paper without the need for the controller to play a central role. It is deployed as a modified artificial neural network distributed over the entire substrate of SDN. It disperses its computation power over the network that requires every participating switch to perform like a neuron. The system is robust without individual targets and has a global view on a large-scale distributed attack without aggregating traffic over the network. Emulation results demonstrate its effectiveness.
In this paper, the integration of dynamic plant-wide optimization and distributed generalized predictive control (DGPC) is presented for serially connected processes. On the top layer, chance-constrained programming (CCP) is employed in the plant-wide optimization with economic and model uncertainties, in which the constraints containing stochastic parameters are guaranteed to be satisfied at a high level of probability. The deterministic equivalents are derived for linear and nonlinear individual chance constraints, and an algorithm is developed to search for the solution to the joint probability constrained problem. On the lower layer, the distributed GPC method based on neighborhood optimization with one-step delay communication is developed for on-line control of the whole system. Simulation studies for furnace temperature set-points optimization problem of the walking-beam-type reheating furnace are illustrated to verify the effectiveness and practicality of the proposed scheme.