• Title/Summary/Keyword: quantum algorithm

Search Result 149, Processing Time 0.03 seconds

Comparative Evaluation of Images after Applying Quantum Denoising System Algorithm to Brain Computed Tomography (뇌 컴퓨터단층검사 시 양자잡음제거 알고리즘을 적용한 영상의 비교평가)

  • Cho, Pyong-Kon
    • Journal of radiological science and technology
    • /
    • v.40 no.4
    • /
    • pp.589-594
    • /
    • 2017
  • The objective of this study was to evaluate the enhancement effects of the quantum denoising system (QDS) on brain CT images. This retrospective study was conducted with 45 adults who visited G Radiology located in Gyungbuk for having brain CT tests between Jul 2017 and Oct 2017 after receiving consents. Subjects were divided into a control group (A group; no QDS(-) application during the brain CT test) and a treatment group (B Group; QDS(+) application during the brain CT test). The following conclusions were obtained from the study. The noise values at the Pons part and the Vermis part were significantly (p<0.05) lower in B Group ($Pons=5.41{\pm}1.05HU$; $Vermis=5.28{\pm}0.73HU$) than A Group ($Pons=6.92{\pm}0.98HU$; Vermis=6.72). The SNR values at the Pons part and the Vermis part were significantly (p<0.05) higher in B Group ($Pons=7.28{\pm}2.56$; $Vermis=8.63{\pm}3.04$) than A Group ($Pons=5.21{\pm}1.28$; $Vermis=6.23{\pm}1.49$). In conclusion, the results of this study suggested that the application of QDS to the brain CT test would enhance the signal to noise ratio (SNR) and the contrast to noise ratio (CNR) to provide an image more appropriate for diagnosis.

A Study on Efficient Signing Methods and Optimal Parameters Proposal for SeaSign Implementation (SeaSign에 대한 효율적인 서명 방법 및 최적 파라미터 제안 연구)

  • Suhri Kim
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.34 no.2
    • /
    • pp.167-177
    • /
    • 2024
  • This paper proposes optimization techniques for SeaSign, an isogeny-based digital signature algorithm. SeaSign combines class group actions of CSIDH with the Fiat-Shamir with abort. While CSIDH-based algorithms have regained attention due to polynomial time attacks for SIDH-based algorithms, SeaSiogn has not undergone significat optimization because of its inefficiency. In this paper, an efficient signing method for SeaSign is proposed. The proposed signing method is simple yet powerful, achived by repositioning the rejection sampling within the algorithm. Additionally, this paper presnts parameters that can provide optimal performance for the proposed algorithm. As a result, by using the original parameters of SeaSign, the proposed method is three times faster than the original SeaSign. Additonally, combining the newly suggested parameters with the signing method proposed in this paper yields a performance that is 290 times faster than the original SeaSign and 7.47 times faster than the method proposed by Decru et al.

Evaluation of Automatic Image Segmentation for 3D Volume Measurement of Liver and Spleen Based on 3D Region-growing Algorithm using Animal Phantom (간과 비장의 체적을 구하기 위한 3차원 영역 확장 기반 자동 영상 분할 알고리즘의 동물팬텀을 이용한 성능검증)

  • Kim, Jin-Sung;Cho, June-Sik;Shin, Kyung-Sook;Kim, Jin-Hwan;Jeon, Ho-Sang;Cho, Gyu-Seong
    • Progress in Medical Physics
    • /
    • v.19 no.3
    • /
    • pp.178-185
    • /
    • 2008
  • Living donor liver transplantation is increasingly performed as an alternative to cadaveric transplantation. Preoperative screening of the donor candidates is very important. The quality, size, and vascular and biliary anatomy of the liver are best assessed with magnetic resonance (MR) imaging or computed tomography (CT). In particular, the volume of the potential graft must be measured to ensure sufficient liver function after surgery. Preoperative liver segmentation has proved useful for measuring the graft volume before living donor liver transplantations in previous studies. In these studies, the liver segments were manually delineated on each image section. The delineated areas were multiplied by the section thickness to obtain volumes and summed to obtain the total volume of the liver segments. This process is tedious and time consuming. To compensate for this problem, automatic segmentation techniques have been proposed with multiplanar CT images. These methods involve the use of sequences of thresholding, morphologic operations (ie, mathematic operations, such as image dilation, erosion, opening, and closing, that are based on shape), and 3D region growing methods. These techniques are complex but require a few computation times. We made a phantom for volume measurement with pig and evaluated actual volume of spleen and liver of phantom. The results represent that our semiautomatic volume measurement algorithm shows a good accuracy and repeatability with actual volume of phantom and possibility for clinical use to assist physician as a measuring tool.

  • PDF

