• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.713-716
• /
• 2009

In this paper, we propose a vision-based detection of container hole for container location measuring. We use a method for container position using detection of diagonal container holes, because containers have holes that are linked to spreader headblocks. First, we extract images from spreader and detect straight lines to detect container in images using hough transform. Next, proposed method finds positions of cross at the right angles and set candidates of the corner that is linked to spreader headblocks. Finally, this method performs template matching to detect a right corner of containers. Experimental results show that proposed method performed well at detection of container position.

• Journal of Internet Computing and Services
• /
• v.21 no.3
• /
• pp.1-9
• /
• 2020

Along with the growth of Blockchain, DApp (Distributed Application) is getting attention. As interest in DApp grows, market size continues to grow and many developers participate in development. Many developers are using API(Application Programming Interface) services to mediate Blockchain nodes, such as Infura, for DApp development. However, when using such a service, there is a serious risk that the API service operator can violate the user's privacy by 1 to 1 matching the account address of the Transaction executed by the DApp user with the IP address of the DApp user. It can have an adverse effect on the reliability of public Blockchains that need to provide users with a secure DApp service environment. The proposed Blockchain platform is expected to provide user privacy protection from API services and provide a reliable DApp use environment that existing Blockchain platforms did not provide. It is also expected to help to activate DApp and increase the number of DApp users, which has not been activated due to the risk of an existing privacy breach.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.11
• /
• pp.113-123
• /
• 2023

This paper introduces the Cherry system, a user-independent blockchain donation system. This is a procedure that is delivered to the beneficiary's bank account through a virtual account when a donor makes a donation, so there is no difference from the existing donation delivery method from the user's point of view However, within the blockchain, Cherry Points, a virtual currency based on the user ID, are issued and delivered to the beneficiary, while all transactions and the beneficiary's usage history are managed on the blockchain. By adopting this method, there was an improvement in blockchain performance, with transaction processing exceeding 1,000 TPS in typical transaction condition and service completion within 21.3 seconds. By applying the automatic influence control algorithm to this system, the influence according to stake, which is an individual donation, is greatly reduced to 0.3 after 2 months, thereby concentrating influence could be controlled automatically. In addition, it was designed to enable micro tracking by adding a tracking function by timestamp to the donation ledger for each individual ID, which greatly improved the transparency in the use of donations. From a service perspective, existing blockchain donation systems were handled as limited donation delivery methods. Since it is a direct service in a user-independent method, convenience has been greatly improved by delivering donations in various forms.

• Journal of Broadcast Engineering
• /
• v.9 no.3
• /
• pp.225-235
• /
• 2004

In this paper, we propose a new stereoscopic video coding approach for heterogeneous consumer devices by exploiting the concept of spatio-temporal scalability. The proposed method uses MPEG-2 standard for coding the left or main sequence and an enhanced compatible coding scheme for predicting the P- and B-type of frames of the right or auxiliary sequence. The enhanced compatible coding scheme predicts matching block by interpolating both two forward and backward motion predicted macroblocks and disparity predicted macroblock. To provide flexible stereo video service, we define both a temporally scalable layer and a spatially scalable layer for each eye-view. The experimental results show the efficiency of proposed coding scheme by comparison with already known methods and the advantages of disparity estimation in terms of scalability overhead. According to the experimental results, we expect the proposed functionalities will play a key role in establishing highly flexible stereo video service for ubiquitous computing environment where devices and network connections are heterogeneous.

• Journal of the Institute of Convergence Signal Processing
• /
• v.20 no.2
• /
• pp.84-90
• /
• 2019

Tremendous computation of full search or lossless motion estimation algorithms for video coding has led development of many fast motion estimation algorithms. We still need proper control of computation and prediction quality. In the paper, we suggest an algorithm that reduces computation effectively and controls computational amount and prediction quality, while keeping prediction quality as almost the same as that of the full search. The proposed algorithm uses multiple thresholds for partial block sum and times of counting unchanged minimum position for each step. It also calculates the partial block matching error, removes impossible candidates early, implements fast motion estimation by comparing times of keeping the position of minimum error for each step, and controls prediction quality and computation easily by adjusting the thresholds. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.73-80
• /
• 2003

The Java programming language is designed for developing effective applications in a heterogeneous network environment. Major problem in Java is its performance. many attractive features of Java make the development of software easy, but also make it expensive to support ; applications written in Java are often much slower than their counterparts written in C or C++. To use Java`s attractive features without the performance penalty, sophisticated optimizations and runtime systems are required. Optimising Java bytecode has several advantages. First, the bytecode is independent of any compiler that is used to generate it. Second, the bytecode optimization can be performed as a pre=pass to Just-In-Time(JIT) compilation. Many attractive features of Java make the development of software easy, but also make it expensive to support. The goal of this work is to develop automatic construction of code optimizer for Java bytecode. We`ve designed and implemented a Bytecode Optimizer that performs the peephole optimization, bytecode-specific optimization, and method-inlining techniques. Using the Classfile optimizer, we see up to 9% improvement in speed and about 20% size reduction in Java class files, when compared to average code using the interpreter alone.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.2
• /
• pp.67-74
• /
• 2013

