• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.75-81
• /
• 2010

The segmentation of cartilage is crucial for the diagnose and treatment of osteoarthritis (OA), and has mostly been done manually by an expert, requiring a considerable amount of time and effort due to the thin shape and vague boundaries of the cartilage in MR (magnetic resonance) images. In this paper, we propose a fully automatic method to segment cartilage in a knee joint on MR images. The proposed method is based on a small number of manually segmented images as the training set and comprised of an initial per patch segmentation process and a global refinement process on the cumulative per patch results. Each patch for per patch segmentation is positioned by classifying the bone-cartilage interface on the pre-segmented bone surface. Next, the shape and intensity priors are constructed for each patch based on information extracted from reference patches in the training set. The ratio of influence between the shape and intensity priors is adaptively determined per patch. Each patch is segmented by graph cuts, where energy is defined based on constructed priors. Finally, global refinement is conducted on the global cartilage using the results of per patch segmentation as the shape prior. Experimental evaluation shows that the proposed framework provide accurate and clinically useful segmentation results.

• ETRI Journal
• /
• v.46 no.4
• /
• pp.683-696
• /
• 2024

The point cloud provides viewers with intuitive geometric understanding but requires a huge amount of data. Moving Picture Experts Group (MPEG) has developed video-based point-cloud compression in the range of 300-700. As the compression rate increases, the complexity increases to the extent that it takes 101.36 s to compress one frame in an experimental environment using a personal computer. To realize real-time point-cloud compression processing, the direct patch projection (DPP) method proposed herein simplifies the complex patch segmentation process by classifying and projecting points according to their geometric positions. The DPP method decreases the complexity of the patch segmentation from 25.75 s to 0.10 s per frame, and the entire process becomes 8.76 times faster than the conventional one. Consequently, this proposed DPP method yields similar peak signal-to-noise ratio (PSNR) outcomes to those of the conventional method at reduced times (4.7-5.5 times) at the cost of bitrate overhead. The objective and subjective results show that the proposed DPP method can be considered when low-complexity requirements are required in lightweight device environments.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.376-381
• /
• 1992

This paper presents an expert system for the segmentation of a 2.5-D image. The results of two segmentation approaches, edge-based and region-based, are combined to produce a consistent and reliable segmentation. Rich information embedded in the 2.5-D image is utilized to obtain a view independent surface patch description of the image, which can facilitate object recognition considerably.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.99-107
• /
• 2004

In stereo matching system, it is efficient using segment patch, which divides the image into homogeneous region in color or similar intensity, because it preserves the disparity boundary and disparity continuity in low textured region. But many miss matching occur in the highly textured region because of the over segmentation that makes patch small and ambiguous. In this paper, in order to solve problems, we propose adaptive patch matching based on the watershed image segmentation. Performance was verified in experimental results.

• Journal of information and communication convergence engineering
• /
• v.13 no.3
• /
• pp.205-214
• /
• 2015

In this paper, we propose a new approach to learning a discriminative model for figure/ground segmentation by incorporating the bag-of-features and conditional random field (CRF) techniques. We advocate the use of image patches instead of superpixels as the basic processing unit. The latter has a homogeneous appearance and adheres to object boundaries, while an image patch often contains more discriminative information (e.g., local image structure) to distinguish its categories. We use pixel-level sparse coding to represent an image patch. With the proposed feature representation, the unary classifier achieves a considerable binary segmentation performance. Further, we integrate unary and pairwise potentials into the CRF model to refine the segmentation results. The pairwise potentials include color and texture potentials with neighborhood interactions, and an edge potential. High segmentation accuracy is demonstrated on three benchmark datasets: the Weizmann horse dataset, the VOC2006 cow dataset, and the MSRC multiclass dataset. Extensive experiments show that the proposed approach performs favorably against the state-of-the-art approaches.

• International Journal of CAD/CAM
• /
• v.7 no.1
• /
• pp.31-40
• /
• 2007