3D Non-local Means(NLM) Algorithm Based on Stochastic Distance for Low-dose X-ray Fluoroscopy Denoising (저선량 X-ray 영상의 잡음 제거를 위한 확률 거리 기반 3차원 비지역적 평균 알고리즘)

  • Lee, Min Seok;Kang, Moon Gi
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.4
    • /
    • pp.61-67
    • /
    • 2017
  • Low-dose X-ray fluoroscopic image sequences to avoid radiation exposure risk are contaminated by quantum noise. To restore these noisy sequences, we propose a 3D nonlocal means (NLM) filter based on stochastic distancesed can be applied to the denoising of X-ray fluoroscopic image sequences. The stochastic distance is obtained within motion-compensated noise filtering support to remove the Poisson noise. In this paper, motion-adaptive weight which reflected the frame similarity is proposed to restore the noisy sequences without motion artifact. Experimental results including comparisons with conventional algorithms for real X-ray fluoroscopic image sequences show the proposed algorithm has a good performance in both visual and quantitative criteria.

A Survey of Genetic Programming and Its Applications

  • Ahvanooey, Milad Taleby;Li, Qianmu;Wu, Ming;Wang, Shuo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.1765-1794
    • /
    • 2019
  • Genetic Programming (GP) is an intelligence technique whereby computer programs are encoded as a set of genes which are evolved utilizing a Genetic Algorithm (GA). In other words, the GP employs novel optimization techniques to modify computer programs; imitating the way humans develop programs by progressively re-writing them for solving problems automatically. Trial programs are frequently altered in the search for obtaining superior solutions due to the base is GA. These are evolutionary search techniques inspired by biological evolution such as mutation, reproduction, natural selection, recombination, and survival of the fittest. The power of GAs is being represented by an advancing range of applications; vector processing, quantum computing, VLSI circuit layout, and so on. But one of the most significant uses of GAs is the automatic generation of programs. Technically, the GP solves problems automatically without having to tell the computer specifically how to process it. To meet this requirement, the GP utilizes GAs to a "population" of trial programs, traditionally encoded in memory as tree-structures. Trial programs are estimated using a "fitness function" and the suited solutions picked for re-evaluation and modification such that this sequence is replicated until a "correct" program is generated. GP has represented its power by modifying a simple program for categorizing news stories, executing optical character recognition, medical signal filters, and for target identification, etc. This paper reviews existing literature regarding the GPs and their applications in different scientific fields and aims to provide an easy understanding of various types of GPs for beginners.

Baseline Correction in Computed Radiography Images with 1D Morphological Filter (CR 영상에서 기저선 보정을 위한 1차원 모폴로지컬 필터의 이용에 관한 연구)

  • Kim, Yong-Gwon;Ryu, Yeunchul
    • Journal of radiological science and technology
    • /
    • v.45 no.5
    • /
    • pp.397-405
    • /
    • 2022
  • Computed radiography (CR) systems, which convert an analog signal recorded on a cassette into a digital image, combine the characteristics of analog and digital imaging systems. Compared to digital radiography (DR) systems, CR systems have presented difficulties in evaluating system performance because of their lower detective quantum efficiency, their lower signal-to-noise ratio (SNR), and lower modulation transfer function (MTF). During the step of energy-storing and reading out, a baseline offset occurs in the edge area and makes low-frequency overestimation. The low-frequency offset component in the line spread function (LSF) critically affects the MTF and other image-analysis or qualification processes. In this study, we developed the method of baseline correction using mathematical morphology to determine the LSF and MTF of CR systems accurately. We presented a baseline correction that used a morphological filter to effectively remove the low-frequency offset from the LSF. We also tried an MTF evaluation of the CR system to demonstrate the effectiveness of the baseline correction. The MTF with a 3-pixel structuring element (SE) fluctuated since it overestimated the low-frequency component. This overestimation led the algorithm to over-compensate in the low-frequency region so that high-frequency components appeared relatively strong. The MTFs with between 11- and 15-pixel SEs showed little variation. Compared to spatial or frequency filtering that eliminated baseline effects in the edge spread function, our algorithm performed better at precisely locating the edge position and the averaged LSF was narrower.

