• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.3
• /
• pp.236-241
• /
• 2008

This paper presents a method to recognize the plane regions for movement of walking robots. When the autonomous agencies using stereo camera or laser scanning sensor is under unknown 3D environment, the mobile agency has to detect the plane regions to decide the moving direction and perform the given tasks. In this paper, we propose a very fast method for plane detection using normal vector of a triangle by 3 vertices defined on a small circular region. To reduce the effect of noises and outliers, the triangle rotates with respect to the center position of the circular region and generates a series of triangles with different normal vectors based on different three points on the boundary of the circular region. The vectors for several triangles are normalized and then median direction of the normal vectors is used to test the planarity of the circular region. The method is very fast and we prove the performance of algorithm for real range data obtained from a stereo camera system.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.228-230
• /
• 2002

We present a new low power scan testing and test data compression method for System-On-a-Chip (SOC). The don't cares in unspecified scan vectors are mapped to binary values for low power and encoded by adaptive encoding method for higher compression. Also, the scan-in direction of scan vectors is determined for low power. Experimental results for full-scanned versions of ISCAS 89 benchmark circuits show that the proposed method has both low power and higher compression.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.462-464
• /
• 1992

In this paper, an extraction of depth intonation in pattern using neural network is presented. All the 3D images represent the depth information in grey pixels. This pixels which have analog values translated digital values. Because of the noise and distortion in pattern, we use the normalization in learning and recalling the patterns. Our method has eight direction vectors and slopes for pattern. Also, we use potential to obtain the mean slope and direction vectors of given 3D patches. The higher level of deduction finding the global depth information is also carried out by using neural network.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.3
• /
• pp.78-87
• /
• 2002

A macroblock(MB) in MPEG coded domain can have zero, one, or two motion vectors depending on its frame type and prediction direction (forward-, backward-, or hi-directionally). In this paper, we propose a method that converts these motion vectors on MPEG coded domain as a uniform set, independent of the frame type and the direction of prediction, and directly utilizes these re-analyzed motion vectors for understanding video contents. Also, using this frame-type-independent motion vector, we propose novel methods for detecting and tracking moving objects with frame-based detection accuracy on the compressed domain. These algorithms are performed directly from the MPEG bitstreams after VLC decoding with little time consumption. Experimental results show validity and outstanding performance of our methods.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.161-163
• /
• 2005

In this paper, we propose an efficient motion vector recovery algorithm for the new coding standard H.264, which makes use of the Lagrange interpolation formula. In H.264/AVC, a 16$\times$16 macroblock can be divided into different block shapes for motion estimation, and each block has its own motion vector. In the natural video the motion vector is likely to move in the same direction, hence the neighboring motion vectors are correlative. Because the motion vector in H.264 covers smaller area than previous coding standards, the correlation between neighboring motion vectors increases. We can use the Lagrange interpolation formula to constitute a polynomial that describes the motion tendency of motion vectors, and use this polynomial to recover the lost motion vector. The simulation result shows that our algorithm can efficiently improve the visual quality of the corrupted video.

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• pp.485-490
• /
• 1999

Wind vector information over the ocean is currently obtained using multiple beam scatterometer data. The scatterometers on ERS-1/2 generate wind vector information with a spatial resolution of 50km and accuracies of $\pm$2m/s in wind speed and $\pm$20$^{\circ}$ in wind direction. Synthetic aperture radar (SAR) data over the ocean have the potential of providing wind vector information independent of weather conditions with finer resolution. Finer resolution wind vector information can often be useful particularly in coastal regions where the scatterometer wind information is often corrupted because of the lower resolution system characteristics which is often contaminated by the signal returns from the coastal areas or ice in the case of arctic environments. In this paper we tested CMOD_4 and CMOD_IFR2 algorithms for extracting the wind vector from SAR data. These algorithms require precise estimation of normalized radar cross-section and wind direction from the SAR data and the local incidence angle. The CMOD series algorithms were developed for the C-band, VV-Polarized SAR data, typically for the ERS SAR data. Since RADARSAT operates at the same C-band but with HH-Polarization, the CMOD series algorithms should not be used directly. As a preliminary approach of resolving with this problem, we applied the polarization ratio between the HH and VV polarizations in the wind vectors estimation. Two test areas, one in front of Inchon and several sites around Jeju island were selected and investigated for wind vector estimation. The new results were compared with the wind vectors obtained from CMOD algorithms. The wind vector results agree well with the observed wind speed data. However the estimation of wind direction agree with the observed wind direction only when the wind speed is greater than approximately 3.0m/s.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2209-2215
• /
• 2014

This paper presents, a deinterlacing method by improving the Direction-Oriented Interpolation (DOI) technique. The technique is considered to be a very strong tool for intrafield-based deinterlacing. However, DOI has some problems such as long processing time, wrong edge detection in periodic pattern. To remedy this problem, we replace the full search in DOI by a two-step search to reduce processing time and introduces two additional processes to improve image quality. In the proposed method, the spatial direction vectors (SDVs) misread data are reconsidered to prevent them utilizing in the next interpolation step, resulting in an accurate deinterlacing method. We conduct experiments with ISO experimental images to compare the proposed method with the existing methods including line evarage (LA), edge-based line averaging (ELA), DOI, selective deinterlacing algorithm (SDA). Experimental results show the proposed method gives better performance in objective and subjective quality than existing deinterlacing methods.

• Journal of the Korean Statistical Society
• /
• v.27 no.4
• /
• pp.471-483
• /
• 1998

The influence of observations on the misclassification probability in multiple discriminant analysis under the equal covariance assumption is investigated by the local influence method. Under an appropriate perturbation we can get information about influential observations and outliers by studying the curvatures and the associated direction vectors of the perturbation-formed surface of the misclassification probability. We show that the influence function method gives essentially the same information as the direction vector of the maximum slope. An illustrative example is given for the effectiveness of the local influence method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.37-47
• /
• 2009

When H.264 encoded video streams are transmitted over wireless network, packet loss is unavoidable. Responding on this environment, we propose methods to recover missed motion vector in the decoder: At first, A candidate vector set for missing macroblock is estimated from high correlation coefficient of neighboring motion vectors and missing block vectors the algorithm clusters candidate vectors through distances amongst motion vectors of neighboring blocks. Then the optimal candidate vector is determined by the median value of the clustered motion vector set. In next stage, from the candidate vector set, the final candidate vector of missing block is determined it has minimum distortion value considering directions of neighboring pixels' boundary. Test results showed that the proposed algorithm decreases the candidate motion vectors $23{\sim}61%$ and reduces $3{\sim}4sec$ on average processing(decoding) time comparing the existing H.264 codec. The PSNR, in terms of visual quality is similar to existing methods.

• Communications for Statistical Applications and Methods
• /
• v.8 no.3
• /
• pp.875-883
• /
• 2001

We derive the asymptotic relative efficiencies in two special cases of Chaudhuri's estimators for the multivariate one sample problem. And we compare those two when observations are independent and identically distributed from a family of spherically symmetric distributions including normal distributions.