• 제목/요약/키워드: Migration Algorithm

검색결과 133건 처리시간 0.029초

Extension of Range Migration Algorithm for Airborne SAR Data Processing

  • Shin, Hee-Sub;Song, Won-Gyu;Son, Jun-Won;Jung, Yong-Hwan;Lim, Jong-Tae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.857-860
    • /
    • 2005
  • Several algorithms have been developed for the data processing of spotlight synthetic aperture radar (SAR). In particular, the range migration algorithm (RMA) does not assume that illuminating wavefronts are planar. Also, a high resolution image can be obtained by the RMA. This paper introduces an extension of the original RMA to enable a more efficient airborne SAR data processing. We consider more general motion and scene than the original RMA. The presented formulation is analyzed by using the principle of the stationary phase. Finally, the extended algorithm is tested with numerical simulations using the pulsed spotlight SAR.

  • PDF

위성전자표지와 해양환경자료를 이용한 방어(Seriola quinqueradiata) 이동경로 추적 연구 (Tracking of Yellowtail Seriola quinqueradiata Migration Using Pop-up Satellite Archival Tag (PSAT) and Oceanic Environments Data)

  • 김창신;양지관;강수진;이승종;강수경
    • 한국수산과학회지
    • /
    • 제54권5호
    • /
    • pp.787-797
    • /
    • 2021
  • Yellowtail Seriola quinqueradiata tagged with a Pop-up Satellite Archival Tag (PSAT) was released off the coast of near the Moseulpo, Jeju Island and the ecological data during about 40 days was obtained. However, it is difficult to determine the spatial location of underwater ecological data. To improve the accuracy of estimating the Yellowtail migration route using temperature, suitable background field of the oceanic environment data was evaluated and used for input data. After developing of the tracking algorithm for migration route estimation, three experiment cases were estimated with ecological data among the surface layer, the mixed layer, and the whole water column. All tracking experiments move from western to eastern Jeju Island. Additionally, tracking experiment using 3D ocean numerical model reveal that it is possible to estimate the migration route using the fish ecological data of the entire water column. Therefore, using a large number of ecological data and a high-accuracy ocean numerical model to estimate the migration route seems to be a way to increase the accuracy of the tracking experiment. Moreover, the tracking algorithm of this study can be applied to small pelagic fishery using small archival electronic tags to track the migration route.

GPU를 이용한 이방성 탄성 거꿀 참반사 보정의 계산가속 (Acceleration of Anisotropic Elastic Reverse-time Migration with GPUs)

  • 최형욱;설순지;변중무
    • 지구물리와물리탐사
    • /
    • 제18권2호
    • /
    • pp.74-84
    • /
    • 2015
  • 탄성 거꿀 참반사 보정(elastic reverse-time migration)을 통해 물리적으로 의미가 있는 영상을 얻기 위해서는 탄성 파동방정식(elastic wave equation)을 통해 재구성된 벡터 파동장(reconstructed vector wavefield)으로부터 P파와 S파를 분리하는 파분리 알고리듬이 필요하다. 그리고 이방성을 고려한 탄성 거꿀 참반사 보정으로의 확장을 위해서는 이방성을 고려한 탄성 모델링 알고리듬 뿐만 아니라 이방성을 고려한 파분리가 필요하다. 이방성 탄성매질에서의 파분리는 등방성 탄성매질에서 주로 이용하는 Helmholtz decomposition과는 달리 탄성매질의 수직 속도 및 이방성 계수에 따라 계산된 유사미분필터(pseudo-derivative filter)를 이용한다. 이 필터는 적용에 많은 계산이 필요하기 때문에 이 연구를 통해 많은 양의 병렬계산을 효율적으로 수행할 수 있는 GPU (Graphic Processing Unit)를 이용하여 이방성 파분리를 수행하는 알고리듬을 개발하였다. 또한 GPU를 이용해 파분리를 수행하는 알고리듬을 포함하고 MPI (Message-Passing Interface)를 이용하는 효율성 높은 이방성 탄성 거꿀 참반사 보정 알고리듬을 개발하였다. 개발된 알고리듬의 검증을 위해 Marmousi-II 탄성모델을 기초로 수직 횡등방성(vertically transversely isotropy; VTI) 탄성모델을 구축하여 수치모형 실험을 수행해 다성분 합성탄성파탐사자료를 생성하였다. 이 합성탄성파 자료에 개발된 이방성 탄성 거꿀 참반사 보정 알고리듬을 적용하여 GPU와 MPI를 효과적으로 이용한 계산속도 향상과 이방성 파분리에 의한 영상결과의 정확도 향상을 보여주었다.

