The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
With rapidly growing interest in ways to hide information, a large number of schemes have been proposed for watermarks and other information in digital pictures, video, audio and other multimedia objects. In an attempt to overcome this problem, watermarking has been suggested in the literature as the most effective means for copyright protection and authentication. The main focus of this thesis is...
Lossless coding is commonly found in binary image encoding with lower compression ratio. In this paper, image segmentation is used to classify the document image into line image regions, text image regions and halftone image regions. According to different features of each region, different encoding methods are applied to improve the image compression ratio. Adaptive arithmetic coding is used for...
A space-time coding scheme based on interleave division multiplexing (EDM) is investigated over an orthogonal frequency division multiplexing (OFDM) link that employs multiple transmit antennas. The performance of an iterative receiver structure for the proposed scheme over a quasi-static channel is evaluated via simulation, and its advantages are shown by comparison to other space-time schemes in...
An iterative source-channel decoding scheme which exploits the source residual redundancies on symbol-basis is proposed. We first derive a modified BCJR algorithm based on the sectionalized code trellis for symbol decoding of the convolutional codes. This is used in conjunction with a softbit source decoder that computes the interpolative a posteriori probabilities of quantizer indexes. Simulation...
This paper introduces an implementation of a half-duplex decode-and-forward cooperative algorithm using the complete complementary code (CCC) sets. These code sets have an impulsive autocorrelation sum among each set and a cross correlation sum along the set size that vanishes for all shifts. Each user is assigned a set of spreading codes to spread his data and send each of the resulting signals on...
In this paper, we mention our work on incorporating rule based reordering and morphological information for English to Malayalam statistical machine translation. The main ideas which have proven very effective are (i) reordering the English source sentence according to Malayalam syntax, and (ii) using the root suffix separation on both English and Malayalam words. The first one is done by applying...
Language model domain adaption usually uses a large quantity of auxiliary data in different genres and domains. It has mostly been relying on scoring functions for selection and it is typically independent of intended applications such as machine translation. In this paper, we present a novel domain adaptation approach that is directly motivated by the need of translation engine. We first identify...
In current statistical machine translation, IBM model based word alignment is widely used as a starting point to build phrase-based machine translation systems. However, such alignment model is separated from the rest of machine translation pipeline and optimized independently. Furthermore, structural information is not taken into account in the alignment model, which sometimes leads to incorrect...
This paper proposes a recognition method for light objects in a video for real-time application and the movement of the surrounding objects. The method extracts the objects by considering known geometric arrangements and blinking frequency, while the latter is also used to remove the image noise. Therefore, locations of the light objects can be found rapidly, and the on-off blinking states of these...
So far, many effective hypothesis alignment metrics have been proposed and applied to the system combination, such as TER, HMM, ITER and IHMM. In addition, the Minimum Bayes-risk (MBR) decoding and the confusion network (CN) have become the state-of-the-art techniques in system combination. In this paper, we present a three-pass system combination strategy that can combine hypothesis alignment results...
We introduce a new attack model for collusion-secure codes, called the combined digit model, which represents signal processing attacks against the underlying watermarking level better than existing models. In this paper, we analyze the performance of two variants of the Tardos code and show that both variants can accommodate the new model and resist collusion attacks with only a modest increase in...
Image watermarking is the robust, imperceptible embedding of a small quantity of data into a digital image, and the subsequent recovery of this data, perhaps after the watermarked image has been distorted. We present a new watermarking technique which is robust to many image distortions, in particular arbitrary affine transformations of the image. The method achieves its robustness through the use...
This paper outlines the work on another design of a parity check matrix for Irregular LDPC codes. The design is based on the pattern of Modified Array and Interleaved Modified Array LDPC codes. The application of matrix transposition Quasi-cyclic shifting has resulted in the reduction of 1's. The designed matrix is suitable for codes with short and medium block lengths. The code rate of 0.56 at the...
Hierarchical phrase-based translation model has been proven to be a simple and powerful machine translation model. However, due to the computational complexity constraints, the extraction and use of hierarchical rules are usually restricted under certain limits, and these limits could have a negative impact on the performance of the translation model, especially for reordering. This paper presents...
The robustness of quantized continuous-time non-linear systems with respect to the discrepancy (mismatch) between the ranges of the encoder and the decoder quantizers is investigated. A condition which guarantees asymptotic stability and which describes the interplay between quantization density and mismatch is derived.
In this paper voltage mode quaternary circuits are introduced. The quaternary circuits are encoder and decoder circuit, half and full adder circuit. Quaternary operators and elements which are used in the implementation of encoder and decoder circuits, half and full adder are also presented. The set of operators are logical sum, logical product, level up, level down, level conversion operator. Quaternary...
Single Row Facility Layout Problem (SRFLP) consists of arranging a number of rectangular facilities with varying length on one side of a straight line to minimize the weighted sum of the distance between all facility pairs. In this paper we use a Particle Swarm Optimization (PSO) algorithm to solve the SRFLP. We first employ a new coding and decoding technique to efficiently map discrete feasible...
A Low-complexity Layered Decoding Algorithm for LDPC Codes is proposed. Our modified algorithm reduces the number of operations in variable nodes to lower LDPC decoder power consumption. The modified parts of LDPC decoder architecture is also described. Simulation results show that comparing with SPA and MSA, our algorithm reducing the number of operations nearly to 60% with little performance loss.
We study randomized fingerprinting codes that achieve the fundamental capacity limits subject to the so-called Boneh-Shaw marking assumption. Two decoding schemes are studied in particular: the joint decoder is capacity-achieving but computationally intense, while the simple decoder is suboptimal but efficient. We provide tight bounds as well as numerical results for capacities and study the difference...
Wet paper codes are an essential tool for communication with non-shared selection channels. Inspired by the recent ZZW construction for matrix embedding, we propose a novel wet paper coding scheme with high embedding efficiency. The performance is analyzed under the assumption that wet cover elements form an i.i.d. Bernoulli sequence. Attention is paid to implementation details to minimize capacity...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.