• Title/Summary/Keyword: Improved similarity

Search Result 328, Processing Time 0.026 seconds

Turbulent-image Restoration Based on a Compound Multibranch Feature Fusion Network

  • Banglian Xu;Yao Fang;Leihong Zhang;Dawei Zhang;Lulu Zheng
    • Current Optics and Photonics
    • /
    • v.7 no.3
    • /
    • pp.237-247
    • /
    • 2023
  • In middle- and long-distance imaging systems, due to the atmospheric turbulence caused by temperature, wind speed, humidity, and so on, light waves propagating in the air are distorted, resulting in image-quality degradation such as geometric deformation and fuzziness. In remote sensing, astronomical observation, and traffic monitoring, image information loss due to degradation causes huge losses, so effective restoration of degraded images is very important. To restore images degraded by atmospheric turbulence, an image-restoration method based on improved compound multibranch feature fusion (CMFNetPro) was proposed. Based on the CMFNet network, an efficient channel-attention mechanism was used to replace the channel-attention mechanism to improve image quality and network efficiency. In the experiment, two-dimensional random distortion vector fields were used to construct two turbulent datasets with different degrees of distortion, based on the Google Landmarks Dataset v2 dataset. The experimental results showed that compared to the CMFNet, DeblurGAN-v2, and MIMO-UNet models, the proposed CMFNetPro network achieves better performance in both quality and training cost of turbulent-image restoration. In the mixed training, CMFNetPro was 1.2391 dB (weak turbulence), 0.8602 dB (strong turbulence) respectively higher in terms of peak signal-to-noise ratio and 0.0015 (weak turbulence), 0.0136 (strong turbulence) respectively higher in terms of structure similarity compared to CMFNet. CMFNetPro was 14.4 hours faster compared to the CMFNet. This provides a feasible scheme for turbulent-image restoration based on deep learning.

Comparative Analysis on Smart Features of IoT Home Living Products among Korea, China and Japan (한·중·일 IoT홈 가전생활재의 지능형 기능성 비교연구)

  • Zhang, Chun Chun;Lee, Yeun Sook;Hwang, Ji Hye;Park, Jae Hyun
    • Design Convergence Study
    • /
    • v.15 no.2
    • /
    • pp.237-250
    • /
    • 2016
  • Along with rapid development, progress of the network technology and digital information technology, human are stepping into the intelligent society of internet. Thereby the quality of living environment and working environment are keep improving. Under the big background of internet era, the timeliness and convenience of smart home system has been improved greatly. While lots of smart products have gradually penetrated into people's daily life. The household appliances are among most popular ones. This paper is intended to compare smart features of household living products among most representative brands in China, Japan and South Korea. The smart features include self-learning, self-adapting, self-coordinating, self-diagnosing, self-inferring, self-organizing, and self adjusting. As result, most smart features of these products showed great similarity. While some features were dominated according to countries such as remote control feature in Korea, energy saving feature in Japan, and one button operation feature in China.

Field measurement study on snow accumulation process around a cube during snowdrift

  • Wenyong Ma;Sai Li;Xuanyi Zhou;Yuanchun Sun;Zihan Cui;Ziqi Tang
    • Wind and Structures
    • /
    • v.37 no.1
    • /
    • pp.25-38
    • /
    • 2023
  • Due to the complexity and difficulty in meeting the multiphase flow complexity, similarity, and multiscale characteristics, the mechanism of snow drift is so complicated that the snow deposition prediction is still inaccurate and needs to be far improved. Meanwhile, the validation of prediction methods is also limited due to a lack of field-measured data about snow deposition. To this end, a field measurement activity about snow deposition around a cube with time was carried out, and the snow accumulation process was measured under blowing snow conditions in northwest China. The maximum snow depth, snow profile, and variation in snow depth around the cube were discussed and analyzed. The measured results indicated three stages of snow accumulation around the cube. First, snow is deposited in windward, lateral and leeward regions, and then the snow depth in windward and lateral regions increases. Secondly, when the snow in the windward region reaches its maximum, the downwash flow erodes the snow against the front wall. Meanwhile, snow range and depth in lateral regions have a significant increase. Thirdly, a narrow road in the leeward region is formed with the increase in snow range and depth, which results in higher wind speed and reforming snow deposition there. The field measurement study in this paper not only furthers understanding of the snow accumulation process instead of final deposition under complex conditions but also provides an important benchmark for validating prediction methods.

