The separation of signals with temporal structure from mixed sources is a challenging problem in signal processing. For this problem, blind source extraction (BSE) is more suitable than blind source separation (BSS) because it has lower computation cost. Nowadays many BSE algorithms can be used to extract signals with temporal structure. However, some of them are not robust because they are too dependent on the estimation precision of time delay; some others need to choose parameters before extracting, which means that arbitrariness can't be avoided. In order to solve the above problems, we propose a robust source extraction algorithm whose performance doesn't rely on the choice of parameters. The algorithm is realized by maximizing the objective function that we develop based on the non-Gaussianity and the temporal structure of source signals. Furthermore, we analyze the stability of the algorithm. Simulation results show that the algorithm can extract the desired signal from large numbers of observed sensor signals and is very robust to error in the estimation of time delay.
Sentence similarity computation is an increasingly important task in applications of natural language processing such as information retrieval, machine translation, text summarization and so on. From the viewpoint of information theory, the essential attribute of natural language is that the carrier of information and the capacity of information can be measured by information content which is already successfully used for word similarity computation in simple ways. Existing sentence similarity methods don't emphasize the information contained by the sentence, and the complicated models they employ often need using empirical parameters or training parameters. This paper presents a fully unsupervised computational model of sentence semantic similarity. It is also a simply and straightforward model that neither needs any empirical parameter nor rely on other NLP tools. The method can obtain state-of-the-art experimental results which show that sentence similarity evaluated by the model is closer to human judgment than multiple competing baselines. The paper also tests the proposed model on the influence of external corpus, the performance of various sizes of the semantic net, and the relationship between efficiency and accuracy.
Ali BOZBEY Yuma KITA Kyohei KAMIYA Misaki KOZAKA Masamitsu TANAKA Takekazu ISHIDA Akira FUJIMAKI
One of the fundamental problems in many-pixel detectors implemented in cryogenics environments is the number of bias and read-out wires. If one targets a megapixel range detector, number of wires should be significantly reduced. One possibility is that the detectors are serially connected and biased by using only one line and read-out is accomplished by on-chip circuitry. In addition to the number of pixels, the detectors should have fast response times, low dead times, high sensitivities, low inter-pixel crosstalk and ability to respond to simultaneous irradiations to individual pixels for practical purposes. We have developed an equivalent circuit model for a serially connected superconducting strip line detector (SSLD) array together with the read-out electronics. In the model we take into account the capacitive effects due to the ground plane under the detector, effects of the shunt resistors fabricated under the SSLD layer, low pass filters placed between the individual pixels that enable individual operation of each pixel and series resistors that prevents the DC bias current flowing to the read-out electronics as well as adjust the time constants of the inductive SSLD loop. We explain the results of investigation of the following parameters: Crosstalk between the neighbor pixels, response to simultaneous irradiation, dead times, L/R time constants, low pass filters, and integration with the SFQ front-end circuit. Based on the simulation results, we show that SSLDs are promising devices for detecting a wide range of incident radiation such as neurons, X-rays and THz waves in many-pixel configurations.
We present a hierarchical replicated state machine (H-RSM) and its corresponding consensus protocol D-Paxos for replication across multiple data centers in the cloud. Our H-RSM is based on the idea of parallel processing and aims to improve resource utilization. We detail D-Paxos and theoretically prove that D-Paxos implements an H-RSM. With batching and logical pipelining, D-Paxos efficiently utilizes the idle time caused by high-latency message transmission in a wide-area network and available bandwidth in a local-area network. Experiments show that D-Paxos provides higher throughput and better scalability than other Paxos variants for replication across multiple data centers. To predict the optimal batch sizes when D-Paxos reaches its maximum throughput, an analytical model is developed theoretically and validated experimentally.
Yuya SUGIMOTO Shigeki MIYABE Takeshi YAMADA Shoji MAKINO Biing-Hwang JUANG
MUltiple SIgnal Classification (MUSIC) is a standard technique for direction of arrival (DOA) estimation with high resolution. However, MUSIC cannot estimate DOAs accurately in the case of underdetermined conditions, where the number of sources exceeds the number of microphones. To overcome this drawback, an extension of MUSIC using cumulants called 2q-MUSIC has been proposed, but this method greatly suffers from the variance of the statistics, given as the temporal mean of the observation process, and requires long observation. In this paper, we propose a new approach for extending MUSIC that exploits higher-order moments of the signal for the underdetermined DOA estimation with smaller variance. We propose an estimation algorithm that nonlinearly maps the observed signal onto a space with expanded dimensionality and conducts MUSIC-based correlation analysis in the expanded space. Since the dimensionality of the noise subspace is increased by the mapping, the proposed method enables the estimation of DOAs in the case of underdetermined conditions. Furthermore, we describe the class of mapping that allows us to analyze the higher-order moments of the observed signal in the original space. We compare 2q-MUSIC and the proposed method through an experiment assuming that the true number of sources is known as prior information to evaluate in terms of the bias-variance tradeoff of the statistics and computational complexity. The results clarify that the proposed method has advantages for both computational complexity and estimation accuracy in short-time analysis, i.e., the time duration of the analyzed data is short.
In this study we investigate the synchronization of relaxation oscillators having individual differences by using non-periodic signal injection. When a common non-periodic signal is injected into the relaxation oscillators, the oscillators exhibit synchronization phenomena. Such synchronization phenomena can be classified as injection locking. We also consider the relation between the synchronization state and the individual difference. Further, we pay attention to the effect of the fluctuation range of the non-periodic injected signal. When the fluctuation range is wide, we confirm that the synchronization range increases if the individual difference is small.
Tomoya KAWAKAMI Yoshimasa ISHI Tomoki YOSHIHISA Yuuichi TERANISHI
In the future Internet of Things/M2M network, enormous amounts of data generated from sensors must be processed and utilized by cloud applications. In recent years, sensor data stream delivery, which collects and sends sensor data periodically, has been attracting great attention. As for sensor data stream delivery, the receivers have different delivery cycle requirements depending on the applications or situations. In this paper, we propose a sensor data stream delivery method to accommodate heterogeneous cycles on the cloud. The proposed method uses distributed hashing to determine relay nodes on the cloud and construct delivery paths autonomously. We evaluate the effectiveness of the proposed method in simulations. The simulation results show that the proposed method halves the maximum load of nodes compared to the baseline methods and achieves high load balancing.
Huan HAO Huali WANG Naveed UR REHMAN Hui TIAN
The dyadic filter bank property of multivariate empirical mode decomposition (MEMD) for white Gaussian noise (WGN) is well established. In order to investigate the way MEMD behaves in the presence of fractional Gaussian noise (fGn), we conduct thorough numerical experiments for MEMD for fGn inputs. It turns out that similar to WGN, MEMD follows dyadic filter bank structure for fGn inputs, which is more stable than empirical mode decomposition (EMD) regardless of the Hurst exponent. Moreover, the estimation of the Hurst exponent of fGn contaminated with different kinds of signals is also presented via MEMD in this work.
This article proposes a versatile model of a multiservice queueing system with elastic traffic. The model can provide a basis for an analysis of telecommunications and computer network systems, internet network systems in particular. The advantage of the proposed approach is a possibility of a determination of delays in network nodes for a number of selected classes of calls offered in modern telecommunications networks.
Cong Minh DINH Hyung Jeong YANG Guee Sang LEE Soo Hyung KIM
In recent years, optical music recognition (OMR) has been extensively developed, particularly for use with mobile devices that require fast processing to recognize and play live the notes in images captured from sheet music. However, most techniques that have been developed thus far have focused on playing back instrumental music and have ignored the importance of lyric extraction, which is time consuming and affects the accuracy of the OMR tools. The text of the lyrics adds complexity to the page layout, particularly when lyrics touch or overlap musical symbols, in which case it is very difficult to separate them from each other. In addition, the distortion that appears in captured musical images makes the lyric lines curved or skewed, making the lyric extraction problem more complicated. This paper proposes a new approach in which lyrics are detected and extracted quickly and effectively. First, in order to resolve the distortion problem, the image is undistorted by a method using information of stave lines and bar lines. Then, through the use of a frequency count method and heuristic rules based on projection, the lyric areas are extracted, the cases where symbols touch the lyrics are resolved, and most of the information from the musical notation is kept even when the lyrics and music notes are overlapping. Our algorithm demonstrated a short processing time and remarkable accuracy on two test datasets of images of printed Korean musical scores: the first set included three hundred scanned musical images; the second set had two hundred musical images that were captured by a digital camera.
Bima Sena Bayu DEWANTARA Jun MIURA
This paper proposes an appearance-based novel descriptor for estimating head orientation. Our descriptor is inspired by the Weber-based feature, which has been successfully implemented for robust texture analysis, and the gradient which performs well for shape analysis. To further enhance the orientation differences, we combine them with an analysis of the intensity deviation. The position of a pixel and its intrinsic intensity are also considered. All features are then composed as a feature vector of a pixel. The information carried by each pixel is combined using a covariance matrix to alleviate the influence caused by rotations and illumination. As the result, our descriptor is compact and works at high speed. We also apply a weighting scheme, called Block Importance Feature using Genetic Algorithm (BIF-GA), to improve the performance of our descriptor by selecting and accentuating the important blocks. Experiments on three head pose databases demonstrate that the proposed method outperforms the current state-of-the-art methods. Also, we can extend the proposed method by combining it with a head detection and tracking system to enable it to estimate human head orientation in real applications.
Nobutaro SHIBATA Yoshinori GOTOH Takako ISHIHARA
Two-port SRAMs are frequently installed in gate-array VLSIs to implement smart functions. This paper presents a new high-density 10T CMOS base cell for gate-array-based two-port SRAM applications. Using the single base cell alone, we can implement a two-port memory cell whose bitline contacts are shared with the memory cell adjacent to one of two dedicated sides, resulting in greatly reduced parasitic capacitance in bitlines. To throw light on the total performance derived from the base cell, a plain two-port SRAM macro was designed and fabricated with a 0.35-µm low cost, logic process. Each of two 10-bit power-saved address decoders was formed with 36% fewer base cells by employing complex gates and a subdecoder. The new sense amplifier with a complementary sensing scheme had a fine sensitivity of 35 mVpp, and so we successfully reduced the required read bitline signal from 250 to 70 mVpp. With the macro with 1024 memory cells per bitline, the address access time under typical conditions of a 2.5-V power supply and 25°C was 4.0 ns (equal to that obtained with full-custom style design) and the power consumption at 200-MHz simultaneous operations of two ports was 6.7 mW for an I/O-data width of 1 bit.
Fine-grained visual categorization (FGVC) has drawn increasing attention as an emerging research field in recent years. In contrast to generic-domain visual recognition, FGVC is characterized by high intra-class and subtle inter-class variations. To distinguish conceptually and visually similar categories, highly discriminative visual features must be extracted. Moreover, FGVC has highly specialized and task-specific nature. It is not always easy to obtain a sufficiently large-scale training dataset. Therefore, the key to success in practical FGVC systems is to efficiently exploit discriminative features from a limited number of training examples. In this paper, we propose an efficient two-step dimensionality compression method to derive compact middle-level part-based features. To do this, we compare both space-first and feature-first convolution schemes and investigate their effectiveness. Our approach is based on simple linear algebra and analytic solutions, and is highly scalable compared with the current one-vs-one or one-vs-all approach, making it possible to quickly train middle-level features from a number of pairwise part regions. We experimentally show the effectiveness of our method using the standard Caltech-Birds and Stanford-Cars datasets.
Connection Service Providers (CSP) are wishing to increase their Return on Investment (ROI) by utilizing the data assets generated by tracking subscriber behaviors. This results in the ability to apply personalized policies, monitor and control the service traffic to subscribers and gain more revenue through the usage of subscriber data with ad networks. In this paper, a system is proposed to monitor and analyze the Internet access of the subscribers of a regional SP in order to classify the subscribers into interest categories from the Interactive Advertising Bureau (IAB) categories. The study employs the categorization engine to build category vectors for all individuals using Internet services through the subscription. The proposal makes it easy to detect changes in the interests of individuals/subscribers over time.
A non-photorealistic rendering method creates oil-film-like images, expressed with colorful, smooth curves similar to the oil films generated on the surface of glass or water, from color photo images. The proposed method generates oil-film-like images through iterative processing between a bilateral infra-envelope filter and an unsharp mask. In order to verify the effectiveness of the proposed method, tests using a Lena image were performed, and visual assessment of oil-film-like images was conducted for changes in appearance as the parameter values of the proposed method were varied. As a result of tests, the optimal value of parameters was found for generating oil-film patterns.
A non-linear extension of generalized hyperplane approximation (GHA) method is introduced in this letter. Although GHA achieved a high-confidence result in motion parameter estimation by utilizing the supervised learning scheme in histogram of oriented gradient (HOG) feature space, it still has unstable convergence range because it approximates the non-linear function of regression from the feature space to the motion parameter space as a linear plane. To extend GHA into a non-linear regression for larger convergence range, we derive theoretical equations and verify this extension's effectiveness and efficiency over GHA by experimental results.
Jaeyong JU Taeyup SONG Bonhwa KU Hanseok KO
Key frame based video summarization has emerged as an important task for efficient video data management. This paper proposes a novel technique for key frame extraction based on chaos theory and color information. By applying chaos theory, a large content change between frames becomes more chaos-like and results in a more complex fractal trajectory in phase space. By exploiting the fractality measured in the phase space between frames, it is possible to evaluate inter-frame content changes invariant to effects of fades and illumination change. In addition to this measure, the color histogram-based measure is also used to complement the chaos-based measure which is sensitive to changes of camera /object motion. By comparing the last key frame with the current frame based on the proposed frame difference measure combining these two complementary measures, the key frames are robustly selected even under presence of video fades, changes of illumination, and camera/object motion. The experimental results demonstrate its effectiveness with significant improvement over the conventional method.
Based on the completeness of the real-valued discrete Gabor transform, a new biorthogonal relationship between analysis window and synthesis window is derived and a fast algorithm for computing the analysis window is presented for any given synthesis window. The new biorthogonal relationship can be expressed as a linear equation set, which can be separated into a certain number of independent sub-equation sets, where each of them can be fast and independently solved by using convolution operations and FFT to obtain the analysis window for any given synthesis window. Computational complexity analysis and comparison indicate that the proposed algorithm can save a considerable amount of computation and is more efficient than the existing algorithms.
Fan YANG Qinghai YANG Kyung Sup KWAK
In this paper, by jointly considering power allocation and network selection, we address the energy efficiency maximization problem in dynamic and heterogeneous wireless networks, where user equipments are typically equipped with multi-homing capability. In order to effectively deal with the dynamics of heterogeneous wireless networks, a stochastic optimization problem is formulated that optimizes the long-term energy efficiency under the constraints of system stability, peak power consumption and average transmission rate. By adopting the parametric approach and Lyapunov optimization, we derive an equivalent optimization problem out of the original problem and then investigate its optimal resource allocation. Then, to reduce the computational complexity, a suboptimal resource allocation algorithm is proposed based on relaxed optimization, which adapts to time-varying channels and stochastic traffic without requiring relevant a priori knowledge. The simulation results demonstrate the theoretical analysis and validate the adaptiveness of our proposed algorithm.
Go MATSUKAWA Yuta KIMI Shuhei YOSHIDA Shintaro IZUMI Hiroshi KAWAGUCHI Masahiko YOSHIMOTO
As technology nodes continue to shrink, the impact of radiation-induced soft error on processor reliability increases. Estimation of processor reliability and identification of vulnerable flip-flops requires accurate soft error rate (SER) analysis techniques. This paper presents a proposal for a soft error propagation analysis technique. We specifically examine single event upset (SEU) occurring at a flip-flop in sequential circuits. When SEUs propagate in sequential circuits, the faults can be masked temporally and logically. Conventional soft error propagation analysis techniques do not consider error convergent timing on re-convergent paths. The proposed technique can analyze soft error propagation while considering error-convergent timing on a re-convergent path by combinational analysis of temporal and logical effects. The proposed technique also considers the case in which the temporal masking is disabled with an enable signal of the erroneous flip-flop negated. Experimental results show that the proposed technique improves inaccuracy by 70.5%, on average, compared with conventional techniques using ITC 99 and ISCAS 89 benchmark circuits when the enable probability is 1/3, while the runtime overhead is only 1.7% on average.