• Title/Summary/Keyword: 3-D Segmentation

Search Result 452, Processing Time 0.036 seconds

Comparison of Performance of Medical Image Semantic Segmentation Model in ATLASV2.0 Data (ATLAS V2.0 데이터에서 의료영상 분할 모델 성능 비교)

  • So Yeon Woo;Yeong Hyeon Gu;Seong Joon Yoo
    • Journal of Broadcast Engineering
    • /
    • v.28 no.3
    • /
    • pp.267-274
    • /
    • 2023
  • There is a problem that the size of the dataset is insufficient due to the limitation of the collection of the medical image public data, so there is a possibility that the existing studies are overfitted to the public dataset. In this paper, we compare the performance of eight (Unet, X-Net, HarDNet, SegNet, PSPNet, SwinUnet, 3D-ResU-Net, UNETR) medical image semantic segmentation models to revalidate the superiority of existing models. Anatomical Tracings of Lesions After Stroke (ATLAS) V1.2, a public dataset for stroke diagnosis, is used to compare the performance of the models and the performance of the models in ATLAS V2.0. Experimental results show that most models have similar performance in V1.2 and V2.0, but X-net and 3D-ResU-Net have higher performance in V1.2 datasets. These results can be interpreted that the models may be overfitted to V1.2.

Brain Hologram Visualization for Diagnosis of Tumors using Graphic Imaging

  • Nam, Jenie;Kim, Young Jae;Lee, Seung Hyun;Kim, Kwang Gi
    • Journal of Multimedia Information System
    • /
    • v.3 no.3
    • /
    • pp.47-52
    • /
    • 2016
  • This research paper examines the usage of graphic imaging in Holographic Projections to further advance the medical field. It highlights the importance and necessity of this technology as well as avant-garde techniques applied in the process of displaying images in digital holography. This paper also discusses the different types of applications for holograms in society today. Different tools were utilized to transfer a set of a cancer patient's brain tumor data into data used to produce a 3D holographic image. This image was produced through the transfer of data from one program to another. Through the use of semi-automatic segmentation through the seed region method, we were able to create a 3D visualization from Computed Tomography (CT) data.

LiDAR Data Segmentation Using Aerial Images for Building Modeling (항공영상에 의한 LiDAR 데이터 분할에 기반한 건물 모델링)

  • Lee, Jin-Hyung;Lee, Dong-Cheon
    • 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.

3D conversion of 2D video using depth layer partition (Depth layer partition을 이용한 2D 동영상의 3D 변환 기법)

  • Kim, Su-Dong;Yoo, Ji-Sang
    • Journal of Broadcast Engineering
    • /
    • v.16 no.1
    • /
    • pp.44-53
    • /
    • 2011
  • In this paper, we propose a 3D conversion algorithm of 2D video using depth layer partition method. In the proposed algorithm, we first set frame groups using cut detection algorithm. Each divided frame groups will reduce the possibility of error propagation in the process of motion estimation. Depth image generation is the core technique in 2D/3D conversion algorithm. Therefore, we use two depth map generation algorithms. In the first, segmentation and motion information are used, and in the other, edge directional histogram is used. After applying depth layer partition algorithm which separates objects(foreground) and the background from the original image, the extracted two depth maps are properly merged. Through experiments, we verify that the proposed algorithm generates reliable depth map and good conversion results.

A Novel Horizontal Disparity Estimation Algorithm Using Stereoscopic Camera Rig

  • Ramesh, Rohit;Shin, Heung-Sub;Jeong, Shin-Il;Chung, Wan-Young
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.1
    • /
    • pp.83-88
    • /
    • 2011
  • Abstract. Image segmentation is always a challenging task in computer vision as well as in pattern recognition. Nowadays, this method has great importance in the field of stereo vision. The disparity information extracting from the binocular image pairs has essential relevance in the fields like Stereoscopic (3D) Imaging Systems, Virtual Reality and 3D Graphics. The term 'disparity' represents the horizontal shift between left camera image and right camera image. Till now, many methods are proposed to visualize or estimate the disparity. In this paper, we present a new technique to visualize the horizontal disparity between two stereo images based on image segmentation method. The process of comparing left camera image with right camera image is popularly known as 'Stereo-Matching'. This method is used in the field of stereo vision for many years and it has large contribution in generating depth and disparity maps. Correlation based stereo-matching are used most of the times to visualize the disparity. Although, for few stereo image pairs it is easy to estimate the horizontal disparity but in case of some other stereo images it becomes quite difficult to distinguish the disparity. Therefore, in order to visualize the horizontal disparity between any stereo image pairs in more robust way, a novel stereo-matching algorithm is proposed which is named as "Quadtree Segmentation of Pixels Disparity Estimation (QSPDE)".

