• Title/Summary/Keyword: 블록 기반 방법

Search Result 1,132, Processing Time 0.026 seconds

Comparative Analysis of Deep Learning Researches for Compressed Video Quality Improvement (압축 영상 화질 개선을 위한 딥 러닝 연구에 대한 분석)

  • Lee, Young-Woon;Kim, Byung-Gyu
    • Journal of Broadcast Engineering
    • /
    • v.24 no.3
    • /
    • pp.420-429
    • /
    • 2019
  • Recently, researches using Convolutional Neural Network (CNN)-based approaches have been actively conducted to improve the reduced quality of compressed video using block-based video coding standards such as H.265/HEVC. This paper aims to summarize and analyze the network models in these quality enhancement studies. At first the detailed components of CNN for quality enhancement are overviewed and then we summarize prior studies in the image domain. Next, related studies are summarized in three aspects of network structure, dataset, and training methods, and present representative models implementation and experimental results for performance comparison.

Smart contract research for efficient learner problem recommendation in online education environment (온라인 교육 환경에서 효율적 학습자 문제추천을 위한 스마트 컨트랙트 연구)

  • Min, Youn-A
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.4
    • /
    • pp.195-201
    • /
    • 2022
  • For a efficient distance education environment, the need for correct problem recommendation guides considering the learner's exact learning pattern is increasing. In this paper, we study block chain based smart contract technology to suggest a method for presenting the optimal problem recommendation path for individual learners based on the data given by situational weights to the problem patterns of learners collected in the distance education environment. For the performance evaluation of this study, the learning satisfaction with the existing similar learning environment, the usefulness of the problem recommendation guide, and the learner data processing speed were analyzed. Through this study, it was confirmed that the learning satisfaction improved by more than 15% and the learning data processing speed was improved by more than 20% compared to the existing learning environment.

Resource Allocation Scheme in an Integrated CDMA System Using Throughput Maximization Strategy (통합된 CDMA시스템에서 데이터 전송률 최대화 방법을 이용한 자원할당 방법)

  • Choi Seung-Sik;Kim Sang-Kyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2B
    • /
    • pp.146-153
    • /
    • 2006
  • It is required to have researches on efficient resource allocation schemes in an integrated voice and data CDMA system with the spreading of high-speed wireless internets. In this paper, we proposed a efficient resouce allocation scheme for providing a high speed data service in an integrated CDMA system. In an integrated voice/data CDMA system, resources for voice users are allocated with high priority and residual resources are allocated to the data service. In this case, it is necessary to use a resource allocation scheme for minimizing interference. In this paper, we first explain about a interference minimizing method and define QoS requirements. Based on the method, we proposed a efficient resource allocation scheme which satisfy the QoS requirements. The proposed scheme controls the transmission rate and delay of data users with a priority information such as the number of packets in a queue. From the simulation results, we show that the proposed scheme reduce the blocking probability and delay and improve the performance.

GPU-accelerated Reliability Analysis Method using Dynamic Reliability Block Diagram based on DEVS Formalism (DEVS 형식론 기반의 Dynamic Reliability Block Diagram과 GPU 가속 기술을 이용한 신뢰도 분석 방법)

  • Ha, Sol;Ku, Namkug;Roh, Myung-Il
    • Journal of the Korea Society for Simulation
    • /
    • v.22 no.4
    • /
    • pp.109-118
    • /
    • 2013
  • This paper adopts the system configuration to assess the reliability instead of making a fault tree (FT), which is a traditional method to analyze reliability of a certain system; this is the reliability block diagram (RBD) method. The RBD method is a graphical presentation of a system diagram connecting the subsystems of components according to their functions or reliability relationships. The equipment model for the reliability simulation is modeled based on the discrete event system specification (DEVS) formalism. In order to make various alternatives of target system, this paper also adopts the system entity structure (SES), an ontological framework that hierarchically represents the elements of a system and their relationships. To enhance the calculation time of reliability analysis, GPU-based accelerations are adopted to the reliability simulation.

Design of Teaching Method for SW Education Based On Python and Team-Shared Mental Model (파이썬과 팀 공유정신모형을 활용한 SW교육 방법의 설계)

  • Lee, Hakkyung;Park, Phanwoo;Yoo, Inhwan
    • Journal of The Korean Association of Information Education
    • /
    • v.24 no.1
    • /
    • pp.1-10
    • /
    • 2020
  • According to the Fourth Industrial Revolution, SW education is emphasized around the world to educate student with new abilities. Following to these global trends, SW education has become mandatory in Korea's 2015 revised curriculum. However, Korean elementary SW education is focused on the use of block-based programming languages. In addition, the point of view of selecting goals and organizing content of SW Education, the affective domain is ignored and focused only on the cognitive and psychomotor domains. So, this study explored method of SW education using the concept of Team-Shared Mental Model for develop of community capacity and Python, which is textual programming language gaining popularity recently. As a result of performing the post test t-test on two groups with similar Team-Shared Mental Model formation, we found that it was effective in forming a Team-Shared Mental Model of the group applying the SW teaching method suggested in the study.

