• Title/Summary/Keyword: Fast Computation

Search Result 750, Processing Time 0.028 seconds

Fast Inter Block Mode Decision Using Image Complexity in H.264/AVC (H.264/AVC에서 영상 복잡도를 이용한 고속 인터 블록 모드 결정)

  • Kim, Seong-Hee;Oh, Jeong-Su
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11C
    • /
    • pp.925-931
    • /
    • 2008
  • In video coding standard H.264/AVC, variable block size mode algorithm improves compression efficiency but has need of a large amount of computation for various block modes and mode decision. Meanwhile, decided inter block modes depend on the complexity of a block image, and then the more complex a macroblock is, the smaller its block size is. This paper proposes fast inter block mode decision algorithm. It limits valid block modes to the block modes with a great chance for decision using the image complexity and carries out motion estimation rate-distortion optimization with only the valid block modes. In addition to that, it applies fast motion estimation PDE to the valid block modes with only the $16{\times}16$ block mode. The reference software JM 9.5 was executed to estimate the proposed algorithm's performance. The simulation results showed that the proposed algorithm could save about 24.12% of the averaged motion estimation time while keeping the image quality and the bit rate to be -0.02dB and -0.12% on the average, respectively.

The Improvement of the Correlation Method for Shack-Hartmann Wavefront Sensors using Multi-Resolution Method (다중 해상도 중심점 탐색법을 이용한 샥-하트만 센서용 상관관계법의 속도 개선)

  • Yoo, Jae-Eun;Youn, Sung-Kie
    • Korean Journal of Optics and Photonics
    • /
    • v.19 no.1
    • /
    • pp.1-8
    • /
    • 2008
  • Shack-Hartmann sensors are widely employed as a wavefront measuring device in various applications. Adaptive optics is one of the major applications. Since an adaptive optics system should be operated in real-time, high-speed wavefront sensing is essential. In high-speed operation, integration time of an image detector is very short. In this case, noises such as readout noise and photon noise greatly influence the accuracy of wavefront sensing. Therefore a fast and noise-insensitive centroid finding algorithm is required for the real-time wavefront sensing. In this paper, the multi-resolution correlation method is proposed. By employing multi-resolution images, this method greatly reduces the computation time when compared to the fast Fourier transform (FFT) correlation method. The verification is performed through the computational simulation. In this paper, the center of mass method, correlation method and multi-resolution correlation method are employed to compare the measurement accuracy of the centroid finding algorithms. The accuracy of a Shack-Hartmann wavefront sensor using the proposed algorithm is proved to be comparable to that of the conventional correlation method.

Adaptive Fast Algorithm for Inter/Intra Prediction in H.264 (H.264의 인터/인트라 예측을 위한 적응적 고속 알고리즘)

  • Jin, Soon-Jong;Kim, Won-Ki;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12C
    • /
    • pp.1153-1161
    • /
    • 2005
  • The latest standard H.264 coding methods show better efficiency compared to the former coding standards from the rate distortion point of view, but also lead to high complexity. In this paper, we propose an adaptive and fast inter/intra prediction algorithm for H.264 video coding. In the inter prediction algorithm, an effective and simple mode selection method is proposed, which can adaptively adjust to motion estimation to reduce complexity. And proposed intra prediction algorithm reduces its complexity by using calculated Minimum Rate-Distortion costs in the prediction of Intra $16{\times}16$ and $4{\times}4$ modes. From experiment using JM8.4, our algorithm can reduce about $60.9\%$ of computation time as compared to JM, with only negligible PSNR and bitrate degradation.

