• Title/Summary/Keyword: Optimized algorithm

Search Result 1,806, Processing Time 0.032 seconds

An Optimized Iterative Semantic Compression Algorithm And Parallel Processing for Large Scale Data

  • Jin, Ran;Chen, Gang;Tung, Anthony K.H.;Shou, Lidan;Ooi, Beng Chin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2761-2781
    • /
    • 2018
  • With the continuous growth of data size and the use of compression technology, data reduction has great research value and practical significance. Aiming at the shortcomings of the existing semantic compression algorithm, this paper is based on the analysis of ItCompress algorithm, and designs a method of bidirectional order selection based on interval partitioning, which named An Optimized Iterative Semantic Compression Algorithm (Optimized ItCompress Algorithm). In order to further improve the speed of the algorithm, we propose a parallel optimization iterative semantic compression algorithm using GPU (POICAG) and an optimized iterative semantic compression algorithm using Spark (DOICAS). A lot of valid experiments are carried out on four kinds of datasets, which fully verified the efficiency of the proposed algorithm.

A study on the effectively optimized algorithm for an incremental attribute grammar (점진적 속성문법을 위한 효과적인 최적화 알고리즘에 관한 연구)

  • Jang, Jae-Chun;Ahn, Heui-Hak
    • The KIPS Transactions:PartA
    • /
    • v.8A no.3
    • /
    • pp.209-216
    • /
    • 2001
  • The effective way to apply incremental attribute grammar to a complex language process is the use of optimized algorithm. In optimized algorithm for incremental attribute grammar, the new input attribute tree should be exactly compared with the previous input attribute tree, in order to determine which subtrees from the old should be used in constructing the new one. In this paper the new optimized algorithm was reconstructed by analyzing the algorithm suggested by Carle and Pollock, and a generation process of new attribute tree d’copy was added. Through the performance evaluation for the suggested matching algorithm, the run time is approximately improved by 19.5%, compared to the result of existing algorithm.

  • PDF

Optimization of Non-Local Means Algorithm in Low-Dose Computed Tomographic Image Based on Noise Level and Similarity Evaluations (노이즈 레벨 및 유사도 평가 기반 저선량 조건의 전산화 단층 검사 영상에서의 비지역적 평균 알고리즘의 최적화)

  • Ha-Seon Jeong;Ie-Jun Kim;Su-Bin Park;Suyeon Park;Yunji Oh;Woo-Seok Lee;Kang-Hyeon Seo;Youngjin Lee
    • Journal of radiological science and technology
    • /
    • v.47 no.1
    • /
    • pp.39-48
    • /
    • 2024
  • In this study, we optimized the FNLM algorithm through a simulation study and applied it to a phantom scanned by low-dose CT to evaluate whether the FNLM algorithm can be used to obtain improved image quality images. We optimized the FNLM algorithm with MASH phantom and FASH phantom, which the algorithm was applied with MATLAB, increasing the smoothing factor from 0.01 to 0.05 with increments of 0.001 and measuring COV, RMSE, and PSNR values of the phantoms. For both phantom, COV and RMSE decreased, and PSNR increased as the smoothing factor increased. Based on the above results, we optimized a smoothing factor value of 0.043 for the FNLM algorithm. Then we applied the optimized FNLM algorithm to low dose lung CT and lung CT under normal conditions. In both images, the COV decreased by 55.33 times and 5.08 times respectively, and we confirmed that the quality of the image of low dose CT applying the optimized FNLM algorithm was 5.08 times better than the image of lung CT under normal conditions. In conclusion, we found that the smoothing factor of 0.043 among the factors of the FNLM algorithm showed the best results and validated the performance by reducing the noise in the low-quality CT images due to low dose with the optimized FNLM algorithm.

Trends in AI Processor Technology (인공지능프로세서 기술 동향)

  • Lee, M.Y.;Chung, J.;Lee, J.H.;Han, J.H.;Kwon, Y.S.
    • Electronics and Telecommunications Trends
    • /
    • v.35 no.3
    • /
    • pp.66-75
    • /
    • 2020
  • As the increasing expectations of a practical AI (Artificial Intelligence) service makes AI algorithms more complicated, an efficient processor to process AI algorithms is required. To meet this requirement, processors optimized for parallel processing, such as GPUs (Graphics Processing Units), have been widely employed. However, the GPU has a generalized structure for various applications, so it is not optimized for the AI algorithm. Therefore, research on the development of AI processors optimized for AI algorithm processing has been actively conducted. This paper briefly introduces an AI processor especially for inference acceleration, developed by the Electronics and Telecommunications Research Institute, South Korea., and other global vendors for mobile and server platforms. However, the GPU has a generalized structure for various applications, so it is not optimized for the AI algorithm. Therefore, research on the development of AI processors optimized for AI algorithm processing has been actively conducted.

Research finding optimized evacuation route of people in subway passenger cars using genetic algorithm (유전 알고리즘을 이용한 지하철 객차 내 승객의 최적대피경로 탐색)

  • Choi, Jae Hyuk;Park, Ji Hye;Choi, Su Hyeon;Kim, Nam Moon
    • Proceeding of EDISON Challenge
    • /
    • 2015.03a
    • /
    • pp.543-546
    • /
    • 2015
  • There have been subway conflagrations such as Daegu subway conflagration at 2003, Washington D.C conflagration last month and so on. Compared to that, proper evacuation route is far from satisfactory. So this paper suggests optimized route when subway's passengers evacuate from passenger cars. For conducting our experiment, We made temporarily a model of subway station which is made up with 8 passengers cars and 3 exits. Using genetic algorithm, we found the optimized route that first and second passenger cars are optimized to first exit and third, fourth, fifth and sixth passengers cars are optimized to second exit and finally seventh, eighth passengers cars are optimized to third exit. It is expected that real subway station is applied to our experiment by developing passenger distribution algorithm.

  • PDF

