• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.167-170
• /
• 2000

In this paper, we present a fast algorithm for the motion estimation using the efficient selection of an initial search position. In the method, we select the initial search position using the motion vector from the subsmpled images, the predicted motion vector from the neighbor blocks, and the (0,0) motion vector. While searching the candidate blocks, we use the spiral search pattern with the successive elimination algorithm(SEA) and the partial distortion elimination(PDE). The experiment results show that the complexity of the proposed algorithm is about 2∼3 times faster than the three-step search(TSS) with the PSNR loss of just 0.05［dB］∼0.1［dB］ than the full search algorithm PSNR. The search complexity can be reduced with quite a few PSNR loss by controling the number of the depth in the spiral search pattern.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.52-62
• /
• 1997

To reconstruct the complete 3-D shape of an object, seveal range images form different viewpoints should be merged into a single model. The process of extraction of the transformation parameters between multiple range views is calle dregistration. In this paper, we propose a new algorithm to find the transformation parameters between multiple range views. Th eproposed algorithm consists of two step: initial estimation and iteratively update the transformation. To guess the initial transformation, we modify the principal axes by considering the projection effect, due to the difference fo viewpoints. Then, the following process is iterated: in order to extract the exact transformation parameters between the range views: For every point of the common region, find the nearest point among the neighborhood of the current corresponding point whose correspondency is defined by the reverse calibration of the range finder. Then, update the transformation to satisfy the new correspondencies. In order to evaluate the performance the proposed registration algorithm, some experiments are performed on real range data, acquired by space encoding range finder. The experimental results show that the proposed initial estimation accelerate the following iterative registration step.

• International Journal of Contents
• /
• v.9 no.1
• /
• pp.6-10
• /
• 2013

Foreground estimation in object segmentation has been an important issue for last few decades. In this paper we propose a GrabCut based automatic foreground estimation method using block clustering. GrabCut is one of popular algorithms for image segmentation in 2D image. However GrabCut is semi-automatic algorithm. So it requires the user input a rough boundary for foreground and background. Typically, the user draws a rectangle around the object of interest manually. The goal of proposed method is to generate an initial rectangle automatically. In order to create initial rectangle, we use Gabor filter and Saliency map and then we use 4 features (amount of area, variance, amount of class with boundary area, amount of class with saliency map) to categorize foreground and background. From the experimental results, our proposed algorithm can achieve satisfactory accuracy in object segmentation without any prior information by the user.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.8
• /
• pp.74-83
• /
• 1997

In this paper, we propose a new fractal image decoding algorithm with fast convergence speed by using the data dependence and the improved initial image estimation. Conventional method for fractal image decoding requires high-degrdd computational complexity in decoding process, because of iterated contractive transformations applied to whole range blocks. On proposed method, Range of reconstruction imagte is divided into referenced range and data dependence region. And computational complexity is reduced by application of iterated contractive transformations for the referenced range only. Data dependence region can be decoded by one transformations when the referenced range is converged. In addition, more exact initial image is estimated by using bound () function in case of all, and an initial image more nearer to a fixed point is estimated by using range block division estimation. Consequently, the convergence speed of reconstruction iamge is improved with 40% reduction of computational complexity.

• International Journal of Ocean System Engineering
• /
• v.1 no.3
• /
• pp.165-170
• /
• 2011

In this paper, for the accurate estimation of the position and orientation of the UUV (unmanned underwater vehicle), an AHRS (Attitude Heading Reference System) was developed using the IMU (inertial measurement unit) sensor which provides information on acceleration and orientation in the object coordinate and the initial alignment algorithm and the E-KF (extended Kalman Filter). The initial position and orientation of the UUV are estimated using the initial alignment algorithm with 3-axis acceleration and geomagnetic information of the IMU sensor. The position and orientation of the UUV are estimated using the AHRS composed of 3-axis acceleration, velocity, and geomagnetic information and the E-KF. For the performance test of the orientation estimation of the AHRS, a testbed using IMU sensor(ADIS16405) and DSP28335 coded with an E-KF algorithm was developed and its performance was verified through tests.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.339-342
• /
• 2005

We present an efficient block-based motion estimation algorithm with motion analysis. The motion analysis determines a size of search pattern and a maximum repeated count of search pattern. In case of large movement in large image, we reduce search points and the local minimum which caused by low performance. The proposed algorithm employs with searching step of 2. The first step determines an initial search point with neighbor block vector and a size of initial search pattern. The second step determines a size of search pattern and a maximum repeated count with motion analysis. We improve motion prediction accuracy while reducing required computational complexity compared to other fast block-based motion estimation algorithms.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.30 no.4
• /
• pp.341-349
• /
• 1994

From the results of model tests, statistical regression analysis for EHP estimation based on hull form parameters is adopted in this study. From this result, the method for estimation of EHP and optimization of hull form parameters at the initial design stage of fishing boats is developed. This method is applied to two standard fishing boats with chine lines. The EHP s are estimated and compared to experimental results. From the optimization of four principal hull form parameters of these fishing boats, approximately 19% of resistance reduction at the design speed is achieved and thus certifies that this method can be used efficiently for the initial design of hull forms of fishing boats.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.85-88
• /
• 2011

Fuzzy C-Means (FCM) 알고리듬은 가장 널리 사용되는 군집화 알고리듬 중 하나로 다양한 응용 분야에서 사용되고 있다. 하지만 FCM은 여러 가지 문제점을 가지고 있으며 초기 원형 설정이 그 중 하나이다. FCM은 국부 최적해에 수렴하므로 초기 원형 설정에 따라 클러스터링 결과가 달라진다. 이 논문에서는 이러한 FCM의 초기 원형 설정 문제를 개선하기 위하여 커널밀도 추정 (kernel density estimation) 기법을 활용하는 방법을 제안한다. 제안한 방법에서는 먼저 커널 밀도 추정을 수행한 후 밀도가 높은 지역에 클러스터의 초기 원형을 설정하고 원형이 설정된 영역의 밀도를 감소시키는 과정을 반복함으로써 효율적으로 초기 원형을 설정할 수 있다. 제안된 방법이 일반적으로 사용되는 무작위 초기화 방법에 비해 효율적이라는 사실은 실험결과를 통해 확인할 수 있다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.526-526
• /
• 2000

The present has a double objective. The first one is to compare and estimate sixteen continuous-time methods through the identificatiun of a system consisted with an RLC electrical circuit. These sixteen methods are classified into three groups that are the linear filters, the modulating functions and the integral methods. The second objective is to estimate directly the physical parameters of the RLC circuit, without resorting to a discrete-time model. The system is consisted of a coil with inductance L and resistance H, and of a capacitor with capacitance C. Having written the physical equations which describe the behavior of the system, the transfer function in where the initial conditions appear is given. These initial conditions should be taken into account during the parameter estimation phase, because they are inevitable within the framework of real signals. A physical interpretation of the identified models is tempted by the direct estimation of the physical parameters L and C. In conclusion, a classification of the studied methods is proposed.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.57 no.2
• /
• pp.115-120
• /
• 2008

The EKF(Extended Kalman filter) method which is the state estimation algorithm of nonlinear stochastic system depends on the initial error and the estimated states. Therefore, the divergence of the estimated state can be caused if the initial values of the estimated states are not chosen as approximate real state values. In this paper, the demerit of the existing EKF method is improved using the EKF algorithm transformated by STWS(Single Term Walsh Series). This method linearizes each sampling interval of continous-time system through the derivation of an algebraic iterative equation without discretizing continuous system by the characteristic of STWS, the convergence of the estimated states can be improved. The validity of the proposed method is checked through comparison with the existing EKF method in simulation.