Arama Sonuçları

Listeleniyor 1 - 4 / 4
  • Yayın
    Cryptanalysis of a new substitution-diffusion based image cipher
    (Elsevier Science BV, 2010-07) Rhouma, Rhouma; Solak, Ercan; Belghith, Safya Mdimegh
    This 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
    Imaging of rough surfaces by RTM method
    (IEEE, 2024) Sefer, Ahmet; Yapar, Ali; Yelkenci, Tanju
    An 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
    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ücel
    11.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, Ufuk
    Association 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.