• Title/Summary/Keyword: 증명학습

Search Result 358, Processing Time 0.028 seconds

Gaussian Blending: Improved 3D Gaussian Splatting for Model Light-Weighting and Deep Learning-Based Performance Enhancement

  • Yeong-In Lee;Jin-Nyeong Heo;Ji-Hwan Moon;Ha-Young Kim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.29 no.8
    • /
    • pp.23-32
    • /
    • 2024
  • NVS (Novel View Synthesis) is a field in computer vision that reconstructs new views of a scene from a set of input views. Real-time rendering and high performance are essential for NVS technology to be effectively utilized in various applications. Recently, 3D-GS (3D Gaussian Splatting) has gained popularity due to its faster training and inference times compared to those of NeRF (Neural Radiance Fields)-based methodologies. However, since 3D-GS reconstructs a 3D (Three-Dimensional) scene by splitting and cloning (Density Control) Gaussian points, the number of Gaussian points continuously increases, causing the model to become heavier as training progresses. To address this issue, we propose two methodologies: 1) Gaussian blending, an improved density control methodology that removes unnecessary Gaussian points, and 2) a performance enhancement methodology using a depth estimation model to minimize the loss in representation caused by the blending of Gaussian points. Experiments on the Tanks and Temples Dataset show that the proposed methodologies reduce the number of Gaussian points by up to 4% while maintaining performance.

The Growth of School Mathematics: Korean Secondary Gifted Students' Collaborative Problem Solving Using The Wiki (학교수학적 지식의 성장: 고등학교 영재 학생들의 위키(Wiki) 기반 협력 문제해결 활동을 중심으로)

  • Lee, Seoung Woo
    • Journal of Educational Research in Mathematics
    • /
    • v.25 no.4
    • /
    • pp.717-754
    • /
    • 2015
  • As a design research, this study aims to identify students' collaborative problems solving patterns using the Wiki and design factors triggering MKB(mathematical knowledge building) in virtual environment. For 70 days, 14 Korean secondary gifted students, who enrolled in calculus II courses in one of gifted institutions in Korea, solved 10 math problems together using the Wiki. In this study, I considered five design factors; motivation, practice of LaTeX, norms of participation, epistemic agency, and two types of educational settings. The primary pattern emergent in students' collaborative problem solving process is identified as 'solutions and refutations' along the double helix consisting of the constructive line and the critical line, which is very similar to the pattern of 'Conjectures and Refutations'(Lakatos, 1976). Despite that most participants had difficulty in using LaTeX for mathematical expressions, this study shows that Wikis are valuable tools for providing Korean secondary students opportunities to learn social virtue such as humility and courage (Lampert, 1990), which is considered to be have been neglected in Korean educational environment but is emphasized as precious for doing mathematics in the field of mathematics education.

The Improvement of Convergence Characteristic using the New RLS Algorithm in Recycling Buffer Structures

  • Kim, Gwang-Jun;Kim, Chun-Suck
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.4
    • /
    • pp.691-698
    • /
    • 2003
  • We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-l, we may compute the updated estimate of this vector at iteration n upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RLS algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the B times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.

Performance Enhancement of Tree Kernel-based Protein-Protein Interaction Extraction by Parse Tree Pruning and Decay Factor Adjustment (구문 트리 가지치기 및 소멸 인자 조정을 통한 트리 커널 기반 단백질 간 상호작용 추출 성능 향상)

  • Choi, Sung-Pil;Choi, Yun-Soo;Jeong, Chang-Hoo;Myaeng, Sung-Hyon
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.2
    • /
    • pp.85-94
    • /
    • 2010
  • This paper introduces a novel way to leverage convolution parse tree kernel to extract the interaction information between two proteins in a sentence without multiple features, clues and complicated kernels. Our approach needs only the parse tree alone of a candidate sentence including pairs of protein names which is potential to have interaction information. The main contribution of this paper is two folds. First, we show that for the PPI, it is imperative to execute parse tree pruning removing unnecessary context information in deciding whether the current sentence imposes interaction information between proteins by comparing with the latest existing approaches' performance. Secondly, this paper presents that tree kernel decay factor can play an pivotal role in improving the extraction performance with the identical learning conditions. Consequently, we could witness that it is not always the case that multiple kernels with multiple parsers perform better than each kernels alone for PPI extraction, which has been argued in the previous research by presenting our out-performed experimental results compared to the two existing methods by 19.8% and 14% respectively.

