• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.38 no.4
• /
• pp.1-10
• /
• 2001

In this paper, we propose the stability analysis and design methodology for the discrete-time affine Type III fuzzy system via the convex optimization technique. First, the stability condition is derived under which the discrete-time affine Type III fuzzy system is quadratically stable in the large. Next, the derived condition is reformulated into the convex optimization problem called Linear Matrix Inequalities (LMI) and numerically addressed. Finally, the effectiveness and the feasibility of the proposed analysis and design methodology is highlighted via an example and its computer simulation result.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.726-732
• /
• 2017

In practical distributed sensing and prediction applications over wireless sensor networks (WSN), environmental sensing activities are highly dynamic because of noisy sensory information from moving source signals. The recent distributed online convex optimization frameworks have been developed as promising approaches for solving approximately stochastic learning problems over network of sensors in a distributed manner. Negligence of mobility consequence in the original distributed saddle point algorithm (DSPA) could strongly affect the convergence rate and stability of learning results. In this paper, we propose an integrated sliding windows mechanism in order to stabilize predictions and achieve better convergence rates in cooperative detection of a moving source signal scenario.

• Journal of Institute of Control, Robotics and Systems
• /
• v.1 no.1
• /
• pp.63-70
• /
• 1995

퍼지논리제어기는 산업응용에 광범위하게 연구되고 있으며, 계속적으로 사용되고 있다. 그러나 퍼지집합의 조정을 통해 최적규칙을 구축하기 위하여, 시행착오에 의한 매우 능숙한 기술이 요구된다. 이 논문에서는 첫째로, 퍼지논리제어기와 기존의 PID 제어기로 구성된 하이브리드 퍼지제어기를 제안한다. 즉, 시스템의 제어 입력은 퍼지변수로서, 과도상태에서의 FLC출력과 정상상태에서의 PID 출력의 컨벡스(convex) 결합이다. 둘째로, 간략추론법과 개선된 컴플렉스방법을 이용한 강력한 자동동조알고리즘이 퍼지논리제어기의 성능을 자동적으로 개선하기 위하여 사용된다. 이방법은 오차변화율및 제어출력의 제한조건에 의하여, 언어제어규칙, 퍼지계수(scaling factor), PID계수, 하이브리드 퍼지논리제어기의 하중계수의 최적값을 자동적으로 추정한다. 시뮬레이션은 시간지연 플랜트및 하수처리시스템의 활성오니공정과 같은 비선형 플랜트에서 실행되고, 시스템의 성능은 평가지수 ITAE로 평가된다.

• Journal of IKEEE
• /
• v.17 no.1
• /
• pp.29-35
• /
• 2013

In this paper, we suggest an improved Convex Hull algorithm considering sort in plane point set. This algorithm has low computational complexity since processing data are reduced by characteristic of extreme points. Also it obtains a complete convex set with just one processing using an convex vertex discrimination criterion. Initially it requires sorting of point set. However we can't quickly sort because of its heavy operations. This problem was solved by replacing value and index. We measure the execution time of algorithms by generating a random set of points. The results of the experiment show that it is about 2 times faster than the existing algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.11
• /
• pp.130-136
• /
• 1998

This paper develops an efficient algorithm for the minimum distance calculation between two general polyhedra(convex and/or concave) in three-dimensional space. The polyhedra approximate objects using flat polygons which composed of more than three vertices. The algorithm developed in this paper basically computes minimum distance between two polygons(one polygon per object) and finds a set of two polygons which makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that the minimum distance computing time is rapidly increased with the number of polygons which used to approximate an object. This paper develops a method to eliminate sets of two polygons which have no possibility of minimum distance occurrence, and an efficient algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. The correctness of the algorithm is verified not only comparing analytically calculated exact minimum distance with one calculated using the developed algorithm but also watching a line which connects two points making a global minimum distance of a convex object and/or a concave object. The algorithm efficiently finds minimum distance between two convex objects made of 224 polygons respectively with a computation time of about 0.1 second.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.89-93
• /
• 2014

Reviews are very important for potential consumer' making choices. They are also used by manufacturers to find problems of their products and to collect competitors' business information. But someone write fake reviews to mislead readers to make wrong choices. Therefore detecting fake reviews is an important problem for the E-commerce sites. Support Vector Machines (SVMs) are very important text classification algorithms with excellent performance. In this paper, we propose a new incremental algorithm based on weight and the extension of Karush-Kuhn-Tucker(KKT) conditions and Convex Hull for online Review Spam Detection. Finally, we analyze its performance in theory.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.8
• /
• pp.766-771
• /
• 2002

In this study, we have developed a 3-dimensional diagnostic ultrasonic sector probe using a convex type ultrasonic probe with 128 active elements. The probe was made to operate at the center frequency of 4.5㎒ with the bandwidth of 66%. The driving part was designed to rotate the axis of the convex probe by means of a step motor equipped with reduction gears and spur gears attached to the motor so that the probe could enable us to acquire a series of 2-dimensional images to construct a 3-dimensional image. Acoustic cover of the probe was made of polymers to have the same radius of rotation as that of the convex probe. The controllability of the rotation angle and the structural stability of the probe were confirmed through experimental 3-dimensional images obtained using the developed 3-dimensional sector probe.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2012.06a
• /
• pp.85-86
• /
• 2012

e-Navigation strategy IMO promotes is defined as it is necessary to network to provide various maritime safety information to in land and on board users, and it is expected to provide a large amount and diverse kinds of maritime spatial information services to them frequently. However, as there are some limits to transmit that by current mobile maritime communication technologies, it is required to simplify and optimize the information. In this study, tree node and convex hull method is applied to S-100 SD spatial information to generalize and we arranged the efficiency and effect of generalization by storing in XML form which can be used in general.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.522-532
• /
• 2011

In Oriental medicine, the status of a tongue is the important indicator to diagnose the condition of internal organs in a body. A tongue diagnosis is not only convenient but also non-invasive, and therefore widely used in Oriental medicine. But tongue diagnosis has some problems that should be objective and standardized, it also exhaust the diagnosis tool that can help for oriental medicine doctor's decision-making. In this paper, to solve the this problem we propose a method that calculates the tongue geometry information for effective tongue diagnosis analysis. Our method is to extract the tongue region for using improved snake algorithm, and calculates the geometry information by using convex hull and In-painting. In experiment, our method has stable performance as 7.2% by tooth plate and 8.5% by crack in region difference ratio.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.513-518
• /
• 2016

This paper presents a fast 3D mesh generation method using projection for line laser-based 3D scanners. The well-known method for 3D mesh generation utilizes convex hulls for 4D vertices that is converted from the input 3D vertices. This 3D mesh generation for a large set of vertices requires a lot of time. To overcome this problem, the proposed method takes (${\theta}-y$) 2D depth map into account. The 2D depth map is a projection version of 3D data with a form of (${\theta}$, y, z) which are intermediately acquired by line laser-based 3D scanners. Thus, our 2D-based method is a very fast 3D mesh generation method. To evaluate our method, we conduct experiments with intermediate 3D vertex data from line-laser scanners. Experimental results show that the proposed method is superior to the existing method in terms of mesh generation speed.