• 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.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.231-233
• /
• 2010

Many algorithms for processing LIDAR data are being 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 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.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.4
• /
• pp.29-38
• /
• 2018

In this paper, we propose an automatic segmentation method of meniscus in knee MR images by automatic meniscus localization, multi-atlas-based locally-weighted voting, and patch-based edge feature classification. First, after segmenting the bone and knee articular cartilage, the volume of interest of the meniscus is automatically localized. Second, the meniscus is segmented by multi-atlas-based locally-weighted voting taking into account the weights of shape and intensity distribution in the volume of interest of the meniscus. Finally, to remove leakage to the collateral ligaments with similar intensity, meniscus is refined using patch-based edge feature classification considering shape and distance weights. Dice similarity coefficient between proposed method and manual segmentation were 80.13% of medial meniscus and 80.81 % for lateral meniscus, and showed better results of 7.25% for medial meniscus and 1.31% for lateral meniscus compared to the multi-atlas-based locally-weighted voting.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.471-472
• /
• 2012

The active shape model(ASM) is one of the most popular methods among the shape prior based segmentation methods based on its strong shape constraints using the statistic of shape information which is acquired from the training set. ASM has a few drawbacks, such as, the lack of shape variability, and the sensitivity for false locally searched points. In this paper, we suggest the patch-wise robust ASM to overcome the limitations of the ASM. In addition to the SSM, we introduce the patch-wise SSM, to reduce the shape inflexibility and to search reliable points with the point reliance measurement. The quantitative and qualitative results show the robustmness and the accuracy of the proposed method.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.1
• /
• pp.47-56
• /
• 2010

The use of airborne LiDAR data obtained by airborne laser scanners has increased in the field of spatial information such as building modeling. LiDAR data consist of irregularly distributed 3D coordinates and lack visual and semantic information. Therefore, LiDAR data processing is complicate. This study suggested a method of LiDAR data segmentation using roof surface patches from aerial images. Each segmented patch was modeled by analyzing geometric characteristics of the LiDAR data. The optimal functions could be determined with segmented data that fits various shapes of the roof surfaces as flat and slanted planes, dome and arch types. However, satisfiable segmentation results were not obtained occasionally due to shadow and tonal variation on the images. Therefore, methods to remove unnecessary edges result in incorrect segmentation are required.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.59-64
• /
• 2002

This paper presents a method for line segment extraction for 3-d building reconstruction. Building roofs are described as a set of planar polygonal patches, each of which is extracted by watershed-based image segmentation, line segment matching and coplanar grouping. Coplanar grouping and polygonal patch formation are performed per region by selecting 3-d line segments that are matched using epipolar geometry and flight information. The algorithm has been applied to high resolution aerial images and the results show accurate 3-d building reconstruction.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.29 no.9_10 s.146
• /
• pp.1359-1368
• /
• 2005

When we develop the tight-fit 2D pattern from the 3D scan data, segmentation of the 3D scan data into several parts is necessary to make a curved surface into a flat plane. In this study, Garland's method of triangle simplification was adopted to reduce the number of data point without distorting the original shape. The Runge-Kutta method was applied to make triangular patch from the 3D surface in a 2D plane. We also explored the detailed arrangement method of small 2D patches to make a tight-fit pattern for a male body. As results, minimum triangle numbers in the simplification process and efficient arrangement methods of many pieces were suggested for the optimal 2D pattern development. Among four arrangement methods, a block method is faster and easier when dealing with the triangle patches of male's upper body. Anchoring neighboring vertices of blocks to make 2D pattern was observed to be a reasonable arrangement method to get even distribution of stress in a 2D plane.

• 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.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.24 no.1
• /
• pp.111-121
• /
• 2006

Recently, many studies have been performed to apply airborne LIDAR data to extracting urban models. In order to model efficiently the man-made objects which are the main components of these urban models, it is important to extract automatically planar patches from the set of the measured three-dimensional points. Although some research has been carried out for their automatic extraction, no method published yet is sufficiently satisfied in terms of the accuracy and completeness of the segmentation results and their computational efficiency. This study thus aimed to developing an efficient approach to automatic segmentation of planar patches from the three-dimensional points acquired by an airborne LIDAR system. The proposed method consists of establishing adjacency between three-dimensional points, grouping small number of points into seed patches, and growing the seed patches into surface patches. The core features of this method are to improve the segmentation results by employing the variable threshold value repeatedly updated through a statistical analysis during the patch growing process, and to achieve high computational efficiency using priority heaps and sequential least squares adjustment. The proposed method was applied to real LIDAR data to evaluate the performance. Using the proposed method, LIDAR data composed of huge number of three dimensional points can be converted into a set of surface patches which are more explicit and robust descriptions. This intermediate converting process can be effectively used to solve object recognition problems such as building extraction.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.465-467
• /
• 1992

This paper shows 3D vision system based on halftone image analysis. Any halftone image has its own surface vector normal to surface patch. To classily the given 3D images, all the patch on 3D object are transformed to black/white halftone. First we extract the general learning patterns which represents required slopes and their attributes. And next we propose 3D segmentation by searching intensity, slope and density. Artificial neural network is found to be very suitable in this approach, because it has powerful learning quality and noise tolerant. In this study, 3D shape reconstruct using pyramidian model. Our results are evaluated to enhance the quality.