• Title/Summary/Keyword: data segmentation

Search Result 1,234, Processing Time 0.027 seconds

Airborne LiDAR Simulation Data Generation of Complex Polyhedral Buildings and Automatic Modeling (다양한 건물의 항공 라이다 시뮬레이션 데이터 생성과 자동 모델링)

  • Kim, Jung-Hyun;Jeon, Young-Jae;Lee, Dong-Cheon
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2010.04a
    • /
    • pp.235-238
    • /
    • 2010
  • Since the mid 1990s airborne LiDAR data have been widely used, automation of building modeling is getting a central issue. LiDAR data processing for building modeling is involved with extracting surface patch elements by segmentation and surface fitting with optimal mathematical functions. In this study, simulation LiDAR data were generated with complex polyhedral roofs of buildings and an automatic modeling approach was proposed.

  • PDF

Effect of Learning Data on the Semantic Segmentation of Railroad Tunnel Using Deep Learning (딥러닝을 활용한 철도 터널 객체 분할에 학습 데이터가 미치는 영향)

  • Ryu, Young-Moo;Kim, Byung-Kyu;Park, Jeongjun
    • Journal of the Korean Geotechnical Society
    • /
    • v.37 no.11
    • /
    • pp.107-118
    • /
    • 2021
  • Scan-to-BIM can be precisely mod eled by measuring structures with Light Detection And Ranging (LiDAR) and build ing a 3D BIM (Building Information Modeling) model based on it, but has a limitation in that it consumes a lot of manpower, time, and cost. To overcome these limitations, studies are being conducted to perform semantic segmentation of 3D point cloud data applying deep learning algorithms, but studies on how segmentation result changes depending on learning data are insufficient. In this study, a parametric study was conducted to determine how the size and track type of railroad tunnels constituting learning data affect the semantic segmentation of railroad tunnels through deep learning. As a result of the parametric study, the similar size of the tunnels used for learning and testing, the higher segmentation accuracy, and the better results when learning through a double-track tunnel than a single-line tunnel. In addition, when the training data is composed of two or more tunnels, overall accuracy (OA) and mean intersection over union (MIoU) increased by 10% to 50%, it has been confirmed that various configurations of learning data can contribute to efficient learning.

A Fast Lower Extremity Vessel Segmentation Method for Large CT Data Sets Using 3-Dimensional Seeded Region Growing and Branch Classification

  • Kim, Dong-Sung
    • Journal of Biomedical Engineering Research
    • /
    • v.29 no.5
    • /
    • pp.348-354
    • /
    • 2008
  • Segmenting vessels in lower extremity CT images is very difficult because of gray level variation, connection to bones, and their small sizes. Instead of segmenting vessels, we propose an approach that segments bones and subtracts them from the original CT images. The subtracted images can contain not only connected vessel structures but also isolated vessels, which are very difficult to detect using conventional vessel segmentation methods. The proposed method initially grows a 3-dimensional (3D) volume with a seeded region growing (SRG) using an adaptive threshold and then detects junctions and forked branches. The forked branches are classified into either bone branches or vessel branches based on appearance, shape, size change, and moving velocity of the branch. The final volume is re-grown by collecting connected bone branches. The algorithm has produced promising results for segmenting bone structures in several tens of vessel-enhanced CT image data sets of lower extremities.

A Study on Customer Segmentation Prediction Model using Support Vector Machine (Support Vector Machine을 이용한 고객이탈 예측모형에 관한 연구)

  • Seo Kwang Kyu
    • Journal of the Korea Safety Management & Science
    • /
    • v.7 no.1
    • /
    • pp.199-210
    • /
    • 2005
  • Customer segmentation prediction has attracted a lot of research interests in previous literature, and recent studies have shown that artificial neural networks (ANN) method achieved better performance than traditional statistical ones. However, ANN approaches have suffered from difficulties with generalization, producing models that can overfit the data. This paper employs a relatively new machine learning technique, support vector machines (SVM), to the customer segmentation prediction problem in an attempt to provide a model with better explanatory power. To evaluate the prediction accuracy of SVM, we compare its performance with logistic regression analysis and ANN. The experiment results with real data of insurance company show that SVM superiors to them.

An Approach for Segmentation of Airborne Laser Point Clouds Utilizing Scan-Line Characteristics

  • Han, Soo-Hee;Lee, Jeong-Ho;Yu, Ki-Yun
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.641-648
    • /
    • 2007
  • In this study, we suggest a new segmentation algorithm for processing airborne laser point cloud data which is more memory efficient and faster than previous approaches. The main principle is the reading of data points along a scan line and their direct classification into homogeneous groups as a single process. The results of our experiments demonstrate that the algorithm runs faster and is more memory efficient than previous approaches. Moreover, the segmentation accuracy is generally acceptable.

  • PDF