A New Sender-Side Public-Key Deniable Encryption Scheme with Fast Decryption

  • Barakat, Tamer Mohamed
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3231-3249
    • /
    • 2014
  • Deniable encryption, introduced in 1997 by Canetti, Dwork, Naor, and Ostrovsky, guarantees that the sender or the receiver of a secret message is able to "fake" the message encrypted in a specific ciphertext in the presence of a coercing adversary, without the adversary detecting that he was not given the real message. Sender - side deniable encryption scheme is considered to be one of the classification of deniable encryption technique which defined as resilient against coercing the sender. M. H. Ibrahim presented a sender - side deniable encryption scheme which based on public key and uncertainty of Jacobi Symbol [6]. This scheme has several problems; (1) it can't be able to derive the fake message $M_f$ that belongs to a valid message set, (2) it is not secure against Quadratic Residue Problem (QRP), and (3) the decryption process is very slow because it is based dramatically on square root computation until reach the message as a Quadratic Non Residue (QNR). The first problem is solved by J. Howlader and S. Basu's scheme [7]; they presented a sender side encryption scheme that allows the sender to present a fake message $M_f$ from a valid message set, but it still suffers from the last two mentioned problems. In this paper we present a new sender-side deniable public-key encryption scheme with fast decryption by which the sender is able to lie about the encrypted message to a coercer and hence escape coercion. While the receiver is able to decrypt for the true message, the sender has the ability to open a fake message of his choice to the coercer which, when verified, gives the same ciphertext as the true message. Compared with both Ibrahim's scheme and J. Howlader and S. Basu's scheme, our scheme enjoys nice two features which solved the mentioned problems: (1) It is semantically secure against Quadratic Residue Problem; (2) It is as fast, in the decryption process, as other schemes. Finally, applying the proposed deniable encryption, we originally give a coercion resistant internet voting model without physical assumptions.

Neutron-shielding behaviour investigations of some clay-materials

  • Olukotun, S.F.;Mann, Kulwinder Singh;Gbenu, S.T.;Ibitoye, F.I.;Oladejo, O.F.;Joshi, Amit;Tekin, H.O.;Sayyed, M.I.;Fasasi, M.K.;Balogun, F.A.;Korkut, Turgay
    • Nuclear Engineering and Technology
    • /
    • v.51 no.5
    • /
    • pp.1444-1450
    • /
    • 2019
  • The fast-neutron shielding behaviour (FNSB) of two clay-materials (Ball clay and Kaolin)of Southwestern Nigeria ($7.49^{\circ}N$, $4.55^{\circ}E$) have been investigated using effective removal cross section, ${\Sigma}_R(cm^{-1})$, mass removal cross section, ${\Sigma}_{R/{\rho}}(cm^2g^{-1})$ and Mean free path, ${\lambda}$ (cm). These parameters decide neutron shielding behaviour of any material. A computer program - WinNC-Toolkit has been used for computation of these parameters. The toolkit evaluates these parameters by using elemental compositions and densities of samples. The proficiency of WinNC-Toolkit code was probe by using MCNPX and GEANT4 to model fast neutron transmission of the samples under narrow beam geometry, intending to represent the actual experimental setup. Direct calculation of effective removal cross section ($cm^{-1}$) of the samples was also carried out. The results from each of the methods for each types of the studied clay-materials (Ball clay and Kaolin) shows similar trend. The trend might be the fingerprint of water content retained in each of the samples being baked at different temperature. The compositions of each sample have been obtained by Particle-Induced X-ray Emission (PIXE) technique (Tandem Pelletron Accelerator: 1.7 MV, Model 5SDH). The FNSB of the selected clay-materials have been compared with standard concrete. The cognizance of various factors such as availability, thermo-chemical stability and water retaining ability by the clay-samples can be analyzed for efficacy of the material for their FNSB.

Electromagnetic Field Analysis Using the Point Collocation Method Based on the FMLSRK Approximation

  • Kim, Hong-Kyu;Chong, Jin-Kyo;Park, Kyong-Yop;Kim, Do-Wan
    • KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
    • /
    • v.4B no.4
    • /
    • pp.180-183
    • /
    • 2004
  • This paper presents a description of the point collocation method and its application to the electromagnetic field computation. The interpolation scheme is based on the fast moving least square reproducing kernel approximation. In the method, the integration cell is not required and the essential boundary conditions can be enforced directly. Numerical simulations on 1-D and 2-D problems are carried out to validate the method. It is found that computational efficiency is higher than the general mesh-free methods.

