• Title/Summary/Keyword: 3D 클러스터링

Search Result 68, Processing Time 0.025 seconds

Parallel clustering technology for real-time LWIR band image processing (실시간 LWIR 밴드 영상 처리를 위한 병렬 클러스터링 기술)

  • Cho, Yongjin;Lee, Kyou-seung;Hong, Seongha;Oh, Jong-woo;Lee, DongHoon
    • Proceedings of the Korean Society for Agricultural Machinery Conference
    • /
    • 2017.04a
    • /
    • pp.158-158
    • /
    • 2017
  • 비닐포장 하부에 위치한 콩의 생장 초기에 발생한 초엽을 인식하기 위한 연구를 수행중이다. 선행 연구에서 비닐포장에 접촉한 콩 초엽으로 인해 비닐포장 상부 표면의 열 반응 분포에 변화가 있음을 발견하였다. 현장에서 주행 중에 콩 초엽의 위치를 실시간으로 인식하고 연동된 선형 또는 회전형 엑츄에이터를 제어하여 정확한 위치에 천공을 수행하기 위해서는 계측 시스템과 제어 시스템간의 시간적 차이를 최소할 수 있는 실시간 신호 처리 기술이 필수적이다. 선행 연구에서 사용한 다중 IR 센서의 분해능은 $16{\times}4pixel$이며 주파수는 3 Hz로, 폭이 30cm 내외인 비닐포장 상부의 정밀 분석에 한계가 있음을 발견하였다. 이를 해결하기 위하여 분해능과 계측 주기를 개선할 수 있는 초소형 ($1cm{\times}1cm{\times}1cm$) 열화상 센서를 이용하였다. LWIR(Longwave infrared)영역에 해당하는 $8{\mu}m{\sim}14{\mu}m$의 영역에서 $0.05^{\circ}C$의 분해능을 보이는 $ Lepton^{TM}$ (500-0690-00, FLIR, Goleta, CA)모델을 사용하였다. 프레임당 $80{\times}60$ 픽셀의 정보가 2 Byte의 단위로 계측이 되며 9 Hz의 주파수로 대상면의 열 분포를 측정할 수 있다. 이론적으로 초당 정보 전송량은 86,400 Byte ($80{\times}60{\times}2{\times}9$)이며, 1 m를 진행하는 주행형 천공기에 적용할 경우 1 프레임당 10cm 정도의 면적을 측정하므로, 최대 위치 판정 분해능은 약 10 cm / 60 pixel = 0.17 cm/pixel로 상대적으로 정밀한 위치 판별이 가능하다. $80{\times}60{\times}2Byet$의 정보를 0.1초 이내에 분석해야 하는 기술적 과제를 해결하기 위하여 천공 작업기에 적합한 상용 SBC(Single board computer)의 클럭 속도(1 Ghz)로 처리 가능한 공간 분포 분석 알고리즘을 개발하였다. 전체 이미지 도메인을 한 번에 분석하는데 소요되는 시간을 최소화하기 위하여 공간정보 행렬을 균등히 배분하고 별도의 프로세서에서 Feature를 분석한 후 개별 프로세서의 결과를 경합식으로 판정하는 기술을 연구하였다. 오픈 소스인 MPICH(www.mpich.org) 라이브러리를 이용하여 개발한 신호 분석 프로그램을 클러스터링으로 연동된 개별 코어에 설치/수행 하였다. 2D 행렬인 열분포 정보를 공간적으로 균등 분배하여 개별 코어에서 행렬의 Spatial domain analysis를 수행하였다. $20{\times}20$의 클러스터링 단위를 이용할 경우 총 12개의 코어가 필요하였으며, 초당 10회의 연산이 가능함을 확인하였다. 병렬 클러스터링 기술을 이용하여 1m/s 내외의 주행 속도에 대응이 가능한 비닐포장 상부 열 분포 분석 시스템을 구현하였다.

  • PDF

Deep Learning Approach for Automatic Discontinuity Mapping on 3D Model of Tunnel Face (터널 막장 3차원 지형모델 상에서의 불연속면 자동 매핑을 위한 딥러닝 기법 적용 방안)

  • Chuyen Pham;Hyu-Soung Shin
    • Tunnel and Underground Space
    • /
    • v.33 no.6
    • /
    • pp.508-518
    • /
    • 2023
  • This paper presents a new approach for the automatic mapping of discontinuities in a tunnel face based on its 3D digital model reconstructed by LiDAR scan or photogrammetry techniques. The main idea revolves around the identification of discontinuity areas in the 3D digital model of a tunnel face by segmenting its 2D projected images using a deep-learning semantic segmentation model called U-Net. The proposed deep learning model integrates various features including the projected RGB image, depth map image, and local surface properties-based images i.e., normal vector and curvature images to effectively segment areas of discontinuity in the images. Subsequently, the segmentation results are projected back onto the 3D model using depth maps and projection matrices to obtain an accurate representation of the location and extent of discontinuities within the 3D space. The performance of the segmentation model is evaluated by comparing the segmented results with their corresponding ground truths, which demonstrates the high accuracy of segmentation results with the intersection-over-union metric of approximately 0.8. Despite still being limited in training data, this method exhibits promising potential to address the limitations of conventional approaches, which only rely on normal vectors and unsupervised machine learning algorithms for grouping points in the 3D model into distinct sets of discontinuities.

