• Title/Summary/Keyword: 2-D discrete systems

Search Result 87, Processing Time 0.027 seconds

Numerical Investigation of a Steady Non-Evaporating Hollow-Cone Spray Interacting with an Annular Air Jet (정상 할로우 콘 분무와 환형 공기 제트의 상호작용에 관한 수치적 연구)

  • Kim, Woo-Tae;Huh, Kang-Y.
    • Journal of ILASS-Korea
    • /
    • v.5 no.2
    • /
    • pp.43-52
    • /
    • 2000
  • Numerical simulation of steady, non-evaporating hollow-cone sprays interacting with concentric annular air jets is performed using the discrete stochastic particle method in KIVA. The spray characteristics such as SMD, mean droplet velocity, liquid volume flux, air/liquid mass ratio, and droplet number density arc obtained and compared with the measurements involving different air flow rates in large and small annuli. Overall satisfactory agreement is achieved between calculation and experiment except for the deviation in the downstream SMD arising from uncertainty in the size distribution function at injection, and inaccuracy in the averaged spray parameters due to the small volumes of axisymmetric 2-D sector meshes close to the axis.

  • PDF

Auto-Covariance Analysis for Depth Map Coding

  • Liu, Lei;Zhao, Yao;Lin, Chunyu;Bai, Huihui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3146-3158
    • /
    • 2014
  • Efficient depth map coding is very crucial to the multi-view plus depth (MVD) format of 3-D video representation, as the quality of the synthesized virtual views highly depends on the accuracy of the depth map. Depth map contains smooth area within an object but distinct boundary, and these boundary areas affect the visual quality of synthesized views significantly. In this paper, we characterize the depth map by an auto-covariance analysis to show the locally anisotropic features of depth map. According to the characterization analysis, we propose an efficient depth map coding scheme, in which the directional discrete cosine transforms (DDCT) is adopted to substitute the conventional 2-D DCT to preserve the boundary information and thereby increase the quality of synthesized view. Experimental results show that the proposed scheme achieves better performance than that of conventional DCT with respect to the bitrate savings and rendering quality.

Point Spread Function of Optical Systems Apodized by Semicircular Array of 2D Aperture Functions with Asymmetric Apodization

  • Reddy, Andra Naresh Kumar;Sagar, Dasari Karuna
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.2
    • /
    • pp.83-88
    • /
    • 2014
  • The simultaneous suppression of sidelobes and the sharpening of the central peak in the process of diffraction pattern detection based on asymmetric apodization have been investigated. Asymmetric apodization is applied to a semicircular array of two-dimensional (2D) aperture functions, which is a series of 'coded-phase arrays of semicircular rings randomly distributed over the central circular region of a pupil function' and is similar to that used in the field of diffractive optics. The point spread function (PSF) of an imaging system with asymmetric apodization of the discrete type has been found to possess a good side with suppressed sidelobes, whereas its bad side contains enhanced sidelobes. Further, the diffracted field characteristics are obtained in the presence of these aperture functions. Asymmetric apodization is helpful in improving the performance of the optical gratings or 2D arrays used in real-time imaging techniques.

A Comparative Study of Twist Property in KSS Curves of Embedding Degree 16 and 18 from the Implementation Perspective

  • Khandaker, Md. Al-Amin;Park, Taehwan;Nogami, Yasuyuki;Kim, Howon
    • Journal of information and communication convergence engineering
    • /
    • v.15 no.2
    • /
    • pp.97-103
    • /
    • 2017
  • Implementation of faster pairing calculation is the basis of efficient pairing-based cryptographic protocol implementation. Generally, pairing is a costly operation carried out over the extension field of degree $k{\geq}12$. But the twist property of the pairing friendly curve allows us to calculate pairing over the sub-field twisted curve, where the extension degree becomes k/d and twist degree d = 2, 3, 4, 6. The calculation cost is reduced substantially by twisting but it makes the discrete logarithm problem easier if the curve parameters are not carefully chosen. Therefore, this paper considers the most recent parameters setting presented by Barbulescu and Duquesne [1] for pairing-based cryptography; that are secure enough for 128-bit security level; to explicitly show the quartic twist (d = 4) and sextic twist (d = 6) mapping between the isomorphic rational point groups for KSS (Kachisa-Schaefer-Scott) curve of embedding degree k = 16 and k = 18, receptively. This paper also evaluates the performance enhancement of the obtained twisted mapping by comparing the elliptic curve scalar multiplications.

A New Robust Blind Crypto-Watermarking Method for Medical Images Security

  • Mohamed Boussif;Oussema Boufares;Aloui Noureddine;Adnene Cherif
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.3
    • /
    • pp.93-100
    • /
    • 2024
  • In this paper, we propose a novel robust blind crypto-watermarking method for medical images security based on hiding of DICOM patient information (patient name, age...) in the medical imaging. The DICOM patient information is encrypted using the AES standard algorithm before its insertion in the medical image. The cover image is divided in blocks of 8x8, in each we insert 1-bit of the encrypted watermark in the hybrid transform domain by applying respectively the 2D-LWT (Lifting wavelet transforms), the 2D-DCT (discrete cosine transforms), and the SVD (singular value decomposition). The scheme is tested by applying various attacks such as noise, filtering and compression. Experimental results show that no visible difference between the watermarked images and the original images and the test against attack shows the good robustness of the proposed algorithm.