Reverse engineering of reliefs aims to turn an existing relief superimposed on an underlying surface into a geometric model which may be applied to a different base surface. Steps in this process include segmenting the relief from the background, and describing it as an offset height field relative to the underlying surface. We have previously considered relief segmentation using a geometric snake. Here, we show how to use this initial segmentation to estimate the background surface lying under the relief, which can be used (i) to refine the segmentation and (ii) to express the relief as an offset field. Our approach fits a B-spline surface patch to the measured background data surrounding the relief, while tension terms ensure this background surface smoothly continues underneath the relief where there are no measured background data points to fit. After making an initial estimate of relief offset height everywhere within the patch, we use a support vector machine to refine the segmentation. Tests demonstrate that this approach can accurately model the background surface where it underlies the relief, providing more accurate segmentation, as well as relief height field estimation. In particular, this approach provides significant improvements for relief concavities with narrow mouths and can segment reliefs with small internal holes.

• Journal of the Korean Society of Industry Convergence
• /
• v.25 no.4_2
• /
• pp.573-586
• /
• 2022

Corrosion can cause dangerous and expensive damage and failures of ship hulls and equipment. Therefore, it is necessary to maintain the vessel by periodic corrosion inspections. During visual inspection, many corrosion locations are inaccessible for many reasons, especially safety's point of view. Including subjective decisions of inspectors is one of the issues of visual inspection. Automation of visual inspection is tried by many pieces of research. In this study, we propose image preprocessing methods by image patch segmentation and thresholding. YOLOv5 was used as an object detection model after the image preprocessing. Finally, it was evaluated that corrosion detection performance using the proposed method was improved in terms of mean average precision.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.22-29
• /
• 2002

This paper presents an algorithm for segmentation of 3D triangular mesh data. The proposed algorithm uses iterative merging of adjacent triangle pairs based on the orientation of triangles. The surface is segmented into patches, where each patch has a similar normal property Thus, each region can be approximated to planar patch and its boundaries have perceptually important geometric information of the entire mesh model. The experimental results show that the Proposed algorithm is peformed efficiently.

• Journal of Broadcast Engineering
• /
• v.24 no.4
• /
• pp.592-601
• /
• 2019

For coronary procedures, X-ray angiogram images are useful for diagnosing and assisting procedures. It is challenging to accurately segment a coronary artery using only a single segmentation model in 2D X-ray images due to a complex structure of three-dimensional coronary artery, especially from phenomenon of vessels being broken in the middle or end of coronary artery. In order to solve these problems, the initial segmentation is performed using an existing single model, and the candidate regions for the sophisticate correction is estimated based on the initial segment, and the local patch-based correction is performed in the candidate regions. Through this research, not only the broken coronary arteries are re-connected, but also the distal part of coronary artery that is very thin is additionally correctly found. Further, the performance can be much improved by combining the proposed correction method with any existing coronary artery segmentation method. In this paper, the U-net, a fully convolutional network was chosen as a segmentation method and the proposed correction method was combined with U-net to demonstrate a significant improvement in performance through X-ray images from several patients.

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

Recent developments in sensor technologies have provided remotely sensed data with very high spatial resolution. In order to fully utilize the potential of high resolution images, new image classification strategies are necessary. Unfortunately, the high resolution images increase the spectral within-field variability, and the classification accuracy of traditional methods based on pixel-based classification algorithms such as Maximum-Likelihood method may be decreased (Schiewe 2001). Recent development in Object Oriented Classification based on image segmentation algorithms can be used for the classification of forest patches on rugged terrain of Korea. The objectives of this paper are as follows. First, to compare the pros and cons of image classification methods based on pixel-based and object oriented classification algorithm for the forest patch classification. Landsat ETM＋ data and IKONOS data will be used for the classification. Second, to investigate ways to increase classification accuracy of forest patches. Supplemental data such as DTM and Forest Type Map of 1:25,000 scale are used for topographic correction and image segmentation. Third, to propose the best classification strategy for forest patch classification in terms of accuracy and data requirement. The research site for this paper is Namhansansung Provincial Park located at the eastern suburb of Seoul Metropolitan City for its diverse forest patch types and data availability. Both Landsat ETM＋ and IKONOS data are used for the classification. Preliminary results can be summarized as follows. First, topographic correction of reflectance is essential for the classification of forest patches on rugged terrain. Second, object oriented classification of IKONOS data enables higher classification accuracy compared to Landsat ETM＋ and pixel-based classification. Third, multi-stage segmentation is very useful to investigate landscape ecological aspect of forest communities of Korea.