A study on motion prediction and subband coding of moving pictuers using GRNN (GRNN을 이용한 동영상 움직임 예측 및 대역분할 부호화에 관한 연구)

  • Han, Young-Oh
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.3
    • /
    • pp.256-261
    • /
    • 2010
  • In this paper, a new nonlinear predictor using general regression neural network(GRNN) is proposed for the subband coding of moving pictures. The performance of a proposed nonlinear predictor is compared with BMA(Block Match Algorithm), the most conventional motion estimation technique. As a result, the nonlinear predictor using GRNN can predict well more 2-3dB than BMA. Specially, because of having a clustering process and smoothing noise signals, this predictor well preserves edges in frames after predicting the subband signal. This result is important with respect of human visual system and is excellent performance for the subband coding of moving pictures.

Reconstruction of 3D Building Model from Satellite Imagery Based on the Grouping of 3D Line Segments Using Centroid Neural Network (중심신경망을 이용한 3차원 선소의 군집화에 의한 위성영상의 3차원 건물모델 재구성)

  • Woo, Dong-Min;Park, Dong-Chul;Ho, Hai-Nguyen;Kim, Tae-Hyun
    • Korean Journal of Remote Sensing
    • /
    • v.27 no.2
    • /
    • pp.121-130
    • /
    • 2011
  • This paper highlights the reconstruction of the rectilinear type of 3D rooftop model from satellite image data using centroid neural network. The main idea of the proposed 3D reconstruction method is based on the grouping of 3D line segments. 3D lines are extracted by 2D lines and DEM (Digital Elevation Map) data evaluated from a pair of stereo images. Our grouping process consists of two steps. We carry out the first grouping process to group fragmented or duplicated 3D lines into the principal 3D lines, which can be used to construct the rooftop model, and construct the groups of lines that are parallel each other in the second step. From the grouping result, 3D rooftop models are reconstructed by the final clustering process. High-resolution IKONOS images are utilized for the experiments. The experimental result's indicate that the reconstructed building models almost reflect the actual position and shape of buildings in a precise manner, and that the proposed approach can be efficiently applied to building reconstruction problem from high-resolution satellite images of an urban area.

2D-THI: Two-Dimensional Type Hierarchy Index for XML Databases (2D-THI: XML 데이테베이스를 위한 이차원 타입상속 계층색인)

  • Lee Jong-Hak
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.3
    • /
    • pp.265-278
    • /
    • 2006
  • This paper presents a two-dimensional type inheritance hierarchy index(2D-THI) for XML databases. XML Schema is one of schema models for the XML documents supporting. The type inheritance. The conventional indexing techniques for XML databases can not support XML queries on type inheritance hierarchies. We construct a two-dimensional index structure using multidimensional file organizations for supporting type inheritance hierarchy in XML queries. This indexing technique deals with the problem of clustering index entries in the two-dimensional domain space that consists of a key element domain and a type identifier domain based on the user query pattern. This index enhances query performance by adjusting the degree of clustering between the two domains. For performance evaluation, we have compared our proposed 2D-THI with the conventional class hierarchy indexing techniques in object-oriented databases such as CH-index and CG-tree through the cost model. As the result of the performance evaluations, we have verified that our proposed two-dimensional type inheritance indexing technique can efficiently support the query Processing in XML databases according to the query types.

  • PDF

Segmentation of Multispectral MRI Using Fuzzy Clustering (퍼지 클러스터링을 이용한 다중 스펙트럼 자기공명영상의 분할)

  • 윤옥경;김현순;곽동민;김범수;김동휘;변우목;박길흠
    • Journal of Biomedical Engineering Research
    • /
    • v.21 no.4
    • /
    • pp.333-338
    • /
    • 2000
  • In this paper, an automated segmentation algorithm is proposed for MR brain images using T1-weighted, T2-weighted, and PD images complementarily. The proposed segmentation algorithm is composed of 3 step. In the first step, cerebrum images are extracted by putting a cerebrum mask upon the three input images. In the second step, outstanding clusters that represent inner tissues of the cerebrum are chosen among 3-dimensional(3D) clusters. 3D clusters are determined by intersecting densely distributed parts of 2D histogram in the 3D space formed with three optimal scale images. Optimal scale image is made up of applying scale space filtering to each 2D histogram and searching graph structure. Optimal scale image best describes the shape of densely distributed parts of pixels in 2D histogram and searching graph structure. Optimal scale image best describes the shape of densely distributed parts of pixels in 2D histogram. In the final step, cerebrum images are segmented using FCM algorithm with its initial centroid value as the outstanding clusters centroid value. The proposed cluster's centroid accurately. And also can get better segmentation results from the proposed segmentation algorithm with multi spectral analysis than the method of single spectral analysis.

  • PDF