Digital Implementation of $H_\infty$ Optimal Controller ($H_\infty$ 최적제어기의 이산화 구현)

  • 김광우;오도창;박홍배
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.471-476
    • /
    • 1993
  • In this paper we proposed the digital implementation of an $H^{\infty}$-optimal controller using lifting technique and $H^{\infty}$-control theory. The discrete controller is obtained through iterative adjustment of sampling time and weighting function, which can ber performed by computing the L$_{2}$-induced input to output norm of the sampled-data system with bandlimited exogenous input. The resulting sampled-data bandlimited exogenous input. The resulting sampled-data system is stable and the performance including inter-sampling behaviour of the hybrid system can be also optimized.d.

  • PDF

3D Radar Objects Tracking and Reflectivity Profiling

  • Kim, Yong Hyun;Lee, Hansoo;Kim, Sungshin
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.4
    • /
    • pp.263-269
    • /
    • 2012
  • The ability to characterize feature objects from radar readings is often limited by simply looking at their still frame reflectivity, differential reflectivity and differential phase data. In many cases, time-series study of these objects' reflectivity profile is required to properly characterize features objects of interest. This paper introduces a novel technique to automatically track multiple 3D radar structures in C,S-band in real-time using Doppler radar and profile their characteristic reflectivity distribution in time series. The extraction of reflectivity profile from different radar cluster structures is done in three stages: 1. static frame (zone-linkage) clustering, 2. dynamic frame (evolution-linkage) clustering and 3. characterization of clusters through time series profile of reflectivity distribution. The two clustering schemes proposed here are applied on composite multi-layers CAPPI (Constant Altitude Plan Position Indicator) radar data which covers altitude range of 0.25 to 10 km and an area spanning over hundreds of thousands $km^2$. Discrete numerical simulations show the validity of the proposed technique and that fast and accurate profiling of time series reflectivity distribution for deformable 3D radar structures is achievable.

Effects of 3-D Fracture Tensor Parameters on Deformability of Fractured Rock Masses (삼차원 절리텐서 파라미터가 절리성 암반의 변형특성에 미치는 영향)

  • Ryu, Seongjin;Um, Jeong-Gi
    • Tunnel and Underground Space
    • /
    • v.31 no.1
    • /
    • pp.66-81
    • /
    • 2021
  • The effects of directional fracture tensor components and first invariant of fracture tensor on deformation moduli and shear moduli of fractured rock masses is analyzed based on regression analysis performed between 3-D fracture tensor parameters and deformability of DFN blocks. Using one or two deterministic joint sets, a total of 224 3-D discrete fracture network (DFN) cube blocks were generated with various configurations of deterministic density and probabilistic size distribution. The fracture tensor parameters were calculated for each generated DFN systems. Also, deformability moduli with respect to three perpendicular direction of the DFN cube blocks were estimated based on distinct element method. The larger the first invariant of fracture tensor, the smaller the values for the deformability moduli of the DFN blocks. These deformability properties present an asymptotic pattern above the certain threshold. It is found that power-law function describes the relationship between the directional deformability moduli and the corresponding fracture tensor components estimated in same direction.

Facial Expression Recognition by Combining Adaboost and Neural Network Algorithms (에이다부스트와 신경망 조합을 이용한 표정인식)

  • Hong, Yong-Hee;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.6
    • /
    • pp.806-813
    • /
    • 2010
  • Human facial expression shows human's emotion most exactly, so it can be used as the most efficient tool for delivering human's intention to computer. For fast and exact recognition of human's facial expression on a 2D image, this paper proposes a new method which integrates an Discrete Adaboost classification algorithm and a neural network based recognition algorithm. In the first step, Adaboost algorithm finds the position and size of a face in the input image. Second, input detected face image into 5 Adaboost strong classifiers which have been trained for each facial expressions. Finally, neural network based recognition algorithm which has been trained with the outputs of Adaboost strong classifiers determines final facial expression result. The proposed algorithm guarantees the realtime and enhanced accuracy by utilizing fastness and accuracy of Adaboost classification algorithm and reliability of neural network based recognition algorithm. In this paper, the proposed algorithm recognizes five facial expressions such as neutral, happiness, sadness, anger and surprise and achieves 86~95% of accuracy depending on the expression types in real time.

A Scale Invariant Object Detection Algorithm Using Wavelet Transform in Sea Environment (해양 환경에서 웨이블렛 변환을 이용한 크기 변화에 무관한 물표 탐지 알고리즘)

  • Bazarvaani, Badamtseren;Park, Ki Tae;Jeong, Jongmyeon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.3
    • /
    • pp.249-255
    • /
    • 2013
  • In this paper, we propose an algorithm to detect scale invariant object from IR image obtained in the sea environment. We create horizontal edge (HL), vertical edge (LH), diagonal edge (HH) of images through 2-D discrete Haar wavelet transform (DHWT) technique after noise reduction using morphology operations. Considering the sea environment, Gaussian blurring to the horizontal and vertical edge images at each level of wavelet is performed and then saliency map is generated by multiplying the blurred horizontal and vertical edges and combining into one image. Then we extract object candidate region by performing a binarization to saliency map. A small area in the object candidate region are removed to produce final result. Experiment results show the feasibility of the proposed algorithm.