• Title/Summary/Keyword: Range processing

Search Result 2,763, Processing Time 0.034 seconds

Valve Model Extraction from Noisy 3-D Point Cloud Data (잡음이 있는 3차원 점군 정보에서의 밸브 모형 추출)

  • Oh, Ki-Won;Choi, Kang-Sun
    • Annual Conference of KIPS
    • /
    • 2015.04a
    • /
    • pp.945-946
    • /
    • 2015
  • Laser Range Finder를 이용하여 생성한 3차원 점군 정보는 단면적인 부분만 볼 수 있으며, 잡음이 포함되어 작은 물체를 추출하는데 많은 영향이 생긴다. 이러한 잡음이 있는 3차원 점군 정보 사이에서 밸브의 중심의 위치에 대한 추가적인 입력을 받아 원환체, 원통, 평면의 정보를 복합적으로 포함하고 있는 밸브의 모델을 추출한다.

An Approximate Evidence Combination Scheme for Increased Efficiency (효율성 제고를 위한 근사적 증거병합 방법)

  • Lee, Gye-Sung
    • Annual Conference of KIPS
    • /
    • 2001.04a
    • /
    • pp.337-340
    • /
    • 2001
  • A major impediment in using the Dempster-Shafer evidence combination scheme is its computational complexity, which in general is exponential since DS scheme allows any subsets over the frame of discernment as focal elements. To avoid this problem, we propose a method called approximate evidence combination scheme. This scheme is applied to a few sample applications and the experiment results are compared with those of VBS. The results show that the approximation scheme achieves a great amount of computational speedup and produces belief values within the range of deviation that the expert allows.

  • PDF

Location-based Support Multi-path Multi-rate Routing for Grid Mesh Networks

  • Hieu, Cao Trong;Hong, Choong Seon
    • Annual Conference of KIPS
    • /
    • 2009.04a
    • /
    • pp.1264-1266
    • /
    • 2009
  • We introduce a location-based routing model applied for grid backbone nodes in wireless mesh network. The number of paths with nearest distance between two nodes is calculated and used as key parameter to execute routing algorithm. Node will increase the transmission range that makes a trade off with data rate to reach its neighbors when node itself is isolated. The routing model is lightweight and oriented thanks to the simple but efficient routing algorithm.

Frequency Range Enhancement for Faster Convergence of Neural Music Source Separation Systems (신경망 기반 음원 분리 시스템의 학습 속도 향상을 위한 음역대 강조 기법)

  • Kim, Min-Seok;Choi, Woo-Sung;Jung, Soon-Young
    • Annual Conference of KIPS
    • /
    • 2020.05a
    • /
    • pp.567-569
    • /
    • 2020
  • 여러 악기가 섞여 있는 음원으로부터 원하는 악기 소리를 추출하는 음원 분리 기법 중 최근 신경망 기반 시스템이 활발히 연구되고 있다. 악기마다 고유의 음역대를 가진다는 사실에 감안하여, 연구진은 기존 음원 분리 신경망에 적은 수의 학습 파라미터를 추가하여 학습 속도를 대폭 향상시킬 수 있는 음역대 강조 기법을 제안한다.

Hybrid Closed-Form Solution for Wireless Localization with Range Measurements (거리정보 기반 무선위치추정을 위한 혼합 폐쇄형 해)

  • Cho, Seong Yun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.7
    • /
    • pp.633-639
    • /
    • 2013
  • Several estimation methods used in the range measurement based wireless localization area have individual problems. These problems may not occur according to certain application areas. However, these problems may give rise to serious problems in particular applications. In this paper, three methods, ILS (Iterative Least Squares), DS (Direct Solution), and DSRM (Difference of Squared Range Measurements) methods are considered. Problems that can occur in these methods are defined and a simple hybrid solution is presented to solve them. The ILS method is the most frequently used method in wireless localization and has local minimum problems and a large computational burden compared with closed-form solutions. The DS method requires less processing time than the ILS method. However, a solution for this method may include a complex number caused by the relations between the location of reference nodes and range measurement errors. In the near-field region of the complex solution, large estimation errors occur. In the DSRM method, large measurement errors occur when the mobile node is far from the reference nodes due to the combination of range measurement error and range data. This creates the problem of large localization errors. In this paper, these problems are defined and a hybrid localization method is presented to avoid them by integrating the DS and DSRM methods. The defined problems are confirmed and the performance of the presented method is verified by a Monte-Carlo simulation.

