• Title/Summary/Keyword: 속도 결정 알고리즘

Search Result 501, Processing Time 0.029 seconds

Filtering & Cridding Algorithms for Multibeam Echo Sounder Data based on Bathymetry (수심에 기반한 멀티빔 음향 측심 필터와 격자 대표값 선정 알고리즘)

  • 박요섭;김학일
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.11a
    • /
    • pp.260-265
    • /
    • 1999
  • 멀티빔 음향측심기(Multibeam Echo Sounder)는 기존의 단빔 음향측심기(Singlebeam Echo Sounder)와 달리 탐사선 진행방향의 수직(Crosstrack)으로 해저면을 주사(Swath)하여, 한 번의 송수신(Ping)으로 다중의 빔 자료 - 수심, 후방산란된 음압(Backscattered Amplitude), 사이드 스캔 소나(Side Scan Sonar) 자료 - 를 취득하는 장비이다. 멀티빔 음향 측심기를 이용한 해저면 탐사의 경우, 수심이 변함에 따라 주사폭(Swath width)이 변화하고, 각 빔의 수평 해상도(Footprint)는 수심과 더불어 빔폭(Beam width)에 의하여 동적으로 변화한다. 멀티빔 음향 측심기는 해저면을 전역탐사 할 수 있을 뿐만 아니라, 연속된 음향 탐사를 통하여 이웃한 핑 사이에 발생하는 전방중첩영역(Endlap)과 이웃 측선(Trackline)을 따라 겹쳐지는 측방중첩영역(Sidelap)의 자료들을 이용하여 멀티 뎀 자료들의 전반적인 정확도 및 신뢰도를 평가할 수 있다. 본 논문은 수로 측량(Hydrographic Survey)에서 사용되는 멀티빔 음향 측심기를 운영하여 얻어진 측심 자료를 처리하는 알고리즘 개발에 관한 연구이다. 본 논문에서는 L3사의 Sea Beam 2100 벌티빔 음향 측심기를 대상으로, 멀티빔의 측심 원리와 해저 지형에 대한 일반적 이해를 통하여 획득된 측심 자료의 통계적 특성을 파악하고, 오측심된 수심 자료를 제거하는 방법을 제안하며, 측심 구간의 대표격자 크기를 결정하는 기준을 제시한다. 또한, 항공원격탐사에서 고도 추정시 사용되고 있는, 평균보간법, 가중평균 보간법과, 본 논문에서 제안하는 격자 대표값 선정 알고리즘(Gridding Algorithms)의 결과를 비교하고, 최종적으로 얻어지는 해저 수치지형모델(DEM, Digital Elevation Model)과 후방산란 영상을 제시한다. 빠른 한지형잔디들이 지표면을 피복하도록 하고 여름의 고온기와 장마시기에는 뿌리전단력이 우수한 이러한 초종들로 지표면이 피복되도록 하는 것이 이상적이라 생각된다. 4. 혼파처리간의 토사유출량을 비교한 결과 토사 유출 억제효과는 한지형과 나지형잔디들의 혼합형(MixtureIII)과 자생처리구(MixtureV), Italian ryegrass와 자생식물의 혼합형(MixtureIV)등에서 비교적 낮은 수치를 토사유출량을 기록하였다. 이러한 결과는 자생식물들이 비록 초기생육속도는 외래도입초종에 떨어지지만 토사유출의 억제효과면에서는 이들 외래초종에 필적할 수 있음을 나타낸다고 할 수 있겠다.중량이 약 115kg/$m^2$정도로 나타났다.소 들(환경의 의미, 사람의 목적과 지식)보다 미학적 경험에 주는 영향이 큰 것으로 나타났으며, 모든 사람들에게 비슷한 미학적 경험을 발생시키는 것 이 밝혀졌다. 다시 말하면 모든 사람들은 그들의 문화적인 국적과 사회적 인 직업의 차이, 목적의 차이, 또한 환경의 의미의 차이에 상관없이 아름다 운 경관(High-beauty landscape)을 주거지나 나들이 장소로서 선호했으며, 아름답다고 평가했다. 반면에, 사람들이 갖고 있는 문화의 차이, 직업의 차 이, 목적의 차이, 그리고 환경의 의미의 차이에 따라 경관의 미학적 평가가 달라진 것으로 나타났다.corner$적 의도에 의한 경관구성의 일면을 확인할수 있지만 엄밀히 생각하여 보면 이러한 예의 경우도 최락의 총체적인 외형은 마찬가지로 $\ulcorner$순응$\lrcorner$의 범위를 벗어나지 않는다. 그렇기 때문에도 $\ulcorner$순응$\lrcorner$$\ulcorner$표현$\lrcorner$의 성격과 형태를 외형상으로 더욱이 공간상에서는 뚜렷하게 경계

  • PDF

