Incremental refinement of image salient-point detection

Low-level image analysis systems typically detect "points of interest", i.e., areas of natural images that contain corners or edges. Most of the robust and computationally efficient detectors proposed for this task use the autocorrelation matrix of the localized image derivatives. Although the performance of such detectors and their suitability for particular applications has been studied in relevant literature, their behavior under limited input source (image) precision or limited computational or energy resources is largely unknown. All existing frameworks assume that the input image is readily available for processing and that sufficient computational and energy resources exist for the completion of the result. Nevertheless, recent advances in incremental image sensors or compressed sensing, as well as the demand for low-complexity scene analysis in sensor networks now challenge these assumptions. In this paper, we investigate an approach to compute salient points of images incrementally, i.e., the salient point detector can operate with a coarsely quantized input image representation and successively refine the result (the derived salient points) as the image precision is successively refined by the sensor. This has the advantage that the image sensing and the salient point detection can be terminated at any input image precision (e.g., bound set by the sensory equipment or by computation, or by the salient point accuracy required by the application) and the obtained salient points under this precision are readily available. We focus on the popular detector proposed by Harris and Stephens and demonstrate how such an approach can operate when the image samples are refined in a bitwise manner, i.e., the image bitplanes are received one-by-one from the image sensor. We estimate the required energy for image sensing as well as the computation required for the salient point detection based on stochastic source modeling. The computation and energy required by the proposed incremental refinement approach is compared against the conventional salient-point detector realization that operates directly on each source precision and cannot refine the result. Our experiments demonstrate the feasibility of incremental approaches for salient point detection in various classes of natural images. In addition, a first comparison between the results obtained by the intermediate detectors is presented and a novel application for adaptive low-energy image sensing based on points of saliency is presented

On the Performance of SSK Modulation over Multiple-Access Rayleigh Fading Channels”, IEEE Global Communications Conference

International audienceSpatial Modulation (SM) is a recently proposed joint coding and modulation scheme for Multiple–Input-Multiple–Output (MIMO) wireless systems, which is receiving a growing interest. SM offers a low-complexity alternative to the design of MIMO wireless systems, which avoids multiple Radio Frequency (RF) chains at the transmitter and high–complexity interference cancelation algorithms at the receiver, but still guarantees a multiplexing gain that only depends on the number of antennas at the transmitter. This makes this technology especially suitable for the downlink with low–complexity mobile units. So far, the feasibility and performance of SM have been assessed and studied only for point–to–point communication systems, i.e., the single–user scenario. However, the performance achievable by the vast majority of wireless communication networks is interference limited, due to the simultaneous transmission of various users over the same physical wireless channel. Therefore, the adoption of SM in the next generation of wireless communication systems requires a deep understanding of its performance over interference channels. Motivated by this consideration, in this paper we study the performance of SM over the reference multiple–access fading channel composed by two transmitters and one receiver. Two detectors at the receiver are studied, i.e., the single– and the multi–user detector. In particular, analysis and Monte Carlo simulations show that the single–user detector does not offer, in general, good error performance for arbitrary channel conditions, while the multi–user detector achieves error performance very close to the single–user lower–bound. These results clearly highlight that SM can be adopted for enabling data transmission over multiple–access fading channels as well

Mobile Multiuser Detection Technique

In mobile / cellular networks the multiuser detection technology emerged in early 80s. it is now developed in to an important full-fledged field in multi-access communication. In the conventional single user detector in DS-CDMA system, MAI and near-far effect cause limitation of capacity. On the other hand the optimal MUD suffers from computational complexity that grows exponentially with number active user. During a last two decade there has been a lot of interest of sub optimal multiuser detector which are low in complexity but deliver negotiable performance. This topic highlighted various detection techniques. As in Multiuser MIMO system a base station equipped with multiple antennas serves a number of users. Conventionally the communication between the BS and the user is performed by orthogonalizing the channel so that the BS communicates with each user in separate time frequency resources. This is not optimal from an information theoretic point of view and high rate can be obtained, if the BS communicates with several users in same time frequency response. DOI: 10.17762/ijritcc2321-8169.15082

Sub-graph based joint sparse graph for sparse code multiple access systems

Sparse code multiple access (SCMA) is a promising air interface candidate technique for next generation mobile networks, especially for massive machine type communications (mMTC). In this paper, we design a LDPC coded SCMA detector by combining the sparse graphs of LDPC and SCMA into one joint sparse graph (JSG). In our proposed scheme, SCMA sparse graph (SSG) defined by small size indicator matrix is utilized to construct the JSG, which is termed as sub-graph based joint sparse graph of SCMA (SG-JSG-SCMA). In this paper, we first study the binary-LDPC (B-LDPC) coded SGJSG- SCMA system. To combine the SCMA variable node (SVN) and LDPC variable node (LVN) into one joint variable node (JVN), a non-binary LDPC (NB-LDPC) coded SG-JSG-SCMA is also proposed. Furthermore, to reduce the complexity of NBLDPC coded SG-JSG-SCMA, a joint trellis representation (JTR) is introduced to represent the search space of NB-LDPC coded SG-JSG-SCMA. Based on JTR, a low complexity joint trellis based detection and decoding (JTDD) algorithm is proposed to reduce the computational complexity of NB-LDPC coded SGJSG- SCMA system. According to the simulation results, SG-JSGSCMA brings significant performance improvement compare to the conventional receiver using the disjoint approach, and it can also outperform a Turbo-structured receiver with comparable complexity. Moreover, the joint approach also has advantages in terms of processing latency compare to the Turbo approaches