Character Region Detection in Natural Image Using Edge and Connected Component by Morphological Reconstruction (에지 및 형태학적 재구성에 의한 연결요소를 이용한 자연영상의 문자영역 검출)

  • Gwon, Gyo-Hyeon;Park, Jong-Cheon;Jun, Byoung-Min
    • Journal of Korea Entertainment Industry Association
    • /
    • v.5 no.1
    • /
    • pp.127-133
    • /
    • 2011
  • Characters in natural image are an important information with various context. Previous work of character region detection algorithms is not detect of character region in case of image complexity and the surrounding lighting, similar background to character, so this paper propose an method of character region detection in natural image using edge and connected component by morphological reconstructions. Firstly, we detect edge using Canny-edge detector and connected component with local min/max value by morphological reconstructed-operation in gray-scale image, and labeling each of detected connected component elements. lastly, detected candidate of text regions was merged for generation for one candidate text region, Final text region detected by checking the similarity and adjacency of neighbor of text candidate individual character. As the results of experiments, proposed algorithm improved the correctness of character regions detection using edge and connected components.

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.

Key Principles of Clinical Validation, Device Approval, and Insurance Coverage Decisions of Artificial Intelligence

  • Seong Ho Park;Jaesoon Choi;Jeong-Sik Byeon
    • Korean Journal of Radiology
    • /
    • v.22 no.3
    • /
    • pp.442-453
    • /
    • 2021
  • Artificial intelligence (AI) will likely affect various fields of medicine. This article aims to explain the fundamental principles of clinical validation, device approval, and insurance coverage decisions of AI algorithms for medical diagnosis and prediction. Discrimination accuracy of AI algorithms is often evaluated with the Dice similarity coefficient, sensitivity, specificity, and traditional or free-response receiver operating characteristic curves. Calibration accuracy should also be assessed, especially for algorithms that provide probabilities to users. As current AI algorithms have limited generalizability to real-world practice, clinical validation of AI should put it to proper external testing and assisting roles. External testing could adopt diagnostic case-control or diagnostic cohort designs. A diagnostic case-control study evaluates the technical validity/accuracy of AI while the latter tests the clinical validity/accuracy of AI in samples representing target patients in real-world clinical scenarios. Ultimate clinical validation of AI requires evaluations of its impact on patient outcomes, referred to as clinical utility, and for which randomized clinical trials are ideal. Device approval of AI is typically granted with proof of technical validity/accuracy and thus does not intend to directly indicate if AI is beneficial for patient care or if it improves patient outcomes. Neither can it categorically address the issue of limited generalizability of AI. After achieving device approval, it is up to medical professionals to determine if the approved AI algorithms are beneficial for real-world patient care. Insurance coverage decisions generally require a demonstration of clinical utility that the use of AI has improved patient outcomes.

