Abstract: Text representation is a basic issue of text information processing and event plays an important role in text understanding; both attract the attention of scholars. The event network conceals lexical relations in events, and its edges express logical relations between events in document. However, the events and relations are extracted from event-annotated text, which makes it hard for large-scale text automatic processing. In the paper, with expanded CEC (Chinese Event Corpus) as data source, prior knowledge of manifestation rules of event and relation as the guide, we propose an event extraction method based on knowledge-based rule of event manifestation, to achieve automatic building and improve text processing performance of event network. PubDate: Sun, 04 Jun 2017 08:25:11 +000
Abstract: Recommender system is a very efficient way to deal with the problem of information overload for online users. In recent years, network based recommendation algorithms have demonstrated much better performance than the standard collaborative filtering methods. However, most of network based algorithms do not give a high enough weight to the influence of the target user’s nearest neighbors in the resource diffusion process, while a user or an object with high degree will obtain larger influence in the standard mass diffusion algorithm. In this paper, we propose a novel preferential diffusion recommendation algorithm considering the significance of the target user’s nearest neighbors and evaluate it in the three real-world data sets: MovieLens 100k, MovieLens 1M, and Epinions. Experiments results demonstrate that the novel preferential diffusion recommendation algorithm based on user’s nearest neighbors can significantly improve the recommendation accuracy and diversity. PubDate: Thu, 04 May 2017 00:00:00 +000
Abstract: Compressive-Sensing Video Coding (CSVC) is a new video coding framework based on compressive-sensing (CS) theory. This paper presents the evaluations on rate-distortion performance and rate-energy-distortion performance of CSVC by comparing it with the popular hybrid video coding standard H.264 and distributed video coding (DVC) system DISCOVER. Experimental results show that CSVC achieves a poor rate-distortion performance when compared with H.264 and DISCOVER, but its rate-energy-distortion performance has a distinct advantage; moreover, its energy consumption of coding is approximately invariant regardless of reconstruction quality. It can be concluded that, with a limited energy budget, CSVC outperforms H.264 and DISCOVER, but its rate-distortion performance still needs improvement. PubDate: Thu, 16 Mar 2017 06:20:12 +000
Abstract: The traditional image Compressive Sensing (CS) conducts block-wise sampling with the same sampling rate. However, some blocking artifacts often occur due to the varying block sparsity, leading to a low rate-distortion performance. To suppress these blocking artifacts, we propose to adaptively sample each block according to texture features in this paper. With the maximum gradient in 8-connected region of each pixel, we measure the texture variation of each pixel and then compute the texture contrast of each block. According to the distribution of texture contrast, we adaptively set the sampling rate of each block and finally build an image reconstruction model using these block texture contrasts. Experimental results show that our adaptive sampling scheme improves the rate-distortion performance of image CS compared with the existing adaptive schemes and the reconstructed images by our method achieve better visual quality. PubDate: Mon, 13 Mar 2017 00:00:00 +000
Abstract: Today, eavesdropping is becoming a common issue in the rapidly growing digital network and has foreseen the need for secret communication channels embedded in digital media. In this paper, a novel steganography technique designed for Standard Definition Digital Television (SDTV) H.264/AVC encoded video sequences is presented. The algorithm introduced here makes use of the compression properties of the Context Adaptive Variable Length Coding (CAVLC) entropy encoder to achieve a low complexity and real-time inserting method. The chosen scheme hides the private message directly in the H.264/AVC bit stream by modifying the AC frequency quantized residual luminance coefficients of intrapredicted I-frames. In order to avoid error propagation in adjacent blocks, an interlaced embedding strategy is applied. Likewise, the steganography technique proposed allows self-detection of the hidden message at the target destination. The code source was implemented by mixing MATLAB 2010 b and Java development environments. Finally, experimental results have been assessed through objective and subjective quality measures and reveal that less visible artifacts are produced with the technique proposed by reaching PSNR values above 40.0 dB and an embedding bit rate average per secret communication channel of 425 bits/sec. This exemplifies that steganography is affordable in digital television. PubDate: Mon, 09 May 2016 12:58:09 +000
Abstract: With the rapid rise of the Internet and electronics in people’s life, the data related to it has also undergone a mammoth increase in magnitude. The data which is stored in the cloud can be sensitive and at times needs a proper file storage system with a tough security algorithm. Whereas cloud is an open shareable elastic environment, it needs impenetrable and airtight security. This paper deals with furnishing a secure storage system for the above-mentioned purpose in the cloud. To become eligible to store data a user has to register with the cloud database. This prevents unauthorized access. The files stored in the cloud are encrypted with RSA algorithm and digital fingerprint for the same has been generated through MD5 message digest before storage. The RSA provides unreadability of data to anyone without the private key. MD5 makes it impossible for any changes on data to go unnoticed. After the application of RSA and MD5 before storage, the data becomes resistant to access or modifications by any third party and to intruders of cloud storage system. This application is tested in Amazon Elastic Compute Cloud Web Services. PubDate: Wed, 04 May 2016 11:25:10 +000
Abstract: Multimedia broadcast is the most efficient method to distribute identical content to multiple users in the Evolved Packet System (EPS). EPS enables efficient usage of network resources and provisioning of quality of service for every user. Third-party control allows applications in an enterprise domain to invoke network functions like multimedia broadcast. In this paper, an approach to modeling the behavior of Service Capability Server (SCS) for multimedia broadcast in EPS is presented. Third-party applications can access multimedia broadcasting capabilities by using Parlay X Web Service interfaces. The SCS for multimedia broadcast exposes Parlay X interfaces toward 3rd-party applications and control protocols toward the network. The SCS functional behavior has to be synchronized with the application view on message broadcast and the state of the network resources intended for the broadcast session. Models of multicast session, IP connectivity session, and bearers’ and charging session are proposed and formally described using the notation of Label Transition Systems. The concept of weak bisimilarity is used to prove that models expose equivalent behavior; that is, they are synchronized. PubDate: Wed, 02 Mar 2016 12:56:46 +000
Abstract: In this paper, we propose a new Scalable Video Coding (SVC) quality-adaptive peer-to-peer television (P2PTV) system executed at the peers and at the network. The quality adaptation mechanisms are developed as follows: on one hand, the Layer Level Initialization (LLI) is used for adapting the video quality with the static resources at the peers in order to avoid long startup times. On the other hand, the Layer Level Adjustment (LLA) is invoked periodically to adjust the SVC layer to the fluctuation of the network conditions with the aim of predicting the possible stalls before their occurrence. Our results demonstrate that our mechanisms allow quickly adapting the video quality to various system changes while providing best Quality of Experience (QoE) that matches current resources of the peer devices and instantaneous throughput available at the network state. PubDate: Wed, 12 Aug 2015 07:10:46 +000
Abstract: In practical unlicensed communications in TV band, radio devices have to identify, at first, the transmission opportunities, that is, the portion of the spectrum licensed for broadcasting services unoccupied in a certain region at certain time, that is, the so-called TV white space. In this paper the outcome of field measurements in the UHF TV band (470–860 MHz) conducted in EU is presented. To obtain empirical values for the parameters upon which unlicensed radio devices are able to distinguish in a real scenario between empty and occupied TV channels, signal power measurements have been performed in Italy, Spain, and Romania on rural, suburban, and urban sites, at different heights over the ground by using different analysis bandwidths. The aim of this work is to provide a set of practical parameters upon which harmless unlicensed communication in the UHF TV white space is feasible. The results have been analyzed with respect to the hidden node margin problem, spectrum sensing bandwidth, and occupancy threshold. PubDate: Mon, 23 Feb 2015 08:50:13 +000
Abstract: We propose two generalized block-diagonalization (BD) schemes for multiple-input multiple-output (MIMO) relay broadcasting systems with no channel state information (CSI) at base station. We first introduce a generalized zero forcing (ZF) scheme that reduces the complexity of the traditional BD scheme. Then the optimal power loading matrix for the proposed scheme is analyzed and the closed-form solution is derived. Furthermore, an enhanced scheme is proposed by employing the minimum-mean-squared-error (MMSE) criterion. Simulation results show that the proposed generalized MMSE scheme outperforms the other schemes and the optimal power loading scheme improves the sum-rate performance efficiently. PubDate: Wed, 31 Dec 2014 00:10:07 +000
Abstract: The research presented in this paper improves the structure-criterion switching performance of the blind decision feedback equalizer (DFE) which eliminates error propagation effects by optimizing both the structure and the cost criterion. To conquer the complexity of the 64-QAM (quadrature amplitude modulated) signal constellation, the stochastic entropy-gradient algorithm is additionally regularized by the coefficient leaky term to avoid a coefficients norm overgrowth of the received signal whitener. Effectively, the leak of coefficients is employed to ensure a stable structure-criterion switching of DFE between blind and decision-directed operation modes. The optimization of the resulting whitening algorithm is achieved by means of two free, leaky and entropic, parameters which act in opposition to each other. Both, the influence of the 64-QAM signal on the feedback filter behavior and the parametric optimization of the whitening algorithm are analyzed through simulations. PubDate: Wed, 31 Dec 2014 00:10:04 +000
Abstract: We propose a new watermarking method based on quantization index modulation. A concept of initial data loss is introduced in order to increase capacity of the watermarking channel under high intensity additive white Gaussian noise. According to the concept some samples in predefined positions are ignored even though this produces errors in the initial stage of watermark embedding. The proposed method also exploits a new form of distribution of quantized samples where samples that interpret “0” and “1” have differently shaped probability density functions. Compared to well-known watermarking schemes, this provides an increase of capacity under noise attack and introduces a distinctive feature. Two criteria are proposed that express the feature numerically. The criteria are utilized by a procedure for estimation of a gain factor after possible gain attack. Several state-of-the-art quantization-based watermarking methods were used for comparison on a set of natural grayscale images. The superiority of the proposed method has been confirmed for different types of popular attacks. PubDate: Thu, 11 Sep 2014 09:59:35 +000
Abstract: A new representation of the Fourier transform in terms of time and scale localization is discussed that uses a newly coined A-wavelet transform (Grigoryan 2005). The A-wavelet transform uses cosine- and sine-wavelet type functions, which employ, respectively, cosine and sine signals of length . For a given frequency , the cosine- and sine-wavelet type functions are evaluated at time points separated by on the time-axis. This is a two-parameter representation of a signal in terms of time and scale (frequency), and can find out frequency contents present in the signal at any time point using less computation. In this paper, we extend this work to provide further signal information in a better way and name it as -wavelet transform. In our proposed work, we use cosine and sine signals defined over the time intervals, each of length , , and are nonnegative integers, to develop cosine- and sine-type wavelets. Using smaller time intervals provides sharper frequency localization in the time-frequency plane as the frequency is inversely proportional to the time. It further reduces the computation for evaluating the Fourier transform at a given frequency. The A-wavelet transform can be derived as a special case of the -wavelet transform. PubDate: Mon, 25 Aug 2014 08:51:00 +000
Abstract: The need for adapting video stream delivery over heterogeneous and unreliable networks requires self-adaptive and error resilient coding. Network bandwidth fluctuations can be handled by means of a video coding scheme which adapts to the channel conditions. However, packet losses which are frequent in wireless networks can cause a mismatch during the reconstruction in the receiver end and result in an accumulation of errors which deteriorates the quality of the delivered video. A combination of multiple description coding in pixel domain and scalable video coding schemes which addresses both video adaptation and robustness to data loss is proposed in this paper. The proposed scheme combines error concealment with spatial video scalability. In order to improve the fidelity of the reconstructed to the original frames in presence of packet loss, a multilayer polyphase spatial decomposition algorithm is proposed. Classical multiple description methods interpolate the missing data which results in smoothing and artifact at object boundaries. The proposed algorithm addresses the quality degradation due to low-pass filtering effect of interpolation methods. We also comparatively analyze the trade-off between robustness to channel errors and coding efficiency. PubDate: Mon, 25 Aug 2014 07:53:15 +000
Abstract: This paper presents a model to predict video quality perceived by the broadcast digital television (DTV) viewer. We present how noise on DTV can introduce individual transport stream (TS) packet losses at the receiver. The type of these errors is different than the produced on IP networks. Different scenarios of TS packet loss are analyzed, including uniform and burst distributions. The results show that there is a high variability on the perceived quality for a given percentage of packet loss and type of error. This implies that there is practically no correlation between the type of error or the percentage of packets loss and the perceived degradation. A new metric is introduced, the weighted percentage of slice loss, which takes into account the affected slice type in each lost TS packet. We show that this metric is correlated with the video quality degradation. A novel parametric model for video quality estimation is proposed, designed, and verified based on the results of subjective tests in SD and HD. The results were compared to a standard model used in IP transmission scenarios. The proposed model improves Pearson Correlation and root mean square error between the subjective and the predicted MOS. PubDate: Thu, 03 Apr 2014 11:15:53 +000
Open Access journal
[334 journals]
