• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.11b
• /
• pp.99-104
• /
• 1999

영상을 획득하는 과정에 있어, 영상획득 장치 또는 피사체의 흔들림으로 인해 발생되는 움직임 열화(motion-blur)현상은 영상의 선명도를 크게 떨어뜨리는 주된 원인이 된다. 손상된 영상은 그 영상자체로부터 움직임의 각도와 길이를 추출 함으로서 복원될 수 있다. 본 논문에서는 움직임 열화의 각도와 길이를 추정하기 위한 방법 중, 본 저자가 제안 했던 극점자취방법에, 확률적인 개념을 적용한 새로운 확률적 극점자취 방법을 소개한다. 기존의 방법은 신호지배영역이 올바로 지정되지 않았을 경우, 오차를 수반하기도 한다. 이러한 문제를 해결 하기 위해, 본 연구에서는 maximum likelihood(ML) 분류방법을 이용해 적절하지 않은 극점자취점의 영향을 선택적으로 작게 하여, 신호지배 영역의 설정 없이, 저주파 영역에서의 올른 극점자취의 검출이 가능하도록 하였다. 또한, Auto-regressive(Ah) 모델을 이용한 선형예측방법을 통해 극점 검출과정에서 불규칙하게 발생하는 특이점들이 극점으로 검출되지 못하도록 하여, 정밀한 움직임 방향의 추정이 가능하게 하였다. 또한, 움직임 길이의 검출에 있어서는, 노이즈에 의해 영향을 무시할 수 없는 기존의 영점교차점 방법을 보완한, 새로운 이동평균최소(MALM)법을 정의하였다 이 방법은 움직임 열화가 발생한 영상의 주파수 영역단면 패턴을 이용한 것으로서, 2차원적인 sinc함수를 1차원적인 표현으로 바꾸어주는 이동평균함수를 사용하여, 쉽게 부극점(sub-peak point)을 찾을 수 있도록 한다 부극점 또한 노이즈에 의한 영향을 받지 않고, 이동평균최소법 자체에 노이즈를 제거하는 과정에 포함되어있으므로. 이 방법을 사용하게 되면, 심한 노이즈 환경에서도 적절한 움직임의 길이 값을검출할 수 있다. 이렇게 얻어진 길이와 방향의 파라메터를 이용하여, 실제 실험에 사용된 손상되어진 영상을 효과적으로 복원할 수 있었다.>$\bigcirc$ 펄라이트 : 합섬A(비스코스+레이온)급액천의 유입은 소(1$\times$60cm)에서 21.8ml, 중(2$\times$60cm) 33.5ml, 대(3$\times$60cm) 43.4ml가 통과되었고 합섬(폴리에스텔)에서는 19.0~30.7ml로서 급액천의 규격에 따라 통과되는 차이가 있었다. 배지가 규격화되어 있어 급액천의 규격별로 일정하게 유입되었으며 급액천의 재질이 유입에 영향을 미친 것으로 사료되었다. (2) 급액관과 베드상과의 높이에 따른 유출양 : 급액과 베드상과의 낙차가 클수록 유출이 증가함을 알수 있었으나 합섬C(인견)실험구에서는 낙차가 유출에 영향을 미치지 않았다. (4) 급액된 양액의 EC 및 pH조사 : 급액된 양액의 EC 및 pH에 전혀 변화가 없어 재배 적응에 문제가 없을것으로 사료되었다.이가 가장 이상적인 것으로 생각된다.세포수에 대한 내부세포괴세포(ICM/total cells)가 20~40% 범주에 드는 비율은 처리구가 대조구보다 낮은 결과를 나타냈다. 결론적으로 돼지난포란을 이용하여 체외성숙을 유기할 때 효과적인 cysteamine의 농도는 50$\mu$M이 적당하며, 초기배발달을 유기할 때의 효과적인 cysteamine의 농도는 25~50$\mu$M인 것으로 판단된다.N)A(N)/N을 제시하였다(A(N)=N에 대한 A값). 위의 실험식을 사용하여 헝가리산 Zempleni 시료(15%$S_{XRD}$)의 기본입자분포로부터 %$S_{XRD}$를 계산한 결과, 16%$S_{XRD}$의 결과값을 얻을 수 있었다. 따라서, 본 연구에서 도출한 관계식들이 유효함을 확인할 수 있었다.계식들이 유효함을 확인할 수 있었다.할 때 약간의 증가를 나타냈다.". And

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.277-284
• /
• 2007

