• Journal of the Korean Society of Industry Convergence
• /
• v.21 no.1
• /
• pp.29-36
• /
• 2018

Low pressure casting process for unidirectional carbon fiber reinforced aluminum (UD-CF/Al) composites which is an infiltration route of molten Al into porous UD-CF preform has been a cost-effective way to obtain metal matrix composites (MMCs) but, easy to cause non-uniform fiber distribution as CF clustering. Such clustered CFs have been a problem to decrease the density and thermal conductivity (TC) of composites, due to the existence of pores in the clustered area. To obtain high thermal performance composites for heat-sink application, the relationship between fiber distribution and porosity has to be clearly investigated. In this study, the CF distribution was evaluated with quantification approach by using two-dimensional spatial distribution method as local number 2-dimension (LN2D) analysis. Note that the CFs distribution in composites sensitively changed by sizes of Cu bridging particles between the CFs added in the UD-CF preform fabrication stage, and influenced on only $LN2D_{var}$ values.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2504-2526
• /
• 2016

Wireless sensors are always deployed in brutal environments, but as we know, the nodes are powered only by non-replaceable batteries with limited energy. Sending, receiving and transporting information require the supply of energy. The essential problem of wireless sensor network (WSN) is to save energy consumption and prolong network lifetime. This paper presents a new communication protocol for WSN called Dynamical Threshold Control Algorithm with three-parameter Particle Swarm Optimization and Ant Colony Optimization based on residual energy (DPA). We first use the state of WSN to partition the region adaptively. Moreover, a three-parameter of particle swarm optimization (PSO) algorithm is proposed and a new fitness function is obtained. The optimal path among the CHs and Base Station (BS) is obtained by the ant colony optimization (ACO) algorithm based on residual energy. Dynamical threshold control algorithm (DTCA) is introduced when we re-select the CHs. Compared to the results obtained by using APSO, ANT and I-LEACH protocols, our DPA protocol tremendously prolongs the lifecycle of network. We observe 48.3%, 43.0%, and 24.9% more percentages of rounds respectively performed by DPA over APSO, ANT and I-LEACH.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.620-622
• /
• 2004

Mobility of an indoor wheeled robot is affected by adhesion force that is related to various floor conditions. When the adhesion force between driving wheels and the floor decreases suddenly, the robot has a slip state. In order to overcome this slip problem, optimal slip velocity must be decided for stable movement of wheeled robot. First of all, this paper shows that conventional PI control can not be applied to a wheeled robot of the light weigh. Secondly, reposed fuzzy logic applied by the Takagi-Sugeno model for the configuration of fuzzy sets. For the design of Takaki-Sugeno model and fuzzy rule, proposed algorithm uses FCM(Fuzzy c-mean clustering method) algorithm. In additionally, this algorithm controls recovered driving torque for the restrain the re-slip. The proposed fuzzy logic controller(FLC) is pretty useful with prevention of the slip phenomena through that compare fuzzy with PI control for the controller performance in the re-adhesion control strategy. These procedures are implemented using a Pioneer 2-DXE wheeled robot parameter.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.698-701
• /
• 2005