A study on machine learning-based anomaly detection algorithm using current data of fish-farm pump motor (양식장 펌프 모터 전류 데이터를 이용한 머신러닝 기반 이상 감지 알고리즘에 관한 연구)

  • Sae-yong Park;Tae Uk chang;Taeho Im
    • Journal of Internet Computing and Services
    • /
    • v.24 no.2
    • /
    • pp.37-45
    • /
    • 2023
  • In line with the 4th Industrial Revolution, facility maintenance technologies for building smart factories are receiving attention and are being advanced. In addition, technology is being applied to smart farms and smart fisheries following smart factories. Among them, in the case of a recirculating aquaculture system, there is a motor pump that circulates water for a stable quality environment in the tank. Motor pump maintenance activities for recirculating aquaculture system are carried out based on preventive maintenance and data obtained from vibration sensor. Preventive maintenance cannot cope with abnormalities that occur before prior planning, and vibration sensors are affected by the external environment. This paper proposes an anomaly detection algorithm that utilizes ADTK, a Python open source, for motor pump anomaly detection based on data collected through current sensors that are less affected by the external environment than noise, temperature and vibration sensors.

The Potential Energy Surface of BH5 and the Rate of the Hydrogen Scrambling

  • Kim, Kyung-Hyun;Kim, Yong-Ho
    • Bulletin of the Korean Chemical Society
    • /
    • v.24 no.6
    • /
    • pp.763-770
    • /
    • 2003
  • The $BH_5$ molecule, which is suggested as an intermediate of the acidolysis of $BH_4^-$, contains a weak two-electron-three-center bond and it requires extremely high-level of theories to calculate the energy and structure correctly. The structures and energies of $BH_5$ and the transition state for the hydrogen scrambling have been studied using recently developed multi-coefficient correlated quantum mechanical methods (MCCMs). The dissociation energies and the barrier heights agree very well with the previous results at the CCSD(T)/ TZ(3d1f1g, 2p1d) level. We have also calculated the potential energy curves for the dissociation of $BH_5$ to $BH_3$ and $H_2$. The lower levels of theory were unable to plot correct potential curves, whereas the MCCM methods give very good potential energy curves and requires much less computing resources than the CCSD(T)/ TZ(3d1f1g,2p1d) level. The potential energy of the $BH_5$ scrambling has been obtained by the multiconfiguration molecular mechanics algorithm (MCMM), and the rates are calculated using the variational transition state theory including multidimensional tunneling approximation. The rate constant at 300 K is 2.1 × $10^9s^{-1}$, and tunneling is very important.

A Study on Correcting Korean Pronunciation Error of Foreign Learners by Using Supporting Vector Machine Algorithm

  • Jang, Kyungnam;You, Kwang-Bock;Park, Hyungwoo
    • International Journal of Advanced Culture Technology
    • /
    • v.8 no.3
    • /
    • pp.316-324
    • /
    • 2020
  • It has experienced how difficult People with foreign language learning, it is to pronounce a new language different from the native language. The goal of various foreigners who want to learn Korean is to speak Korean as well as their native language to communicate smoothly. However, each native language's vocal habits also appear in Korean pronunciation, which prevents accurate information transmission. In this paper, the pronunciation of Chinese learners was compared with that of Korean. For comparison, the fundamental frequency and its variation of the speech signal were examined and the spectrogram was analyzed. The Formant frequencies known as the resonant frequency of the vocal tract were calculated. Based on these characteristics parameters, the classifier of the Supporting Vector Machine was found to classify the pronunciation of Koreans and the pronunciation of Chinese learners. In particular, the linguistic proposition was scientifically proved by examining the Korean pronunciation of /ㄹ/ that the Chinese people were not good at pronouncing.

Identity Based Proxy Re-encryption Scheme under LWE

  • Yin, Wei;Wen, Qiaoyan;Li, Wenmin;Zhang, Hua;Jin, Zheng Ping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.6116-6132
    • /
    • 2017
  • The proxy re-encryption allows an intermediate proxy to convert a ciphertext for Alice into a ciphertext for Bob without seeing the original message and leaking out relevant information. Unlike many prior identity based proxy re-encryption schemes which are based on the number theoretic assumptions such as large integer factorization and discrete logarithm problem. In this paper, we first propose a novel identity based proxy re-encryption scheme which is based on the hardness of standard Learning With Error(LWE) problem and is CPA secure in the standard model. This scheme can be reduced to the worst-case lattice hard problem that is able to resist attacks from quantum algorithm. The key step in our construction is that the challenger how to answer the private query under a known trapdoor matrix. Our scheme enjoys properties of the non-interactivity, unidirectionality, anonymous and so on. In this paper, we utilize primitives include G-trapdoor for lattice and sample algorithms to realize simple and efficient re-encryption.