• Journal of IKEEE
• /
• v.23 no.2
• /
• pp.557-570
• /
• 2019

In this study, a novel hierarchical approach is investigated to extract coronary vessel from X-ray angiogram. First, we propose to combine Decimation-free Directional Filter Bank (DDFB) and Homographic Filtering (HF) in order to enhance X-ray coronary angiographic image for segmentation purposes. Because the blood vessel ensures that blood flows in only one direction on vessel branch, the DDFB filter is suitable to be used to enhance the vessels at different orientations and radius. In the combination with HF filter, our method can simultaneously normalize the brightness across the image and increases contrast. Next, a coarse-to-fine strategy for iterative segmentation based on Otsu algorithm is applied to extract the main coronary vessels in different sizes. Furthermore, we also propose a new approach to segment very small vessels. Specifically, based on information of the main extracted vessels, we introduce a new method to extract junctions on the vascular tree and level of nodes on the tree. Then, the window based segmentation is applied to locate and extract the small vessels. Experimental results on our coronary X-ray angiography dataset demonstrate that the proposed approach can outperform standard method and attain the accuracy of 71.34%.

• Journal of Broadcast Engineering
• /
• v.26 no.3
• /
• pp.258-268
• /
• 2021

Point cloud content is immersive content that represents real-world objects with three-dimensional (3D) points. In the process of acquiring point cloud data or encoding and decoding point cloud data, the resolution of point cloud content could be degraded. In this paper, we propose a method of progressively enhancing the resolution of sequential point cloud contents through inter-frame registration. To register a point cloud, the iterative closest point (ICP) algorithm is commonly used. Existing ICP algorithms can transform rigid bodies, but there is a disadvantage that transformation is not possible for non-rigid bodies having motion vectors in different directions locally, such as point cloud content. We overcome the limitations of the existing ICP-based method by registering regions with motion vectors in different directions locally between the point cloud content of the current frame and the previous frame. In this manner, the resolution of the point cloud content with geometric movement is enhanced through the process of registering points between frames. We provide four different point cloud content that has been enhanced with our method in the experiment.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.172-176
• /
• 1989

In this paper, a simple method for designing iterative learning control scheme is proposed. The proposed learning algorithm is designed based on series expansion of inverse plant model. The proposed scheme has simple structure and fast convergency so that it is suitable for implementing it on conventional micro processor based controllers. The effectiveness of the proposed algorithm is investigated through a series of computer simulations.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.12
• /
• pp.59-71
• /
• 1994

This paper proposes a motion estimation method in video sequences based on the feature based matching and anistropic propagation. It measures translation and rotation parameters using a relaxation scheme at feature points and object orinted anistropic propagation in continuous and discontinuous regions. Also an iterative improvement motion extimation based on the strongly coupled module fusion and adaptive smoothing is proposed. Computer simulation results show the effectiveness of the proposed algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.9
• /
• pp.9-16
• /
• 2017

The course timetabling problem is a problem assigning a set of subjects to the given classrooms and different timeslots, while satisfying various hard constraints and soft constraints. This problem is defined as a constraint satisfaction optimization problem and is known as an NP-complete problem. Various methods has been proposed such as integer programming, constraint programming and local search methods to solve a variety of course timetabling problems. In this paper, we propose an iterative improvement search method to solve the problem based on constraint programming. First, an initial solution satisfying all the hard constraints is obtained by constraint programming, and then the solution is repeatedly improved using constraint programming again by adding new constraints to improve the quality of the soft constraints. Through experimental results, we confirmed that the proposed method can find far better solutions in a shorter time than the manual method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2686-2708
• /
• 2020

This paper investigates the energy efficiency of energy harvesting (EH) bidirectional cooperative sensor networks, in which the considered system model enables the uplink information transmission from the sensor (SN) to access point (AP) and the energy supply for the amplify-and-forward (AF) relay and SN using power-splitting (PS) or time-switching (TS) protocol. Considering the minimum EH activation constraint and quality of service (QoS) requirement, energy efficiency is maximized by jointly optimizing the resource division ratio and transmission power. To cope with the non-convexity of the optimizations, we propose the low complexity iterative algorithm based on fractional programming and alternative search method (FAS). The key idea of the proposed algorithm first transforms the objective function into the parameterized polynomial subtractive form. Then we decompose the optimization into two convex sub-problems, which can be solved by conventional convex programming. Simulation results validate that the proposed schemes have better output performance and the iterative algorithm has a fast convergence rate.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.144-147
• /
• 2000

Data security is an important issue in today's computer networks. In order to construct a safe infra in the open communication network, a cryptography is necessarily applied to several communication application fields like a high-speed networking system supporting real-time operation. A cryptography which has already realized by a software is designed by using a hardware to improve a throughput. In this paper, we design hardware architecture of IDEA by using a single iterative round method to improve a encryption throughput. In addition, we intend to develop a hardware design methodology that a specific cryptography operate with high-speed. The hardware model is described in VHDL and synthesized by the Samsung KG 80 Library in the Synopsys development software tool. With a system clock frequency 20MHz, this hardware permits a data conversion rate of more than 116 Mbit/s.

• Journal of Navigation and Port Research
• /
• v.34 no.6
• /
• pp.503-509
• /
• 2010

Remarshaling is referred to a preparatory task of rearranging containers piled up in a stacking yard to improve the efficiency of loading. Selective remarshaling is required because the time for remarshaling known as large time-consuming task is not enough to remarshal all containers. In this research, we compare two previous researches in more objectively way: heuristic and genetic algorithm based approaches. In addition, we prove the effect of iterative reselection method on dwindling the gap between plan and execution due to the uncertainty of crane operation during execution. Simulation experiments under realistic uncertainty model show that heuristic approaches which have few computational complexity can cope with the uncertainty well when reselection interval is short, but genetic algorithm based approach has advantages when reselection interval that can ensure appropriate number of evolutions is given because of computational complexity for search.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.2
• /
• pp.643-661
• /
• 2018

This paper proposes a novel algorithm for lane detection based on inverse perspective transformation and Kalman filter. A simple inverse perspective transformation method is presented to remove perspective effects and generate a top-view image. This method does not need to obtain the internal and external parameters of the camera. The Gaussian kernel function is used to convolute the image to highlight the lane lines, and then an iterative threshold method is used to segment the image. A searching method is applied in the top-view image obtained from the inverse perspective transformation to determine the lane points and their positions. Combining with feature voting mechanism, the detected lane points are fitted as a straight line. Kalman filter is then applied to optimize and track the lane lines and improve the detection robustness. The experimental results show that the proposed method works well in various road conditions and meet the real-time requirements.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.2
• /
• pp.41-48
• /
• 2019

Digital image watermarking techniques have been studied in various fields in order to protect the copyright of multimedia contents mostly composed by images. JPEG compression is a representative copyright attack for image watermarking. The CRT-based watermarking methods in DCT domain have been studied, because these are robust for JPEG compression attack. In this paper, we propose a new method with improved performance compared with the existing CRT based methods in DCT domain. The proposed method selects the DCT block according to the denseness at the watermark insertion phase, and iteratively adjust the CRT Conditional coefficients at the watermark extraction. This paper shows that it is more robust for the JPEG compression attacks through experimental results.