• Title/Summary/Keyword: 이동경계처리기법

Search Result 49, Processing Time 0.023 seconds

Performance Enhancement of Spline-based Edge Detection (스플라인 기법을 이용한 영상의 경계 검출 성능 개선)

  • 김영호;김진철;이완주;박규태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.11
    • /
    • pp.2106-2115
    • /
    • 1994
  • As a pre processing for an edge detection process. edge preserving smoothing algorithm is proposed. For this purpose we used the interpolation method using B-spline basis function and scaling of digital images. By approximation of continuous function from descrete data using B-spline basis function. undetermined data between two sample can be computed. so that they smooth the surfaces of objects. Some edges having mainly low frequency components are detected using down scaling of the images. Edge maps from proposed pre processed images are hardly affected by the varying space constants($\sigma$) and threshold values used in detecting zero-crossing.

  • PDF

The Sampling Interval Adjustment Technique of the Air Pollution Monitoring System (대기 오염 감시 시스템에서의 센서 샘플링 주기 조정 기법)

  • Jung, Young Jin;Lee, Yang Koo;Lee, Dong Gyu;Cho, Kum Won
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.04a
    • /
    • pp.892-895
    • /
    • 2010
  • 무선 기기의 소형화와 무선 통신 기술의 발달, 그리고 센서의 환경 정보 측정 기술 및 센서 네트워크의 확산으로 홍수, 태풍, 지진, 환경 오염, 등 재난의 피해를 줄이고자 재해 방지 시스템에 대한 연구가 활발하게 진행되고 있다. 그리고 이러한 재해는 특정한 시간에 특정 지점에만 발생하는 특징이 있으며, 이 발생 시간을 제외한 나머지 시간대에서는 정상적인 상황을 유지한다. 이와 같은 특성은 센서 네트워크 응용에서 센서의 배터리 전력 유지 및 환경 정보 획득 방법을 설계할 때, 주요한 사안으로 고려되고 있다. 이 논문에서는 센서의 전력소비를 줄이고 대기 오염에 대한 정보를 오염 발생 시간에 따라 적절히 획득하기 위하여, 대기 오염 방지 시스템에서의 센서 샘플링 주기 조정 기법을 제안한다. 제안된 기법은 대기 오염의 현재와 가까운 미래의 상태를 기반으로 센서의 샘플링 주기가 변화하는 규칙과 경계, 가중치를 설정한다. 그리고 매 샘플링 주기마다 센서 데이터 값과 이전에 저장된 오염 레벨을 고려하여 다음 샘플링 주기를 갱신한다. 이렇게 변화하는 샘플링 주기로 인해 대기 오염 감지 시스템은 측정 데이터의 정확도와 센서의 배터리 전력 소비의 균현을 적절히 유지할 수 있다. 제안된 샘플링 주기 기법은 다양한 환경 감시 응용에 활용될 수 있다.

Server Performance Improvement with Predicted Range of Agent Movement (이동 범위 예측을 통한 온라인 서버 성능 향상 기법)

  • Kim, Yong-O;Shin, Seung-Ho;Kang, Shin-Jin
    • Journal of Korea Game Society
    • /
    • v.11 no.1
    • /
    • pp.101-109
    • /
    • 2011
  • The performance of server becomes important issues in online game with the online game market expansion. This paper proposes a method of improving performance to decrease synchronized packets for each entity's informations in game. Our method provides adapted solution of reconstructing spatial subdivision to reduce a load of movement between boundary regions using prediction of entity's movement range and disabled regions where entity can not move to. It is shown through the experiments that proposed method outperforms existing method in terms of processing quantity of packets.

Countinuous k-Nearest Neighbor Query Processing Algorithm for Distributed Grid Scheme (분산 그리드 기법을 위한 연속 k-최근접 질의처리 알고리즘)

  • Kim, Young-Chang;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.3
    • /
    • pp.9-18
    • /
    • 2009
  • Recently, due to the advanced technologies of mobile devices and wireless communication, there are many studies on telematics and LBS(location-based service) applications. because moving objects usually move on spatial networks, their locations are updated frequently, leading to the degradation of retrieval performance. To manage the frequent updates of moving objects' locations in an efficient way, a new distributed grid scheme, called DS-GRID (distributed S-GRID), and k-NN(k-nearest neighbor) query processing algorithm was proposed[1]. However, the result of k-NN query processing technique may be invalidated as the location of query and moving objects are changed. Therefore, it is necessary to study on continuous k-NN query processing algorithm. In this paper, we propose both MCE-CKNN and MBP(Monitoring in Border Point)-CKNN algorithmss are S-GRID. The MCE-CKNN algorithm splits a query route into sub-routes based on cell and seproves retrieval performance by processing query in parallel way by. In addition, the MBP-CKNN algorithm stores POIs from the border points of each grid cells and seproves retrieval performance by decreasing the number of accesses to the adjacent cells. Finally, it is shown from the performance analysis that our CKNN algorithms achieves 15-53% better retrieval performance than the Kolahdouzan's algorithm.

  • PDF

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

Efficient Resource Allocation Technique for LTE-Advanced based Interference Avoidance of Heterogeneous Network (LTE-Advanced 기반 이기종 네트워크 시스템의 간섭회피를 위한 효율적인 자원할당 기법)

  • Jang, Sung-Won;Seong, Hyeon-Kyeong
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.17 no.1
    • /
    • pp.46-52
    • /
    • 2016
  • LTE-Advanced system consisting of the number of cells in the cellular environment because it is built to allow efficient use of limited frequency resources of adjacent cell interference avoidance should be considered. Transition services in accordance with the development of the mobile communication technology, wireless multimedia content from voice-centric mobile communications services and causing a lot of mobile data traffic, such as smart phones and tablet terminals spread of a data-driven surge in mobile data traffic base stations in urban areas by increasing became a reality that can not be prevented. In this paper, we propose a new Hybrid resource allocation technique for improving the performance of the cell boundary and analyzed the performance of the proposed new techniques to perform the simulation using LTE-Advanced system level simulator based on 19cell of cellular system model.