FPGA-based design and implementation of data acquisition and real-time processing for laser ultrasound propagation

  • Abbas, Syed Haider;Lee, Jung-Ryul;Kim, Zaeill
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.17 no.4
    • /
    • pp.467-475
    • /
    • 2016
  • Ultrasonic propagation imaging (UPI) has shown great potential for detection of impairments in complex structures and can be used in wide range of non-destructive evaluation and structural health monitoring applications. The software implementation of such algorithms showed a tendency in time-consumption with increment in scan area because the processor shares its resources with a number of programs running at the same time. This issue was addressed by using field programmable gate arrays (FPGA) that is a dedicated processing solution and used for high speed signal processing algorithms. For this purpose, we need an independent and flexible block of logic which can be used with continuously evolvable hardware based on FPGA. In this paper, we developed an FPGA-based ultrasonic propagation imaging system, where FPGA functions for both data acquisition system and real-time ultrasonic signal processing. The developed UPI system using FPGA board provides better cost-effectiveness and resolution than digitizers, and much faster signal processing time than CPU which was tested using basic ultrasonic propagation algorithms such as ultrasonic wave propagation imaging and multi-directional adjacent wave subtraction. Finally, a comparison of results for processing time between a CPU-based UPI system and the novel FPGA-based system were presented to justify the objective of this research.

Performance Characteristics of a Chirp Data Acquisition and Processing System for the Time-frequency Analysis of Broadband Acoustic Scattering Signals from Fish Schools (어군에 의한 광대역 음향산란신호의 시간-주파수 분석을 위한 chirp 데이터 수록 및 처리 시스템의 성능특성)

  • Lee, Dae-Jae
    • Korean Journal of Fisheries and Aquatic Sciences
    • /
    • v.51 no.2
    • /
    • pp.178-186
    • /
    • 2018
  • A chirp-echo data acquisition and processing system was developed for use as a simplified, PC-based chirp echo-sounder with some data processing software modules. The design of the software and hardware system was implemented via a field-programmable gate array (FPGA). Digital signal processing algorithms for driving a single-channel chirp transmitter and dual-channel receivers with independent TVG (time varied gain) amplifier modules were incorporated into the FPGA for better real-time performance. The chirp-echo data acquisition and processing system consisted of a notebook PC, an FPGA board, and chirp sonar transmitter and receiver modules, which were constructed using three chirp transducers operating over a frequency range of 35-210 kHz. The functionality of this PC-based chirp echo-sounder was tested in various field experiments. The results of these experiments showed that the developed PC-based chirp echo-sounder could be used in the acquisition, processing and analysis of broadband acoustic echoes related to fish species identification.

A Batch Scheduling Problem for Jobs with Interval-typed Processing Time (구간 공정 시간을 갖는 작업들의 일괄처리 일정계획문제)

  • 오세호
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.27 no.1
    • /
    • pp.47-50
    • /
    • 2004
  • This paper deals with the problem of batching and scheduling of jobs whose processing times are different respectively But, they are given as not the exact value but the range from the lower limits to the upper, which makes it possible to group jobs into batches. The grouping of jobs is desirable because of the capability of the batch processor to accommodate several jobs at once. The time required to process the jobs in any batch depends on their lower limit processing times. Once processing is initiated on a batch processor, the batch cannot be interrupted, nor can other jobs be started. And all jobs are assumed to be simultaneously available. This paper develops the model to describe these situation and a heuristic method to minimize its total tardiness.

Optimization of Processing on Filling Balance of the HR3P Mold Structure (균형충전을 위한 HR3P 금형 구조에서의 공정의 최적화)

  • Kwon, Youn-Suk;Jeong, Yeong-Deug
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.26 no.3
    • /
    • pp.98-102
    • /
    • 2009
  • Almost all injection molds have multi-cavity runner system for mass production, which are designed with geometrically balanced runner system in order to accomplish filling balance between cavity to cavity during processing. However, even though geometrically balanced runner is used, filling imbalance has been observed. Filling imbalance could be decreased by modifying processing conditions such as injections rate, mold temperature, injection pressure, melt temperature that are related to shear, viscosity. In this study, a series of experiment was conducted to investigate filling imbalance variation when modifying runner layout and polymer and to determine which processing condition influences as the primary cause of filling imbalance in geometrically balanced runner system. The filling imbalance was decreased up to result range of $3{\leq}DFI{\leq}8(%)$ by using a new runner system for balanced filling.

A Study on Image Processing of Tree Discharges for Insulation Destructive Prediction (절연파괴 예측을 위한 트리방전의 영상처리에 관한 연구)

  • 오무송;김태성
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.14 no.1
    • /
    • pp.26-33
    • /
    • 2001
  • The proposed system was composed of pre-processor which was executing binary/high-pass filtering and post-processor which ranged from statistic data to prediction. In post-processor work, step one was filter process of image, step two was image recognition, and step three was destruction degree/time prediction. After these processing, we could predict image of the last destruction timestamp. This research was produced variation value according to growth of tree pattern. This result showed improved correction, when this research was applied image Processing. Pre-processing step of original image had good result binary work after high pas- filter execution. In the case of using partial discharge of the image, our research could predict the last destruction timestamp. By means of experimental data, this prediction system was acquired $\pm$3.2% error range.

  • PDF