The routing algorithm many used in the wireless sensor network features the clustering method to reduce the amount of data transmission from the energy efficiency perspective. However, the clustering method results in high energy consumption at the cluster head node. Dynamic clustering is a method used to resolve such a problem by distributing energy consumption through the re-selection of the cluster head node. Still, dynamic clustering modifies the cluster structure every time the cluster head node is re-selected, which causes energy consumption. In other words, the dynamic clustering approaches examined in previous studies involve the repetitive processes of cluster head node selection. This consumes a high amount of energy during the set-up process of cluster generation. In order to resolve the energy consumption problem associated with the repetitive set-up, this paper proposes the Round-Robin Cluster Header (RRCH) method that fixes the cluster and selects the head node in a round-robin method The RRCH approach is an energy-efficient method that realizes consistent and balanced energy consumption in each node of a generated cluster to prevent repetitious set-up processes as in the LEACH method. The propriety of the proposed method is substantiated with a simulation experiment.

• The KIPS Transactions:PartA
• /
• v.12A no.1 s.91
• /
• pp.41-52
• /
• 2005

Memory reference instruction caused by cache miss is the critical factor that limits the processing power of processor. Cache prefetching technique is an effective way to reduce the latency due to memory access. However, excessively aggressive prefetch leads to cache pollution and finally to cancel out the advantage of prefetch. In this study, an active prefetch filtering scheme is introduced which dynamically decides whether to commence prefetching after referring a filtering table to reduce the cache pollution due to unnecessary prefetches. For the precision filtering, an evicted address referencing scheme has been proposed where the filter directly compares the current prefetch address with previous unnecessary prefetch addresses stored in filtering table. Moreover, a small sized exclusive prefetch cache has been introduced to increase the amount of eviction of unnecessarily prefetched addresses to enhance the accuracy of dynamic filtering. The exclusive prefetch cache also prevents useful demand data from being pushed out by prefetched data, while the evicted address direct referencing scheme enables the prefetch cache to keep most of useful prefetch data within its small size. Experimental results from commonly used general and multimedia benchmarks show that the average cache miss ratio has been decreased by $13.3{\%}$ by virtue of enhanced filtering accuracy compared with conventional schemes.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.45-52
• /
• 2006

To perform on-line maintenance for Distributed Information System, it is indispensable to disseminate files to participant nodes in the network. When users' requests for file deployment occur simultaneously in a short period a deployment server falls into overload phase, which is often called Flash Crowds. h common solution to avoid Flash Crowds is to increase hardware capacity. In this paper, we propose a software solution based on P2P, which does not cost any additional expense. In the proposed solution, nodes in the network are grouped into subnetworks one of which is composed of only neighboring nodes. In each subnetwork, copies of deployment files can be transferred to each other. Consequently, it brings about the effect of load balancing in deployment server. To raise the effectiveness, target files for deployment are packed into one package. Before being transferred, each package is divided into multiple equal-sized segments. A deployment server in a normal phase transmits a package requested from nodes in segment units. However a deployment server is overloaded, if segments already exist in the subnetwork participant nodes in the subnetwork receive necessary segments from neighboring nodes. In this paper, we propose data structures and algorithm for this approach and show performance improvement through simulation.

• Progress in Medical Physics
• /
• v.15 no.2
• /
• pp.84-93
• /
• 2004

Stereotactic radiosurgery (SRS) is a technique that delivers a high dose to a target legion and a low dose to a critical organ through only one or a few irradiations. For this purpose, many mathematical methods for optimization have been proposed. There are some limitations to using these methods: the long calculation time and difficulty in finding a unique solution due to different tumor shapes. In this study, many clinical target shapes were examined to find a typical pattern of tumor shapes from which some possible ideal geometrical shapes, such as spheres, cylinders, cones or a combination, are assumed to approximate real tumor shapes. Using the arrangement of multiple isocenters, optimum variables, such as isocenter positions or collimator size, were determined. A database was formed from these results. The optimization procedure consisted of the following steps: Any shape of tumor was first assumed to an ideal model through a geometry comparison algorithm, then optimum variables for ideal geometry chosen from the predetermined database, followed by a final adjustment of the optimum parameters using the real tumor shape. Although the result of applying the database to other patients was not superior to the result of optimization in each case, it can be acceptable as a plan starling point.

