• Title/Summary/Keyword: Data Merge

Search Result 189, Processing Time 0.029 seconds

The 3D Shape Reconstruction System Based on Active Stereo Matching (Active Stereo Matching 기반의 3차원 형상 재구성 시스템)

  • Byun, Ki-Won;Im, Jae-Uk;Kim, Dae-Dong;Nam, Ki-Gon
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.1003-1004
    • /
    • 2008
  • In this paper, we propose a 3D modeling method using Laser Slit Beam and Stereo Camera. We can get depth information of image by analyzing projected Laser Slit Beam on object. 3D modeling is demanded exquisite merge of 3D data. In our approach, we can get the depth image where the reliability is high. Each reconstructed 3D modeling is combined by the sink information which is acquired by SIFT (Scale Invariant Feature Transform) Algorithm. We perform experiments using indoor images. The results show that the proposed method works well in indoor environments

  • PDF

A Bit Allocation Algorithm Using Adaptive Bandwidth for DMT (적응적인 대역폭을 이용한 DMT에서의 비트 할당 알고리듬)

  • 최현우;신봉식;정정화
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.372-375
    • /
    • 1999
  • This paper proposes a bit allocation algorithm using adaptive bandwidth for ADSL that uses the DMT technology. In certain cases for high attenuation loops the conventional algorithms are unable to assign data bits to the higher frequency tones, due to the power spectrum mask limitation recommended by ANSI Standard, even if the total power budget is not expended. In the proposed bit allocation algorithm, adjacent empty tones that would not be used merge into single tone, then additional bits is assigned to the merged empty tones. Because additional bits is allocated, most of the available power is used. The proposed algorithm show that total bit increase in about 2~9% bits more than about conventional "water-filling" and "bit removal" algorithms and that is able to use about 93% of the available budget Power

  • PDF

An algorithm for pattern recognition of multichannel ECG signals using AI (AI기법을 이용한 멀티채널 심전도신호의 패턴인식 알고리즘)

  • 신건수;이병채;황선철;이명호
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10a
    • /
    • pp.575-579
    • /
    • 1990
  • This paper describes an algorithm that can efficiently analyze the multichannel ECG signal using the frame. The input is a set of significant features (points) which have been extracted from an original sampled signal by using the split-and-merge algorithm. A signal from each channel can be hierarchical ADN/OR graph on the basis of the priori knowledge for ECG signal. The search mechanisms with some heuristics and the mixed paradigms of data-driven hypothesis formation are used as the major control mechanisms. The mutual relations among features are also considered by evaluating a score based on the relational spectrum. For recognition of morphologies corresponding to OR nodes, an hypothesis modification strategy is used. Other techniques such as instance, priority update of prototypes, and template matching facility are also used. This algorithm exactly recognized the primary points and supporting points from the multichannel ECG signals.

  • PDF

Sensor Fusion for Underwater Navigation of Unmanned Underwater Vehicle (무인잠수정의 수중합법을 위한 센서융합)

  • Sur, Joo-No
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.8 no.4 s.23
    • /
    • pp.14-23
    • /
    • 2005
  • In this paper we propose a sensor fusion method for the navigation algorithm which can be used to estimate state vectors such as position and velocity for its motion control using multi-sensor output measurements. The output measurement we will use in estimating the state is a series of known multi-sensor asynchronous outputs with measurement noise. This paper investigates the Extended Kalman Filtering method to merge asynchronous heading, heading rate, velocity of DVL, and SSBL information to produce a single state vector. Different complexity of Kalman Filter, with. biases and measurement noise, are investigated with theoretically data from MOERI's SAUV. All levels of complexity of the Kalman Filters are shown to be much more close and smooth to real trajectories then the basic underwater acoustic navigation system commonly used aboard underwater vehicle.

Sensor Fusion for Underwater Navigation of Unmanned Underwater Vehicle (무인잠수체의 수중항법을 위한 센서퓨전)

  • 주민근;서주노;송광섭;이판묵;홍석원;박영일
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.175-175
    • /
    • 2000
  • In this Paper we propose a navigation algorithm which can be used to estimate state vectors such as position and velocity for its motion control using multi-sensor output measurements. The output measurement we will use in estimating the state is a series of known multi-sensor asynchronous outputs with measurement noise. This paper investigates the Extended Kalman Filtering method to merge asynchronous heading, heading rate, velocity of DVL, and SSBL information to produce a single state vector. Different complexity of Kalman Filter, with biases and measurement noise, are investigated with theoretically data from KRISO's AUV. All levels of complexity of the Kalman Filters are shown to be much more close and smooth to real trajectories then the basic underwater acoustic navigation system comment)'used aboard underwater vehicle.

  • PDF

