Heart disease is one of the major causes of death in many advanced countries. For prevention or treatment of heart disease, getting an early diagnosis from a long time period of electrocardiogram (ECG) examination is necessary. However, it could be a large burden on medical experts to analyze this large amount of data. To reduce the burden and support the analysis, this paper proposes an arrhythmia detection method based on a deformable part model, which absorbs individual variation of ECG waveform and enables the detection of various arrhythmias. Moreover, to detect the arrhythmia in low processing delay, the proposed method only utilizes time domain features. In an experimental result, the proposed method achieved 0.91 F-measure for arrhythmia detection.

This paper describes the background noise estimation technique of the tensor product expansion with absolute error (TPE-AE) to estimate multiple sources. The electroencephalogram (EEG) signal produced by the saccadic eye movement is adopted to analyze relationship between a brain function and a human activity. The electrooculogram (EOG) generated by eye movements yields significant problems for the EEG analysis. The denoising of EOG artifacts is important task to perform an accurate analysis. In this paper, the two types of TPE-AE are proposed to estimates EOG and other components in EEG during eye movement. One technique estimates two outer products using median filter based TPE-AE. The another technique uses a reference signal to separate the two sources. We show that the proposed method is effective to estimate and separate two sources in EEG.

This paper presents convex filter networks that are obtained from extensions of morphological filters. The proposed filter network consists of a convex and concave filter that are extensions of the dilation and erosion of mathematical morphology with the maxout activation function. Maxout can approximate arbitrary convex functions as piecewise linear functions, including the max function. The class of the convex function hence includes the morphological dilation and can be trained for specific image processing tasks. In this paper, the closing filter is extended to a convex-concave filter network with maxout. The convex-concave filter is trained by the stochastic gradient method for noise and mask removal. The examples of noise and mask removal show that the convex-concave filter can obtain a recovered image, whose quality is comparable to inpainting by using the total variation minimization with reduced computational cost without mask information of the corrupted pixels.

This paper proposes a new inverse tone mapping operator (TMO) with estimated parameters. The proposed inverse TMO is based on Reinhard's global operator which is a well-known TMO. Inverse TM operations have two applications: generating an HDR image from an existing LDR one, and reconstructing an original HDR image from the mapped LDR image. The proposed one can be applied to both applications. In the latter application, two parameters used in Reinhard's TMO, i.e. the key value α regarding brightness of a mapped LDR one and the geometric mean $\overline{L}_w$ of an original HDR one, are generally required for carrying out the Reinhard based inverse TMO. In this paper, we show that it is possible to estimate $\overline{L}_w$ from α under some conditions, while α can be also estimated from $\overline{L}_w$, so that a new inverse TMO with estimated parameter is proposed. Experimental results show that the proposed method outperforms conventional ones for both applications, in terms of high structural similarities and low computational costs.

Preserving hue is an important issue for color image processing. In order to preserve hue, color image processing is often carried out in HSI or HSV color space which is translated from RGB color space. Transforming from RGB color space to another color space and processing in this space usually generate gamut problem. We propose image enhancement methods which conserve hue and preserve the range (gamut) of the R, G, B channels in this paper. First we show an intensity processing method while preserving hue and saturation. In this method, arbitrary gray-scale transformation functions can be applied to the intensity component. Next, a saturation processing method while preserving hue and intensity is proposed. Arbitrary gray-scale transform methods can be also applied to the saturation component. Two processing methods are completely independent. Therefore, two methods are easily combined by applying two processing methods in succession. The combination method realizes the hue-preserving color image processing with a high arbitrariness without gamut problem. Furthermore, the concrete enhancement algorithm based on the proposed processing methods is proposed. Numerical results confirm our theoretical results and show that our processing algorithm performs much better than the conventional hue-preserving methods.

