• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.505-508
• /
• 2000

The success of target reconstruction in SAR(Synthetic Aperture Radar) imaging system is greatly dependent on the coherent detection. Primary causes of incoherent detection are uncompensated target or sensor motion, random turbulence in propagation media, wrong path in radar platform, and etc. And these appear as multiplicative phase error to the echoed signal, which consequently, causes fatal degradations such as fading or dislocation of target image. In this paper, we present iterative phase error estimation scheme which uses echoed data in all temporal frequencies. We started with analyzing wave equation for one point target and extend to overall echoed data from the target scene - The two wave equations governing the SAR signal at two temporal frequencies of the radar signal are combined to derive a method to reconstruct the complex phase error function. Eventually, this operation attains phase error correction algorithm from the total received SAR signal. We verify the success of the proposed algorithm by applying it to the simulated spotlight-mode SAR data.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.920-923
• /
• 1996

This paper presents a new algorithm for the self-localization of a mobile robot using perspective invariant(Cross Ratio). Most of conventional model-based self-localization methods have some problems that data structure building, map updating and matching processes are very complex. Use of the simple cross ratio can be effective to the above problems. The algorithm is based on two basic assumptions that the ground plane is flat and two parallel walls are available. Also it is assumed that an environmental map is available for matching between the scene and the model. To extract an accurate steering angle for a mobile robot, we take advantage of geometric features such as vanishing points(V.P). Point features for computing cross ratios are extracted robustly using a vanishing point and the intersection points between floor and the vertical lines of door frames. The robustness and feasibility of our algorithms have been demonstrated through experiments in indoor environments using an indoor mobile robot, KASIRI-II(KAist SImple Roving Intelligence).

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1055-1058
• /
• 2003

The robustness and reliability of vision algorithms is the key issue in robotic research and industrial applications. In this paper robust real time visual tracking in complex scene is considered. A common approach to increase robustness of a tracking system is the use of different model (CAD model etc.) known a priori. Also fusion or multiple features facilitates robust detection and tracking of objects in scenes of realistic complexity. Voting-based fusion of cues is adapted. In voting. a very simple or no model is used for fusion. The approach for this algorithm is tested in a 3D Cartesian robot which tracks a toy vehicle moving along 3D rail, and the Kalman filter is used to estimate the motion parameters. namely the system state vector of moving object with unknown dynamics. Experimental results show that fusion of cues and motion estimation in a tracking system has a robust performance.

• Journal of information and communication convergence engineering
• /
• v.13 no.3
• /
• pp.197-204
• /
• 2015

In this paper, we present an algorithm for the detection of illegally parked vehicles based on a combination of some image processing algorithms. A digital camera is fixed in the illegal parking region to capture the video frames. An adaptive Gaussian mixture model (GMM) is used for background subtraction in a complex environment to identify the regions of moving objects in our test video. Stationary objects are detected by using the pixel-level features in time sequences. A stationary vehicle is detected by using the local features of the object, and thus, information about illegally parked vehicles is successfully obtained. An automatic alarm system can be utilized according to the different regulations of different illegal parking regions. The results of this study obtained using a test video sequence of a real-time traffic scene show that the proposed method is effective.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.421-424
• /
• 1999

Automatic human face detection in a complex background is one of the difficult problems In this paper. we propose an effective automatic face detection system that can locate the face region in natural scene images when the system is used as a pre-processor of a face recog- nition system. We use two natural and powerful visual cues, the color and the human head shape. The outline of the human head can be generally described as being roughly elliptic in nature. In the first step of the proposed system, we have tried the approach of fitting the best Possible ellipse to the outline of the head In the next step, the method based on the human skin color space by selecting flesh tone regions in color images and histogramming their r(＝R/(R＋G＋B)) and g(＝G/R＋G＋B)) values. According to our experiment. the proposed system shows robust location results

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.531-535
• /
• 1999

Automatic human face detection in a complex background is one of the difficult problems. In this paper, we propose an effective and robust automatic face detection approach that can locate the face region in natural scene images when the system is used as a pre-processor of a face recognition system . We use two natural and powerful visual cues, the skin color and the eyes. In the first step of the proposed system, the method based on the human skin color space by selecting flesh tone regions using normalized r-g space in color images. In the next step, we extract eye features by calculating moments and using geometrical face model. Experimental results demonstrate that the approach can efficiently detect human faces and satisfactory deal with the problems caused by bad lighting condition, skew face orientation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2400-2419
• /
• 2014

Pre-segmented pixels can reduce the difficulty of segmentation and promote the segmentation performance. This paper proposes a novel segmentation method based on merging texture superpixels by computing inner similarity. Firstly, we design a set of Gabor filters to compute the amplitude responses of original image and compute the texture map by a salience model. Secondly, we employ the simple clustering to extract superpixles by affinity of color, coordinates and texture map. Then, we design a normalized histograms descriptor for superpixels integrated color and texture information of inner pixels. To obtain the final segmentation result, all adjacent superpixels are merged by the homogeneity comparison of normalized color-texture features until the stop criteria is satisfied. The experiments are conducted on natural scene images and synthesis texture images demonstrate that the proposed segmentation algorithm can achieve ideal segmentation on complex texture regions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3664-3677
• /
• 2017

Abrupt scene changes generally incur the afterimage effect. So, the unblocked image portion is still viewed by human eyes just after it is blocked by some pattern. Yovo's secure display method utilized this phenomenon and it is systematically analyzed using computational afterimage modeling by replacing the complex afterimage effect via simple low-pass filtering. With this approach, realistic images perceived by the human eye can be computationally generated at every single moment, especially reflecting the afterimage effect. The generated images are compared with the original images to determine the factors that affect the image quality of the secure display method. The simulation results demonstrate that the ratio of the unblocked portion to the blocked portion of an image and the playback rate are two primary factors related to the recognized image quality. We also found that the two factors are still effective for generalized secure display techniques.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.1
• /
• pp.7-14
• /
• 1983

Linear feature such as lines and curves are one of important features in image processing. In this paper, new method of linear feature detection is suggested. Also, we have studied approximation technique which transforms detected linear feature into data structure for the practical. This method is based on graph theory and principle of this method is based on minimal spanning tree concept which is widely used in edge linking process. By postprocessing, Hairs and inconsistent line segments are removed. To approximate and describe traced linear feature, piecewise linear approximation is adapted. The algorithm is demonstrated through computer simulations.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.446-449
• /
• 2009

In this paper, we present a novel method for reconstructing a super-resolution image using multi-view low-resolution images captured for depth varying scene without requiring complex analysis such as depth estimation and feature matching. The proposed method is based on the iterative back projection technique that is extended to the 3D volume domain (i.e., space + depth), unlike the conventional superresolution methods that handle only 2D translation among captured images.