A study on image segmentation for depth map generation (깊이정보 생성을 위한 영상 분할에 관한 연구)

  • Lim, Jae Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.10
    • /
    • pp.707-716
    • /
    • 2017
  • The advances in image display devices necessitate display images suitable for the user's purpose. The display devices should be able to provide object-based image information when a depthmap is required. In this paper, we represent the algorithm using a histogram-based image segmentation method for depthmap generation. In the conventional K-means clustering algorithm, the number of centroids is parameterized, so existing K-means algorithms cannot adaptively determine the number of clusters. Further, the problem of K-means algorithm tends to sink into the local minima, which causes over-segmentation. On the other hand, the proposed algorithm is adaptively able to select centroids and can stand on the basis of the histogram-based algorithm considering the amount of computational complexity. It is designed to show object-based results by preventing the existing algorithm from falling into the local minimum point. Finally, we remove the over-segmentation components through connected-component labeling algorithm. The results of proposed algorithm show object-based results and better segmentation results of 0.017 and 0.051, compared to the benchmark method in terms of Probabilistic Rand Index(PRI) and Segmentation Covering(SC), respectively.

The Algorithm of Protein Spots Segmentation using Watersheds-based Hierarchical Threshold (Watersheds 기반 계층적 이진화를 이용한 단백질 반점 분할 알고리즘)

  • Kim Youngho;Kim JungJa;Kim Daehyun;Won Yonggwan
    • The KIPS Transactions:PartB
    • /
    • v.12B no.3 s.99
    • /
    • pp.239-246
    • /
    • 2005
  • Biologist must have to do 2DGE biological experiment for Protein Search and Analysis. This experiment coming into being 2 dimensional image. 2DGE (2D Gel Electrophoresis : two dimensional gel electrophoresis) image is the most widely used method for isolating of the objective protein by comparative analysis of the protein spot pattern in the gel plane. The process of protein spot analysis, firstly segment protein spots that are spread in 2D gel plane by image processing and can find important protein spots through comparative analysis with protein pattern of contrast group. In the algorithm which detect protein spots, previous 2DGE image analysis is applies gaussian fitting, however recently Watersheds region based segmentation algorithm, which is based on morphological segmentation is applied. Watersheds has the benefit that segment rapidly needed field in big sized image, however has under-segmentation and over-segmentation of spot area when gray level is continuous. The drawback was somewhat solved by marker point institution, but needs the split and merge process. This paper introduces a novel marker search of protein spots by watersheds-based hierarchical threshold, which can resolve the problem of marker-driven watersheds.

Three-Dimensional Active Shape Models for Medical Image Segmentation (의료영상 분할을 위한 3차원 능동 모양 모델)

  • Lim, Seong-Jae;Jeong, Yong-Yeon;Ho, Yo-Sung
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.44 no.5
    • /
    • pp.55-61
    • /
    • 2007
  • In this paper, we propose a three-dimensional(3D) active shape models for medical image segmentation. In order to build a 3D shape model, we need to generate a point distribution model(PDM) and select corresponding landmarks in all the training shapes. The manual determination method, two-dimensional(2D) method, and limited 3D method of landmark correspondences are time-consuming, tedious, and error-prone. In this paper, we generate a 3D statistical shape model using the 3D model generation method of a distance transform and a tetrahedron method for landmarking. After generating the 3D model, we extend the shape model training and gray-level model training of 2D active shape models(ASMs) and we use the integrated modeling process with scale and gray-level models for the appearance profile to represent the local structure. Experimental results are comparable to those of region-based, contour-based methods, and 2D ASMs.

Image Coding Using DCT and Block Hierarchical Segmentation Finite-State Vector Quantization (DCT와 블록 계층 분할 유한상태 벡터 양자화를 이용한 영상 부호화)

  • Jo, Seong-Hwan;Kim, Eung-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.3
    • /
    • pp.1013-1020
    • /
    • 2000
  • In this paper, we propose an algorithm which segments hierarchically blocks of image using discrete cosine transform(DCT) and execute finite-state vector quantization (FSVQ) for each block. Using DCT coefficient feature, image is segmented hierarchically to large smooth block and small edge block, then the block hierarchy informations are transmitted. The codebooks are respectively constructed for each hierarchical blocks, the encoder transmits codeword index using FSVQ for reducing encoded bit with hierarchical segmentation. Compared with side match VQ(SMVQ) and hierarchical FSVQ(HFSVQ) algorithm, about Zelda and Boat image, the new algorithm shows better picture quality with 1.97dB and 2.85 dB difference as to SMVQ, 1.78dB and 1.85dB diffences as to HFSVQ respectively.

  • PDF