A Joint Allocation and Path Selection Scheme for Downlink Transmission in LTE-Advanced Relay System with Cooperative Relays (협력 통신을 이용한 LTE-Advanced 릴레이 시스템을 위한 하향링크 통합 자원할당 및 경로선택 기법)

  • Lee, Hyuk Joon;Um, Tae Hyun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.6
    • /
    • pp.211-223
    • /
    • 2018
  • Mobile relay systems have been adopted by $4^{th}$ generation mobile systems as an alternative method to extend cell coverage as well as to enhance the system throughput at cell-edges. In order to achieve such performance gains, the mobile relay systems require path selection and resource allocation schemes that are specifically designed for these systems which make use of additional radio resources not needed in single-hop systems. This paper proposes an integrated path selection and resource allocation scheme for LTE-Advanced relay systems using collaborative communication. We first define the problem of maximizing the downlink throughput of LTE-Advanced relay systems using collaborative communication and transform it into a multi-dimensional multi-choice backpacking problem. The proposed Lagrange multiplier-based heuristic algorithm is then applied to derive the approximate solution to the maximization problem. It is shown through simulations that the approximate solution obtained by the proposed scheme can achieve a near-optimal performance.

Implementation of a Self Controlled Mobile Robot with Intelligence to Recognize Obstacles (장애물 인식 지능을 갖춘 자율 이동로봇의 구현)

  • 류한성;최중경
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.5
    • /
    • pp.312-321
    • /
    • 2003
  • In this paper, we implement robot which are ability to recognize obstacles and moving automatically to destination. we present two results in this paper; hardware implementation of image processing board and software implementation of visual feedback algorithm for a self-controlled robot. In the first part, the mobile robot depends on commands from a control board which is doing image processing part. We have studied the self controlled mobile robot system equipped with a CCD camera for a long time. This robot system consists of a image processing board implemented with DSPs, a stepping motor, a CCD camera. We will propose an algorithm in which commands are delivered for the robot to move in the planned path. The distance that the robot is supposed to move is calculated on the basis of the absolute coordinate and the coordinate of the target spot. And the image signal acquired by the CCD camera mounted on the robot is captured at every sampling time in order for the robot to automatically avoid the obstacle and finally to reach the destination. The image processing board consists of DSP (TMS320VC33), ADV611, SAA7111, ADV7l76A, CPLD(EPM7256ATC144), and SRAM memories. In the second part, the visual feedback control has two types of vision algorithms: obstacle avoidance and path planning. The first algorithm is cell, part of the image divided by blob analysis. We will do image preprocessing to improve the input image. This image preprocessing consists of filtering, edge detection, NOR converting, and threshold-ing. This major image processing includes labeling, segmentation, and pixel density calculation. In the second algorithm, after an image frame went through preprocessing (edge detection, converting, thresholding), the histogram is measured vertically (the y-axis direction). Then, the binary histogram of the image shows waveforms with only black and white variations. Here we use the fact that since obstacles appear as sectional diagrams as if they were walls, there is no variation in the histogram. The intensities of the line histogram are measured as vertically at intervals of 20 pixels. So, we can find uniform and nonuniform regions of the waveforms and define the period of uniform waveforms as an obstacle region. We can see that the algorithm is very useful for the robot to move avoiding obstacles.

Analysis of Gas Pipeline Movement and Stress Estimation (가스배관 위치이동 해석 및 응력 예측 기법 개발)

  • Kim, Joon Ho;Kim, Dong Hyawn;Lee, Sang Geun;Hong, Seong Kyeong;Jeong, Sek Young
    • Journal of Korean Society of Steel Construction
    • /
    • v.21 no.3
    • /
    • pp.203-210
    • /
    • 2009
  • If there are some construction works that affect the stability of buried pipelines, the pipelines should be moved to guarantee their safety. In this paper, modeling methods for analyzing the movement of pipelines were sought, and the step-by-step stress estimation method of moving pipelines was developed. Some factors affecting of pipeline response such as the element type, the element size, boundary modeling, and geometric non-linearity were quantitatively investigated. In addition, some conditions in which accuracy and effectiveness can be compromised in the analysis of long pipelines were identified. A neural network was used to estimate the pipeline stress. The inputs to the neural network included step-by-step displacements, and the output was the resulting stress at each movement step. After training the neural network, it can be used to estimate pipeline stresses at some sub-steps that are not included in the training. A Windows-based stress estimation program was developed.

Design and Performance Analysis of Bandwidth-Efficient Handoff Scheme in Proxy Mobile IPv6 Networks (프록시 모바일 IPv6 네트워크에서 대역폭에 효율적인 핸드오프 기법의 설계 및 성능 분석)

  • Yoo, Seung-Beak;Jeong, Jongpil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.219-236
    • /
    • 2014
  • In this paper, we propose a novel Proxy Mobile IPv6 network bandwidth-efficient handoff scheme. MN are classified into slow and fast one. At first MN should be registered in the microcell for bandwidth efficient handoff scheme. microcell is overlapped to handle the overflow session request which is nested. Overflow session request in macrocell requests to go back from the boundary of the microcell to new microcell. If idle session traffic is in a cell, it is requested by the target microcell. Analysis model was developed, an existing session of the session blocking probability and forcing termination probability of the session request have improved considerably. If the total traffic load of the system is not very large, the proposed scheme has the best bandwidth efficiency and provides better quality of service (QoS) to MN without costs of a lot of processing on the system.