This paper examines that is extracted certain information in forest areas within high resolution imagery based on wavelet transformation. First of all, study areas are selected one more species distributed spots refer to forest type map. Next, study area is cut 256 x 256 pixels size because of image processing problem in large volume data. Prior to wavelet transformation, five texture parameters (contrast, dissimilarity, entropy, homogeneity, Angular Second Moment (ASM≫ calculated by using Gray Level Co-occurrence Matrix (GLCM). Five texture images are set that shifting window size is 3x3, distance .is 1 pixel, and angle is 45 degrees used. Wavelet function is selected Daubechies 4 wavelet basis functions. Result is summarized 3 points; First, Wavelet transformation images derived from contrast, dissimilarity (texture parameters) have on effect on edge elements detection and will have probability used forest road detection. Second, Wavelet fusion images derived from texture parameters and original image can apply to forest area classification because of clustering in Homogeneous forest type structure. Third, for grading evaluation in forest fire damaged area, if data fusion of established classification method, GLCM texture extraction concept and wavelet transformation technique effectively applied forest areas (also other areas), will obtain high accuracy result.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.116-119
• /
• 2005

As to the synthetical estimation of land covering parameters or the compounded land covering classification for multi-resolution satellite data, former researches mainly adopted linear or nonlinear regression models to describe the regression relationship of land covering parameters caused by the degradation of spatial resolution, in order to improve the retrieval accuracy of global land covering parameters based on 1;he lower resolution satellite data. However, these methods can't authentically represent the complementary characteristics of spatial resolutions among different satellite data at arithmetic level. To resolve the problem above, a new compounded land covering classification method at arithmetic level for multi-resolution satellite data is proposed in this .paper. Firstly, on the basis of unsupervised clustering analysis of the higher resolution satellite data, the likelihood distribution scatterplot of each cover type is obtained according to multiple-to-single spatial correspondence between the higher and lower resolution satellite data in some local test regions, then Parzen window approach is adopted to derive the real likelihood functions from the scatterplots, and finally the likelihood functions are extended from the local test regions to the full covering area of the lower resolution satellite data and the global covering area of the lower resolution satellite is classified under the maximum likelihood rule. Some experimental results indicate that this proposed compounded method can improve the classification accuracy of large-scale lower resolution satellite data with the support of some local-area higher resolution satellite data.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.278-282
• /
• 2001

The discovery of tacit knowledge from domain experts is one of the most exciting challenges in today\`s knowledge management. The nature of decision knowledge in determining the quality a firm\`s short-term liquidity is full of abstraction, ambiguity, and incompleteness, and presents a typical tacit knowledge extraction problem. In dealing with knowledge discovery of this nature, we propose a scheme that integrates both knowledge elicitation and knowledge discovery in the knowledge engineering processes. The knowledge elicitation component applies the Verbal Protocol Analysis to establish industrial cases as the basic knowledge data set. The knowledge discovery component then applies fuzzy clustering to the data set to build a fuzzy knowledge based system, which consists of a set of fuzzy rules representing the decision knowledge, and membership functions of each decision factor for verifying linguistic expression in the rules. The experimental results confirm that the proposed scheme can effectively discover the expert\`s tacit knowledge, and works as a feedback mechanism for human experts to fine-tune the conversion processes of converting tacit knowledge into implicit knowledge.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.38-57
• /
• 2016

Service discovery is one of the major challenges in cloud computing environment with a large number of service providers and heterogeneous services. Non-uniform naming conventions, varied types and features of services make cloud service discovery a grueling problem. With the proliferation of cloud services, it has been laborious to find services, especially from Internet-based service repositories. To address this issue, services are crawled and clustered according to their similarity. The clustered services are maintained as a catalogue in which the data published on the cloud provider's website are stored in a standard format. As there is no standard specification and a description language for cloud services, new efficient and intelligent mechanisms to discover cloud services are strongly required and desired. This paper also proposes a key-value representation to describe cloud services in a formal way and to facilitate matching between offered services and demand. Since naïve users prefer to have a query in natural language, semantic approaches are used to close the gap between the ambiguous user requirements and the service specifications. Experimental evaluation measured in terms of precision and recall of retrieved services shows that the proposed approach outperforms existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.272-287
• /
• 2016

Recently, various and effective contrast based salient object detection models to focus on a single target have been proposed. However, there is a lack of research on detection of multiple objects, and also it is a more challenging task than single target process. In the multiple target problem, we are confronted by new difficulties caused by distinct difference between properties of objects. The characteristic of existing models depending on the global maximum distribution of data point would become a drawback for detection of multiple objects. In this paper, by analyzing limitations of the existing methods, we have devised three main processes to detect multiple salient objects. In the first stage, regional features are extracted from over-segmented regions. In the second stage, the regional features are categorized into homogeneous cluster using the mean-shift algorithm with the kernel function having various sizes. In the final stage, we compute saliency scores of the categorized regions using only spatial features without the contrast features, and then all scores are integrated for the final salient regions. In the experimental results, the scheme achieved superior detection accuracy for the SED2 and MSRA-ASD benchmarks with both a higher precision and better recall than state-of-the-art approaches. Especially, given multiple objects having different properties, our model significantly outperforms all existing models.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.240-245
• /
• 2008

컴퓨터 그래픽스에서 많은 광원들을 포함하는 장면을 사실적으로 렌더링하기 위해서는, 많은 양의 조명 계산을 수행해야 한다. 다수의 광원들로부터 빠르게 조명 계산을 하기 위해 많이 사용되는 기법 중에 몬테 카를로(Monte Carlo) 기법이 있다. 본 논문은 이러한 몬테 카를로(Monte Carlo) 기법을 기반으로, 다수의 광원들을 효과적으로 샘플링 할 수 있는 새로운 중요도 샘플링 기법을 제안한다. 제안된 기법의 두 가지 핵심 아이디어는 첫째, 장면 내에 다수의 광원이 존재하여도 어떤 특정 지역에 많은 영향을 주는 광원은 일부인 경우가 많다는 점이고 두 번째는 공간 일관성(spatial coherence)이 낮거나 그림자 경계 지역에 위치한 픽셀들은 영향을 받는 주요 광원이 서로 다르다는 점이다. 제안된 기법은 이러한 관찰에 착안하여 특정 지역에 광원이 기여하는 정도를 평가하고 이에 비례하게 확률 밀도 함수(PDF: Probability Density Function)를 결정하는 방법을 제안한다. 이를 위하여 이미지 공간상에서 픽셀들을 클러스터링(clustering)하고 클러스터 구조를 기반으로 대표 샘플을 선정한다. 선정된 대표 샘플들로부터 광원들의 기여도를 평가하고 이를 바탕으로 클러스터 단위의 확률 밀도 함수를 결정하여 최종 렌더링을 수행한다. 본 논문이 제안하는 샘플링 기법을 적용했을 때 전통적인 샘플링 방식과 비교하여 같은 샘플링 개수에서 노이즈(noise)가 적게 발생하는 좋은 화질을 얻을 수 있었다. 제안된 기법은 다수의 조명과 다양한 재질, 복잡한 가려짐이 존재하는 장면을 효과적으로 표현할 수 있다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.12
• /
• pp.7302-7308
• /
• 2014

Detecting target objects robustly in natural environments is a difficult problem in the computer vision and image processing areas. This paper suggests a method of robustly detecting target objects in the environments where reflection exists. The suggested algorithm first captures scenes with a stereo camera and extracts the line and corner features representing the target objects. This method then eliminates the reflected features among the extracted ones using a homographic transform. Subsequently, the method robustly detects the target objects by clustering only real features. The experimental results showed that the suggested algorithm effectively detects the target objects in reflection environments rather than existing algorithms.