• Title/Summary/Keyword: 순차적 알고리듬

Search Result 55, Processing Time 0.021 seconds

Design of e-Learning System for Spectral Analysis of High-Order Pulse (고차원펄스 스펙트럼 분석을 위한 이러닝 시스템의 설계)

  • Oh, Yong-Sun
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.8
    • /
    • pp.475-487
    • /
    • 2011
  • In this paper, we present a systematic method to derive spectrum of high-order pulse and a novel design of e-Learning system that deals with deriving the spectrum using concept-based branching method. Spectrum of high-order pulse can be derived using conventional methods including 'Consecutive Differentiations' or 'Convolutions', however, their complexity of calculation should be too high to be used as the order of the pulse increase. We develop a recursive algorithm according to the order of pulse, and then derive the formula of spectrum connected to the order with a newly designed look-up table. Moving along, we design an e-Learning content for studying the procedure of deriving high-order pulse spectrum described above. In this authoring, we use the concept-based object branching method including conventional page or title-type branching in sequential playing. We design all four Content-pages divided into 'Modeling', 'Impulse Response and Transfer Function', 'Parameters' and 'Look-up Table' by these conceptual objects. And modules and sub-modules are constructed hierarchically as conceptual elements from the Content-pages. Students can easily approach to the core concepts of the analysis because of the effects of our new teaching method. We offer step-by-step processes of the e-Learning content through unit-based branching scheme for difficult modules and sub-modules in our system. In addition we can offer repetitive learning processes for necessary block of given learning objects. Moreover, this method of constructing content will be considered as an advanced effectiveness of content itself.

Video Backlight Compensation Algorithm Based on Reliability of Brightness Variation (밝기 변화량의 신뢰도에 기반한 역광 비디오 영상의 보정 알고리듬)

  • Hyun, Dae-Young;Heu, Jun-Hee;Kim, Chang-Su;Lee, Sang-Uk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.6
    • /
    • pp.117-126
    • /
    • 2010
  • In the case of failure images with controlling lighting like backlighting and excessive frontlinghting, the compensation scheme for a specific area in an image is required. The interested region is first selected by user in our method to compensate the first frame. Then we define the matching function of brightness and energy function is proposed with weight of matching function and the relationship among the neighbors. Finally, the energy is minimized by the graph-cut algorithm to compensate the brightness of the first frame. Other frames are straightforwardly compensated using the results of the first frame. The brightness variations of the previous frame is transmitted to the next frame via motion vectors. The reliability of the brightness variation is calculated based on the motion vector reliability. Video compensation result is achieved by the process of the image case. Simulation show that the proposed algorithm provides more natural results than the conventional algorithms.

A Study on the Serialized Event Sharing System for Multiple Telecomputing User Environments (원격.다원 사용자 환경에서의 순차적 이벤트 공유기에 관한 연구)

  • 유영진;오용선
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2003.05a
    • /
    • pp.344-350
    • /
    • 2003
  • In this paper, we propose a novel sharing method ordering the events occurring between users collaborated with the common telecomputing environment. We realize the sharing method with multimedia data to improve the coworking effect using teleprocessing network. This sharing method advances the efficiency of communicating projects such as remote education, tele-conference, and co-authoring of multimedia contents by offering conveniences of presentation, group authoring, common management, and transient event productions of the users. As for the conventional sharing white board system, all the multimedia contents segments should be authored by the exclusive program, and we cannot use any existing contents or program. Moreover we suffer from the problem that ordering error occurs in the teleprocessing operation because we do not have any line-up technology for the input ordering of commands. Therefore we develop a method of retrieving input and output events from the windows system and the message hooking technology which transmits between programs in the operating system In addition, we realize the allocation technology of the processing results for all sharing users of the distributed computing environment without any error. Our sharing technology should contribute to improve the face-to-face coworking efficiency for multimedia contents authoring, common blackboard system in the area of remote educations, and presentation display in visual conference.

  • PDF

Development and Validation of the GPU-based 3D Dynamic Analysis Code for Simulating Rock Fracturing Subjected to Impact Loading (충격 하중 시 암석의 파괴거동해석을 위한 GPGPU 기반 3차원 동적해석기법의 개발과 검증 연구)

  • Min, Gyeong-Jo;Fukuda, Daisuke;Oh, Se-Wook;Cho, Sang-Ho
    • Explosives and Blasting
    • /
    • v.39 no.2
    • /
    • pp.1-14
    • /
    • 2021
  • Recently, with the development of high-performance processing devices such as GPGPU, a three-dimensional dynamic analysis technique that can replace expensive rock material impact tests has been actively developed in the defense and aerospace fields. Experimentally observing or measuring fracture processes occurring in rocks subjected to high impact loads, such as blasting and earth penetration of small-diameter missiles, are difficult due to the inhomogeneity and opacity of rock materials. In this study, a three-dimensional dynamic fracture process analysis technique (3D-DFPA) was developed to simulate the fracture behavior of rocks due to impact. In order to improve the operation speed, an algorithm capable of GPGPU operation was developed for explicit analysis and contact element search. To verify the proposed dynamic fracture process analysis technique, the dynamic fracture toughness tests of the Straight Notched Disk Bending (SNDB) limestone samples were simulated and the propagation of the reflection and transmission of the stress waves at the rock-impact bar interfaces and the fracture process of the rock samples were compared. The dynamic load tests for the SNDB sample applied a Pulse Shape controlled Split Hopkinson presure bar (PS-SHPB) that can control the waveform of the incident stress wave, the stress state, and the fracture process of the rock models were analyzed with experimental results.

Three-dimensional Model Generation for Active Shape Model Algorithm (능동모양모델 알고리듬을 위한 삼차원 모델생성 기법)

  • Lim, Seong-Jae;Jeong, Yong-Yeon;Ho, Yo-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.6 s.312
    • /
    • pp.28-35
    • /
    • 2006
  • Statistical models of shape variability based on active shape models (ASMs) have been successfully utilized to perform segmentation and recognition tasks in two-dimensional (2D) images. Three-dimensional (3D) model-based approaches are more promising than 2D approaches since they can bring in more realistic shape constraints for recognizing and delineating the object boundary. For 3D model-based approaches, however, building the 3D shape model from a training set of segmented instances of an object is a major challenge and currently it remains an open problem in building the 3D shape model, one essential step is to generate a point distribution model (PDM). Corresponding landmarks must be selected in all1 training shapes for generating PDM, and manual determination of landmark correspondences is very time-consuming, tedious, and error-prone. In this paper, we propose a novel automatic method for generating 3D statistical shape models. Given a set of training 3D shapes, we generate a 3D model by 1) building the mean shape fro]n the distance transform of the training shapes, 2) utilizing a tetrahedron method for automatically selecting landmarks on the mean shape, and 3) subsequently propagating these landmarks to each training shape via a distance labeling method. In this paper, we investigate the accuracy and compactness of the 3D model for the human liver built from 50 segmented individual CT data sets. The proposed method is very general without such assumptions and can be applied to other data sets.