Application of SE Management Techniques for Space Launch System Development (우주 발사 시스템 개발에 있어서의 SE 관리기법 적용)

  • Joh, Miok;Cho, Byoung-Gyu;Oh, Bum-Seok;Park, Jeong-Joo;Cho, Gwang-Rae
    • Journal of the Korean Society of Systems Engineering
    • /
    • v.1 no.1
    • /
    • pp.53-60
    • /
    • 2005
  • System engineering(SE) management techniques applied for space launch system development are introduced to assess the current status and address the effectiveness of these techniques. Management plans and guides are prepared for the work breakdown structure, data, configuration, interface control, quality assurance, procurement, reliability, risk and verification/validat ion. Further improvement is required for the system engineering management plan(SEMP) to merge the international cooperation into current engineering management system.

  • PDF

A Study on the Block Truncation Coding Using the Bit-plane Reduction (비트평면 감축을 이용한 블록 절단부호화에 관한 연구)

  • 이형호;박래홍
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.5
    • /
    • pp.833-840
    • /
    • 1987
  • A new Block Truncation Coding(BTC) technique reducing the bit-plane and using differential pulse code modulation (DPCM) is proposed and compared with the conventional BTC methods. A new technique decides whether the subblock can be approximated to be uniform or not. If the subblock can be approximated to be uniform(merge mode), we transmit only the gray-level informantion. It not (split mode), we transmity both the bit-plane and the gray-level information. DPCM method is proposed to the encoding of gray-level information when the subblock can be approximated to be uniform. Also modified quantization method is presented to the encoding of gray-level information when the subblock is not uniform. This technique shows the results of coding 256 level images at the average data rate of about 0.75 bits/pel.

  • PDF

Edit Method Using Representative Frame on Video (비디오에서의 대표 프레임을 이용한 편집기법)

  • 유현수;이지현
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.11a
    • /
    • pp.420-423
    • /
    • 1999
  • In this paper, we propose the method which efficiently obtain information through edit and retrieval of video data easily and rapidly. To support this method, extract the candidate representative frame using existing scene change detection method and the user selects representative frame for video segmentation at his desire, and then visualization indexing methods supported by logical-links enable users to freely merge and split each scene.

  • PDF

Finding the Worst-case Instances of Some Sorting Algorithms Using Genetic Algorithms (유전 알고리즘을 이용한 정렬 알고리즘의 최악의 인스턴스 탐색)

  • Jeon, So-Yeong;Kim, Yong-Hyuk
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06b
    • /
    • pp.1-5
    • /
    • 2010
  • 정렬 알고리즘에서 사용한 원소 간 비교횟수를 기준으로, 비교횟수가 많게 되는 순열을 최악의 인스턴스(worst-case instance)라 명명하고 이를 찾기 위해 유전 알고리즘(genetic algorithm)을 사용하였다. 잘 알려진 퀵 정렬(quick sort), 머지 정렬(merge sort), 힙 정렬(heap sort), 삽입 정렬(insertion sort), 쉘 정렬(shell sort), 개선된 퀵 정렬(advanced quick sort)에 대해서 실험하였다. 머지 정렬과 삽입 정렬에 대해 탐색한 인스턴스는 최악의 인스턴스에 거의 근접하였다. 퀵 정렬은 크기가 증가함에 따라 최악의 인스턴스 탐색이 어려웠다. 나머지 정렬에 대해서 찾은 인스턴스는 최악의 인스턴스인지 이론적으로 보장할 수 없지만, 임의의 1,000개 순열을 정렬해서 얻은 비교횟수들의 평균치보다는 훨씬 높았다. 본 논문의 최악의 인스턴스를 탐색하는 시도는 알고리즘의 성능 검증을 위한 테스트 데이터를 생성한다는 점에서 의미가 크다.

  • PDF

Concurrent Merge Updates of Tile-based Geometry Data for Building a GIS Database (GIS 데이터베이스 구축을 위한 타일-기반 기하 데이터의 동시 합병 변경)

  • 이상현;김동현;홍봉희
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10a
    • /
    • pp.376-378
    • /
    • 1999
  • 공간 데이터 수집과정을 통해 제작된 수치지도는 타일 기반의 교환 포맷으로 구성되어 있다. 이러한 타일 기반의 수치지도를 이용해서 공간 데이터베이스를 구축하기 위해 먼저 타일로 분리되어 있는 수치지도를 Seamless 수치지도로 재작성해야 하며 이를 위해 타일 합병 작업이 필요하다. 타일 합병 작업을 다수의 작업자가 동시에 수행할 경우, 작업의 선후 관계에 따라 작업을 잃어 버리거나 (작업손실(Lost-Work)) 또는 동일한 엔티티들에 대해 교차 잠금이 요청되어 교착상태(DeadLock)가 발생하는 등의 문제점들이 발생한다. 이러한 문제점들을 해결하기 위해 이 논문에서는 작업자 상호간의 메시지 교환을 통한 동시 합병 작업 알고리즘을 제시하고 그에 따른 수치지도 합병 처리기를 설계 및 구현한다.

  • PDF