Several models of feed-forward complex-valued neural networks have been proposed, and those with split and polar-represented activation functions have been mainly studied. Neural networks with split activation functions are relatively easy to analyze, but complex-valued neural networks with polar-represented functions have many applications but are difficult to analyze. In previous research, Nitta proved the uniqueness theorem of complex-valued neural networks with split activation functions. Subsequently, he studied their critical points, which caused plateaus and local minima in their learning processes. Thus, the uniqueness theorem is closely related to the learning process. In the present work, we first define three types of reducibility for feed-forward complex-valued neural networks with polar-represented activation functions and prove that we can easily transform reducible complex-valued neural networks into irreducible ones. We then prove the uniqueness theorem of complex-valued neural networks with polar-represented activation functions.
Yang LI Junyong YE Tongqing WANG Shijian HUANG
Traditional sparse representation-based methods for human action recognition usually pool over the entire video to form the final feature representation, neglecting any spatio-temporal information of features. To employ spatio-temporal information, we present a novel histogram representation obtained by statistics on temporal changes of sparse coding coefficients frame by frame in the spatial pyramids constructed from videos. The histograms are further fed into a support vector machine with a spatial pyramid matching kernel for final action classification. We validate our method on two benchmarks, KTH and UCF Sports, and experiment results show the effectiveness of our method in human action recognition.
Won-Jae SHIN Ki-Won KWON Yong-Je WOO Hyoungsoo LIM Hyoung-Kyu SONG Young-Hwan YOU
In this letter, a robust algorithm for jointly finding an estimate of the start of the frame and transmission mode is proposed in a digital audio broadcasting (DAB) system. In doing so, the use of differential-correlation based joint detection is proposed, which considers not only the height of correlation peak but also its plateau. We show via simulations that the proposed detection algorithm is capable of robustly detecting the start of a frame and its mode against the variation of signal-to-noise ratio, providing a performance advantage over the conventional algorithm.
Xiao Yu LUO Xiao chao FEI Lu GAN Ping WEI Hong Shu LIAO
We propose a novel sparse representation-based direction-of-arrival (DOA) estimation method. In contrast to those that approximate l0-norm minimization by l1-norm minimization, our method designs a reweighted l1 norm to substitute the l0 norm. The capability of the reweighted l1 norm to bridge the gap between the l0- and l1-norm minimization is then justified. In addition, an array covariance vector without redundancy is utilized to extend the aperture. It is proved that the degree of freedom is increased as such. The simulation results show that the proposed method performs much better than l1-type methods when the signal-to-noise ratio (SNR) is low and when the number of snapshots is small.
Zhihui FAN Zhaoyang LU Jing LI Chao YAO Wei JIANG
To eliminate casting shadows of moving objects, which cause difficulties in vision applications, a novel method is proposed based on Visual background extractor by altering its updating mechanism using relevant spatiotemporal information. An adaptive threshold and a spatial adjustment are also employed. Experiments on typical surveillance scenes validate this scheme.
Yohei KAWAGUCHI Masahito TOGAMI Hisashi NAGANO Yuichiro HASHIMOTO Masuyuki SUGIYAMA Yasuaki TAKADA
A new algorithm for separating mass spectra into individual substances for explosives detection is proposed. In the field of mass spectrometry, separation methods, such as principal-component analysis (PCA) and independent-component analysis (ICA), are widely used. All components, however, have no negative values, and the orthogonality condition imposed on components also does not necessarily hold in the case of mass spectra. Because these methods allow negative values and PCA imposes an orthogonality condition, they are not suitable for separation of mass spectra. The proposed algorithm is based on probabilistic latent-component analysis (PLCA). PLCA is a statistical formulation of non-negative matrix factorization (NMF) using KL divergence. Because PLCA imposes the constraint of non-negativity but not orthogonality, the algorithm is effective for separating components of mass spectra. In addition, to estimate the components more accurately, a sparsity constraint is applied to PLCA for explosives detection. The main contribution is industrial application of the algorithm into an explosives-detection system. Results of an experimental evaluation of the algorithm with data obtained in a real railway station demonstrate that the proposed algorithm outperforms PCA and ICA. Also, results of calculation time demonstrate that the algorithm can work in real time.
Kazunori OKADA Takayuki SHIMAZU Akira FUJIKI Yoshiyuki FUJINO Amane MIURA
The Satellite/Terrestrial Integrated mobile Communication System (STICS), which allows terrestrial mobile phones to communicate directly through a satellite, has been studied [1]. Satellites are unaffected by the seismic activity that causes terrestrial damage, and therefore, the STICS can be expected to be a measure that ensures emergency call connection. This paper first describes the basic characteristics of call blocking rates of terrestrial mobile phone systems in areas where non-functional base stations are geographically clustered, as investigated through computer simulations that showed an increased call blocking rate as the number of non-functional base stations increased. Further simulations showed that restricting the use of the satellite system for emergency calls only ensures the STICS's capacity to transmit emergency communications; however, these simulations also revealed a weakness in the low channel utilization rate of the satellite system [2]. Therefore, in this paper, we propose increasing the channel utilization rate with a priority channel framework that divides the satellite channels between priority channels for emergency calls and non-priority channels that can be available for emergency or general use. Simulations of this priority channel framework showed that it increased the satellite system's channel utilization rate, while continuing to ensure emergency call connection [3]. These simulations showed that the STICS with a priority channel framework can provide efficient channel utilization and still be expected to provide a valuable secondary measure to ensure emergency communications in areas with clustered non-functional base stations during large-scale disasters.
Jaeseon HWANG Hyuk LIM Seunghun OH Byung-Tak LEE
In wireless LANs, wireless clients are associated with one of access points (APs) to obtain network connectivity, and the AP performs network traffic relay between the wired infrastructure and wireless clients. If a client with a low transmission rate is associated with an AP, the throughput performance of all the clients that are associated with the AP is significantly degraded because of the long channel usage time of the low-rate client. Therefore, it is important to select an appropriate AP when a new client joins the wireless LAN to prevent the performance degradation. In this paper, we propose a traffic control that determines the feasible data traffic from an AP to the clients on the basis of the trade-off relationship between the equal-throughput and equal-airtime traffic allocation policies. We then propose a network-wide association algorithm that allows a client to be associated with the AP that can provide the highest throughput improvement. Simulation results indicate that the proposed algorithm achieves the better aggregate throughput and throughput fairness performances in IEEE 802.11 WLANs.
Tetsuya OKUDA Yoichi TOMIOKA Hitoshi KITAZAWA
Object extraction and tracking in a video image is basic technology for many applications, such as video surveillance and robot vision. Many moving object extraction and tracking methods have been proposed. However, they fail when the scenes include illumination change or light reflection. For tracking the moving object robustly, we should consider not only the RGB values of input images but also the shape information of the objects. If the objects' shapes do not change suddenly, matching positions on the cost matrix of exclusive block matching are located nearly on a line. We propose a method for obtaining the correspondence of feature points by imposing a matching position constraint induced by the shape constancy. We demonstrate experimentally that the proposed method achieves robust tracking in various environments.
Shidang LI Chunguo LI Yongming HUANG Dongming WANG Luxi YANG
Considering worse-case channel uncertainties, we investigate the robust energy efficient (EE) beamforming design problem in a K-user multiple-input-single-output (MISO) interference channel. Our objective is to maximize the worse-case sum EE under individual transmit power constraints. In general, this fractional programming problem is NP-hard for the optimal solution. To obtain an insight into the problem, we first transform the original problem into its lower bound problem with max-min and fractional form by exploiting the relationship between the user rate and the minimum mean square error (MMSE) and using the min-max inequality. To make it tractable, we transform the problem of fractional form into a subtractive form by using the Dinkelbach transformation, and then propose an iterative algorithm using Lagrangian duality, which leads to the locally optimal solution. Simulation results demonstrate that our proposed robust EE beamforming scheme outperforms the conventional algorithm.
Naoya KOSAKA Ryota OGURA Gosuke OHASHI
Recently, Intelligent Transport Systems (ITS) are being researched and developed briskly. As a part of ITS, detecting vehicles from images taken by a camera loaded on a vehicle are conducted. From such backgrounds, authors have been conducting vehicle detection in nighttime. To evaluate the accuracy of this detection, gold standards of the detection are required. At present, gold standards are created manually, but manually detecting vehicles take time. Accordingly, a system which detects vehicles accurately without human help is needed to evaluate the accuracy of the vehicle detection in real time. Therefore the purpose of this study is to automatically detect vehicles in nighttime images, taken by an in-vehicle camera, with high accuracy in offline processing. To detect vehicles we focused on the brightness of the headlights and taillights, because it is difficult to detect vehicles from their shape in nighttime driving scenes. The method we propose uses Center Surround Extremas, called CenSurE for short, to detect blobs. CenSurE is a method that uses the difference in brightness between the lights and the surroundings. However, blobs obtained by CenSurE will also include objects other than headlights and taillights. For example, streetlights and delineators would be detected. To distinguish such blobs, they are tracked in inverse time and vehicles are detected using tags based on the characteristics of each object. Although every object appears from the same point in forward time process, each object appears from different places in images in inverse time processing, allowing it to track and tag blobs easily. To evaluate the effectiveness of this proposed method, experiment of detecting vehicles was conducted using nighttime driving scenes taken by a camera loaded on a vehicle. Experimental results of the proposed method were nearly equivalent to manual detection.
Asahi TAKAOKA Satoshi TAYU Shuichi UENO
A 2-directional orthogonal ray graph is an intersection graph of rightward rays (half-lines) and downward rays in the plane. We show a dynamic programming algorithm that solves the weighted dominating set problem in O(n3) time for 2-directional orthogonal ray graphs, where n is the number of vertices of a graph.
Shosuke SATO Masaharu NAKAGAWA Masahiro IWASAKI Fumihiko IMAMURA
In the case of a disaster such as an earthquake or a tsunami, the city, town, and village administration usually issues an evacuation advisory and other information through the Outdoor Public Address Speakers for the disaster reduction broadcasting system covering its area of jurisdiction. However, in areas those have previous experience of a disaster, people frequently voice the lack of audibility of the disaster reduction broadcast. In this research, we conducted a questionnaire survey on the residents in the central area of Ishinomaki City, Miyagi Prefecture, who are the victims of the Great East Japan Earthquake Disaster, on the audible quality of outdoor public address (PA) speakers of the disaster reduction broadcasting system so as to understand the current state of such broadcasts and to propose ideal methods of sending and receiving information at the time of a future disaster.
Tomotaka NAGASHIMA Makoto HASEGAWA Takuya MURAKAWA Tsuyoshi KONISHI
We investigate a quantization error improvement technique using a dual rail configuration for optical quantization. Our proposed optical quantization uses intensity-to-wavelength conversion based on soliton self-frequency shift and spectral compression based on self-phase modulation. However, some unfavorable input peak power regions exist due to stagnations of wavelength shift or distortions of spectral compression. These phenomena could induce a serious quantization error and degrade the effective number of bit (ENOB). In this work, we propose a quantization error improvement technique which can make up for the unfavorable input peak power regions. We experimentally verify the quantization error improvement effect by the proposed technique in 6 bit optical quantization. The estimated ENOB is improved from 5.35 bit to 5.66 bit. In addition, we examine the XPM influence between counter-propagating pulses at high sampling rate. Experimental results and numerical simulation show that the XPM influence is negligible under ∼40 GS/s conditions.
Lucas DE M. GUIMARÃES Jacir L. BORDIM Koji NAKANO
Directional communications have been considered as a feasible alternative to improve spatial division and throughput in mobile communication environments. In general, directional MAC protocols proposed in the literature rely on channel reservation based on control frames, such as RTS/CTS. Notwithstanding, channel reservation based on control frames increases latency and has an impact on the network throughput. The main contribution of this paper is to propose a channel reservation technique based on pulse/tone signals. The proposed scheme, termed directional pulse/tone channel reservation (DPTCR), allows for efficient channel reservation without resorting to control frames such as RTS and CTS. Theoretical and empirical results show that the proposed scheme has a low probability of failure while providing significant throughput gains. The results show that DPTCR is able to provide throughput improvement up to 158% higher as compared to traditional channel reservation employing RTS/CTS frames.
Perceptually optimized missing texture reconstruction via neighboring embedding (NE) is presented in this paper. The proposed method adopts the structural similarity (SSIM) index as a measure for representing texture reconstruction performance of missing areas. This provides a solution to the problem of previously reported methods not being able to perform perceptually optimized reconstruction. Furthermore, in the proposed method, a new scheme for selection of the known nearest neighbor patches for reconstruction of target patches including missing areas is introduced. Specifically, by monitoring the SSIM index observed by the proposed NE-based reconstruction algorithm, selection of known patches optimal for the reconstruction becomes feasible even if target patches include missing pixels. The above novel approaches enable successful reconstruction of missing areas. Experimental results show improvement of the proposed method over previously reported methods.
Jie SUN Lijian ZHOU Zhe-Ming LU Tingyuan NIE
In this Letter, a new iris recognition approach based on local Gabor orientation feature is proposed. On one hand, the iris feature extraction method using the traditional Gabor filters can cause time-consuming and high-feature dimension. On the other hand, we can find that the changes of original iris texture in angle and radial directions are more obvious than the other directions by observing the iris images. These changes in the preprocessed iris images are mainly reflected in vertical and horizontal directions. Therefore, the local directional Gabor filters are constructed to extract the horizontal and vertical texture characteristics of iris. First, the iris images are preprocessed by iris and eyelash location, iris segmentation, normalization and zooming. After analyzing the variety of iris texture and 2D-Gabor filters, we construct the local directional Gabor filters to extract the local Gabor features of iris. Then, the Gabor & Fisher features are obtained by Linear Discriminant Analysis (LDA). Finally, the nearest neighbor method is used to recognize the iris. Experimental results show that the proposed method has better iris recognition performance with less feature dimension and calculation time.
Sung Sik NAM Jeong Woo CHOI Sung Ho CHO
In this paper, a threshold-based I-Q diversity combining scheme for ultra-high frequency (UHF) radio frequency identification (RFID) readers with a quadrature receiver is proposed in the aspect of improving the tag detection performance. In addition, the performance of the proposed scheme is evaluated as the closed-form expressions. In particular, its statistical characteristics are detailed and its performance is compared to that of conventional schemes over independent and identically distributed Rician fading conditions in terms of average signal-to-noise ratio (SNR), bit error rate (BER), and the average number of required combining process. Numerical results indicate that the proposed scheme enables processing power control through threshold control while meeting the required quality of service compared to conventional schemes.
Hikofumi SUZUKI Shinichi KARASAWA David ASANO Yasushi FUWA
A regional protection system based on a wireless Ad-Hoc network has been in operation since 2008 in Shiojiri City, Japan. Wireless terminals transmit data packets to a server via transponders situated around the city. In this paper, a new routing algorithm that takes into account the level of congestion of the transponders is proposed. Using computer simulations, the proposed algorithm is shown to reduce the packet loss rate compared to the previous algorithm which is based on minimization of the number of hops to the server. Also, the proposed algorithm is shown be have almost the same packet loss rate as the best routing decisions obtained by an exhaustive search. Furthermore, the simulations used recreate the actual movement of terminals, so the results show what will happen in a realistic environment.
Jun JIANG Di WU Qizhi TENG Xiaohai HE Mingliang GAO
Collective motion stems from the coordinated behaviors among individuals of crowds, and has attracted growing interest from the physics and computer vision communities. Collectiveness is a metric of the degree to which the state of crowd motion is ordered or synchronized. In this letter, we present a scheme to measure collectiveness via link prediction. Toward this aim, we propose a similarity index called superposed random walk with restarts (SRWR) and construct a novel collectiveness descriptor using the SRWR index and the Laplacian spectrum of a network. Experiments show that our approach gives promising results in real-world crowd scenes, and performs better than the state-of-the-art methods.