• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.321-328
• /
• 2003

This Paper Proposes a size-variable block matching algorithm for motion vector extraction. The Proposed algorithm dynamically determines the search area and the size of a block. We exploit the constraint of small velocity changes of a block along the time to determine the origin of the search area. The range of the search area is adjusted according to the motion coherency of spatially neighboring blocks. The process of determining the sire of a block begins matching with a small block. If the matching degree is not good enough, we expand the size of a block a little bit and then repeat the matching process until our matching criterion Is satisfied. The experimental results show that the proposed algorithm can yield very accurate block motion vectors. Our algorithm outperforms other algorithms in terms of the estimated motion vectors, though our algorithm requires some computational overhead.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.569-570
• /
• 2017

Bitcoin-based blockchain technology provides an infrastructure that enables anonymous smart contracts, low-cost remittances, and online payments. However, the block-chain technology that implements the bitcoin has scalability constraints in tradeoffs between throughput and latency. To solve these problems, the Byzantine fault tolerant block-chain technique has been proposed. This technique improves throughput without increasing latency by selecting a leader and constructing many microblocks that do not contain proofs of work within the existing block by the leader. However, this technique may be less secure than existing techniques in selecting the reader. In this paper, we propose a technique for scalability of the blockchain technology by using microblock technology and parallel execution technique. Within one microblock there is information about several transactions. In the proposed scheme, the throughput of the microblocks can be increased by performing concurrently.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.361-361
• /
• 2015

감세블록(baffle block)은 고속의 흐름에서 도수를 유도함으로써 과도한 에너지를 감세시키는 역할을 하는 구조물이며 구조물의 크기, 형태, 위치, 조합 등의 변수로 도수가 형성되는 조건을 조절하여 흐름에 영향을 줄 수 있다. 하단방류형 가동보에서 고속으로 방류되는 흐름의 Froude 수가 2.5에서 4.5 사이일 경우 발생하는 불규칙한 주기의 진동이 중첩 보강되면 감세하기 어려운 파동을 형성하여 수 Km 동안 지속될 수 있어 추가적인 조치가 필요하다(Peterka, 1984). 이 연구에서는 총 연장 11m, 폭 0.5m의 구형수로에 하단방류형 가동보와 감세블럭을 설치하여 감세블록의 위치가 에너지의 감세에 미치는 영향을 분석하고, 감세블록의 최적 위치를 제안하였다. 감세블럭은 높이 2cm, 폭 5cm의 구형단면으로 제작하여 일정한 간격으로 치형 배열하였으며, 가동보로 부터 5.5~8.5cm 지점에서 1cm간격으로 총 5가지 조건으로 수리실험을 수행하였다. 또한, 수문 하단에서의 Froude 수가 3.8~3.9를 만족하는 강한 도수가 발생할 수 있도록 유량을 조절 하였고, 유속과 수심은 3차원 유속계와 피에조미터를 이용하여 가동보로부터 0.2m간격으로 하류단 2m 지점까지 측정하였다. 실험 결과, 가동보로부터 도수가 발생하여 수위가 안정되는 지점까지의 도수길이는 감세블록을 설치한 경우, 설치하기 전의 1.1m와 비교하여 최소 27.3%에서 최대 81.8%만큼 짧아졌으며 감세블록 보에 가깝게 설치될수록 도수길이는 단축되는 것으로 나타났다. 가동보 하류부에서 도수가 발생한 이후 수심이 안정화되는 1m 지점에서, 도수 전후의 비에너지비로 정의되는 도수효율은 감세블록 미설치 시 74.9%이고, 감세블록이 설치된 조건에서는 54.9~60.6%로 감세블록에 의한 에너지 감소효과가 큰 것으로 나타났다. 에너지 감세 효과가 가장 큰 감세블록 위치는 가동보로부터 6.5cm 떨어진 곳으로 하류단 수심의 약 80%에 해당하는 지점이 감세블록의 최적 위치인 것으로 판단된다.

• Journal of Internet Computing and Services
• /
• v.20 no.5
• /
• pp.9-18
• /
• 2019

Android Application Package (APK) is vulnerable to repackaging attacks. Therefore, obfuscation technology was applied inside the Android APK file to cope with repackaging attack. However, as more advanced reverse engineering techniques continue to be developed, fake Android APK files to be released. A new approach is needed to solve this problem. A blockchain is a continuously growing list of records, called blocks, which are linked and secured using cryptography. Each block typically contains a cryptographic hash of theprevious block, a timestamp and transaction data. Once recorded, the data inany given block cannot be altered retroactively without the alteration of all subsequent blocks. Therefore, it is possible to check whether or not theAndroid Mobile APK is forged by applying the blockchain technology. In this paper, we construct a discrimination DApp (Decentralized Application) against forgery Android Mobile APK by recording and maintaining the legitimate APK in the consortium blockchain framework like Hyperledger Fabric by Composer. With proposed DApp, we can prevent the forgery and modification of the appfrom being installed on the user's Smartphone, and normal and legitimate apps will be widely used.

• Journal of Internet of Things and Convergence
• /
• v.7 no.4
• /
• pp.77-83
• /
• 2021

In the 4^th industrial revolution, research on various new technologies is being actively conducted. Among the new technologies of the 4^th industrial revolution, interest in blockchain is very high. A lot of research on this kind of block chain is being actively conducted, centered on graduate schools. It is not easy for a university to operate a dedicated blockchain curriculum centered on undergraduate students. In such a situation, a variety of new blockchain ecosystems have been created to revitalize the blockchain-related industry, and many developments are being made with a lot of interest and effort. In this research, we intend to propose a university curriculum model for blockchain, which is important in the 4^th industrial revolution. Regarding the blockchain education model, we propose a related blockchain education model focusing on the contents of operating an industry-oriented education course through the human resource nurturing process, and various blockchain education will be activated to achieve the blockchain industry development.