A Study on the Development of Industrial Clusters in the International Science and Business Belt through the Industrial Clustering Analysis (산업 클러스터링 분석을 통한 국제과학비즈니스벨트의 클러스터 발전 방향 연구)

  • Jung, Hye-Jin;Og, Joo-Young;Kim, Byung-Keun;Ji, Il-Yong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.2
    • /
    • pp.370-379
    • /
    • 2018
  • The Korean government announced plans for the International Science Business Belt as a spatial area for promoting the linkage between scientific knowledge and commercialization in 2009. R&D and entrepreneurial activities are essential for the success of the International Science Business Belt. In particular, prioritizing the types of businesses is critical at the cluster establishment stage in that this largely affects the features and development of clusters comprising the International Science Business Belt. This research aims to predict the entry and growth of firms that specialize in four industrial clusters, including Big Science Cluster, Frontier Cluster, ICT Cluster, and Bio-Healthcare Cluster. For this purpose, we employ the Swann & Prevezer's industrial clustering model to identify sectors that affect the establishment and growth of industrial clusters in the International Science Business Belt, focusing on ICT, Bio-Healthcare and Frontier clusters. Data was collected from the 2014 Korean Innovation Survey (KIS) and University Alimi for the ICT cluster, 2014 National Bio Industry Survey and University Alimi for the Bio-Healthcare Cluster, and the 2015 National Nano Convergent Industry Survey and Annual Report of Nano Technology for the Frontier cluster. Empirical results show that the ICT service sector, bio process/equipment sector, and Nano electronic sector promote clustering in other sectors. Based on the analysis results, we discuss several policy implications and strategies that can attract relevant firms for the development of industrial clusters.

Line Drawings from 2D Images (이차원 영상의 라인 드로잉)

  • Son, Min-Jung;Lee, Seung-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.12
    • /
    • pp.665-682
    • /
    • 2007
  • Line drawing is a widely used style in non-photorealistic rendering because it generates expressive descriptions of object shapes with a set of strokes. Although various techniques for line drawing of 3D objects have been developed, line drawing of 2D images has attracted little attention despite interesting applications, such as image stylization. This paper presents a robust and effective technique for generating line drawings from 2D images. The algorithm consists of three parts; filtering, linking, and stylization. In the filtering process, it constructs a likelihood function that estimates possible positions of lines in an image. In the linking process, line strokes are extracted from the likelihood function using clustering and graph search algorithms. In the stylization process, it generates various kinds of line drawings by applying curve fitting and texture mapping to the extracted line strokes. Experimental results demonstrate that the proposed technique can be applied to the various kinds of line drawings from 2D images with detail control.

Construction of Theme Melody Index by Transforming Melody to Time-series Data for Content-based Music Information Retrieval (내용기반 음악정보 검색을 위한 선율의 시계열 데이터 변환을 이용한 주제선율색인 구성)

  • Ha, Jin-Seok;Ku, Kyong-I;Park, Jae-Hyun;Kim, Yoo-Sung
    • The KIPS Transactions:PartD
    • /
    • v.10D no.3
    • /
    • pp.547-558
    • /
    • 2003
  • From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user's query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.

Similar Trajectory Retrieval on Road Networks using Spatio-Temporal Similarity (시공간 유사성을 이용한 도로 네트워크 상의 유사한 궤적 검색)

  • Hwang Jung-Rae;Kang Hye-Young;Li Ki-Joune
    • The KIPS Transactions:PartD
    • /
    • v.13D no.3 s.106
    • /
    • pp.337-346
    • /
    • 2006
  • In order to analyze the behavior of moving objects, a measure for determining the similarity of trajectories needs to be defined. Although research has been conducted that retrieved similar trajectories of moving objects in Euclidean space, very little research has been conducted on moving objects in the space defined by road networks. In terms of real applications, most moving objects are located in road network space rather than in Euclidean space. In similarity measure between trajectories, however, previous methods were based on Euclidean distance and only considered spatial similarity. In this paper, we define similarity measure based on POI and TOI in road network space. With this definition, we present methods to retrieve similar trajectories using spatio-temporal similarity between trajectories. We show clustering results for similar trajectories. Experimental results show that similar trajectories searched by each method and consistency rate between each method for the searched trajectories.