Arama Sonuçları
Listeleniyor 1 - 9 / 9
Yayın Cryptanalysis of a multi-chaotic systems based image cryptosystem(Elsevier Science BV, 2010-01-15) Solak, Ercan; Rhouma, Rhouma; Belghith, Safya MdimeghThis paper is a cryptanalysis of a recently proposed multi-chaotic systems based image cryptosystem. The cryptosystem is composed of two shuffling stages parameterized by chaotically generated sequences. We propose and implement two different attacks which completely break this encryption scheme.Yayın A robust localization framework to handle noisy measurements in wireless sensor networks(IEEE, 2009-09-14) Erten, Cesim; Karataş, ÖmerWe construct a robust localization framework to handle noisy measurements in wireless sensor networks. Traditionally many approaches employ the distance information gathered from ranging devices of the sensor nodes to achieve localization. However the measurements of these devices may contain noise both as hardware noise and as environmental noise due to the employment conditions of the network. It Is necessary to provide a general framework that handles such a noise in data and yet still be applicable within several localization algorithms. In order to handle noise in distance measurements, our framework utilizes convex constraints and confidence intervals of a random variable. At the end of the localization process nodes are assigned to a set of feasible regions with corresponding probabilities. The accuracy of the localization can be adjusted and the framework can easily be embedded to work within previously suggested localization algorithms.Yayın Cryptanalysis of a new substitution-diffusion based image cipher(Elsevier Science BV, 2010-07) Rhouma, Rhouma; Solak, Ercan; Belghith, Safya MdimeghThis paper introduces two different types of attacks on a recently proposed cryptosystem based on chaotic standard and logistic maps. In the two attacks, only a pair of (plaintext/ciphertext) was needed to totally break the cryptosystem.Yayın Adaptive Volterra channel equalisation with lattice orthogonalisation(Institution of Engineering and Technology, 1998-04) Özden, Mehmet Tahir; Kayran, Ahmet Hamdi; Panayırcı, ErdalThe authors present a new recursive least-squares adaptive nonlinear equaliser based on Volterra series expansion. The main approach is to transform the nonlinear equalisation problem into an equivalent multichannel, but linear, equalisation problem. Then the multichannel input signal is completely orthogonalised using sequential processing multichannel lattice stages. With the complete orthogonalisation of the input signal, only scalar operations are required, instability problems owing to matrix inversion are avoided, and good numerical properties are achieved. Avoidance of matrix inversion and vector operations reduce the complexity considerably, and make the filter highly modular and suitable for VLSI implementation. Several experiments demonstrating the performance under different channel distortion and channel noise conditions are also included in the paper.Yayın Imaging of rough surfaces by RTM method(IEEE, 2024) Sefer, Ahmet; Yapar, Ali; Yelkenci, TanjuAn electromagnetic imaging framework is implemented utilizing a single frequency reverse time migration (RTM) technique to accurately reconstruct inaccessible two-dimensional (2D) rough surface profiles from the knowledge of scattered field data. The unknown surface profile, which is expressed as a 1D height function, is either perfectly electric conducting (PEC) or an interface between two penetrable media. For both cases, it is assumed that the surface is illuminated by a number of line sources located in the upper medium. The scattered fields, which should be collected by real measurements in practical applications, are obtained synthetically by solving the associated direct scattering problem through the surface integral equations. RTM is subsequently applied to generate a cross-correlation imaging functional which is evaluated numerically and provides a 2D image of the region of interest. A high correlation is observed by the functional in the regions where the transitions between two media occur. Hence, it results in the acquisition of the unknown surface profile at the sites where the functional attains its highest values. The efficiency of the proposed method is comprehensively tested by numerical examples covering various types of scattering scenarios.Yayın EM-Based sequence estimation for wireless systems with orthogonal transmit diversity(IEEE, 2003) Panayırcı, Erdal; Aygölü, Hasan Ümit; Pusane, Ali EmreIn this paper, an optimum sequence estimation algorithm for wireless systems with Alamouti's two transmitter diversity in the presence of multipath fading is proposed. The algorithm is based on a jointly iterative channel and sequence estimation according to the maximum likelihood (ML) criterion, using the Expectation-Maximization (EM) algorithm employing M-PSK modulation scheme with additive Gaussian noise. The discrete multipath channel is represented in terms of the channel gains from each transmit antenna to the receive antenna. EM algorithm derived estimates jointly the complex channel parameters of each channel And the data sequence transmitted, iteratively, which converges to the true ML solution. The channel estimation is achieved in a simple way through the iterative equations by decoupling of the signals transmitted from different antennas. The algorithm is applied to the trellis coded modulation systems and efficiency of the algorithm proposed has been shown by the computer simulations. Simulation results show that the EM algorithm converges quickly for fast fading channels. The performance of the EM-based decoder approaches that of the ML receiver which has perfect knowledge of the channel.Yayın Hierarchical quantization indexing for wavelet and wavelet packet image coding(Elsevier Science BV, 2010-02) Ateş, Hasan Fehmi; Tamer, EnginIn this paper, we introduce the quantization index hierarchy, which is used for efficient coding of quantized wavelet and wavelet packet coefficients. A hierarchical classification map is defined in each wavelet subband, which describes the quantized data through a series of index classes. Going from bottom to the top of the tree, neighboring coefficients are combined to form classes that represent some statistics of the quantization indices of these coefficients. Higher levels of the tree are constructed iteratively by repeating this class assignment to partition the coefficients into larger Subsets. The class assignments are optimized using a rate-distortion cost analysis. The optimized tree is coded hierarchically from top to bottom by coding the class membership information at each level of the tree. Context-adaptive arithmetic coding is used to improve coding efficiency. The developed algorithm produces PSNR results that are better than the state-of-art wavelet-based and wavelet packet-based coders in literature.Yayın Rate-distortion and complexity optimized motion estimation for H.264 video coding(IEEE-INST Electrical Electronics Engineers Inc, 2008-02) Ateş, Hasan Fehmi; Altunbaşak, Yücel11.264 video coding standard supports several inter-prediction coding modes that use macroblock (MB) partitions with variable block sizes. Rate-distortion (R-D) optimal selection of both the motion vectors (MVs) and the coding mode of each MB is essential for an H.264 encoder to achieve superior coding efficiency. Unfortunately, searching for optimal MVs of each possible subblock incurs a heavy computational cost. In this paper, in order to reduce the computational burden of integer-pel motion estimation (ME) without sacrificing from the coding performance, we propose a R-D and complexity joint optimization framework. Within this framework, we develop a simple method that determines for each MB which partitions are likely to be optimal. MV search is carried out for only the selected partitions, thus reducing the complexity of the ME step. The mode selection criteria is based on a measure of spatiotemporal activity within the MB. The procedure minimizes the coding loss at a given level of computational complexity either for the full video sequence or for each single frame. For the latter case, the algorithm provides a tight upper bound on the worst case complexity/execution time of the ME module. Simulation results show that the algorithm speeds up integer-pel ME by a factor of up to 40 with less than 0.2 dB loss in coding efficiency.Yayın Re-mining item associations: Methodology and a case study in apparel retailing(Elsevier Science BV, 2011-12) Demiriz, Ayhan; Ertek, Gürdal; Atan, Sabri Tankut; Kula, UfukAssociation mining is the conventional data mining technique for analyzing market basket data and it reveals the positive and negative associations between items. While being an integral part of transaction data, pricing and time information have not been integrated into market basket analysis in earlier studies. This paper proposes a new approach to mine price, time and domain related attributes through re-mining of association mining results. The underlying factors behind positive and negative relationships can be characterized and described through this second data mining stage. The applicability of the methodology is demonstrated through the analysis of data coming from a large apparel retail chain, and its algorithmic complexity is analyzed in comparison to the existing techniques.
