• Title/Summary/Keyword: Distance Map

검색결과 713건 처리시간 0.02초

Construction of an Integrated Pepper Map Using RFLP, SSR, CAPS, AFLP, WRKY, rRAMP, and BAC End Sequences

  • Lee, Heung-Ryul;Bae, Ik-Hyun;Park, Soung-Woo;Kim, Hyoun-Joung;Min, Woong-Ki;Han, Jung-Heon;Kim, Ki-Taek;Kim, Byung-Dong
    • Molecules and Cells
    • /
    • 제27권1호
    • /
    • pp.21-37
    • /
    • 2009
  • Map-based cloning to find genes of interest, marker-assisted selection (MAS), and marker-assisted breeding (MAB) all require good genetic maps with high reproducible markers. For map construction as well as chromosome assignment, development of single copy PCR-based markers and map integration process are necessary. In this study, the 132 markers (57 STS from BAC-end sequences, 13 STS from RFLP, and 62 SSR) were newly developed as single copy type PCR-based markers. They were used together with 1830 markers previously developed in our lab to construct an integrated map with the Joinmap 3.0 program. This integrated map contained 169 SSR, 354 RFLP, 23 STS from BAC-end sequences, 6 STS from RFLP, 152 AFLP, 51 WRKY, and 99 rRAMP markers on 12 chromosomes. The integrated map contained four genetic maps of two interspecific (Capsicum annuum 'TF68' and C. chinense 'Habanero') and two intraspecific (C. annuum 'CM334' and C. annuum 'Chilsungcho') populations of peppers. This constructed integrated map consisted of 805 markers (map distance of 1858 cM) in interspecific populations and 745 markers (map distance of 1892 cM) in intraspecific populations. The used pepper STS were first developed from end sequences of BAC clones from Capsicum annuum 'CM334'. This integrated map will provide useful information for construction of future pepper genetic maps and for assignment of linkage groups to pepper chromosomes.

미지 환경에서의 깊이지도를 이용한 쿼드로터 착륙방식 성능 비교 (Performance Comparison of Depth Map Based Landing Methods for a Quadrotor in Unknown Environment)

  • 최종혁;박종호;임재성
    • 한국항공우주학회지
    • /
    • 제50권9호
    • /
    • pp.639-646
    • /
    • 2022
  • 본 논문은 사전에 알려지지 않은 환경에서 깊이지도를 이용하여 정보를 획득하고, 이를 기반으로 쿼드로터의 착륙 선택 알고리즘 성능을 분석한다. 무인항공기의 유도 및 제어시스템은 궤적 계획 유도시스템과 위치 및 자세 제어기로 구성된다. 아래를 향하는 짐벌 시스템에 부착된 스테레오 비전 센서가 획득한 깊이 정보를 이용하여 착륙 지점을 선정한다. 평탄도 정보는 사전 정의된 깊이지도 영역의 최대 깊이 차이 및 UAV와의 거리를 고려하여 산출한다. 본 논문에서는 3가지 착륙 방법을 제안하며 다양한 성능지수들을 활용하여 성능을 비교한다. 성능지수로는 UAV 이동 거리, 지도 정확도, 장애물 대응 시간 등을 고려한다.

보로노이 다이어그램에 기반한 개선된 유클리디언 거리 변환 방법 (Improved Euclidean transform method using Voronoi diagram)

  • 장석환;박용섭;김회율
    • 한국통신학회논문지
    • /
    • 제29권12C호
    • /
    • pp.1686-1691
    • /
    • 2004
  • 본 논문에서는 기존의 고속 유클리디언 거리 변환법을 개선한 새로운 계산 방법을 제안한다. 기존의 고속 유클리디언 거리 변환법이 가지고 있는 단점인 특징점의 수에 비례하여 계산량이 늘어나는 단점을 극복하기 위해서, 본 논문에서는 특징점들 중에서 비특징점과 4방향으로 연결되어 있는 특징점만을 이용하여 보로노이 다이어그램을 계산함으로써 유클리디언 거리 변화도(Euclidean distance map)의 계산 시간을 기존의 방법보다 평균 40%로 감소시켰다. 본 논문에서 제안한 방법의 효율성을 검증하기 위해서 크기의 바이너리 영상 16장에서 대해서 기존의 방법과 제안한 방법으로 똑같이 유클리디언 거리 변화도를 계산하여 계산 시간을 비교함으로써 그 효능을 입증하였다.

Construction of Linkage Map Using RAPD and SSR Markers in Soybean (Glycine max)

  • / J
    • 한국자원식물학회지
    • /
    • 제10권3호
    • /
    • pp.241-246
    • /
    • 1997
  • Linkage maps based on molecular markers are valuable tools in plant breeding and genetic studies. A population of 76 RI lines from the mating of A3733 and PI437.088 was evaluated with Random Amplified Polymorphic DNA(RAPD) and Simple Sequence Repeats (SSR) markers to create soybean molecular linkage map, 302 RAPD and 21 SSR markers were genetically linked and formed forty linkage groups. These linkage groups spanned a genetic distance of 1,775 cM. The average distance between markers was 5.5 cM.

  • PDF

