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

In this paper, a video coding method in wavelet transformed multi-resolution image using variable block sized motion estimation and multi-codebook is proposed. In the propoed method, the accuracy of motion estimation is increased by using variable block matching algorithm based on edge type of blocks which estimation is increased by using variable block matching algoritm based on edge type of blocks which is classified accoridng to the magnitude of wavelet coefficients in vertical subband and horizontal subband of the highest layer. Also, we increased the flexibility of bit allocation and decreased vector quantization error for motion compensated error transmission by using importance of each subband. Some experimental results confirm that he proposed mothod has fine reconstructed images without blocking effect at low bit rate, and especially reconstructs edges well to which human eyes are sensitive.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.25-32
• /
• 2004

We propose a hierarchical disparity estimation algorithm with edge-preserving energy-based regularization. Initial disparity vectors are obtained from downsampled stereo images using a feature-based region-dividing disparity estimation technique. Dense disparities are estimated from these initial vectors with shape-adaptive windows in full resolution images. Finally, the vector fields are regularized with the minimization of the energy functional which considers both fidelity and smoothness of the fields. The first two steps provide highly reliable disparity vectors, so that local minimum problem can be avoided in regularization step. The proposed algorithm generates accurate disparity map which is smooth inside objects while preserving its discontinuities in boundaries. Experimental results are presented to illustrate the capabilities of the proposed disparity estimation technique.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4502-4512
• /
• 2014

This article presents a reformulation of the Grey Edge framework for colour constancy. Colour constancy is the ability of a visual system to perceive objects' colours independently of their scenes' illuminants. Colour constancy algorithms try to estimate the colour of an illuminant from image values. This estimation can later be used to correct the image as though it were taken under a white illuminant. The modification presented allows the framework to incorporate image-specific filters instead of the commonly used edge detectors. A colour constancy algorithm is proposed using PCA and FastICA linear component analyses methods for the construction of such filters. The results show that the proposed method improves the accuracies of the Grey Edge framework algorithms whilst on the other hand, achieving comparable accuracies with the state-of-the-art methods, but improving their time efficiencies.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.01a
• /
• pp.89-92
• /
• 2018

본 논문에서는 Edge computing 환경에서 다수의 노드들로 구성된 네트워크의 디바이스를 효율적으로 관리하기 위한 방법을 제안한다. 기존의 클라이언트-서버 모델은 모든 데이터와 그에 대한 요청을 중심 서버에서 처리하기 때문에, 다수의 노드로부터 생성된 많은 양의 데이터를 처리하는 데 빠른 응답속도를 보장하지 못한다. Edge computing은 분담을 통해 네트워크의 부담을 줄일 수 있는 IoT 네트워크에 적합한 방법으로, 데이터를 전송하고 받는 과정에서 네트워크의 대역폭을 사용하는 대신 서로 연결된 노드들이 협력해서 데이터를 처리하고, 또한 네트워크 말단에서의 데이터 처리가 허용되어 데이터 센터의 부담을 줄일 수 있다. 여러병렬 기계학습 모델 중 본 연구에서는 Stale Synchronous Parallel(SSP) 모델을 이용하여 Edge 노드에서 분산기계 학습에 적용하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.553-563
• /
• 1996

Detecting edges is one of issues with essentialimprotance in the area of image analysis. An edge in an image is a boundary or contour at which a significant change occurs in image intensity. Edge detection has been studied in many addlications such as imagesegmentation, robot vision, and image compression. In this paper, we propose an automatic threshold selection scheme for edge detection and show its application to noise elimination. The scheme suggested here applied statistical properties of the noise estimated from a noisy image to threshold selection. Since a selected threshold value in the scheme depends on not the characgreistic of an orginal image but the statistical feature of added noise, we can remove ad-hoc manners used for selecting the threshold value as well as decide the value theoretically. Furthermore, that shceme can reduce the number of edge pixels either generated or lost by noise. an application of the scheme to noise elimination is shown here. Noise in the input image can be eliminated with considering the direction of each edge pixedl on the edge map obtained by applying the threshold selection scheme proposed in this paper. Achieving significantly improved results in terms of SNR as well as subjective quality, we can claim that the suggested method works well.

• International Journal of Automotive Technology
• /
• v.6 no.2
• /
• pp.171-181
• /
• 2005