Image Rejection Method with Circular Trajectory Characteristic of Single-Frequency Continuous-Wave Signal (단일 주파수 연속파 신호의 원형 궤도 특성을 이용한 영상 제거 방법)

  • Park, Hyung-Chul
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.4
    • /
    • pp.148-156
    • /
    • 2009
  • This paper presents a new image rejection algorithm based on the analysis of the distortion of a single-frequency continuous-wave (CW) signal due to the I/Q mismatch. Existing methods estimated the gain mismatch and phase mismatch on RF receivers and compensated them However, this paper shows that the circular trajectory of a single-frequency CW signal is distorted elliptic-type trajectory due to the I/Q mismatch. Utilizing the analysis, we propose a I/Q mismatch compensation method. It has two processing steps. In the first processing step, the generated signal is rotated to align the major axis of the elliptic-type trajectory diagram with the x-axis. In the second processing step, the Q-channel signal in the regenerated signal is scaled to align the regenerated signal with the transmitted single-frequency CW signal. Simulation results show that a receiver using the proposed image rejection algorithm can achieve an image rejection ratio of more than 70dB. And, simulation results show that the bit error rate performances of receivers using the proposed image rejection algorithm are almost the same as those of conventional coherent demodulators, even in fading channels.

MCBP Neural Netwoek for Effcient Recognition of Tire Claddification Code (타이어 분류 코드의 효율적 인식을 위한 MCBP망)

  • Koo, Gun-Seo;O, Hae-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.2
    • /
    • pp.465-482
    • /
    • 1997
  • In this paper, we have studied on cinstructing code-recognition shstem by neural network according to a image process taking the DOT classification code stamped on tire surface.It happened to a few problems that characters distorted in edge by diffused reflection and two adjacent characters take the same label,even very sen- sitive to illumination ofr recognition the stamped them on tire.Thus,this paper would propose the algorithm for tire code under being cinscious of these properties and prove the algorithm drrciency with a simulation.Also,we have suggerted the MCBP network composing of multi-linked recognizers of dffcient identify the DOT code being tire classification code.The MCBP network extracts the projection balue for classifying each character's rdgion after taking out the prjection of each chracter's region on X,Y axis,processes each chracters by taking 7$\times$8 normalization.We have improved error rate 3% through the MCBP network and post-process comparing the DOT code Database. This approach has a accomplished that learming time get's improvenent at 60% and recognition rate has become to 95% from 90% than BckPropagation with including post- processing it has attained greate rates of entire of tire recoggnition at 98%.

  • PDF

A Study on Improving Performance of the Deep Neural Network Model for Relational Reasoning (관계 추론 심층 신경망 모델의 성능개선 연구)

  • Lee, Hyun-Ok;Lim, Heui-Seok
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.12
    • /
    • pp.485-496
    • /
    • 2018
  • So far, the deep learning, a field of artificial intelligence, has achieved remarkable results in solving problems from unstructured data. However, it is difficult to comprehensively judge situations like humans, and did not reach the level of intelligence that deduced their relations and predicted the next situation. Recently, deep neural networks show that artificial intelligence can possess powerful relational reasoning that is core intellectual ability of human being. In this paper, to analyze and observe the performance of Relation Networks (RN) among the neural networks for relational reasoning, two types of RN-based deep neural network models were constructed and compared with the baseline model. One is a visual question answering RN model using Sort-of-CLEVR and the other is a text-based question answering RN model using bAbI task. In order to maximize the performance of the RN-based model, various performance improvement experiments such as hyper parameters tuning have been proposed and performed. The effectiveness of the proposed performance improvement methods has been verified by applying to the visual QA RN model and the text-based QA RN model, and the new domain model using the dialogue-based LL dataset. As a result of the various experiments, it is found that the initial learning rate is a key factor in determining the performance of the model in both types of RN models. We have observed that the optimal initial learning rate setting found by the proposed random search method can improve the performance of the model up to 99.8%.