Optimized inverse distance weighted interpolation algorithm for γ radiation field reconstruction

  • Biao Zhang;Jinjia Cao;Shuang Lin;Xiaomeng Li;Yulong Zhang;Xiaochang Zheng;Wei Chen;Yingming Song
    • Nuclear Engineering and Technology
    • /
    • v.56 no.1
    • /
    • pp.160-166
    • /
    • 2024
  • The inversion of radiation field distribution is of great significance in the decommissioning sites of nuclear facilities. However, the radiation fields often contain multiple mixtures of radionuclides, making the inversion extremely difficult and posing a huge challenge. Many radiation field reconstruction methods, such as Kriging algorithm and neural network, can not solve this problem perfectly. To address this issue, this paper proposes an optimized inverse distance weighted (IDW) interpolation algorithm for reconstructing the gamma radiation field. The algorithm corrects the difference between the experimental and simulated scenarios, and the data is preprocessed with normalization to improve accuracy. The experiment involves setting up gamma radiation fields of three Co-60 radioactive sources and verifying them by using the optimized IDW algorithm. The results show that the mean absolute percentage error (MAPE) of the reconstruction result obtained by using the optimized IDW algorithm is 16.0%, which is significantly better than the results obtained by using the Kriging method. Importantly, the optimized IDW algorithm is suitable for radiation scenarios with multiple radioactive sources, providing an effective method for obtaining radiation field distribution in nuclear facility decommissioning engineering.

Adaptive Slot-Count Selection Algorithm based on Tag Replies in EPCglobal Gen-2 RFID System

  • Lim, In-Taek
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.653-655
    • /
    • 2011
  • EPCglobal proposed a Q-algorithm, which is used for selecting a slot-count in the next query round. However, it is impossible to allocate an optimized slot-count because the original Q-algorithm did not define an optimized weight C value. In this paper, we propose an adaptive Q-algorithm, in which we differentiate the weight values with respect to collision and empty slots. The weight values are defined with the identification time as well as the collision probability.

  • PDF

Parameter Optimization of Long and Short Term Runoff Models Using Genetic Algorithm (유전자 알고리즘을 이용한 장·단기 유출모형의 매개변수 최적화)

  • Kim, Sun-Joo;Jee, Yong-Geun;Kim, Phil-Shik
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.46 no.5
    • /
    • pp.41-52
    • /
    • 2004
  • In this study, parameters of long and short term runoff model were optimized using genetic algorithm as a basic research for integrated water management in a watershed. In case of Korea where drought and flood occurr frequently, the integrated water management is necessary to minimize possible damage of drought and flood. Modified TANK model was optimized as a long term runoff model and storage-function model was optimized as a short term runoff model. Besides distinguished parameters were applied to modified TANK model for supplementing defect that the model estimates less runoff in the storm period. As a result of application, simulated long and short term runoff results showed 7% and 5% improvement compared with before optimized on the average. In case of modified TANK model using distinguished parameters, the simulated runoff after optimized showed more interrelationship than before optimized. Therefore, modified TANK model can be applied for the long term water balance as an integrated water management in a watershed. In case of storage-function model, simulated runoff in the storm period showed high interrelationship with observed one. These optimized models can be applied for the runoff analysis of watershed.

Thermal Image Mosaicking Using Optimized FAST Algorithm

  • Nguyen, Truong Linh;Han, Dong Yeob
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.35 no.1
    • /
    • pp.41-53
    • /
    • 2017
  • A thermal camera is used to obtain thermal information of a certain area. However, it is difficult to depict all the information of an area in an individual thermal image. To form a high-resolution panoramic thermal image, we propose an optimized FAST (feature from accelerated segment test) algorithm to combine two or more images of the same scene. The FAST is an accurate and fast algorithm that yields good positional accuracy and high point reliability; however, the major limitation of a FAST detector is that multiple features are detected adjacent to one another and the interest points cannot be obtained under no significant difference in thermal images. Our proposed algorithm not only detects the features in thermal images easily, but also takes advantage of the speed of the FAST algorithm. Quantitative evaluation shows that our proposed technique is time-efficient and accurate. Finally, we create a mosaic of the video to analyze a comprehensive view of the scene.

Optimum Design for Piezoelectric Actuator of Inkjet head for Improving Performance (Inkjet head에서의 압전 작동기에 대한 성능 향상을 위한 최적설계)

  • 김시종;조종두
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1997.10a
    • /
    • pp.655-658
    • /
    • 1997
  • In this paper, we intend to develop optimized design algorithm by deciding design parameters which are considered in the first design stage of inkjet printer head. thus, the parameters are such as electric pulse, input voltage of actuator to operate actuator, shape dimension of actuator an so on. in the first design stage, according to such parameters, a lot of time and money to develop inkject printer head are needed. to reduce trial and error and to save development time in the first design stage, optimized design algorithm is required all the more. design algorithm was developed via commercial FE analysis code(ANSYS & COENTOR) for the readability and convenience of algorithm. the reasonability of algorithm was verified by implementing analysis of system stage based on the data of piezoelectric actuator which was designed through algorithm.

  • PDF