In this letter, a new analysis technique for finding the convexity of iterative maximum likelihood (IML) methods for direction-of-arrival (DOA) estimation is presented. The proposed technique can pave the way in avoiding the local solution when the IML methods are utilized to estimate DOA, especially for the scenarios of array with large antennas. From the derivation, we can see that as long as the initial DOA belongs to the approximate convex range estimated by our proposed technique, the IML methods can estimate the DOA very well without entering into local minima, which is particularly true for the large arrays. Furthermore, numerical experiments show us the results tallied well with our theoretical derivations.

We propose simple but efficient encapsulation architecture. In the architecture, clients can better decode Extensible Markup Language (XML) based service information for TV contents with schema digest. Our experimental results show the superiority of the proposed architecture by comparing the compression ratios and decoding times of the proposed architecture and the existing architectures.

The concept of massive multiple input multiple output (MIMO) has recently been proposed. It has been reported that using linear or planar arrays to implement massive MIMO yields narrow beams that can mitigate the interference signal even if interference cancellation techniques such as zero forcing (ZF) are not employed. In this work, we investigate the interference reduction performance achieved by circular array implemented massive MIMO in a real micro cell environment. The channel state information (CSI) is obtained by using a wideband channel sounder with cylindrical 96-element array in the 2-GHz band in an urban area. Circular arrays have much larger beamwidth and sidelobe level than linear arrays. In this paper, when considering the cylindrical array, the interference reduction performance between ZF and maximum ratio combining is compared when one desired user exists in the micro cell while the interference user moves around the adjacent cell. We show that ZF is essential for reducing the interference from the adjacent cell in the circular array based massive MIMO. The required number of antennas in the vertical and horizontal planes for the interference reduction is evaluated, in order to simplify the burden of signal processing for the ZF algorithm in massive MIMO. Because there are elements with low signal to noise power ratio (SNR) when considering cylindrical 96-element array, it is shown that the degradation of the signal to noise plus interference power ratio (SINR) when the number of antennas is reduced is smaller than that by ideal antenna gain reduction with a linear array. Moreover, we show that the appropriate antennas should be selected when a limited number of antennas is assumed, because the dominant waves arrive from certain specific directions.

This paper presents an automatic method to track soccer players in soccer video recorded from a single camera where the occurrence of pan-tilt-zoom can take place. The automatic object tracking is intended to support texture extraction in a free viewpoint video authoring application for soccer video. To ensure that the identity of the tracked object can be correctly obtained, background segmentation is performed and automatically removes commercial billboards whenever it overlaps with the soccer player. Next, object tracking is performed by an attribute matching algorithm for all objects in the temporal domain to find and maintain the correlation of the detected objects. The attribute matching process finds the best match between two objects in different frames according to their pre-determined attributes: position, size, dominant color and motion information. Utilizing these attributes, the experimental results show that the tracking process can handle occlusion problems such as occlusion involving more than three objects and occluded objects with similar color and moving direction, as well as correctly identify objects in the presence of camera movements.

Range estimation based on time of arrival (TOA) is becoming increasingly important with the emergence of location-based applications and next-generation location-aware wireless sensor networks. For radar and positioning systems, chirp signals have primarily been used due to their inborn signal properties for decomposition. Recently, chirp signal has been selected as the baseline standard of ISO/IEC 24730-5 and IEEE 802.15.4a in 2.4GHz, organized for the development of a real-time accurate positioning system. When estimating the TOA of the received signals in multipath channel, the super-resolution algorithms, known as estimation of signal parameters via rotational invariance techniques (ESPRIT), multiple signal classification method (MUSIC) and matrix pencil (MP), are preferred due to their superiority in decomposing the received paths. For the super-resolution algorithm-based TOA estimation of chirp signals, the received chirp signals must be transformed into a sinusoidal form for the super-resolution algorithm. The conventional transformation, the de-chirping technique, changes the received chirp signals to sinusoids so that the super-resolution algorithms can estimate the TOA of the received chirp signals through a frequency estimation of the transformed sinusoids. In practice, the initial timing synchronizer at receiver tries to find the maximum energy point at which the received paths are overlapped maximally. At this time, the conventional de-chirping yields lossy transformed sinusoids for the first arrival path from the received samples synchronized to the maximum energy point. The first arrival path is not involved in the transformed sinusoids with the conventional transformation, leading to performance degradation. However, the proposed energy efficient time-frequency transformation achieves lossless transformation by using the extended reference chirp signals. The proposed transformation is incorporated with MUSIC-based TOA estimation. The effectiveness of the proposed transformation is analyzed and verified. The root mean squared error (RMSE) of the proposed transformation is compared with Cramer-Rao lower bound and those for the conventional algorithms such as super-resolution, ESPRIT and matrix pencil algorithm in multipath channel.

