• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅲ
• /
• pp.1291-1294
• /
• 2003

This paper presents an approach to extract license plates from parking regulation images which is captured in various photographing direction and complex background. first, we search each row at regular intervals starting from the bottom of a license-plate image, and we set up a rough region for a certain zone in which the sign of intensity vector changes frequently enough and color of license plate is detected enough, assuming it as a candidate location of a license plate. And then, we extract an elaborate area of a license plate by horizontally and vertically projecting vertical edges. Here, tar types of the private and the public, are easily classified according to the color of extracted plates. To evaluate proposed method, we used 200 actual regulation images. As a result, the proposed method showed extraction rate of 96%, which is 9% higher than the previous method using only intensity vector.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.122-127
• /
• 1998

This paper suggests an integrated method for discovering knowledge from a large database. Our approach applies an attribute-oriented concept hierarchy ascension technique to extract generalized data from actural data in databases, induction of decision trees to measure the value of information, and knowledge reduction of rough set theory to remove dispensable attributes and attribute values. The integrated algorithm first reduce the size of database for the concept generalization, reduces the number of attributes by way of elimination condition attributes which have little influence on decision attribute, and finally induces simplified decision rules removing the dispensable attribute values by analyzing the dependency relationships among the attributes.

• 품질경영학회지
• /
• 제23권4호
• /
• pp.58-63
• /
• 1995

To access the quality of a fit to a set of data it is always useful to conduct a posteriori analysis involving the examination of residuals, detection of influential data values, etc. Smoothing splines are a type of nonparametric regression estimators for the diagnostic problem. And leverage value, Cook's distance, and DFFITS are used for detecting influential data. Since high leverage points will always have small residuals, the new diagnostic measures including of properties of leverage and residuals are needed. In this paper, we propose FVARATIO version as diagnostic measure in nonparametric regression. Also we consider the rough bound as analogy with linear regression case.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.691-700
• /
• 1994

Voronoi diagram of a set of geometric entities on a plane such as points, line segments, or arcs is a collection of Voronoi polygons associated with each entity, where Voronoi polygon of an entity is a locus of point which is closer to the associated entity than any other entity. Voronoi diagram is one of the most fundamental geometrical construct and well-known for its theoretical elegance and the wealth of applications. Various geometric problems can be solved with the aid of Voronoi diagram. For example, the maximum tool diameter of a milling cutter for rough cutting in a pocket can be easily found, and the pocketing tool path can be efficiently generated from Voronoi diagram. In PCB design, the design rule checking can be easily done via Voronoi diagram, too. This paper discusses an algorithm to construct Voronoi diagram of a simple polygon which consists of simple curves such as line segments as well as arcs in a plane with O(nlogn) time complexity by employing the divide and conquer scheme.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2004년도 춘계학술대회논문집
• /
• pp.969-974
• /
• 2004

Although guided-waves are very efficient for long-range nondestructive damage inspection, it is not easy to extract meaningful pulses of small magnitude out of noisy signals. The ultimate goal of this research is to develop an efficient signal processing technique for the current guided-wave technology. The specific contribution of this investigation towards achieving this goal, a two-stage Gabor pulse-based matching pursuit algorithm is proposed : rough approximations with a set for predetermined parameters characterizing the Gabor pulse and fine adjustments of the parameters by optimization. The parameters estimated from the measured signal are then used to assess not only the location but also the size of a crack existing in a rod. To validate the effectiveness of the proposed method, the longitudinal wave-based damage detection in rods is considered. To estimate the crack size, Love's theory for the dispersion of longitudinal waves is employed.

• 제어로봇시스템학회논문지
• /
• 제20권4호
• /
• pp.449-455
• /
• 2014

This paper presents a method for developing a TM (Traversability Map) from a DTM (Digital Terrain Model) collected by remote sensors of autonomous mobile robots. Such a map can be used to plan traversable paths and estimate navigation speed quantitatively in real time for robots capable of performing autonomous tasks over rough terrain environments. The proposed method consists of three parts: a DTM partition module which divides the DTM into equally spaced patches, a terrain information module which extracts the slope and roughness of the partitioned patches using the curve fitting and the fractal-based triangular prism method, and a traversability analysis module which assesses traversability incorporating with extracted terrain information and fuzzy inference to construct a TM. The potential of the proposed method is validated via simulation works over a set of fractal DTMs.

• Bioinformatics and Biosystems
• /
• 제2권2호
• /
• pp.52-57
• /
• 2007

The computational discovery of transcription factor binding site is one of the important tools in the genetic and genomic analysis. Rough prediction of gene regulation network and finding possible co-regulated genes are typical applications of the technique. Countless motif-discovery algorithms have been proposed for the past years. However, there is no dominant algorithm yet. Each algorithm does not give enough accuracy without extensive information. In this paper, we explore the possibility of combining multiple algorithms for the one integrated result in order to improve the performance and the convenience of researchers. Moreover, we apply new high order information that is reorganized from the set of basis predictions to the final prediction.

• 한국주조공학회지
• /
• 제9권5호
• /
• pp.403-412
• /
• 1989

This study has been carried out to investigate into the properties of molding sands containing various core sands, $CO_2$, Shell, Furan, Pep Set and Cold Box, in the system sands using domestic active bentonite. The properties of system sands with 5% bentonite and 3% moistures containing baked core sands and no-baked core sands were varied by the ratio of core sands. The system sand containing no-baked core sands had been the poor bonding force and rough grain surface than those of the baked core sands. The L. O. I of system sand containing 30% organic binders core sands were more than inorganic binders core sands. It has been found that the no-baked core sands were necessary have to reclaim for using molding sand.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• pp.307-310
• /
• 2000

소프트웨어의 측정값에 근거하여 소프트웨어 품질에 관한 의사결정을 할 때, 동치관계의 요구조건인 추이적(transitive) 특성이 항상 만족되는 것은 아니다. 순환수(cyclomatic number)가 거의 비슷한 프로그램에서, 하나는 "구조적인" 프로그램 범주에 속하고 또 다른 하나는 비구조적인 프로그램 범주에 속한다고 명확히 분류 할 수 있는가하는 점이다. 따라서, 본 연구에서는 동치관계보다는 허용적 관계를 만족하는 허용적 러프집합에 근거한 소프트웨어 분류 기준 제시하고자 한다. 분류기준을 생성하기 위한 실험 데이터 집합을 수집하고, 집합 내의 각 원소에 관한 허용적 클래스들을 생성한 후, 각 허용적 클래스들의 중심값을 클러스터링하여 분류기준을 생성한다. 생성된 분류기준을 또 다른 실험 집합에 적용하여 비교 분석하여 생성된 분류기준이 타당함을 보여준다.

• Communications for Statistical Applications and Methods
• /
• 제27권2호
• /
• pp.255-268
• /
• 2020

A mixture of multivariate canonical fundamental skew t-distribution (CFUST) has been of interest in various fields. In particular, interest in the unsupervised learning society is noteworthy. However, fitting the model via EM algorithm suffers from significant processing time. The main cause is due to the calculation of many multivariate t-cdfs (cumulative distribution functions) in E-step. In this article, we provide an approximate, but fast calculation method for the in univariate fashion, which is the product of successively conditional univariate t-cdfs with Taylor's first order approximation. By replacing all multivariate t-cdfs in E-step with the proposed approximate versions, we obtain the admissible results of fitting the model, where it gives 85% reduction time for the 5 dimensional skewness case of the Australian Institution Sport data set. For this approach, discussions about rough properties, advantages and limits are also presented.