Resolving the 'Gray sheep' Problem Using Social Network Analysis (SNA) in Collaborative Filtering (CF) Recommender Systems (소셜 네트워크 분석 기법을 활용한 협업필터링의 특이취향 사용자(Gray Sheep) 문제 해결)

  • Kim, Minsung;Im, Il
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.137-148
    • /
    • 2014
  • Recommender system has become one of the most important technologies in e-commerce in these days. The ultimate reason to shop online, for many consumers, is to reduce the efforts for information search and purchase. Recommender system is a key technology to serve these needs. Many of the past studies about recommender systems have been devoted to developing and improving recommendation algorithms and collaborative filtering (CF) is known to be the most successful one. Despite its success, however, CF has several shortcomings such as cold-start, sparsity, gray sheep problems. In order to be able to generate recommendations, ordinary CF algorithms require evaluations or preference information directly from users. For new users who do not have any evaluations or preference information, therefore, CF cannot come up with recommendations (Cold-star problem). As the numbers of products and customers increase, the scale of the data increases exponentially and most of the data cells are empty. This sparse dataset makes computation for recommendation extremely hard (Sparsity problem). Since CF is based on the assumption that there are groups of users sharing common preferences or tastes, CF becomes inaccurate if there are many users with rare and unique tastes (Gray sheep problem). This study proposes a new algorithm that utilizes Social Network Analysis (SNA) techniques to resolve the gray sheep problem. We utilize 'degree centrality' in SNA to identify users with unique preferences (gray sheep). Degree centrality in SNA refers to the number of direct links to and from a node. In a network of users who are connected through common preferences or tastes, those with unique tastes have fewer links to other users (nodes) and they are isolated from other users. Therefore, gray sheep can be identified by calculating degree centrality of each node. We divide the dataset into two, gray sheep and others, based on the degree centrality of the users. Then, different similarity measures and recommendation methods are applied to these two datasets. More detail algorithm is as follows: Step 1: Convert the initial data which is a two-mode network (user to item) into an one-mode network (user to user). Step 2: Calculate degree centrality of each node and separate those nodes having degree centrality values lower than the pre-set threshold. The threshold value is determined by simulations such that the accuracy of CF for the remaining dataset is maximized. Step 3: Ordinary CF algorithm is applied to the remaining dataset. Step 4: Since the separated dataset consist of users with unique tastes, an ordinary CF algorithm cannot generate recommendations for them. A 'popular item' method is used to generate recommendations for these users. The F measures of the two datasets are weighted by the numbers of nodes and summed to be used as the final performance metric. In order to test performance improvement by this new algorithm, an empirical study was conducted using a publically available dataset - the MovieLens data by GroupLens research team. We used 100,000 evaluations by 943 users on 1,682 movies. The proposed algorithm was compared with an ordinary CF algorithm utilizing 'Best-N-neighbors' and 'Cosine' similarity method. The empirical results show that F measure was improved about 11% on average when the proposed algorithm was used

    . Past studies to improve CF performance typically used additional information other than users' evaluations such as demographic data. Some studies applied SNA techniques as a new similarity metric. This study is novel in that it used SNA to separate dataset. This study shows that performance of CF can be improved, without any additional information, when SNA techniques are used as proposed. This study has several theoretical and practical implications. This study empirically shows that the characteristics of dataset can affect the performance of CF recommender systems. This helps researchers understand factors affecting performance of CF. This study also opens a door for future studies in the area of applying SNA to CF to analyze characteristics of dataset. In practice, this study provides guidelines to improve performance of CF recommender systems with a simple modification.

  • Exploring the Effect of First Year Science-Focused School Program on High School Students' Science Core Competency and Science Learning Motivation Using Group-Based Trajectory Modeling (집단중심 추세모형을 이용한 과학중점학교 1학년 프로그램이 고등학생들의 과학과 핵심역량과 과학학습동기에 미치는 영향 탐색)

    • Ha, Minsu;Lee, Kiyoung;Choi, Eunhwan;Kim, Ilchan;Yu, Jihye;Won, Bokyeon
      • Journal of The Korean Association For Science Education
      • /
      • v.39 no.6
      • /
      • pp.799-807
      • /
      • 2019
    • The study was conducted to identify if the first-year program of science-focused school improved students' scientific core competency and science learning motivation. The first-year program of the science-focused school consisted of basic education in scientific inquiry, investigation, advanced experiment, and basic education in small research. There were a total of 262 participants in the program, and 169 students took three survey tests. Through the analysis of a group-based trajectory modeling, students were differentiated based on similarity of score changes. This study showed that the first-year program of the science-focused school significantly improved students' scientific core competency and science learning motivation. A group-based trajectory modeling found that about 40~60% of students saw the effects of the program. The students who chose the humanity track showed effects, while some students who chose the science-focused track did not show effects. A group-based trajectory modeling showed the methodological effects of identifying the change process of individual students. This study identified the positive effects of science-focused school policy statistically and is a meaningful example for analyzing the effectiveness of science-focused school programs.

    Study on the Centipede Bite Cases Who Visited a Medical Center (일개 의료원을 방문한 지네 교상 환례에 대한 조사)

    • Lee, Dong-Uk
      • Journal of agricultural medicine and community health
      • /
      • v.27 no.1
      • /
      • pp.79-86
      • /
      • 2002
    • Thirty six patients, female 21(58.4%), male 15(58.4%), with centipede bite visited emergency room of Gimcheon Medical Center, from September 1998 to August 1999. The number of patients accompanying the seasons were increased once in June and were high in August and September; peaked in September, which conforms to the habitude that centipede likes the warmer climate. Frequency accompanying the time was high after sunset(from 6 p.m. to 6 a.m. next morning) than before sunset, which conforms to the habitude that centipede is nocturnal. Distribution of the bite sites was finger(30%), neck(28%), foot(25%) and hand(14%) as same as the previous researches showed. In case of finger and hand, patients got bitten while they were wearing gloves or doing works; foot, wearing shoes. They got bitten the neck while sleeping. Among the localized symptoms were localized pain: 36 patients(100%), swelling: 36 patients(100%), erythema: 26 patients(72.2%), paresthesia: 5 patients (13.9%). Systemic symptoms were dizziness 2 patients(5.6%) and nausea 1 patient(2.8%). Mostly the localized pain was improved within 48 hours, swelling in 48 hours and within 72 hours in case of paresthesia. Systemic symptoms such as dizziness and nausea were improved within 24 hours. Treatment and prognosis of scolopendra have similarity in many countries. We suggest that Korean standard treatment manual is needed so that the localized symptom, systemic symptom and external wound can be cured soon.

    • PDF

    A Study on Market Size Estimation Method by Product Group Using Word2Vec Algorithm (Word2Vec을 활용한 제품군별 시장규모 추정 방법에 관한 연구)

    • Jung, Ye Lim;Kim, Ji Hui;Yoo, Hyoung Sun
      • Journal of Intelligence and Information Systems
      • /
      • v.26 no.1
      • /
      • pp.1-21
      • /
      • 2020
    • With the rapid development of artificial intelligence technology, various techniques have been developed to extract meaningful information from unstructured text data which constitutes a large portion of big data. Over the past decades, text mining technologies have been utilized in various industries for practical applications. In the field of business intelligence, it has been employed to discover new market and/or technology opportunities and support rational decision making of business participants. The market information such as market size, market growth rate, and market share is essential for setting companies' business strategies. There has been a continuous demand in various fields for specific product level-market information. However, the information has been generally provided at industry level or broad categories based on classification standards, making it difficult to obtain specific and proper information. In this regard, we propose a new methodology that can estimate the market sizes of product groups at more detailed levels than that of previously offered. We applied Word2Vec algorithm, a neural network based semantic word embedding model, to enable automatic market size estimation from individual companies' product information in a bottom-up manner. The overall process is as follows: First, the data related to product information is collected, refined, and restructured into suitable form for applying Word2Vec model. Next, the preprocessed data is embedded into vector space by Word2Vec and then the product groups are derived by extracting similar products names based on cosine similarity calculation. Finally, the sales data on the extracted products is summated to estimate the market size of the product groups. As an experimental data, text data of product names from Statistics Korea's microdata (345,103 cases) were mapped in multidimensional vector space by Word2Vec training. We performed parameters optimization for training and then applied vector dimension of 300 and window size of 15 as optimized parameters for further experiments. We employed index words of Korean Standard Industry Classification (KSIC) as a product name dataset to more efficiently cluster product groups. The product names which are similar to KSIC indexes were extracted based on cosine similarity. The market size of extracted products as one product category was calculated from individual companies' sales data. The market sizes of 11,654 specific product lines were automatically estimated by the proposed model. For the performance verification, the results were compared with actual market size of some items. The Pearson's correlation coefficient was 0.513. Our approach has several advantages differing from the previous studies. First, text mining and machine learning techniques were applied for the first time on market size estimation, overcoming the limitations of traditional sampling based- or multiple assumption required-methods. In addition, the level of market category can be easily and efficiently adjusted according to the purpose of information use by changing cosine similarity threshold. Furthermore, it has a high potential of practical applications since it can resolve unmet needs for detailed market size information in public and private sectors. Specifically, it can be utilized in technology evaluation and technology commercialization support program conducted by governmental institutions, as well as business strategies consulting and market analysis report publishing by private firms. The limitation of our study is that the presented model needs to be improved in terms of accuracy and reliability. The semantic-based word embedding module can be advanced by giving a proper order in the preprocessed dataset or by combining another algorithm such as Jaccard similarity with Word2Vec. Also, the methods of product group clustering can be changed to other types of unsupervised machine learning algorithm. Our group is currently working on subsequent studies and we expect that it can further improve the performance of the conceptually proposed basic model in this study.


    (34141) Korea Institute of Science and Technology Information, 245, Daehak-ro, Yuseong-gu, Daejeon
    Copyright (C) KISTI. All Rights Reserved.