The purpose of this paper is two-fold: 1) A novel algorithm in order to extract lane-related information from road images is presented; 2) Design specifications of an image processing onboard unit capable of extracting lane­related information in real-time is also presented. Obtaining precise information from road images requires many features due to the effects of noise that eventually leads to long processing time. By exploiting a FPGA and DSP, we solve the problem of real-time processing. Due to the fact that image processing of road images relies largely on edge features, the FPGA is adopted in the hardware design. The schematic configuration of the FPGA is optimized in order to perform 3 $\times$ 3 Sobel edge extraction. The DSP carries out high-level image processing of recognition, decision, estimation, etc. The proposed algorithm uses edge features to define an Edge Distribution Function (EDF), which is a histogram of edge magnitude with respect to the edge orientation angle. The EDF enables the edge-related information and lane-related to be connected. The performance of the proposed system is verified through the extraction of lane-related information. The experimental results show the robustness of the proposed algorithm and a processing speed of more than 25 frames per second, which is considered quite successful.

• Geomechanics and Engineering
• /
• v.23 no.6
• /
• pp.575-585
• /
• 2020

In this numerical study, the 2D dynamic behavior of a clayey basin and its effect on damage pattern over basin edge are investigated. To attain this goal, a fully nonlinear time domain analysis method has been applied. Then, the fragility curves of the considered two typical industrial structures for that certain point are estimated using the acceleration time histories recorded at each surface point. The results show that the use of the damage related parameters in site effect analyses, instead of amplification curves, can yield more realistic estimation of the basin dynamic response. In a distance about 150 m from outcrop at the basin edge, the differences between fragility curves increase when increasing the distance from outcrop with respect to the reference rock site. Outside this region and towards the basin center, they tend to occur in rather single curves. Furthermore, to connect the structural damage to the basin edge effect, the earthquake demand value at different points for two typical structures was evaluated. It was seen that the probability of occurrence of damage increases over 250 m from outcrop, while the effect of the basin edge was limited to 150 m in case of the basin edge evaluation by using fragility curves.

• Journal of the Korean Statistical Society
• /
• v.30 no.2
• /
• pp.265-280
• /
• 2001

Estimation of the edge of a distribution has many important applications. It is related to classification, cluster analysis, neural network, and statistical image recovering. The problem also arises in measuring production efficiency in economic systems. Three most promising nonparametric estimators in the existing literature are introduced. Their statistical properties are provided, some of which are new. Themes of future study are also discussed.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.24 no.6
• /
• pp.655-663
• /
• 2021

In this paper, DFT-Based channel estimation with channel response mirroring is proposed and analyzed. In General, pilot symbols for channel estimation in MIMO(Multi-Input Multi-Output) OFDM(Orthogonal Frequency-Division Multiplexing) Systems have a diamond shape in the time-frequency plane. An interpolation technique to estimate the channel response of sub-carriers between reference symbols is needed. Various interpolation techniques such as linear interpolation, low-pass filtering interpolation, cubic interpolation and DFT interpolation are employed to estimate the non-pilot sub-carriers. In this paper, we investigate the conventional DFT-based channel estimation for noise reduction and channel response interpolation. The conventional method has performance degradation by distortion called "edge effect" or "border effect". In order to mitigate the distortion, we propose an improved DFT-based channel estimation with channel response mirroring. This technique can efficiently mitigate the distortion caused by the DFT of channel response discontinuity. Simulation results show that the proposed method has better performance than the conventional DFT-based channel estimation in terms of MSE.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.5
• /
• pp.450-456
• /
• 2006

Monte Carlo localization is known to be one of the most reliable methods for pose estimation of a mobile robot. Although MCL is capable of estimating the robot pose even for a completely unknown initial pose in the known environment, it takes considerable time to give an initial pose estimate because the number of random samples is usually very large especially for a large-scale environment. For practical implementation of MCL, therefore, a reduction in sample size is desirable. This paper presents a novel approach to reducing the number of samples used in the particle filter for efficient implementation of MCL. To this end, the topological information generated through the thinning technique, which is commonly used in image processing, is employed. The global topological map is first created from the given grid map for the environment. The robot then scans the local environment using a laser rangefinder and generates a local topological map. The robot then navigates only on this local topological edge, which is likely to be similar to the one obtained off-line from the given grid map. Random samples are drawn near the topological edge instead of being taken with uniform distribution all over the environment, since the robot traverses along the edge. Experimental results using the proposed method show that the number of samples can be reduced considerably, and the time required for robot pose estimation can also be substantially decreased without adverse effects on the performance of MCL.