The Effect of SW education based on Physical Computing on the Computational Thinking ability of elementary school students (피지컬 컴퓨팅 기반 소프트웨어 교육이 초등학생의 컴퓨팅 사고력에 미치는 영향)

  • Lee, Jaeho;Kim, SunHyang
    • Journal of Creative Information Culture
    • /
    • v.7 no.4
    • /
    • pp.243-255
    • /
    • 2021
  • The purpose of this study is to investigate the effect of software education based on physical computing on the CT ability of elementary school students. To this end, previous studies related to physical computing software education and software education in the 2015 revised curriculum were analyzed. In addition, COBL was selected among many physical computing tools on the market in consideration of the level and characteristics of learners in the school to conduct the study, and 'Professor Lee Jae-ho's AI Maker Coding with COBL' was used as the textbook. This study was conducted for 10 sessions on 135 students in 6 classes in 6th grade of H Elementary School located in Pyeongtaek, Gyeong gi-do. The results of this study are as follows. First, it was confirmed that physical computing software education linked to real life was effective in improving the CT ability of elementary school students. Second, the change in competency of CT ability by sector improved evenly from 8 to 30 points in the pre-score and post-score of computing thinking ability. Third, in this study, it was confirmed that 87% of students were very positive as a result of a survey of satisfaction with classes after real-life physical computing software education. We hope that follow-up studies will help select various regions across cities and rural areas, and prove that real-life physical computing software education for various learner members, including large and small schools, will help elementary school students improve their CT ability.

Estimation of Spatial Distribution Using the Gaussian Mixture Model with Multivariate Geoscience Data (다변량 지구과학 데이터와 가우시안 혼합 모델을 이용한 공간 분포 추정)

  • Kim, Ho-Rim;Yu, Soonyoung;Yun, Seong-Taek;Kim, Kyoung-Ho;Lee, Goon-Taek;Lee, Jeong-Ho;Heo, Chul-Ho;Ryu, Dong-Woo
    • Economic and Environmental Geology
    • /
    • v.55 no.4
    • /
    • pp.353-366
    • /
    • 2022
  • Spatial estimation of geoscience data (geo-data) is challenging due to spatial heterogeneity, data scarcity, and high dimensionality. A novel spatial estimation method is needed to consider the characteristics of geo-data. In this study, we proposed the application of Gaussian Mixture Model (GMM) among machine learning algorithms with multivariate data for robust spatial predictions. The performance of the proposed approach was tested through soil chemical concentration data from a former smelting area. The concentrations of As and Pb determined by ex-situ ICP-AES were the primary variables to be interpolated, while the other metal concentrations by ICP-AES and all data determined by in-situ portable X-ray fluorescence (PXRF) were used as auxiliary variables in GMM and ordinary cokriging (OCK). Among the multidimensional auxiliary variables, important variables were selected using a variable selection method based on the random forest. The results of GMM with important multivariate auxiliary data decreased the root mean-squared error (RMSE) down to 0.11 for As and 0.33 for Pb and increased the correlations (r) up to 0.31 for As and 0.46 for Pb compared to those from ordinary kriging and OCK using univariate or bivariate data. The use of GMM improved the performance of spatial interpretation of anthropogenic metals in soil. The multivariate spatial approach can be applied to understand complex and heterogeneous geological and geochemical features.

A Study on Teaching the Method of Lagrange Multipliers in the Era of Digital Transformation (라그랑주 승수법의 교수·학습에 대한 소고: 라그랑주 승수법을 활용한 주성분 분석 사례)

  • Lee, Sang-Gu;Nam, Yun;Lee, Jae Hwa
    • Communications of Mathematical Education
    • /
    • v.37 no.1
    • /
    • pp.65-84
    • /
    • 2023
  • The method of Lagrange multipliers, one of the most fundamental algorithms for solving equality constrained optimization problems, has been widely used in basic mathematics for artificial intelligence (AI), linear algebra, optimization theory, and control theory. This method is an important tool that connects calculus and linear algebra. It is actively used in artificial intelligence algorithms including principal component analysis (PCA). Therefore, it is desired that instructors motivate students who first encounter this method in college calculus. In this paper, we provide an integrated perspective for instructors to teach the method of Lagrange multipliers effectively. First, we provide visualization materials and Python-based code, helping to understand the principle of this method. Second, we give a full explanation on the relation between Lagrange multiplier and eigenvalues of a matrix. Third, we give the proof of the first-order optimality condition, which is a fundamental of the method of Lagrange multipliers, and briefly introduce the generalized version of it in optimization. Finally, we give an example of PCA analysis on a real data. These materials can be utilized in class for teaching of the method of Lagrange multipliers.