High-dynamic-range imaging (HDRI) technologies aim to extend the dynamic range of luminance against the limitation of camera sensors. Irradiance information of a scene can be reconstructed by fusing multiple low-dynamic-range (LDR) images with different exposures. The key issue is removing ghost artifacts caused by motion of moving objects and handheld cameras. This paper proposes a robust ghost-free HDRI algorithm by visual salience based bilateral motion detection and stack extension based exposure fusion. For ghost areas detection, visual salience is introduced to measure the differences between multiple images; bilateral motion detection is employed to improve the accuracy of labeling motion areas. For exposure fusion, the proposed algorithm reduces the discontinuity of brightness by stack extension and rejects the information of ghost areas to avoid artifacts via fusion masks. Experiment results show that the proposed algorithm can remove ghost artifacts accurately for both static and handheld cameras, remain robust to scenes with complex motion and keep low complexity over recent advances including rank minimization based method and patch based method by 63.6% and 20.4% time savings averagely.

Establishing local visual correspondences between images taken under different conditions is an important and challenging task in computer vision. A common solution for this task is detecting keypoints in images and then matching the keypoints with a feature descriptor. This paper proposes a robust and low-dimensional local feature descriptor named Adaptively Integrated Gradient and Intensity Feature (AIGIF). The proposed AIGIF descriptor partitions the support region surrounding each keypoint into sub-regions, and classifies the sub-regions into two categories: edge-dominated ones and smoothness-dominated ones. For edge-dominated sub-regions, gradient magnitude and orientation features are extracted; for smoothness-dominated sub-regions, intensity feature is extracted. The gradient and intensity features are integrated to generate the descriptor. Experiments on image matching were conducted to evaluate performances of the proposed AIGIF. Compared with SIFT, the proposed AIGIF achieves 75% reduction of feature dimension (from 128 bytes to 32 bytes); compared with SURF, the proposed AIGIF achieves 87.5% reduction of feature dimension (from 256 bytes to 32 bytes); compared with the state-of-the-art ORB descriptor which has the same feature dimension with AIGIF, AIGIF achieves higher accuracy and robustness. In summary, the AIGIF combines the advantages of gradient feature and intensity feature, and achieves relatively high accuracy and robustness with low feature dimension.