Fourcade 빙하지역의 GPR 자료처리 (Data Processing for a GPR survey of Fourcade glacier)

  • 김기영;홍명호;이주한;홍종국;진영근;손호웅
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 한국지구물리탐사학회 2007년도 공동학술대회 논문집
    • /
    • pp.139-144
    • /
    • 2007
  • To delineate subglacial and englacial images of the western Fourcade Glacier in Antarctica, GPR data were acquired along a 470 m profile in November 2006. Signature deconvolution, migration velocity analysis, and finite difference depth migration were effective in increasing vertical resolution, obtaining the velocity function, and yielding clear depth images of the mixed-phase single-channel data, respectively. The source signature was extracted through stacking reflection signals from the basement. The deconvolution successfully compressed the source signatures to increase temporal resolution and attenuated reverberations. Medium velocities were analyzed with 112 diffraction events by the constant-velocity migration method based on the Stolt algorithm. Finally, depth migration based on the finite difference algorithm provided clear englacial and subglacial images in the laterally-varying velocity field.

  • PDF

A migration based reconstruction algorithm for the imaging of defects in a plate using a compact array

  • Muralidharan, Ajith;Balasubramaniam, Krishnan;Krishnamurthy, C.V.
    • Smart Structures and Systems
    • /
    • 제4권4호
    • /
    • pp.449-464
    • /
    • 2008
  • An array based, outward monitoring, ultrasonic guided wave based SHM technique using a single transmitter and multiple receivers (STMR), with a small footprint is discussed here. The previous implementation of such SHM arrays used a phase-reconstruction algorithm (that is similar to the beam-steering algorithm) for the imaging of reflectors. These algorithms were found to have a limitation during the imaging of defects/reflectors that are present in the "near-field" of the array. Here, the "near-field" is defined to be approximately 3-4 times the diameter of the compact array. This limitation is caused by approximations in the beam-steering reconstruction algorithm. In this paper, a migration-based reconstruction algorithm, with dispersion correction in the frequency domain, is discussed. Simulation and experimental studies are used to demonstrate that this algorithm improves the reconstruction in the "near-field" without decreasing the ability to reconstruct defects in the "far-field" in both isotropic and anisotropic plates.

분산 시스템에서 동적 파일 이전과 수학적 모델 (Dynamic File Migration And Mathematical model in Distributed Computer Systems)

  • 문원식
    • 디지털산업정보학회논문지
    • /
    • 제10권3호
    • /
    • pp.35-40
    • /
    • 2014
  • Many researches have been conducted to achieve improvement in distributed system that connects multiple computer systems via communication lines. Among others, the load balancing and file migration are considered to have significant impact on the performance of distributed system. The dynamic file migration algorithm common in distributed processing system involved complex calculations of decision function necessary for file migration and required migration of control messages for the performance of decision function. However, the performance of this decision function puts significant computational strain on computer. As one single network is shared by all computers, more computers connected to network means migration of more control messages from file migration, causing the network to trigger bottleneck in distributed processing system. Therefore, it has become imperative to carry out the research that aims to reduce the number of control messages that will be migrated. In this study, the learning automata was used for file migration which would requires only the file reference-related information to determine whether file migration has been made or determine the time and site of file migration, depending on the file conditions, thus reflecting the status of current system well and eliminating the message transfer and additional calculation overhead for file migration. Moreover, mathematical model for file migration was described in order to verify the proposed model. The results from mathematical model and simulation model suggest that the proposed model is well-suited to the distributed system.