Developing a GUI-based Standalone Application of MATLAB Program for Windows

  • Jeong, Yun-Kyoung;Baek, Jang-Sun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.19 no.2
    • /
    • pp.519-529
    • /
    • 2008
  • Many statisticians have been using object-oriented languages such as S-PLUS, R, and MATLAB to make programs for new data analysis methods. S-PLUS and R are slower in computation as well as in processing large data sets than MATLAB. Recently MATLAB is often used for developing statistical analysis programs owing to its fast computing ability and abundant mathematical algorithm modules. Sometimes it is hard for non-statistician to understand MATLAB programs which are developed by statisticians. Therefore Graphical User Interface(GUI) is needed to facilitate the usage of MATLAB codes. In this paper, we introduce how to develop a GUI for MATLAB codes which is executable on Windows with examples.

  • PDF

Thermal vibration analysis of thick laminated plates by the moving least squares differential quadrature method

  • Wu, Lanhe
    • Structural Engineering and Mechanics
    • /
    • v.22 no.3
    • /
    • pp.331-349
    • /
    • 2006
  • The stresses and deflections in a laminated rectangular plate under thermal vibration are determined by using the moving least squares differential quadrature (MLSDQ) method based on the first order shear deformation theory. The weighting coefficients used in MLSDQ approximation are obtained through a fast computation of the MLS shape functions and their partial derivatives. By using this method, the governing differential equations are transformed into sets of linear homogeneous algebraic equations in terms of the displacement components at each discrete point. Boundary conditions are implemented through discrete grid points by constraining displacements, bending moments and rotations of the plate. Solving this set of algebraic equations yields the displacement components. Then substituting these displacements into the constitutive equation, we obtain the stresses. The approximate solutions for stress and deflection of laminated plate with cross layer under thermal load are obtained. Numerical results show that the MLSDQ method provides rapidly convergent and accurate solutions for calculating the stresses and deflections in a multi-layered plate of cross ply laminate subjected to thermal vibration of sinusoidal temperature including shear deformation with a few grid points.

Fast Adaptive Parameter Estimation Algorithm using Unit Vector (단위 벡터를 이용한 고속 적응 계수 예측 알고리즘)

  • Cho, Ju-Phil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.3
    • /
    • pp.1-7
    • /
    • 2008
  • This paper proposes a new QRD-LS adaptive algorithm with computational complexity of O(N). The main idea of proposed algorithm(D-QR-RLS) is based on the fact that the computation for the unit vector of is made from the process during Givens Rotation. The performance of the algorithm is evaluated through computer simulation of FIR system identification problem. As verified by simulation results, this algorithm exhibits a good performance. And, we can see the proposed algorithm converges to optimal coefficient vector theoretically.

  • PDF

A Robust Adaptive Control of Robot Manipulator Based on TMS320C80

  • Han, Sung-Hyun;Jung, Dong-Yean;Shin, Heang-Bong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2540-2545
    • /
    • 2003
  • We propose a new technique to the design and real-time implementation of an adaptive controller for robotic manipulator based on digital signal processors in this paper. The Texas Instruments DSPs(TMS320C80) chips are used in implementing real-time adaptive control algorithms to provide enhanced motion control performance for dual-arm robotic manipulators. In the proposed scheme, adaptation laws are derived from model reference adaptive control principle based on the improved direct Lyapunov method. The proposed adaptive controller consists of an adaptive feed-forward and feedback controller and time-varying auxiliary controller elements. The proposed control scheme is simple in structure, fast in computation, and suitable for real-time control. Moreover, this scheme does not require any accurate dynamic modeling, nor values of manipulator parameters and payload. Performance of the proposed adaptive controller is illustrated by simulation and experimental results for a dual arm robot consisting of two 4-d.o.f. robots at the joint space and cartesian space.

  • PDF