• Journal of Korea Game Society
• /
• v.14 no.6
• /
• pp.109-118
• /
• 2014

We studied the creation of fractal images with polygonal rotation symmetry. As in Loocke's method[13] we start with IFS of affine functions that create polygonal fractals and extends the IFS by adding functions that create Julia sets instead of adding square root functions. The resulting images are rotationally symmetric and Julia set shaped. Also we can improve fractal images by modifying probabilistic IFS algorithm, and we suggest a method of deforming Julia set by changing exponent value.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2006.06a
• /
• pp.41-44
• /
• 2006

본 논문은 안면영상의 인증 요소로 사용되는 눈동자영역을 SIFT를 이용하여 추출해내는 방법을 제안하고 있다. 모델이 되는 눈동자영상과 추출 하고자 하는 입력영상의 SET 결과인 Keypoint descriptor를 이용하여 각각의 특징벡터를 구성하고 서로 정합한 후 두 특징 점들 사이에 affine transform이 존재하는지 판단하여 반수 이상에 대응하는 특징 점들에 대해 동일한 affine transform이 존재할 경우 눈동자영역이라고 판단하였다. 실험결과 학습과정이 없으므로 기존의 인식방법 보다 빠르게 영역을 추출하는 결과를 얻을 수 있었다.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.3
• /
• pp.183-190
• /
• 2002

This paper describes the synthesis of robust and non-fragile H$\infty$ state feedback controllers for linear varying systems with affine parameter uncertainties, and static state feedback controller with structured uncertainty. The sufficient condition of controller existence, the design method of robust and non-fragile H$\infty$ static state feedback controller, and the set of controllers which satisfies non-fragility are presented. The obtained condition can be rewritten as parameterized Linear Matrix Inequalities(PLMls), that is, LMIs whose coefficients are functions of a parameter confined to a compact set. However, in contrast to LMIs, PLMIs feasibility problems involve infinitely many LMIs hence are inherently difficult to solve numerically. Therefore PLMls are transformed into standard LMI problems using relaxation techniques relying on separated convexity concepts. We show that the resulting controller guarantees the asymptotic stability and disturbance attenuation of the closed loop system in spite of controller gain variations within a degree.

• Journal of the Chungcheong Mathematical Society
• /
• v.36 no.2
• /
• pp.77-86
• /
• 2023

The purpose of this paper is to show that a certain finite dimensional representation of the rational Cherednik algebra of type A has a basis consisting of simultaneous eigenvectors for the actions of a certain family of commuting elements, which are introduced in the author's previous paper. To this end, we introduce a combinatorial object, which is called a restricted arrangement of colored beads, and consider an action of the affine symmetric group on the set of the arrangements.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.141-144
• /
• 2002

In this paper, we propose a new object tracking algorithm using deformed template and Level-Set theory, which is robust against background variation, object flexibility and occlusion. The proposed tracking algorithm consists of two steps. The first step is an estimation of object shape and location, on the assumption that the transformation of object can be approximately modeled by the affine transform. The second step is a refinement of the object shape to fit into the real object accurately, by using the potential energy map and the modified Level Set speed function. Experimental results show that the proposed algorithm can track non-rigid objects with large variation in the backgrounds.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1572-1580
• /
• 2005

The common requirements for watermarking are usually invisibility, robustness, and capacity. We proposed the watermarking for 3D mesh model based on projection onto convex sets for invisibility and robustness among requirements. As such, a 3D mesh model is projected alternatively onto two convex sets until it converge a point. The robustness convex set is designed to be able to embed watermark into the distance distribution of vertices. The invisibility convex set is designed for the watermark to be invisible based on the limit range of vertex movement. The watermark can be extracted using the decision values and index that the watermark was embedded with. Experimental results verify that the watermarked mesh model has both robustness against mesh simplification, cropping, affine transformations, and vertex randomization and invisibility.

• ETRI Journal
• /
• v.25 no.2
• /
• pp.109-120
• /
• 2003

Though the airborne laser scanning (ALS) technique is becoming more popular in many applications, horizontal accuracy of points scanned by the ALS is not yet satisfactory when compared with the accuracy achieved for vertical positions. One of the major reasons is the drift that occurs in the inertial measurement unit (IMU) during the scanning. This paper presents an algorithm that adjusts for the error that is introduced mainly by the drift of the IMU that renders systematic differences between strips on the same area. For this, we set up an observation equation for strip-wise adjustments and completed it with tie point and control point coordinates derived from the scanned strips and information from aerial photos. To effectively capture the tie points, we developed a set of procedures that constructs a digital surface model (DSM) with breaklines and then performed feature-based matching on strips resulting in a set of reliable tie points. Solving the observation equations by the least squares method produced a set of affine transformation equations with 6 parameters that we used to transform the strips for adjusting the horizontal error. Experimental results after evaluation of the accuracy showed a root mean squared error (RMSE) of the adjusted strip points of 0.27 m, which is significant considering the RMSE before adjustment was 0.77 m.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11C
• /
• pp.1592-1599
• /
• 2004

In this paper, we proposed the 3D mesh watermarking using projection onto convex sets (POCS). 3D mesh is projected iteratively onto two constraint convex sets until it satisfy the convergence condition. These sets consist of the robustness set and the invisibility set that designed to embed watermark Watermark is extracted without original mesh by using the decision values and the index that watermark is embedded. Experimental results verified that the watermarked mesh have the robustness against mesh simplification, cropping, affine transformation, and vertex randomization as well as the invisibility.

• Journal of Broadcast Engineering
• /
• v.13 no.5
• /
• pp.685-695
• /
• 2008

This paper presents a method to segment the object of interest from a set of multi-view images with minimal user interaction. Specifically, after the user segments an initial image, we first estimate the transformations between foreground and background of the segmented image and the neighboring image, respectively. From these transformations, we obtain regions in the neighboring image that respectively correspond to the foreground and the background of the segmented image. We are then able to segment the neighboring image based on these regions, and iterate this process to segment the whole image set. Transformation of foregrounds are estimated by feature-based registration with free-form deformation, while transformation of backgrounds are estimated by homography constrained to affine transformation. Here, both are based on correspondence point pairs. Segmentation is done by estimating pixel color distributions and defining a shape prior based on the obtained foreground and background regions and applying them to a Markov random field (MRF) energy minimization framework for image segmentation. Experimental results demonstrate the effectiveness of the proposed method.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.27 no.1
• /
• pp.667-675
• /
• 2009

Image matching is widely applied in image application areas, such as remote sensing and GIS. In general, the initial set of matching points always includes outlier which affect the accuracy of image matching. The purpose of this paper is to develop a robust approach for outlier detection and removal in order to keep accuracy in image matching applications. In this paper we use three automatic outlier detection techniques of backward matching and affine transformation, and RANSAC(RANdom SAmple Consensus) algorithm. Moreover, we calculate overlapping apply and steps block-based processing for fast and efficient image matching in pre-processing steps. The suggested approach in this paper has been applied to real frame image pairs and the results have been analyzed in terms of the robustness and the efficiency.