• Journal of Industrial Convergence
• /
• v.21 no.8
• /
• pp.51-58
• /
• 2023

Blockchains have recently struggled to design for the ideal distributed trust networks by solving scalability trilemma. However, local conflicts between some countries lead to imbalance on energy distribution. Besides, blockchain networks (e.g., Bitcoin) currently consume enormous energy for transaction and mining. The existing data volume based trust model evaluated an increasing blockchain size better than Lubin's trust model in scalability trilemma. In this paper, we propose a scalability based energy model to evaluate sustainability for blockchain networks, considering energy consumption for transaction, time duration, and the blockchain size of growing blockchain networks. Through the rigorous numerical analysis, we compare the proposed scalability based energy model with the existing model for the satisfaction and optimal blockchain size. Thus, the scalability based energy model will provide an assessment tool to choose the proper blockchain networks to solve scalability trilemma problem and prove sustainability.

• Journal of Digital Convergence
• /
• v.17 no.8
• /
• pp.89-94
• /
• 2019

Due to the limitations of public and private blockchain, several organizations are implementing consortium blockchain systems. In order for an organization to conduct business using blockchain, it must consider 'blockchain governance' factors, such as decision rights, accountability and incentives over on-chain and off-chain, depending on the organization's strategy and objectives. If an organization conducts business without blockchain governance, it cannot achieve its strategy and objectives systematically, effectively and efficiently, and cannot comply with internal external requirements such as the expectations of stakeholders and laws. However, as businesses using consortium blockchain expand, there is no research on consortium blockchain governance. Thus, in this study, the consortium blockchain governance framework, including functions, roles and responsibilities, was developed to help organizations effectively and efficiently conduct business using consortium blockchain. In addition, to review the feasibility of the developed consortium blockchain governance framework, the framework was reviewed through an advisory committee consisting of experts on blockchain and governance over two occasions. As a result of the review, components of the consortium blockchain governance framework, including functions, roles and responsibilities, were considered complete and relevant.

• The Journal of Bigdata
• /
• v.6 no.2
• /
• pp.151-159
• /
• 2021

Construction of a blockchain network needs a cumbersome and time consuming activity. To overcome these limitations, global IT companies such as Microsoft are providing cloud-based blockchain services. In this paper, we propose a blockchain-based construction and management tool that enables blockchain developers, blockchain operators, and enterprises to deploy blockchain more comfortably in their infrastructure. This tool is implemented using Hyperledger Fabric, one of the famous private blockchain platforms, and Ansible, an open-source IT automation engine that supports network-wide deployment. Instead of complex and repetitive text commands, the tool provides a user-friendly web dashboard interface that allows users to seamlessly set up, deploy and interact with a blockchain network. With this proposed solution, blockchain developers, operators, and blockchain researchers can more easily build blockchain infrastructure, saving time and cost. To verify the usefulness and convenience of the proposed tool, a blockchain network that conducts electronic voting was built and tested. The construction of a blockchain network, which consists of writing more than 10 setting files and executing commands over hundreds of lines, can be replaced with simple input and click operations in the graphical user interface, saving user convenience and time. The proposed blockchain tool will be used to build trust data infrastructure in various fields such as food safety supply chain construction in the future.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.545-548
• /
• 2005

H.264의 인트라 프레임 에러복원기법은 상하좌우 인접한 블록의 픽셀을 사용하여 거리의 가중치 평균값으로 손실된 블록을 복원한다. H.264의 인트라 프레임 에러복원기법으로 복원된 블록은 주변블록 픽셀들의 평균을 취하기 때문에 그로 인해 생기는 블러링 현상을 피할 수 없다. 이를 개선하기 위하여 주변블록의 에지정보를 이용하여 인터폴레이션하는 방법이 제안되었으나 에지성분이 다양하거나 에지성분이 없는 경우, 블록을 복원하는 데 있어서 기존 H.264의 복원기법보다 성능이 저하되는 문제점이 있다. 본 논문에서는 주변블록의 정보를 이용하여 손실된 블록의 인터폴레이션의 에지방향을 추정하고 방해함수를 통해서 임계치를 결정하여 적응적으로 에지방향의 인터폴레이션과 가중치평균 인터폴레이션을 선택하여 복원하는 방법을 제안한다. 에지방향의 인터폴레이션에서는 선택된 전체에지방향과 상하좌우 각각의 주변블록의 에지방향들간의 상호 관계를 고려함으로써 최종적으로 최적에지 방향을 선택하여 성능을 향상시킨다. 제안된 방법은 영상에 따라 H.264 에러복원기법보다 객관적인 화질이 $0.5dB\;{\sim}\;2dB$ PSNR 향상을 보였고 주관적인 화질개선의 결과를 보였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.6
• /
• pp.122-128
• /
• 1998

This paper presents compression of image sequences based on the classification of interframe difference image blocks. classification process consists of image activity classification and energy distribution classification. In the activity classification, interframe difference image blocks are classified into activity blocks and non-activity blocks using the edge detection. In the distribution classification, activity blocks are further classified into vertical blocks, horizontal blocks, and small activity blocks using the AC energy distribution features. The RBFN, trained with numerical classification results, successfully classifies difference image blocks according to image details. Image sequence compressing based on the classification of interframe difference image blocks using the RBFN shows better compression results and less training time than the classical sorting method and the MLP network.