Approximate string matching problems have been studied in diverse fields. Recently, fast approximate string matching algorithms are being used to reduce the time and costs for the next generation sequencing. To measure the amounts of errors between two strings, we use a distance function such as the edit distance. Given two strings X(|X| = m) and Y(|Y| = n) over an alphabet ${\Sigma}$, the edit distance between X and Y is the minimum number of edit operations to convert X into Y. The edit distance between X and Y can be computed using the well-known dynamic programming technique in O(mn) time and space. The edit distance also can be computed using the Four-Russians' algorithm whose preprocessing step runs in $O((3{\mid}{\Sigma}{\mid})^{2t}t^2)$ time and $O((3{\mid}{\Sigma}{\mid})^{2t}t)$ space and the computation step runs in O(mn/t) time and O(mn) space where t represents the size of the block. In this paper, we present a parallelized version of the computation step of the Four-Russians' algorithm. Our algorithm computes the edit distance between X and Y in O(m+n) time using m/t threads. Then we implemented both the sequential version and our parallelized version of the Four-Russians' algorithm using CUDA to compare the execution times. When t = 1 and t = 2, our algorithm runs about 10 times and 3 times faster than the sequential algorithm, respectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.437-439
• /
• 1999

적외선 열 화상에는 물체 내부의 결함과 그 물체 표면의 이물질 등의 효과가 모두 포함된 상태이므로 적외선 열 화상 자체만으로는 비정상적인 부분들을 찾아내기 어렵다. 따라서 본 논문에서는 평행 이동 관계에 있는 두 가시광선 영상으로부터 열 화상에 대응하는 보간 영상을 생성하고, 이것을 열 화상과 중첩시킴으로써 가시화하는 방법을 연구한다. 이를 위해서 적외선 센서에 의해 감지된 온도를 매핑한 열 화상을 적외선 카메라로부터 얻고, 적외선 카메라의 양쪽에 부착된 CCD 카메라로부터 좌우의 가시광선 영상을 얻는다. 보간 영상 생성을 위해서 블록 매칭을 이용한 모션 정보를 사용하고, 생성된 보간 영상에서 생기는 구멍(hole)을 메우는 방법을 소개한다. 또한 생성된 보간 영상과 열 화상을 중첩시켜 가시화하는 방법을 기술한다. 이렇게 함으로써 본 논문에서 제안한 가시화 기법은 재해방지를 위한 비파괴 검사 등에 이용될 수 있다.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.15-18
• /
• 2001

동영상에서 움직이는 객체 검출은 동영상의 내용을 표현하고 유사한 동영상을 검색하는 데 있어 중요한 특징간을 추출하는 방법으로 사용된다. 그러나 복잡하게 카메라가 움직이는 동영상에서 움직이는 객체 검출은 아직까지 어려운 과제이다. 본 논문에서는 복잡한 카메라의 움직임이 있는 환경에서 움직이는 객체를 강인하게 검출하는 방법을 제안한다. 움직이는 객체 검출 방법은 입력 영상을 색상간의 클러스터링을 이용하여 각 영역으로 구분하는 Mean Shift 알고리즘과 인접한 프레임에서 구분된 영역을 대응시켜 영역의 모션 벡터를 구하는 영역 매칭, 유사한 궤적을 가지는 영역들의 클러스터링을 이용하여 객체를 검출하는 궤적 클러스터링 알고리즘을 사용한다. 제안한 영역 기반 알고리즘은 기존의 픽셀이나 블록 기반의 방법보다 움직이는 객체를 정확하게 검출하였다. 실험 결과 복잡하게 움직이는 카메라의 환경 속에서 움직이는 객체를 강인하게 검출하였다.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.831-834
• /
• 2000

본 논문은 주파수 전이신호와 시간 전이 신호에 대해서 고조파 잡음 여기 방법과 시간 분리 여기 방법을 적용한 2.4kbps 음성부호화 방법을 제안한다. 혼합 여기 부호화 방법은 주기 신호와 비 주기 신호를 효과적으로 표현하기 위해 하모닉 잡음 모델을 사용한다. 혼합신호에 대한 잡음 성분은 캡스트럴 분석 방법을 사용함으로써 추출되고, AR(Autoregressive Model) 모델에 의해 표현된다. 시간 전이구간 신호에서의 모호한 음성을 효과적으로 제거하기 위한 또 다른 방법이 제안된다. 제안된 시간 분리 방법은 시간 에너지 변화정도를 관찰함으로써 전이 시점을 감지하고 다른 시간 길이를 가지는 두 블록으로 분리하여 분석한다. 시간 분리 방법은 분석을 위한 비대칭 윈도우와 합성에서의 위상 합성 방법을 포함한다. 제안된 방법을 사용한 2.4kbps 음성부호화 방법은 주관적 음질 평가에서 전이구간에서의 지각적 음질의 향상을 보여주었으며, 원본 음성 스펙트럼과의 고조파 비 매칭에 의한 윙윙거리는 기계적인 잡음을 감소시킨다.