전자부품의 냉각을 위한 자연대류 상관 관계식의 평가

  • 이재헌
    • Journal of the KSME
    • /
    • v.27 no.6
    • /
    • pp.504-514
    • /
    • 1987
  • 복잡한 전자부품의 조립시에 필요한 열적 디자인에 관한 정보는 오래전부터 실험을 통하여 얻어지고 있다. 실험적 데이터를 이용하여 무차원 파라미터로 표시된 실험결과는 꼭 같지는 않지만 현상적으로는 비슷한 상황에 응용될 수 있다. 여기서는 학술문헌에 나타나 있는 자연대류에 관한 실험적인 상관관계식들과 프레임에 수직으로 꽂혀있는 균일가열 전자회로기판의 모델에서 얻어진 무차원 자료들을 비교하고자 한다. 대부분의 자료들은 수정채널 Rayleigh수(Ra")가 15~100범위에 속하며, 이러한 범위는 부품이 조밀하게 배치된 기관이 서로 좁은 채널을 이루고 있으며, 동시에 상당한 전력을 소비하고 있는 경우에 해당한다. Wirt와 Stutzman, Bar-Cohen과 Rohsenow의 일반상관관계식은 AT'||'&'||'T Bell 연구소에서 개발된 전자기기를 이용하여 수집한 실험데이터를 잘 표현하고 있으며 10 < Ra" <1,000범위에서 추천될 수 있다. 두개의 유사한 상관관계식과 비교할 때 상당히 좋은 예측을 보였으며 또한 Sparrow와 Gregg의 연구결과와도 잘 일치하므로 Ra" < 10인 경우에 Aung의 완전발달층류의 채널유동방식, Ra" > 1,000인 경우에는 Aung등의 단일 수직평판 근사식이 추천될 수 있다. Coyne의 알고리즘에 의한 계산치는 10

  • PDF

Determining the number of Clusters in On-Line Document Clustering Algorithm (온라인 문서 군집화에서 군집 수 결정 방법)

  • Jee, Tae-Chang;Lee, Hyun-Jin;Lee, Yill-Byung
    • The KIPS Transactions:PartB
    • /
    • v.14B no.7
    • /
    • pp.513-522
    • /
    • 2007
  • Clustering is to divide given data and automatically find out the hidden meanings in the data. It analyzes data, which are difficult for people to check in detail, and then, makes several clusters consisting of data with similar characteristics. On-Line Document Clustering System, which makes a group of similar documents by use of results of the search engine, is aimed to increase the convenience of information retrieval area. Document clustering is automatically done without human interference, and the number of clusters, which affect the result of clustering, should be decided automatically too. Also, the one of the characteristics of an on-line system is guarantying fast response time. This paper proposed a method of determining the number of clusters automatically by geometrical information. The proposed method composed of two stages. In the first stage, centers of clusters are projected on the low-dimensional plane, and in the second stage, clusters are combined by use of distance of centers of clusters in the low-dimensional plane. As a result of experimenting this method with real data, it was found that clustering performance became better and the response time is suitable to on-line circumstance.

Development of an Automatic 3D Coregistration Technique of Brain PET and MR Images (뇌 PET과 MR 영상의 자동화된 3차원적 합성기법 개발)

  • Lee, Jae-Sung;Kwark, Cheol-Eun;Lee, Dong-Soo;Chung, June-Key;Lee, Myung-Chul;Park, Kwang-Suk
    • The Korean Journal of Nuclear Medicine
    • /
    • v.32 no.5
    • /
    • pp.414-424
    • /
    • 1998
  • Purpose: Cross-modality coregistration of positron emission tomography (PET) and magnetic resonance imaging (MR) could enhance the clinical information. In this study we propose a refined technique to improve the robustness of registration, and to implement more realistic visualization of the coregistered images. Materials and Methods: Using the sinogram of PET emission scan, we extracted the robust head boundary and used boundary-enhanced PET to coregister PET with MR. The pixels having 10% of maximum pixel value were considered as the boundary of sinogram. Boundary pixel values were exchanged with maximum value of sinogram. One hundred eighty boundary points were extracted at intervals of about 2 degree using simple threshold method from each slice of MR images. Best affined transformation between the two point sets was performed using least square fitting which should minimize the sum of Euclidean distance between the point sets. We reduced calculation time using pre-defined distance map. Finally we developed an automatic coregistration program using this boundary detection and surface matching technique. We designed a new weighted normalization technique to display the coregistered PET and MR images simultaneously. Results: Using our newly developed method, robust extraction of head boundary was possible and spatial registration was successfully performed. Mean displacement error was less than 2.0 mm. In visualization of coregistered images using weighted normalization method, structures shown in MR image could be realistically represented. Conclusion: Our refined technique could practically enhance the performance of automated three dimensional coregistration.

  • PDF

Dynamic Traffic Assignment Using Genetic Algorithm (유전자 알고리즘을 이용한 동적통행배정에 관한 연구)

  • Park, Kyung-Chul;Park, Chang-Ho;Chon, Kyung-Soo;Rhee, Sung-Mo
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.8 no.1 s.15
    • /
    • pp.51-63
    • /
    • 2000
  • Dynamic traffic assignment(DTA) has been a topic of substantial research during the past decade. While DTA is gradually maturing, many aspects of DTA still need improvement, especially regarding its formulation and solution algerian Recently, with its promise for In(Intelligent Transportation System) and GIS(Geographic Information System) applications, DTA have received increasing attention. This potential also implies higher requirement for DTA modeling, especially regarding its solution efficiency for real-time implementation. But DTA have many mathematical difficulties in searching process due to the complexity of spatial and temporal variables. Although many solution algorithms have been studied, conventional methods cannot iud the solution in case that objective function or constraints is not convex. In this paper, the genetic algorithm to find the solution of DTA is applied and the Merchant-Nemhauser model is used as DTA model because it has a nonconvex constraint set. To handle the nonconvex constraint set the GENOCOP III system which is a kind of the genetic algorithm is used in this study. Results for the sample network have been compared with the results of conventional method.

  • PDF

A Secure Digital Watermarking Scheme based on RSA Function (RSA 함수에 기반한 안전한 워터마킹 기법)

  • Lee, Jean-Ho;Kim, Tai-Yun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.3
    • /
    • pp.220-228
    • /
    • 2001
  • Digital watermarking is a technique for the purpose of protecting the ownership of the image by embedding invisible watermarks in a digital imnge. To guarantee the security of the digital watermarking scheme for copyright protection, it is required to satisfy some requirements robustness and perceptual invisibility which provided by the location of embedded bits, the public watermarking algorithm, and the hidden use of the key, which can protect unauthorized accesses from illegal users. For this, in this paper we propose a new copyright watermarking scheme, which is based on one-way hash functions using RSA functions and modular operations. RSA functions are widely used in cryptographic systems. Our watermarking scheme is robust against LSB(Jeast significant bit) attacks and gamma corresction attack, and is also perceptually invisible. We demonstrate the characteristics of our proposed watermarking scheme through experiments.

  • PDF

A Study on Efficiency Improvement of the Catenary-Pantograph Dynamic Interaction Analysis Program using Shift Forward Method (Shift Forward 방법을 이용한 가선계-판토그래프 동적 상호작용 해석 프로그램의 효율성 향상에 관한 연구)

  • Lee, Jin-Hee;Park, Tae-Won
    • Journal of the Korean Society for Railway
    • /
    • v.15 no.6
    • /
    • pp.572-578
    • /
    • 2012
  • In the electric railway vehicles, securing stable current collection performance is an important factor which determines the quality of operation and the maximum speed. In order to predict such current collection performance, various analysis methods have been proposed for a long time. Also, investigations for improving the accuracy of the results and the efficiency of the analysis process have been performed. In this paper, a method for the efficiency improvement has been proposed. This method is based on the basic concept that the system equations of motion of a catenary numerical model include only interactive range with a pantograph. In this paper, an algorithm and generalized process for applying proposed method are introduced. Also, validity of the results and utility of the method was verified and studied.

Performance Analysis of HDR-WPAN System with MIMO Techniques (MIMO 기법을 적용한 HDR-WPAN 시스템의 성능분석)

  • Han Deog-Su;Kang Chul-Gyu;Oh Chang-Heon;Cho Sung-Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.8
    • /
    • pp.1502-1509
    • /
    • 2006
  • In this paper, we proposed reliability and capacity enhancement methods for IEEE 802.15.3 HDR-WPAN (High Data Rate-Wireless Personal Area Network) system which is currently getting an interest in home network technology adopting a MIMO technique. We also analyzed performance or the proposed system through a computer simulation. The HDR-WPAN system using V-BLAST algorithm, transmitting the different signal vector to each other's sub-channel, can get the transmission speed of more than 110Mbps using two Tx/Px antenna without bandwidth expansion in TCM-64QAM mode. Also the proposed system has reliability of 104 at $E_b/N_0=35dB$ under the Rayleigh fading channel in case of two Tx/Rx antenna with MMSE algorithm. The HDR-WPAN system adopting V-BLAST method has its drawback which is very complicated to determine the decision-ordering at the receiver. But, the proposed system enhances the transmission capacity and reliability without extra bandwidth expansion by sending data streams to multiple antennas.

An Efficient Cluster Routing Protocol Based on 2-level Tree for Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 에너지 효율적인 2-level 트리 기반의 클러스터 라우팅 프로토콜)

  • Lee, Young Joon;Kim, Sung Chun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.5
    • /
    • pp.155-162
    • /
    • 2014
  • We proposed a 2 level tree based cluster based routing protocol for mobile ad hoc networks. it is our crucial goal to establish improved clustering's structure in order to extend average node life-time and elevate the average packet delivery ratio. Because of insufficient wireless resources and energy, the method to form and manage clusters is useful for increasing network stability. but cluster-head fulfills roles as a host and a router in clustering protocol of Ad hoc networks environment. Therefore energy exhaustion of cluster-head causes communication interruption phenomenon. Effective management of cluster-head is key-point which determines the entire network performance. The scheme focuses on improving the performance the life time of the network and throughput through the management of cluster-heads and its neighbor nodes. In simulation, we demonstrated that it would obtain averagely better 17% performance than LS2RP.

A Study on Smart Real-time Atmospheric Dispersion System (지능형 실시간 대기확산 시스템에 관한 연구)

  • Oh, Jeong-Seok;Hyun, Ji-I;Bang, Hyo-Jung
    • Journal of the Korean Institute of Gas
    • /
    • v.16 no.4
    • /
    • pp.44-51
    • /
    • 2012
  • It is more important to realize safety management, medium-large accident prevention and risk prediction as accident of industry facilities can generate enormous physical and human damage because most energy plant might handle toxic substance. Especially, atmospheric dispersion system, which is able to simulate situation, have been used for release accident of toxic substance since the accident can show different of dispersion range and velocity according to release material, storage facility and atmospheric status. However those systems have been used generally in design step of industry facility and are difficult to deal with release accident quickly. Although some researches and cases have been studied for using real-time atmospheric information, there are insufficient system for processing quickly release accident. This paper aims to develop real-time smart atmospheric dispersion system that can deal with release accident quickly by enhancing distinct characteristics and efficiency of energy plant, and select release time and area using intelligent algorithm as accident prevention type.