• The Journal of Engineering Geology
• /
• v.25 no.1
• /
• pp.67-81
• /
• 2015

A FORTRAN program was developed to determine the optimal locations of multiple recharge wells in an aquifer with different arrangements of pumping wells. The simulated annealing algorithm was used to find optimal locations of two recharge wells which satisfied three objective functions. The model results show that locating two injection wells inside the cluster of pumping wells is efficient if the recovery rate only was taken into account. In contrast, placing injection wells to the side of the cluster is desirable if the simulation considers aggregate objective function. Therefore, installing an injection well on each side of the cluster seems to yield the maximum recovery rates for the existing pumping wells, and it yields similar increases in pumping rate for all wells in the cluster. The locations of recharge wells can be arranged in numerous configurations, because there are multiple near-optimal local minima or maxima. These results indicate that the simulated annealing can yield effective evaluations of the optimal locations of multiple recharge wells. In addition, the suggested aggregate objective function can be utilized as an appropriate multi-objective optimization.

• Journal of the Korean Society for information Management
• /
• v.35 no.3
• /
• pp.77-100
• /
• 2018

The objectives of this study is to present a discovering process of interdisciplinary convergence technology using text mining of big data. For the convergence research of biotechnology(BT) and information communications technology (ICT), the following processes were performed. (1) Collecting sufficient meta data of research articles based on BT terminology list. (2) Generating intellectual structure of emerging technologies by using a Pathfinder network scaling algorithm. (3) Analyzing contents with topic modeling. Next three steps were also used to derive items of BT-ICT convergence technology. (4) Expanding BT terminology list into superior concepts of technology to obtain ICT-related information from BT. (5) Automatically collecting meta data of research articles of two fields by using OpenAPI service. (6) Analyzing contents of BT-ICT topic models. Our study proclaims the following findings. Firstly, terminology list can be an important knowledge base for discovering convergence technologies. Secondly, the analysis of a large quantity of literature requires text mining that facilitates the analysis by reducing the dimension of the data. The methodology we suggest here to process and analyze data is efficient to discover technologies with high possibility of interdisciplinary convergence.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.6
• /
• pp.1610-1619
• /
• 1998

The ABR service class provides feedback based traffic control to transport bursty data traffic efficiently. Feedback based congestion control has first been studied to be applied to unicast connections. Recently. several congestion control algorithms for multicast connections have also been proposed as the number of ABR applications requiring multicast increases. With feedback based congestion control, the effectiveness of a traffic control scheme diminishes as propagation delay increases. Especially for a multicast connection, a remote destination may suffer unfair service compared to a local destination due to the delayed feedback. Amelioration of the disadvantages caused by feedback delay is therefore more important for remote destinations in multicast connections. This paper proposes a new switch behavior to provide effective feedback based mathc control for rentoh destinations. The proposed switches adjust the service rate dynamically in accordance woth the state of the downstream, that is, the congestion of the destinaion is immediately controlled by the nearest apstream switch before the source to ramp down the transmission rate of the connection. The proposed switch has an implementation overhead to have a separate buffer for each VC to adjust the service rate in accordance with a backward Rm cell of each VC. The buffer requirement id also increased at intermediate switches. Simulation results show that the proposed switch reduces the cell loss rate in both the local and the remote destinations and slso amelioratd the between the two destinations.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2001.09a
• /
• pp.164-167
• /
• 2001

