• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.3
• /
• pp.267-274
• /
• 2009

Recently, UAVs (Unmanned Aerial Vehicles) are expected much as the Unmanned Systems for various missions. These missions are often based on the Vision System. Especially, missions such as surveillance and pursuit have a process which is carried on through the transmitted vision data from the UAV. In case of small UAVs, monocular vision is often used to consider weights and expenses. Research of missions performance using the monocular vision is continued but, actually, ground and target model have difference in distance from the UAV. So, 3D distance measurement is still incorrect. In this study, Mean-Shift Algorithm, Optical Flow and Subspace Method are posed to estimate the relative depth. Mean-Shift Algorithm is used for target tracking and determining Region of Interest (ROI). Optical Flow includes image motion information using pixel intensity. After that, Subspace Method computes the translation and rotation of image and estimates the relative depth. Finally, we present the results of this study using images obtained from the UAV experiments.

• Journal of Korean Society of Transportation
• /
• v.17 no.1
• /
• pp.105-112
• /
• 1999

Image Processing Technique has been used as an efficient method to collect traffic information on the road such as vehicle counts, speed, queues, congestion and incidents. Most of the current methods which have been used to detect vehicles by the image processing are based on point processing, dealing with the local gray level of each pixel in the small window. However, these methods have some drawbacks. Firstly, detection is restricted by image quality. Secondly, they can not deal with occlusion and perspective projection problems, In this research, a new method which possibly deals with occlusion and perspective problems will be proposed. It extracts spatial information such as the position, the relationship of vehicles in 3-dimensional space, as well as vehicle detection in the image. The main algorithm used in this research is based on an extension of the Hough Transform. The Hough Transform which is proposed to estimates parameters of vertices and directed edges analytically on the Hough Space, is a valuable method for the 3-dimensional analysis of static scenes, motion detection and the estimation of viewing parameters.

• Journal of Digital Convergence
• /
• v.20 no.4
• /
• pp.491-498
• /
• 2022

Based on Goethe's color theory, this study presented concepts and classification methods through the following research methods for the purpose of defining sensory, emotional, and experiential colors as spatial colors in digital space. First, the concept of spatial color is defined through theoretical consideration and three (3) types of spatial color are classified as the surface, outline, and physical colors. Secondly, the study includes the characteristics of digital space and color sensory type. Third, based on the identified color sensory type through the previous theoretical consideration, the four (4) categorized digital spatial color were derived and presented as techno Chromatic, S.E.N.S.E, pixel, and blur colors were determined and proposed. Based on such research contents, this study is meaningful in that it systematized the meaning of Goethe's color theory in the present age through digital spatial color.

• Journal of the Korea Computer Graphics Society
• /
• v.29 no.1
• /
• pp.13-22
• /
• 2023

In this paper, we present a method for estimating full 3D shapes from given 2D silhouette images of human bodies. Because the silhouette only consists of the partial information on the true shape, it is an ill-posed problem. To address the problem, we use the statistical human shape space obtained from the existing large 3D human shape database. The method consists of three steps. First, we extract the boundary pixels and their appropriate normal vectors from the input silhouette images. Then, we initialize the correspondences of each pixel to the vertex of the statistically-deformable 3D human model. Finally, we numerically optimize the parameters of the statistical model to fit best to the given silhouettes. The viability and the robustness of the method is demonstrated with various experiments.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.663-674
• /
• 2003

Bump mapping is a technique that represents the detailed parts of the object surface, such as a perturberance of the skin of a peanut, using the geometry mapping without complex modeling. However, the hardware implementation for bump mapping is considerable, because a large amount of per pixel computation, including the normal vector shading, is required. In this paper, we propose a new bump mapping algorithm using the polar coordinate system and its hardware architecture. Compared with other existing architectures, our approach performs bump mapping effectively by using a new vector rotation method for transformation into the reference space and minimizing illumination calculation. Consequently, our proposed architecture reduces a large amount of computation and hardware requirements.