Local governments usually designed disaster response plan by themselves in order to overcome disasters. In previous research, we developed the effective analysis method for disaster response which is “BFD (Business Flow Diagram)”. In this research, in order to improve effect of BFD analysis, we designed and developed WBS Manager focusing on the process of WBS development which is a part of BFD analysis, because WBS development is fundamental process of BFD method. Especially we developed WBS Manager as web-based application, and implemented it to actual studies at local governments in planning their disaster response operations. In this paper, we introduced the overview of WBS Manager.

Many previous studies on image quality assessment of 3D still images or video clips have been conducted. In particular, it is important to know the region in which assessors are interested or on which they focus in images or video clips, as represented by the ROI (Region of Interest). For multi-view 3D images, it is obvious that there are a number of viewpoints; however, it is not clear whether assessors focus on objects or background regions. It is also not clear on what assessors focus depending on whether the background region is colored or gray scale. Furthermore, while case studies on coded degradation in 2D or binocular stereoscopic videos have been conducted, no such case studies on multi-view 3D videos exist, and therefore, no results are available for coded degradation according to the object or background region in multi-view 3D images. In addition, in the case where the background region is gray scale or not, it was not revealed that there were affection for gaze point environment of assessors and subjective image quality. In this study, we conducted experiments on the subjective evaluation of the assessor in the case of coded degradation by JPEG coding of the background or object or both in 3D CG images using an eight viewpoint parallax barrier method. Then, we analyzed the results statistically and classified the evaluation scores using an SVM.

The iterative random subdivision of rectangles is used as a generation model of networks in physics, computer science, and urban planning. However, these researches were independent. We consider some relations in them, and derive fundamental properties for the average lifetime depending on birth-time and the balanced distribution of rectangle faces.

In this letter, a local pattern coding scheme is proposed to reduce the dimensionality of feature vectors in the local ternary pattern. The proposed method encodes the ternary patterns into a binary pattern by clustering similar ternary patterns. The experimental results show that the proposed method outperforms the previous methods.

Much research which has shown the usage of social ties could improve the location predictive performance, but as the strength of social ties is varying constantly with time, using the movement data of user's close friends at different times could obtain a better predictive performance. A hybrid Markov location prediction algorithm based on dynamic social ties is presented. The time is divided by the absolute time (week) to mine the long-term changing trend of users' social ties, and then the movements of each week are projected to the workdays and weekends to find the changes of the social circle in different time slices. The segmented friends' movements are compared to the history of the user with our modified cross-sample entropy to discover the individuals who have the relatively high similarity with the user in different time intervals. Finally, the user's historical movement data and his friends' movements at different times which are assigned with the similarity weights are combined to build the hybrid Markov model. The experiments based on a real location-based social network dataset show the hybrid Markov location prediction algorithm could improve 15% predictive accuracy compared with the location prediction algorithms that consider the global strength of social ties.

At present, wireless local area networks (WLANs) based on IEEE802.11 are widely deployed in both private premises and public areas. In a public environment offering several access points (APs), a station (STA) needs to choose which AP to associate with. In this paper, we propose a distributed association control scheme with user guidance to increase users' utility based on uplink and downlink throughputs of individual stations. As part of the scheme, we also present a simple throughput estimation method that considers physical data rate, traffic demand, and frame length in both uplink and downlink. Basically, in the proposed scheme, an AP selects a user and suggests that the user moves to another AP if certain conditions are met. The user then decides whether to accept the suggestion or not in a self-interested manner or in a voluntary manner for the benefit of all users including the user's own self. Through simulations under this condition, we confirm that our distributed association control scheme can improve user utility and fairness even though the channel quality of the new AP is unknown in advance.

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.