본 연구에서는 포항제철소에서 제철부산물로 발생되는 제강분진을 전처리 없이 산화촉매로 사용하여 김포 수도권 매립지의 침출수 처리공정에서 펜톤산화조에 유입되는 원수를 대상으 로 과산화수소를 이용한 연속식 산화처리 실험을 수행하였다. 먼저 회분식 실험결과를 바탕 으로 최적 반응조건에서 lab-scale 연속식 기초반응실험과 자체 설계.제작한 연속산화공정에서의 처리실험을 수행하였다. 또한 기존의 펜톤산화공정에서 Fe 공급원으로 사용되고 있는 FeSO$_4$.7($H_2O$)와의 반응성 비교실험도 수행하였다. 반응기간동안 일정 pH를 유지하기 위해 pH controller를 사용하였으며 침출수 수질은 CODcr로 나타내었다. 반응 pH 3.5, 체류시간 1 hr, 과산화수소 주입량 1,500mg/1에서 제강분진과 FeSO$_4$.7($H_2O$)를 각각 주입하여 수행한 연속처리 기초실험에서는 제강분진을 산화반응촉매로 사용한 경우에 침출수CODcr 처리율 62%, 과산화수소의 분해율 52%를 나타내었다. FeSO$_4$.7($H_2O$)를 산화반응 촉매로 사용한 경우에는 약 65-70%정도의 다소 높은 처리효율을 나타낸 반면에 과산화수소의 소비량은 제강분진의 경우보다 약 20%이상의 높은 값을 나타내었다. 연속산화공정 실험에서는 운전 3시간 이후에 유출수 중의 CODcr과 $H_2O$$_2$의 농도가 안정된 값을 나타내었다. 이 때 산화 반응조의 침출수 CODcr 제거효율은 약 43%이었으며, 처리수의 농도는 현재의 침출수 방류기준 이하로 나타났다. 결론적으로 침출수의 연속식 산화처리 실험결과, 처리효율과 경제성에서 제강분진의 산화촉매활용 공정의 개발 가능성이 매우 높은 것으로 나타났다.ell에 의해 완전분해 되었으며, 함께 존재시 TC는 Fe$^{\circ}$만으로는 분해가 되지 않았지만 cell에 의해 완전분해 되었으며, 함께 존재시 TCE분해에 저해작용을 미치는 것으로 나타났다.술의 첨가가 요구되고 있다. 따라서, 산성광산배수 오염지대에 대해 획일적으로 같은 처리방법을 채택하여 사용하는 것보다 각 지역 또는 광산산성폐수가 유출되어 나오는 광산폐기물의 특성 등을 고려하여 거기에 맞는 기술들을 복합적으로 또는 단독으로 사용하되 처리방법 채택 시 신중을 기할 것이 요망된다.정시에는 SeaWiFS 위성과 관련된 global algorithms 중에서 490nm와 555nm의 복합밴드를 포함하는 OC2 알고리즘(ocean color chlorophyll 2 algorithm)을 사용하는 것이 OC2 series 및 OC4 알고리즘보다 좋은 추정 값을 도출할 수 있을 것으로 기대된다.환경에서는 5일에서 7월에 주로 이 충체의 유충이 발육되고 전파되는 것으로 추측되었다.러 가지 방법들을 적극 적용하여 금후 검토해볼 필요가 있을 것이다.잡은 전혀 삭과가 형성되지 않았다. 이 결과는 종간 교잡종을 자방친으로 하고 그 자방친의 화분친을 사용할 때만 교잡이 이루어지고 있음을 나타내고 있다. 따라서 여교잡을 통한 종간잡종 품종육성 활용방안을 금후 적극 확대 검토해야 할 것이다하였다.함을 보이고 있다.X> , ZnCl$_{3}$$^{-}$같은 이온과 MgCl$^{+}$, MgCl$_{2}$같은 이온종을 형성하기 때문인것 같다. 한편 어떠한 용리액에서던지 NH$_{4}$$^{+}$의 경우 Dv값이 제일 작았다. 바. 본 연구의 목적중의 하나인 인체유해 중금속이온인 Hg(II), Cd(II)등이 NaCl같은 염화물

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.23-35
• /
• 2013

This paper proposes an effective technique that is used to automatically extract feature vectors from vibration signals for fault classification systems. Conventional mel-frequency cepstral coefficients (MFCCs) are sensitive to noise of vibration signals, degrading classification accuracy. To solve this problem, this paper proposes spectral envelope cepstral coefficients (SECC) analysis, where a 4-step filter bank based on spectral envelopes of vibration signals is used: (1) a linear predictive coding (LPC) algorithm is used to specify spectral envelopes of all faulty vibration signals, (2) all envelopes are averaged to get general spectral shape, (3) a gradient descent method is used to find extremes of the average envelope and its frequencies, (4) a non-overlapped filter is used to have centers calculated from distances between valley frequencies of the envelope. This 4-step filter bank is then used in cepstral coefficients computation to extract feature vectors. Finally, a multi-layer support vector machine (MLSVM) with various sigma values uses these special parameters to identify faulty types of induction motors. Experimental results indicate that the proposed extraction method outperforms other feature extraction algorithms, yielding more than about 99.65% of classification accuracy.