The ball state tracking and detection technology plays a significant role in volleyball game analysis, whose performance is limited due to the challenges include: 1) the inaccurate ball trajectory; 2) multiple numbers of the ball event category; 3) the large intra-class difference of one event. With the goal of broadcasting supporting for volleyball games which requires a real time system, this paper proposes a ball state based parallel ball tracking and event detection method based on a sequential estimation method such as particle filter. This method employs a parallel process of the 3D ball tracking and the event detection so that it is friendly for real time system implementation. The 3D ball tracking process uses the same models with the past work [8]. For event detection process, a ball event change estimation based multiple system model, a past trajectory referred hit point likelihood and a court-line distance feature based event type detection are proposed. First, the multiple system model transits the ball event state, which consists the event starting time and the event type, through three models dealing with different ball motion situations in the volleyball game, such as the motion keeping and changing. The mixture of these models is decided by estimation of the ball event change estimation. Secondly, the past trajectory referred hit point likelihood avoids the processing time delay between the ball tracking and the event detection process by evaluating the probability of the ball being hit at certain time without using future ball trajectories. Third, the feature of the distance between the ball and the specific court line are extracted to detect the ball event type. Experimental results based on multi-view HDTV video sequences (2014 Inter High School Men's Volleyball Games, Japan), which contains 606 events in total, show that the detection rate reaches 88.61% while the success rate of 3D ball tracking keeps more than 99%.

In this paper, we propose a precise indoor localization method using visible light communication (VLC) with dual-facing cameras on a smart device (mobile phone, smartphone, or tablet device). This approach can assist the visually impaired with navigation, or provide mobile-robot control. The proposed method is different from conventional techniques in that dual-facing cameras are used to expand the localization area. The smart device is used as the receiver, and light-emitting diodes on the ceiling are used as localization landmarks. These are identified by VLC using a rolling shutter effect of complementary metal-oxide semiconductor image sensors. The front-facing camera captures the direct incident light of the landmarks, while the rear-facing camera captures mirror images of landmarks reflected from the floor face. We formulated the relationship between the poses (position and attitude) of the two cameras and the arrangement of landmarks using tilt detection by the smart device accelerometer. The equations can be analytically solved with a constant processing time, unlike conventional numerical methods, such as least-squares. We conducted a simulation and confirmed that the localization area was 75.6% using the dual-facing cameras, which was 3.8 times larger than that using only the front-facing camera. As a result of the experiment using two landmarks and a tablet device, the localization error in the horizontal direction was less than 98 mm at 90% of the measurement points. Moreover, the error estimation index can be used for appropriate route selection for pedestrians.

High-resolution image and video communication in home networks is highly expected to proliferate with the spread of Wi-Fi devices and the introduction of multiple-input multiple-output (MIMO) systems. This paper proposes a joint transmission and coding scheme for broadcasting high-resolution video streams over multiuser MIMO systems with an eigenbeam-space division multiplexing (E-SDM) technique. Scalable video coding makes it possible to produce the code stream comprised of multiple layers having unequal contribution to image quality. The proposed scheme jointly assigns the data of scalable code streams to subcarriers and spatial streams based on their signal-to-noise ratio (SNR) values in order to transmit visually important data with high reliability. Simulation results show that the proposed scheme surpasses the conventional unequal power allocation (UPA) approach in terms of both peak signal-to-noise ratio (PSNR) of received images and correct decoding probability. PSNR performance of the proposed scheme exceeds 35dB with the probability of over 95% when received SNR is higher than 6dB. The improvement in average PSNR by the proposed scheme compared to the conventional UPA comes up to approx. 20dB at received SNR of 6dB. Furthermore, correct decoding probability reaches 95% when received SNR is greater than 4dB.

Massive MIMO (mMIMO) is a promising technology for smart multimedia and wireless communication fields. In this paper, we investigate pilot allocation problem in two-tier time division duplex (TDD) heterogeneous network (HetNet) with mMIMO. First, we propose a new pilot allocation scheme for maximizing ergodic downlink sum rate of macro users (MUs) and small cell users (SUs), where the uplink pilot overhead and cross-tier interference are jointly considered. Then, we theoretically analyze the formulated problem and propose a low complexity one-dimensional search algorithm to obtain the optimum pilot allocation. In addition, we propose two suboptimal pilot allocation algorithms to simplify the computational process and improve SUs' fairness, respectively. Finally, simulation results show that the performance of the proposed scheme outperforms that of the traditional schemes.

Real-time and reliable radio communication is essential for wireless control systems (WCS). In WCS, preambles create significant overhead and affect the real-time capability since payloads are typically small. To shorten the preamble transmission time in OFDM systems, previous works have considered adopting either time-direction extrapolation (TDE) or frequency-direction interpolation (FDI) for channel estimation which however result in poor performance in fast fading channels and frequency-selective fading channels, respectively. In this work, we propose a subcarrier-selectable short preamble (SSSP) by introducing selectability to subcarrier sampling patterns of a preamble such that it can provide full sampling coverage of all subcarriers with several preamble transmissions. In addition, we introduce adaptability to a channel estimation algorithm for the SSSP so that it conforms to both fast and frequency-selective channels. Simulation results validate the feasibility of the proposed method in terms of the reliability and real-time capability. In particular, the SSSP scheme shows its advantage in flexibility as it can provide a low error rate and short communication time in various channel conditions.

A joint deployment of base stations (BSs) and RGB-depth (RGB-D) cameras for camera-assisted millimeter-wave (mmWave) access networks is discussed in this paper. For the deployment of a wide variety of devices in heterogeneous networks, it is crucial to consider the synergistic effects among the different types of nodes. A synergy between mmWave networks and cameras reduces the power consumption of mmWave BSs through sleep control. A purpose of this work is to optimize the number of nodes of each type, to maximize the average achievable rate within the constraint of a predefined total power budget. A stochastic deployment problem is formulated as a submodular optimization problem, by assuming that the deployment of BSs and cameras forms two independent Poisson point processes. An approximate algorithm is presented to solve the deployment problem, and it is proved that a (1-e^-1)/2-approximate solution can be obtained for submodular optimization, using a modified greedy algorithm. The numerical results reveal the deployment conditions under which the average achievable rate of the camera-assisted mmWave system is higher than that of a conventional system that does not employ RGB-D cameras.

Distributed channel selection schemes are proposed in this paper to mitigate the flow-in-the-middle (FIM) starvation in dense wireless local area networks (WLANs). The FIM starvation occurs when the middle transmitter is within the carrier sense range of two exterior transmitters, while the two exterior transmitters are not within the carrier sense range of each other. Since an exterior transmitter sends a frame regardless of the other, the middle transmitter has a high probability of detecting the channel being occupied. Under heavy traffic conditions, the middle transmitter suffers from extremely low transmission opportunities, i.e., throughput starvation. The basic idea of the proposed schemes is to let each access point (AP) select the channel which has less three-node-chain topologies within its two-hop neighborhood. The proposed schemes are formulated in strategic form games. Payoff functions are designed so that they are proved to be potential games. Therefore, the convergence is guaranteed when the proposed schemes are conducted in a distributed manner by using unilateral improvement dynamics. Moreover, we conduct evaluations through graph-based simulations and the ns-3 simulator. Simulations confirm that the FIM starvation has been mitigated since the number of three-node-chain topologies has been significantly reduced. The 5th percentile throughput has been improved.

We previously proposed a lossless image coding scheme using example-based probability modeling, wherein the probability density function of image signals was dynamically modeled pel-by-pel. To appropriately estimate the peak positions of the probability model, several examples, i.e., sets of pels whose neighborhoods are similar to the local texture of the target pel to be encoded, were collected from the already encoded causal area via template matching. This scheme primarily makes use of non-local information in image signals. In this study, we introduce a prediction technique into the probability modeling to offer a better trade-off between the local and non-local information in the image signals.

In this paper, we propose a method of embedding and detecting data in printed images with several formats, such as different resolutions and numbers of blocks, using the camera of a tablet device. To specify the resolution of an image and the number of blocks, invisible markers that are embedded in the amplitude domain of the discrete Fourier transform of the target image are used. The proposed method can increase the variety of images suitable for data embedding.

In the scenario of finite sample size, the performance of the generalized sidelobe canceller (GSC) is still affected by the desired signal even if all signal sources are independent with each other. Firstly, the novel expression of weight vector of the auxiliary array is derived under the circumstances of finite sample size. Utilizing this new weight vector and considering the correlative interferences, the general expression for the interference cancellation ratio (CR) is developed. Then, the impacts of the CR performance are further analyzed for the parameters including the input signal-to-noise ratio (SNR), the auxiliary array size, the correlation coefficient between the desired signal and interference as well as the snapshots of the sample data, respectively. Some guidelines can thus be given for the practical application. Numerical simulations demonstrate the agreement between the simulation results and the analytical results.

As devices continue to shrink, the parameter shift due to process variation and aging effects has an increasing impact on the circuit yield and reliability. However, predicting how long a circuit can maintain its design yield above the design specification is difficult because the design yield changes during the aging process. Moreover, performing Monte Carlo (MC) simulation iteratively during aging analysis is infeasible. Therefore, most existing approaches ignore the continuity during simulations to obtain high speed, which may result in accumulation of extrapolation errors with time. In this paper, an incremental simulation technique is proposed for lifetime yield analysis to improve the simulation speed while maintaining the analysis accuracy. Because aging is often a gradual process, the proposed incremental technique is effective for reducing the simulation time. For yield analysis with degraded performance, this incremental technique also reduces the simulation time because each sample is the same circuit with small parameter changes in the MC analysis. When the proposed dynamic aging sampling technique is employed, 50× speedup can be obtained with almost no decline accuracy, which considerably improves the efficiency of lifetime yield analysis.

Recent Network on Chip (NoC) design must take the thermal issue into consideration due to its great impact on the network performance and reliability, especially for 3D NoC. In this work, we design a virtual channel based fully adaptive routing algorithm for the runtime 3D NoC thermal-aware management. To improve the network throughput and latency, we use two virtual channels for each horizontal direction and design a routing function which can not only avoid deadlock and livelock, but also ensure high adaptivity and routability in the throttled network. For path selection, we design a strategy that takes priority to the distance, but also considers path diversity and traffic state. For throttling information collection, instead of transmitting the topology information of the whole network, we use a 12 bits register to reserve the router state for one hop away, which saves the hardware cost largely and decreases the network latency. In the experiments, we test our proposed routing algorithm in different states with different sizes, and the proposed algorithm shows better network latency and throughput with low power compared with traditional algorithms.

Rational proofs, introduced by Azar and Micali (STOC 2012), are a variant of interactive proofs in which the prover is rational, and may deviate from the protocol for increasing his reward. Guo et al. (ITCS 2014) demonstrated that rational proofs are relevant to delegation of computation. By restricting the prover to be computationally bounded, they presented a one-round delegation scheme with sublinear verification for functions computable by log-space uniform circuits with logarithmic depth. In this work, we study rational proofs in which the verifier is also rational, and may deviate from the protocol for decreasing the prover's reward. We construct a three-message delegation scheme with sublinear verification for functions computable by log-space uniform circuits with polylogarithmic depth in the random oracle model.

In ASIACRYPT2015, a new model for the analysis of block cipher against side-channel attack and a dedicated attack, differential bias attack, were proposed by Bogdanov et al. The model assumes an adversary who has leaked values whose positions are unknown and randomly chosen from internal states (random leakage model). This paper improves the security analysis on AES under the random leakage model. In the previous method, the adversary requires at least 2³⁴ chosen plaintexts; therefore, it is hard to recover a secret key with a small number of data. To consider the security against the adversary given a small number of data, we reestimate complexity. We propose another hypothesis-testing method which can minimize the number of required data. The proposed method requires time complexity more than t>2⁶⁰ because of time-data tradeoff, and some attacks are tractable under t≤2⁸⁰. Therefore, the attack is a threat for the long-term security though it is not for the short-term security. In addition, we apply key enumeration to the differential bias attack and propose two evaluation methods, information-theoretic evaluation and experimental one with rank estimation. From the evaluations on AES, we show that the attack is a practical threat for the long-term security.

To construct good DNA codes based on biologically motivated constraints, it is important that they have a large minimum Hamming distance and the number of GC-content is kept constant. Also, maximizing the number of codewords in a DNA code is required for given code length, minimum Hamming distance, and number of GC-content. In most previous works on the construction of DNA codes, quaternary constant weight codes were directly used because the alphabet of DNA strands is quaternary. In this paper, we propose new coding theoretic constructions of DNA codes based on the binary Hadamard matrix from a binary sequence with ideal autocorrelation. The proposed DNA codes have a greater number of codewords than or the equal number to existing DNA codes constructed from quaternary constant weight codes. In addition, it is numerically shown that for the case of codes with length 8 or 16, the number of codewords in the proposed DNA code sets is the largest with respect to the minimum reverse complementary Hamming distances, compared to all previously known results.

For mobile video codecs, the huge energy dissipation for external memory traffic is a critical challenge under the battery power constraint. Lossy embedded compression (EC), as a solution to this challenge, is considered in this paper. While previous studies in lossy EC mostly focused on algorithm optimization to reduce distortion, this work, to the best of our knowledge, is the first one that addresses the distortion control. Firstly, from both theoretical analysis and experiments for distortion optimization, a conclusion is drawn that, at the frame level, allocating memory traffic evenly is a reliable approximation to the optimal solution to minimize quality loss. Then, to reduce the complexity of decoding twice, the distortion between two sequences is estimated by a linear function of that calculated within one sequence. Finally, on the basis of even allocation, the distortion control is proposed to determine the amount of memory traffic according to a given distortion limitation. With the adaptive target setting and estimating function updating in each group of pictures (GOP), the scene change in video stream is supported without adding a detector or retraining process. From experimental results, the proposed distortion control is able to accurately fix the quality loss to the target. Compared to the baseline of negative feedback on non-referred B frames, it achieves about twice memory traffic reduction.

In this paper, we study Wi-Fi mesh networks (WMNs) as a promising candidate for wireless networking infrastructure that interconnects a variety of access networks. The main performance bottleneck of a WMN is their limited capacity due to the packet collision from the contention-based IEEE 802.11s MAC. To mitigate this problem, we present the distributed link-activation (DLA) protocol which activates a set of collision-free links for a fixed amount of time by exchanging a few control packets between neighboring MRs. Through the rigorous proof, it is shown that the upper bound of the DLA rounds is O(S_max), where S_max is the maximum number of (simultaneous) interference-free links in a WMN topology. Based on the DLA, we also design the distributed throughput-maximal scheduling (D-TMS) scheme which overlays the DLA protocol on a new frame architecture based on the IEEE 802.11 power saving mode. To mitigate its high latency, we propose the D-TMS adaptive data-period control (D-TMS-ADPC) that adjusts the data period depending on the traffic load of a WMN. Numerical results show that the D-TMS-ADPC scheme achieves much higher throughput performance than the IEEE 802.11s MAC.

In this paper, we propose a safe and comprehensive route finding algorithm for pedestrians based on lighting and landmark conditions. Safety and comprehensiveness can be predicted by the five possible indicators: (1) lighting conditions, (2) landmark visibility, (3) landmark effectiveness, (4) turning counts along a route, and (5) road widths. We first investigate impacts of these five indicators on pedestrians' perceptions on safety and comprehensiveness during route findings. After that, a route finding algorithm is proposed for pedestrians. In the algorithm, we design the score based on the indicators (1), (2), (3), and (5) above and also introduce a turning count reduction strategy for the indicator (4). Thus we find out a safe and comprehensive route through them. In particular, we design daytime score and nighttime score differently and find out an appropriate route depending on the time periods. Experimental simulation results demonstrate that the proposed algorithm obtains higher scores compared to several existing algorithms. We also demonstrate that the proposed algorithm is able to find out safe and comprehensive routes for pedestrians in real environments in accordance with questionnaire results.

Mixed noise removal is a major problem in image processing. Different noises have different properties and it is required to use an appropriate removal method for each noise. Therefore, removal of mixed noise needs the combination of removal algorithms for each contained noise. We aim at the removal of the mixed noise composed of Additive White Gaussian Noise (AWGN) and Random-Valued Impulse Noise (RVIN). Many conventional methods cannot remove the mixed noise effectively and may lose image details. In this paper, we propose a new mixed noise removal method utilizing Direction Weighted Median filter (DWM filter) and Block Matching and 3D filtering method (BM3D). Although the combination of the DWM filter for RVIN and BM3D for AWGN removes almost all the mixed noise, it still loses some image details. We find the cause in the miss-detection of the image details as RVIN and solve the problem by re-detection with the difference of an input noisy image and the output by the combination. The re-detection process removes only salient noise which BM3D cannot remove and therefore preserves image details. These processes lead to the high performance removal of the mixed noise while preserving image details. Experimental results show our method obtains denoised images with clearer edges and textures than conventional methods.

This introduces a method which uses LIDAR to identify humans and track their positions, body orientation, and movement trajectories in any public space to read their various types of behavioral responses to surroundings. We use a network of LIDAR poles, installed at the shoulder level of typical adults to reduce potential occlusion between persons and/or objects even in large-scale social environments. With this arrangement, a simple but effective human tracking method is proposed that works by combining multiple sensors' data so that large-scale areas can be covered. The effectiveness of this method is evaluated in an art gallery of a real museum. The result revealed good tracking performance and provided valuable behavioral information related to the art gallery.

We study the budgeted multi-armed bandit problem with stochastic action costs. In this problem, a player not only receives a reward but also pays a cost for an action of his/her choice. The goal of the player is to maximize the cumulative reward he/she receives before the total cost exceeds the budget. In the classical multi-armed bandit problem, a policy called KL-UCB is known to perform well. We propose KL-UCB-SC, an extension of this policy for the budgeted bandit problem. We prove that KL-UCB-SC is asymptotically optimal for the case of Bernoulli costs and rewards. To the best of our knowledge, this is the first result that shows asymptotic optimality in the study of the budgeted bandit problem. In fact, our regret upper bound is at least four times better than that of BTS, the best known upper bound for the budgeted bandit problem. Moreover, an empirical simulation we conducted shows that the performance of a tuned variant of KL-UCB-SC is comparable to that of state-of-the-art policies such as PD-BwK and BTS.

This letter proposes an extended image-source model to simulate the room transfer function for a rotatable complex source in a three-dimensional reverberant room. The proposed model uses spherical harmonic decomposition to describe the exterior sound field from the complex source. Based on “axis flip” concept, the mirroring relations between the source and images are summarized by a unified mirroring operator that occurs on the soundfield coefficients. The rotation movement of the source is taken into account by exploiting the rotation property of spherical harmonics. The accuracy of our proposed model is verified through the appropriate simulation examples.

In order to significantly reduce the time and space needed, compressive sensing builds upon the fundamental assumption of sparsity under a suitable discrete dictionary. However, in many signal processing applications there exists mismatch between the assumed and the true sparsity bases, so that the actual representative coefficients do not lie on the finite grid discretized by the assumed dictionary. Unlike previous work this paper introduces the unified compressive measurement operator into atomic norm denoising and investigates the problems of recovering the frequency support of a combination of multiple sinusoids from sub-Nyquist samples. We provide some useful properties to ensure the optimality of the unified framework via semidefinite programming (SDP). We also provide a sufficient condition to guarantee the uniqueness of the optimizer with high probability. Theoretical results demonstrate the proposed method can locate the nonzero coefficients on an infinitely dense grid over a wide range of SNR case.

The aim of this letter is to guarantee the ability of low probability of intercept (LPI) and anti-jamming (AJ) by maximizing the energy efficiency (EE) to improve wireless communication survivability and sustain wireless communication in jamming environments. We studied a scenario based on one transceiver pair with a partial-band noise jammer in a Rician fading channel and proposed an EE optimization algorithm to solve the optimization problem. With the proposed EE optimization algorithm, the LPI and AJ can be simultaneously guaranteed while satisfying the constraint of the maximum signal-to-jamming-and-noise ratio and combinatorial subchannel allocation condition, respectively. The results of the simulation indicate that the proposed algorithm is more energy-efficient than those of the baseline schemes and guarantees the LPI and AJ performance in a jamming environment.

Magnetic Anomaly Detection (MAD) is a passive method for the detection of ferromagnetic objects. Currently, the performance of a MAD system is limited by the magnetic background noise that is non-stationary and shows self-similarity and long-range correlation. In this paper, we propose an empirical mode decomposition (EMD) trend filtering based energy detector for adaptively detecting the magnetic anomaly signal from the background noise. The input data is first detrended adaptively with the energy-ratio trend filtering approach. Then, the magnetic anomaly signal is detected using an energy detector. The proposed detector does not need any a priori knowledge about the target or assumptions regarding the background noise. Experiments also prove that the proposed detector shows a more stable performance than the existing undecimated discrete wavelet transform (UDWT) based energy detector.

Community detection is an important task in the social network analysis field. Many detection methods have been developed; however, they provide little semantic interpretation for the discovered communities. We develop a framework based on joint matrix factorization to integrate network topology and node content information, such that the communities and their semantic labels are derived simultaneously. Moreover, to improve the detection accuracy, we attempt to make the community relationships derived from two types of information consistent. Experimental results on real-world networks show the superior performance of the proposed method and demonstrate its ability to semantically annotate communities.

In this paper, we consider the crosscorrelation of two interleaved sequences of period 4N constructed by Gong and Tang which has been proved to possess optimal autocorrelation. Results show that the interleaved sequences achieve the largest crosscorrelation value 4√N.

Image steganalysis can determine whether the image contains the secret messages. In practice, the number of the cover images is far greater than that of the secret images, so it is very important to solve the detection problem in imbalanced image sets. Currently, SMOTE, Borderline-SMOTE and ADASYN are three importantly synthesized algorithms used to solve the imbalanced problem. In these methods, the new sampling point is synthesized based on the minority class samples. But this research is seldom seen in image steganalysis. In this paper, we find that the features of the majority class sample are similar to those of the minority class sample based on the distribution of the image features in steganalysis. So the majority and minority class samples are both used to integrate the new sample points. In experiments, compared with SMOTE, Borderline-SMOTE and ADASYN, this approach improves detection accuracy using the FLD ensemble classifier.

The definitions of the Lee complete ρ weight enumerator and the exact complete ρ weight enumerator over M_n×s(F₂[u,v]/<u^k,v²,uv-vu>) are introduced, and the MacWilliams identities with respect to the RT metric for these two weight enumerators of linear codes over M_n×s(F₂[u,v]/<u^k,v²,uv-vu>) are obtained. Finally, we give two examples to illustrate the results we obtained.

In this letter, we first investigate some new properties of a known power residue frequency-hopping sequence (FHS) set which is established as an optimal one-coincidence frequency-hopping sequence (OC-FHS) set with near-optimal set size. Next, combining the mathematical structure of power residue theory with interleaving technique, we present a new class of optimal OC-FHS set, using the Chinese Remainder Theorem (CRT). As a result, one optimal OC-FHS set with prime length is extended to another optimal OC-FHS set with composite length in which the construction preserves the maximum Hamming correlation (MHC) and the set size as well as the optimality of the Lempel-Greenberger bound.

This letter considers the robust Tomlinson-Harashima Precoding(THP) transceiver design for Multiple-Input Multiple-Output (MIMO) interference channel (IC). Assuming bounded channel state information (CSI) error, we deal with the optimization for minimizing the worst case per-user mean square error (MSE) and sum MSE. We present an approximate approach to derive the upper bound of the constraint leading to less semidefinite. Then the alternate approach is adopted to update the receiver matrix by solving second-order-cone programming (SOCP), and update the transmitter matrix and feedback matrix by solving semidefinite program (SDP), respectively. Simulation results show that the proposed method achieves similar performance of the S-procedure method, whereas the computation complexity is reduced significantly, especially for the system with large number of transmit antennas.

In this letter, a switching detection scheme based on a channel condition number for the MIMO-OFDM system is proposed. The switching algorithm operates by selecting one of three detection schemes of QRD-M, LR-aided MMSE-DFE, and LR-aided MMSE. The switching detection uses the threshold based on the switching algorithm according to the channel condition number. From the simulation results, the proposed detection scheme shows error detection performance and computational complexity in accordance with the threshold for switching detection.

In this letter, we investigate the price-based power allocation with rate proportional fairness constraint in downlink non-orthogonal multiple access (NOMA) systems. The Stackelberg game is utilized to model the interaction between the base station (BS) and users. The revenue maximization problem of the BS is first converted to rate allocation problem, then the optimal rate allocation for each user is obtained by variable substitution. Finally, a price-based power allocation with rate proportional fairness (PAPF) algorithm is proposed based on the relationship between rate and transmit power. Simulation results show that the proposed PAPF algorithm is superior to the previous price-based power allocation algorithm in terms of fairness index and minimum normalized user (MNU) rate.

We have proposed a fish farm monitoring system for the efficient farming of tuna. In our system, energy efficient and adaptive control of sensor node is highly important. In addition, since a sensor node is attached to the fish, the transmission range of sensor node is not omni-directional. In this paper, we propose a data gathering mechanism for fish farm monitoring by extending a traditional desyncronization mechanism. In our proposed mechanism, by utilizing acknowledgment packets from the sink node, distributed and adaptive timing control of packet transmission is accomplished. In addition, we apply a reassignment mechanism and a sleep mechanism for improving the performance of our proposed mechanism. Through simulation experiments, we show that the performance of our proposed mechanism is higher than that of comparative mechanisms.

Recently, non-orthogonal multiple access (NOMA) has gained a great deal of attention due to its ability to simultaneously transmit multiple streams. Device-to-device (D2D) relaying can increase the spectral efficiency via direct communication between two devices, and extends coverage by relaying signals from the base station. In this letter, we propose applying the NOMA technique for D2D relay where D2D relaying and D2D communication can be done simultaneously in the power domain. The proposed scheme can achieve higher spectral efficiency, and its performance is evaluated through extensive simulations in multiple-cell environments, compared with conventional D2D relay schemes.