하나의 경로를 가진 항공기 탑재형 Bistatic Spotlight SAR 영상형성을 위한 Range Migration Algorithm의 확장 (Extension of Range Migration Algorithm for Airborne Single Track Bistatic Spotlight SAR Imaging)

  • 신희섭;전재한;임종태
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • pp.165-166
    • /
    • 2008
  • Bistatic spotlight synthetic aperture radar(BSSAR) with single track configuration uses the transmitter and the receiver which travel along the single track such as the leader-follower. For the BSSAR imaging, we modify the range migration algorithm. In time domain, we make the monostatic SAR using shifting of path, Then, in frequency domain, we compensate the separated distance between the scene center and the flight path using the principle of the stationary phase (PSP).

  • PDF

데이터 마이닝을 위한 이동 에이전트의 효율적인 이주 전략 (An Efficient Migration Strategy of Mobile Agents for Data Mining)

  • 권혁찬;유우종;김흥환;유관종
    • 한국정보처리학회논문지
    • /
    • 제7권5호
    • /
    • pp.1511-1519
    • /
    • 2000
  • 본 논문에서는 데이터 마이닝 (data mining)을 위한 이동 에이전트의 효율적인 이주 전략 알고리즘을 제시한다. 제시한 알고리즘의 목적은 최소의 네트워크 소요시간을 갖도록 이동 에이전트의 이주 계획을 세우는 것이다. 본 논문의 이주 간략 일고리즘을 검증하고 평가하기 우해 데이터 마이닝을 수행하기 위한 세 가지 패러다임-RPC(Remote Procodure Call),이 등 에지전트, locker 패턴이 적용된 이동 에이전트에 대한 수행 평가 모델을 제시하였으며, 시뮬레이션을 수행하여 알고리즘을 평가하였다.

  • PDF

A Novel Service Migration Method Based on Content Caching and Network Condition Awareness in Ultra-Dense Networks

  • Zhou, Chenjun;Zhu, Xiaorong;Zhu, Hongbo;Zhao, Su
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권6호
    • /
    • pp.2680-2696
    • /
    • 2018
  • The collaborative content caching system is an effective solution developed in recent years to reduce transmission delay and network traffic. In order to decrease the service end-to-end transmission delay for future 5G ultra-dense networks (UDN), this paper proposes a novel service migration method that can guarantee the continuity of service and simultaneously reduce the traffic flow in the network. In this paper, we propose a service migration optimization model that minimizes the cumulative transmission delay within the constraints of quality of service (QoS) guarantee and network condition. Subsequently, we propose an improved firefly algorithm to solve this optimization problem. Simulation results show that compared to traditional collaborative content caching schemes, the proposed algorithm can significantly decrease transmission delay and network traffic flow.

Moving Object Detection Using Sparse Approximation and Sparse Coding Migration

  • Li, Shufang;Hu, Zhengping;Zhao, Mengyao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권5호
    • /
    • pp.2141-2155
    • /
    • 2020
  • In order to meet the requirements of background change, illumination variation, moving shadow interference and high accuracy in object detection of moving camera, and strive for real-time and high efficiency, this paper presents an object detection algorithm based on sparse approximation recursion and sparse coding migration in subspace. First, low-rank sparse decomposition is used to reduce the dimension of the data. Combining with dictionary sparse representation, the computational model is established by the recursive formula of sparse approximation with the video sequences taken as subspace sets. And the moving object is calculated by the background difference method, which effectively reduces the computational complexity and running time. According to the idea of sparse coding migration, the above operations are carried out in the down-sampling space to further reduce the requirements of computational complexity and memory storage, and this will be adapt to multi-scale target objects and overcome the impact of large anomaly areas. Finally, experiments are carried out on VDAO datasets containing 59 sets of videos. The experimental results show that the algorithm can detect moving object effectively in the moving camera with uniform speed, not only in terms of low computational complexity but also in terms of low storage requirements, so that our proposed algorithm is suitable for detection systems with high real-time requirements.