• Journal of Broadcast Engineering
• /
• v.9 no.3
• /
• pp.207-213
• /
• 2004

The layered depth image (LDI) is an efficient approach to represent three-dimensional objects with complex geometry for image-based rendering (IBR). LDI contains several attribute values together with multiple layers at each pixel location. In this paper, we propose an efficient preprocessing algorithm to compress depth information of LDI. Considering each depth value as a point in the two-dimensional space, we compute the minimum distance between a straight line passing through the previous two values and the current depth value. Finally, the minimum distance replaces the current attribute value. The proposed algorithm reduces the variance of the depth information , therefore, It Improves the transform and coding efficiency.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.4
• /
• pp.95-102
• /
• 2004

It is necessary to improve the exactness and adaptation of the working environment in the intelligent robot system. The vision sensor have been studied for this reason fur a long time. However, it is very difficult to perform the camera and robot calibrations because the three dimensional reconstruction and many processes are required for the real usages. This paper suggests the image based visual servoing to solve the problem of old calibration technique and supports OLP(Off-Line-Programming) path compensation. Virtual camera can be modeled from the real factors and virtual images obtained from virtual camera gives more easy perception process. Also, Initial path generated from OLP could be compensated by the pixel level acquired from the real and virtual, respectively. Consequently, the proposed visually assisted OLP teaching remove the calibration and reconstruction process in real working space. With a virtual simulation, the better performance is observed and the robot path error is calibrated by the image differences.

• Ocean and Polar Research
• /
• v.37 no.1
• /
• pp.11-22
• /
• 2015

In-situ measurements are labor-intensive, time-consuming, and limited in their ability to observe currents with spatial variations in the surf zone. This paper proposes an optical image-based method of measurement of currents in the surf zone. This method measures nearshore currents by tracking in time wave breaking-induced foam patches from sequential images. Foam patches in images tend to be arrayed with irregular pixel intensity values, which are likely to remain consistent for a short period of time. This irregular intensity feature of a foam patch is characterized and represented as a keypoint using an image-based object recognition method, i.e., Scale Invariant Feature Transform (SIFT). The keypoints identified by the SIFT method are traced from time sequential images to produce instantaneous velocity fields. In order to remove erroneous velocities, the instantaneous velocity fields are filtered by binding them within upper and lower limits, and averaging the velocity data in time and space with a certain interval. The measurements that are obtained by this method are comparable to the results estimated by an existing image-based method of observing currents, named the Optical Current Meter (OCM).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.109-112
• /
• 1999

Image segmentation is the critical first step in image information extraction for computer vision systems. Clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are divided from the fuzzy c-means(FCM) algorithm. The FCM algorithm uses fie probabilistic constraint that the memberships of a data point across classes sum to 1. However, the memberships resulting from the FCM do not always correspond to the intuitive concept of degree of belonging or compatibility. Moreover, the FCM algorithm has considerable trouble under noisy environments in the feature space. Recently, a possibilistic approach to clustering(PCM) for solving above problems was proposed. In this paper, we used the PCM for color image segmentation. This approach differs from existing fuzzy clustering methods for color image segmentation in that the resulting partition of the data can be interpreted as a possibilistic partition. So, the problems in the FCM can be solved by the PCM. But, the clustering results by the PCM are not smoothly bounded, and they often have holes. The region growing was used as a postprocessing after smoothing the noise points in the pixel seeds. In our experiments, we illustrate that the PCM us reasonable than the FCM in noisy environments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.107-110
• /
• 2018

Image compression is the application of Data compression on digital images. The (DCT) discrete cosine transform is a technique for converting a time domain to a frequency domain. It is widely used in image compression. First, the image is divided into 8x8 pixel blocks. Apply the DCT to each block while processing from top to bottom from left to right. Each block is compressed through quantization. The space of the compressed block array constituting the image is greatly reduced. Reconstruct the image through the IDCT. The purpose of this research is to understand compression/decompression of images using the DCT method.