GIS 도로 데이터의 일반화를 이용한 Axial map 구현 방법에 관한 연구 (Axial map Implementation Using Linear Generalization of GIS data)

  • 권순일;박수홍;주용진
    • Spatial Information Research
    • /
    • 제18권4호
    • /
    • pp.99-108
    • /
    • 2010
  • 방향전환의 횟수를 변인으로 공간구조를 정량적으로 산출하고 분석 할 수 있는 Space Syntax 방법론은 안전한 길, 활기 있는 길 등 연간의 '심리적 거리' 특성을 반영 할 수 있어 기존의 GIS 기반 공간정보 서비스에서의 '물리적 최단 거리'에 기반 한 공간정보 서비스에 교통사고 및 야간의 범죄로부터의 안전성 등을 훨씬 중시하는 결과를 보여줄 수 있다. 이처럼 Space Syntax 방법론을 이용한 방법을 위해 기본적으로 Axial map(축선도)을 구축해 작업하여야 하는데, 실제 축선도를 구현하는데 시간적, 물리적 제한을 많이 갖게 된다. 따라서 본 연구에서는 GIS 도로 데이터를 이용하여 축선도를 구현하는데 있어, 선행 사상의 일반화 원리를 이용하여 전통적인 축선도를 구축함에 있어 객관적인 근거를 바탕으로 알아보고, Space Syntax의 주요인자인 전체통합도와 실제 통행량 사이의 상관관계를 통해 결과를 비교하여 본다. 이러한 방법을 통하여 실제 통행량과 $R^2$=0.5387 수준까지의 상관관계의 결과를 얻을 수 있었다.

Multiple Face Segmentation and Tracking Based on Robust Hausdorff Distance Matching

  • Park, Chang-Woo;Kim, Young-Ouk;Sung, Ha-Gyeong
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.632-635
    • /
    • 2003
  • This paper describes a system fur tracking multiple faces in an input video sequence using facial convex hull based facial segmentation and robust hausdorff distance. The algorithm adapts skin color reference map in YCbCr color space and hair color reference map in RGB color space for classifying face region. Then, we obtain an initial face model with preprocessing and convex hull. For tracking, this algorithm computes displacement of the point set between frames using a robust hausdorff distance and the best possible displacement is selected. Finally, the initial face model is updated using the displacement. We provide an example to illustrate the proposed tracking algorithm, which efficiently tracks rotating and zooming faces as well as existing multiple faces in video sequences obtained from CCD camera.

  • PDF

Multiple Face Segmentation and Tracking Based on Robust Hausdorff Distance Matching

  • Park, Chang-Woo;Kim, Young-Ouk;Sung, Ha-Gyeong;Park, Mignon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제3권1호
    • /
    • pp.87-92
    • /
    • 2003
  • This paper describes a system for tracking multiple faces in an input video sequence using facial convex hull based facial segmentation and robust hausdorff distance. The algorithm adapts skin color reference map in YCbCr color space and hair color reference map in RGB color space for classifying face region. Then, we obtain an initial face model with preprocessing and convex hull. For tracking, this algorithm computes displacement of the point set between frames using a robust hausdorff distance and the best possible displacement is selected. Finally, the initial face model is updated using the displacement. We provide an example to illustrate the proposed tracking algorithm, which efficiently tracks rotating and zooming faces as well as existing multiple faces in video sequences obtained from CCD camera.

위상학적 공간 인식을 위한 효과적인 초음파 격자 지도 매칭 기법 개발 (Effective Sonar Grid map Matching for Topological Place Recognition)

  • 최진우;최민용;정완균
    • 로봇학회논문지
    • /
    • 제6권3호
    • /
    • pp.247-254
    • /
    • 2011
  • This paper presents a method of sonar grid map matching for topological place recognition. The proposed method provides an effective rotation invariant grid map matching method. A template grid map is firstly extracted for reliable grid map matching by filtering noisy data in local grid map. Using the template grid map, the rotation invariant grid map matching is performed by Ring Projection Transformation. The rotation invariant grid map matching selects candidate locations which are regarded as representative point for each node. Then, the topological place recognition is achieved by calculating matching probability based on the candidate location. The matching probability is acquired by using both rotation invariant grid map matching and the matching of distance and angle vectors. The proposed method can provide a successful matching even under rotation changes between grid maps. Moreover, the matching probability gives a reliable result for topological place recognition. The performance of the proposed method is verified by experimental results in a real home environment.

HMIPv6 환경에서의 최소비용 MAP 선택 기법 (Cost Effective Mobility Anchor Point Selection Scheme for HMIPv6 Networks)

  • 노명화;정충교
    • 산업기술연구
    • /
    • 제26권B호
    • /
    • pp.207-213
    • /
    • 2006
  • Mobility Anchor points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro hand off. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we propose a novel scheme to select a MAP to minimize the communication cost, taking the mobile node's moving speed and data rate into account. To come up with the scheme we analyses the communication analyses the communication cost into the binding update cost and the data packet delivery cost, and derive an equation representing the optimal MAP domain size to minimize the total cost.

  • PDF

Map Detection using Deep Learning

  • Oh, Byoung-Woo
    • 한국정보기술학회 영문논문지
    • /
    • 제10권2호
    • /
    • pp.61-72
    • /
    • 2020
  • Recently, researches that are using deep learning technology in various fields are being conducted. The fields include geographic map processing. In this paper, I propose a method to infer where the map area included in the image is. The proposed method generates and learns images including a map, detects map areas from input images, extracts character strings belonging to those map areas, and converts the extracted character strings into coordinates through geocoding to infer the coordinates of the input image. Faster R-CNN was used for learning and map detection. In the experiment, the difference between the center coordinate of the map on the test image and the center coordinate of the detected map is calculated. The median value of the results of the experiment is 0.00158 for longitude and 0.00090 for latitude. In terms of distance, the difference is 141m in the east-west direction and 100m in the north-south direction.