Addressing and Routing Method for Zigbee Network Expansion (Zigbee 기반 네트워크의 확장을 위한 어드레스 방식과 라우팅 방법)

  • Choi, Sung-Chul;Jeong, Woo-Jeong;Kim, Tae-Ho;Jeong, Kyu-Seuck;Kim, Jong-Heon;Lee, In-Sung
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.7
    • /
    • pp.57-66
    • /
    • 2009
  • Zigbee is a universal communication standard used in USN and is utilized in various applications. Zigbee protocol provides an address within a single PAN network, and at this time, it uses DAA. This is a method that divides a 16-bit address area into blocks with a fixed size according to the depth to assign one to each node. However, this method is limited because it has to assign addresses in 16 bits. As the depth increases, the number of nodes also increases exponentially to the maximal number of routers provided to each depth. Therefore, it is difficult to construct a huge network with numerous routers and large depth as in the places which are wide or have many shadow areas. Besides, since all the operations are performed in a single PAN network, it is hard to make several PANs into a single network. This article suggests new addressing and routing methods that can construct several PAN networks into a single network and combine broad area with less limitation in the number of routers and depth by extending the Zigbee-based network. Moreover, this paper has tested its performance and has verified its usability through substantive tests.

DCT Based Watermarking Technique Using Region of Interest (관심영역을 이용한 DCT기반 워터마킹 기법)

  • Shin, Jae-Wook;Jeong, Dong-Seok
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.1
    • /
    • pp.16-26
    • /
    • 2000
  • The proposed method inserts a watermark information not mto a whole Image region but only into regions of interest(ROIs) To extract the ROIs, we divide an original Image into sub-blocks and use modified Shi-Kuo Chang's PIM(picture information measure) as the criteria to select the ROIs Considering the directional information and frequency bands, we insert the watermark information into sub-blocks m the DCT domain. The proposed method can reduce the distortion in comparison With the other methods which utilize the whole Image as an nor The proposed method makes much less damaged Images m comparison to the other methods And those Images processed by the proposed algorithm are more robust to the changes caused by signal processing operations such as resampling, clipping. noise, and so on Also due to the block-based watermark insertion, the proposed method has the robustness to the Image compression processes such as JPEG and MPEG.

  • PDF

Fast Mode Decision using Global Disparity Vector for Multi-view Video Coding (다시점 영상 부호화에서 전역 변이 벡터를 이용한 고속 모드 결정)

  • Han, Dong-Hoon;Cho, Suk-Hee;Hur, Nam-Ho;Lee, Yung-Lyul
    • Journal of Broadcast Engineering
    • /
    • v.13 no.3
    • /
    • pp.328-338
    • /
    • 2008
  • Multi-view video coding (MVC) based on H.264/AVC encodes multiple views efficiently by using a prediction scheme that exploits inter-view correlation among multiple views. However, with the increase of the number of views and use of inter-view prediction among views, total encoding time will be increased in multiview video coding. In this paper, we propose a fast mode decision using both MB(Macroblock)-based region segmentation information corresponding to each view in multiple views and global disparity vector among views in order to reduce encoding time. The proposed method achieves on average 40% reduction of total encoding time with the objective video quality degradation of about 0.04 dB peak signal-to-noise ratio (PSNR) by using joint multi-view video model (JMVM) 4.0 that is the reference software of the multiview video coding standard.

Video Object Extraction Using Contour Information (윤곽선 정보를 이용한 동영상에서의 객체 추출)

  • Kim, Jae-Kwang;Lee, Jae-Ho;Kim, Chang-Ick
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.1
    • /
    • pp.33-45
    • /
    • 2011
  • In this paper, we present a method for extracting video objects efficiently by using the modified graph cut algorithm based on contour information. First, we extract objects at the first frame by an automatic object extraction algorithm or the user interaction. To estimate the objects' contours at the current frame, motion information of objects' contour in the previous frame is analyzed. Block-based histogram back-projection is conducted along the estimated contour point. Each color model of objects and background can be generated from back-projection images. The probabilities of links between neighboring pixels are decided by the logarithmic based distance transform map obtained from the estimated contour image. Energy of the graph is defined by predefined color models and logarithmic distance transform map. Finally, the object is extracted by minimizing the energy. Experimental results of various test images show that our algorithm works more accurately than other methods.

A Translation-based Approach to Hierarchical Task Network Planning (계층적 작업 망 계획을 위한 변환-기반의 접근법)

  • Kim, Hyun-Sik;Shin, Byung-Cheol;Kim, In-Cheol
    • The KIPS Transactions:PartB
    • /
    • v.16B no.6
    • /
    • pp.489-496
    • /
    • 2009
  • Hierarchical Task Network(HTN) planning, a typical planning method for effectively taking advantage of domain-specific control knowledge, has been widely used in complex real applications for a long time. However, it still lacks theoretical formalization and standardization, and so there are some differences among existing HTN planners in terms of principle and performance. In this paper, we present an effective way to translate a HTN planning domain specification into the corresponding standard PDDL specification. Its main advantage is to allow even many domain-independent classical planners to utilize domain-specific control knowledge contained in the HTN specifications. In this paper, we try our translation-based approach to three different domains such as Blocks World, Office Delivery, Hanoi Tower, and then conduct some experiments with a forward-chaining heuristic state-space planner, FF, to analyze the efficiency of our approach.