Color image segmentation using the possibilistic C-mean clustering and region growing (Possibilistic C-mean 클러스터링과 영역 확장을 이용한 칼라 영상 분할)

  • 엄경배;이준환
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.3
    • /
    • pp.97-107
    • /
    • 1997
  • Image segmentation is teh important step in image infromation extraction for computer vison sytems. Fuzzy clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are derived from the fuzzy c-means (FCM) algorithm. The FCM algorithm uses th eprobabilistic constraint that the memberships of a data point across classes sum to 1. However, the memberships resulting from the FCM do not always correspond to the intuitive concept of degree of belongingor compatibility. moreover, the FCM algorithm has considerable trouble above under noisy environments in the feature space. Recently, the possibilistic C-mean (PCM) for solving growing for color image segmentation. In the PCM, the membersip values may be interpreted as degrees of possibility of the data points belonging to the classes. So, the problems in the FCM can be solved by the PCM. The clustering results by just PCM are not smoothly bounded, and they often have holes. So, the region growing was used as a postprocessing. In our experiments, we illustrated that the proposed method is reasonable than the FCM in noisy enviironments.

  • PDF

Railroad Surface Defect Segmentation Using a Modified Fully Convolutional Network

  • Kim, Hyeonho;Lee, Suchul;Han, Seokmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.12
    • /
    • pp.4763-4775
    • /
    • 2020
  • This research aims to develop a deep learning-based method that automatically detects and segments the defects on railroad surfaces to reduce the cost of visual inspection of the railroad. We developed our segmentation model by modifying a fully convolutional network model [1], a well-known segmentation model used for machine learning, to detect and segment railroad surface defects. The data used in this research are images of the railroad surface with one or more defect regions. Railroad images were cropped to a suitable size, considering the long height and relatively narrow width of the images. They were also normalized based on the variance and mean of the data images. Using these images, the suggested model was trained to segment the defect regions. The proposed method showed promising results in the segmentation of defects. We consider that the proposed method can facilitate decision-making about railroad maintenance, and potentially be applied for other analyses.

Ensemble UNet 3+ for Medical Image Segmentation

  • JongJin, Park
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.1
    • /
    • pp.269-274
    • /
    • 2023
  • In this paper, we proposed a new UNet 3+ model for medical image segmentation. The proposed ensemble(E) UNet 3+ model consists of UNet 3+s of varying depths into one unified architecture. UNet 3+s of varying depths have same encoder, but have their own decoders. They can bridge semantic gap between encoder and decoder nodes of UNet 3+. Deep supervision was used for learning on a total of 8 nodes of the E-UNet 3+ to improve performance. The proposed E-UNet 3+ model shows better segmentation results than those of the UNet 3+. As a result of the simulation, the E-UNet 3+ model using deep supervision was the best with loss function values of 0.8904 and 0.8562 for training and validation data. For the test data, the UNet 3+ model using deep supervision was the best with a value of 0.7406. Qualitative comparison of the simulation results shows the results of the proposed model are better than those of existing UNet 3+.

Simulation Based Performance Assessment of a LIDAR Data Segmentation Algorithm (라이다데이터 분할 알고리즘의 시뮬레이션 기반 성능평가)

  • Kim, Seong-Joon;Lee, Im-Pyeong
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.18 no.2
    • /
    • pp.119-129
    • /
    • 2010
  • Many algorithms for processing LIDAR data have been developed for diverse applications not limited to patch segmentation, bare-earth filtering and building extraction. However, since we cannot exactly know the true locations of individual LIDAR points, it is difficult to assess the performance of a LIDAR data processing algorithm. In this paper, we thus attempted the performance assessment of the segmentation algorithm developed by Lee (2006) using the LIDAR data generated through simulation based on sensor modelling. Consequently, based on simulation, we can perform the performance assessment of a LIDAR processing algorithm more objectively and quantitatively with an automatic procedure.

A Method of Color Image Segmentation Based on DBSCAN(Density Based Spatial Clustering of Applications with Noise) Using Compactness of Superpixels and Texture Information (슈퍼픽셀의 밀집도 및 텍스처정보를 이용한 DBSCAN기반 칼라영상분할)

  • Lee, Jeonghwan
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.4
    • /
    • pp.89-97
    • /
    • 2015
  • In this paper, a method of color image segmentation based on DBSCAN(Density Based Spatial Clustering of Applications with Noise) using compactness of superpixels and texture information is presented. The DBSCAN algorithm can generate clusters in large data sets by looking at the local density of data samples, using only two input parameters which called minimum number of data and distance of neighborhood data. Superpixel algorithms group pixels into perceptually meaningful atomic regions, which can be used to replace the rigid structure of the pixel grid. Each superpixel is consist of pixels with similar features such as luminance, color, textures etc. Superpixels are more efficient than pixels in case of large scale image processing. In this paper, superpixels are generated by SLIC(simple linear iterative clustering) as known popular. Superpixel characteristics are described by compactness, uniformity, boundary precision and recall. The compactness is important features to depict superpixel characteristics. Each superpixel is represented by Lab color spaces, compactness and texture information. DBSCAN clustering method applied to these feature spaces to segment a color image. To evaluate the performance of the proposed method, computer simulation is carried out to several outdoor images. The experimental results show that the proposed algorithm can provide good segmentation results on various images.