Currently, many operators worldwide are deploying Long Term Evolution (LTE) to provide much faster access with lower latency and higher efficiency than its predecessors 3G and 3.5G. Meanwhile, the service rollout of LTE-Advanced, which is an evolution of LTE and a “true 4G” mobile broadband, is being underway to further enhance LTE performance. However, the anticipated challenges of the next decade (2020s) are so tremendous and diverse that there is a vastly increased need for a new generation mobile communications system with even further enhanced capabilities and new functionalities, namely a fifth generation (5G) system. Envisioning the development of a 5G system by 2020, at DOCOMO we started studies on future radio access as early as 2010, just after the launch of LTE service. The aim at that time was to anticipate the future user needs and the requirements of 10 years later (2020s) in order to identify the right concept and radio access technologies for the next generation system. The identified 5G concept consists of an efficient integration of existing spectrum bands for current cellular mobile and future new spectrum bands including higher frequency bands, e.g., millimeter wave, with a set of spectrum specific and spectrum agnostic technologies. Since a few years ago, we have been conducting several proof-of-concept activities and investigations on our 5G concept and its key technologies, including the development of a 5G real-time simulator, experimental trials of a wide range of frequency bands and technologies and channel measurements for higher frequency bands. In this paper, we introduce an overview of our views on the requirements, concept and promising technologies for 5G radio access, in addition to our ongoing activities for paving the way toward the realization of 5G by 2020.

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.

Harn and Lin proposed an algorithm to detect and identify cheaters in Shamir's secret sharing scheme in the journal Designs, Codes and Cryptography, 2009. In particular, their algorithm for cheater identification is inefficient. We point out that some of their conditions for cheater detection and identification essentially follow from those on error detection/correction of Reed-Solomon codes, which have efficient decoding algorithms, while some other presented conditions turn out to be incorrect. The extended and improved version of the above mentioned scheme was recently presented at the conference International Computer Symposium 2012 (and the journal version appeared in the journal IET Information Security). The new scheme, which is ideal (i.e. the share size is equal to that of the secret), attempts to identify cheaters from minimal number of shares (i.e. the threshold of them). We show that the proposed cheater identification is impossible using the arguments from coding theory.

Open-loop (OL) transmit diversity is more subject to the influence of channel estimation error than closed-loop (CL) transmit diversity, although it has the merit of providing better performance in fast Doppler frequency environments because it doesn't require a feedback signal. This paper proposes an OL transmit diversity scheme combined with intra-subframe frequency hopping (FH) and iterative decision-feedback channel estimation (DFCE) in a shared channel for discrete Fourier transform (DFT)-precoded orthogonal frequency division multiple access (OFDMA). We apply intra-subframe FH to OL transmit diversity to mitigate the reduction in the diversity gain under high fading correlation conditions among antennas and iterative DFCE to improve the channel estimation accuracy. Computer simulation results show that the required average received signal-to-noise power ratio at the average block error rate (BLER) of 10-2 of the space-time block code (STBC) with intra-subframe FH is reduced to within approximately 0.8dB compared to codebook-based CL transmit diversity when using iterative DFCE at the maximum Doppler frequency of fD =5.55Hz. Moreover, it is shown that STBC with intra-subframe FH and iterative DFCE achieves much better BLER performance compared to CL transmit diversity when fD is higher than approximately 30Hz since the tracking ability of the latter degrades due to the fast fading variation in its feedback loop.

The expressions for the reset noise in capacitive-transimpedance-amplifier (CTIA) readout circuits are theoretically derived and confirmed experimentally. The contributions to the reset noise from the thermal current and amplifier noise are considered. The thermal reset noise is found to depend only on the feedback capacitance among the circuit parameters.

In these days, recognizing a user personality is an important issue in order to support various personalized services. Besides the conventional phone usage such as call logs, SMS logs and application usages, smart phones can gather the behavior of users by polling various embedded sensors such as GPS sensors. In this paper, we focus on how to predict user attitude based on GPS log data by applying location clustering techniques and extracting features from the location clusters. Through the evaluation with one month-long GPS log data, it is observed that the location-based features, such as number of clusters and coverage of clusters, are correlated with user attitude to some extent. Especially, when SVM is used as a classifier for predicting the dichotomy of user attitudes of MBTI, over 90% F-measure is achieved.