• 대한의용생체공학회:의공학회지
• /
• 제30권2호
• /
• pp.153-161
• /
• 2009

Mammogram is one of the important techniques for mass detection, which is the early diagnosis stage of a breast cancer. Especially, the CAD(Computer Aided Diagnosis) using mammogram improves the working performance of radiologists as it offers an effective mass detection. There are two types of CAD systems using mammogram; automatic and semi-automatic CAD systems. However, the automatic segmentation is limited in performance due to the difficulty of obtaining an accurate segmentation since mass occurs in the dense areas of the breast tissue and has smoother boundaries. Semi-automatic CAD systems overcome these limitations, however, they also have problems including high FP (False Positive) rate and a large amount of training data required for training a classifier. The proposed system which overcomes the aforementioned problems to detect mass is composed of the suspected area selection, the level set segmentation and SVM (Support Vector Machine) classification. To assess the efficacy of the system, 60 test images from the FFDM (Full-Field Digital Mammography) are analyzed and compared with the previous semi-automatic system, which uses the ANN classifier. The experimental results of the proposed system indicate higher accuracy of detecting mass in comparison to the previous systems.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제12권2호
• /
• pp.175-185
• /
• 2012

Predictive watershed transform is a popular object segmentation algorithm which achieves a speed-up by identifying image regions that are different from the previous frame and performing object segmentation only for those regions. However, incorrect segmentation is often generated by the predictive watershed transform which uses only local information in merge-split decision on boundary regions. This paper improves the predictive watershed transform to increase the accuracy of segmentation results by using the additional information about the root of boundary regions. Furthermore, the proposed algorithm is processed in a block-based manner such that an image frame is decomposed into blocks and each block is processed independently of the other blocks. The block-based approach makes it easy to implement the algorithm in hardware and also permits an extension for parallel execution. Experimental results show that the proposed watershed transform produces more accurate segmentation results than the predictive watershed transform.

• 정보처리학회논문지B
• /
• 제13B권3호
• /
• pp.255-274
• /
• 2006

비디오에서 움직이는 객체의 외곽선은 객체를 정확하게 분할하기 위하여 매우 중요하다. 그러나 움직이는 객체의 외곽선에는 단락된 외곽선들이 존재하게 된다. 우리는 단락된 외곽선을 연결할 수 있는 새로운 외곽선 연결 알고리즘을 개발하였다. 외곽선 연결 알고리즘은 단락된 외곽선의 말단 픽셀에 사분면을 형성하고 동심원을 구성하면서 반지름 내에서 다른 말단 픽셀을 찾는 탐색을 전진하면서 수행한다. 외곽선 연결 알고리즘은 객체의 외곽선에서 가장 짧게 외곽선을 연결한다. 그리고 시스템은 비디오로부터 배경을 구하여 저장한다. 시스템은 외곽선 연결로부터 객체 마스크를 생성하고, 배경된 저장으로부터 또 하나의 객체 마스크를 생성하여 이 두 개의 객체 마스크를 보완적으로 사용하여 움직이는 객체를 분할한다. 논문의 주요 장점은 정확한 객체 분할을 위한 새로운 객체 외곽선 연결 알고리즘의 개발이다. 제안된 알고리즘은 개발된 새로운 객체 외곽선 연결 알고리즘과 배경 저장을 이용하여 정확한 객체 분할, 다중 객체 분할, 내부에 구멍이 존재하는 객체의 분할, 가느다란 객체의 분할, 그리고 복잡한 배경을 가진 객체를 자동으로 분할하여 보여주었다. 우리는 알고리즘들을 표준 MPEG-4 실험 영상과 카메라로 입력된 실제 영상을 가지고 실험하였다. 제안된 알고리즘들은 매우 효율이 좋으며 펜티엄-IV 3.4GHz CPU에서 평균적으로 QCIF 영상을 1초당 70.20 프레임 그리고 CIF 영상을 1초당 19.7 프레임을 실시간 객체 응용을 위하여 처리할 수 있다.

• 한국멀티미디어학회논문지
• /
• 제5권5호
• /
• pp.571-581
• /
• 2002

Near VoD (Video on Demand) 시스템을 위하여 많은 주기적 브로드캐스팅 방식(Periodic Broadcasting Scheme)들이 제시되었다. 이들 중 non-uniform 세그멘테이션 기법들이 uniform 세그멘테이션 기법보다 초기지연시간이 짧고 버퍼의 양을 적게 사용하므로 널리 사용된다. 그러나, 이들 방법들은 CBR 방식으로 인코딩 된 비디오의 전송을 위하여 제시되었다. CBR 비디오들은 VBR로 인코딩된 비디오 보다 용량이 크다. 따라서 VBR 비디오를 사용하므로써 성능의 향상을 꾀할 수 있다. VBR 비디오를 브로드캐스팅하는 기존의 연구가 있으나 이들은 화질의 손실을 가져온다. 본 논문에서는 기존의 CBR 비디오를 브로드캐스팅 하기 위한 대표적인 non-uniform 세그멘테이션 기법인 Skyscraper 브로드캐스팅 방식을 수정 하여 VBR 비디오를 브로드캐스팅 할 수 있도록 하였다. VBR 비디오는 선반입(prefetch)를 이용하면 CBR 방식으로 전송할 수 있다. 이를 이용한 수정 Skyscraper 브로드캐스팅 방식을 제안하고 성능평가를 하였다 성능평가 결과, 제시한 방식이 짧은 초기지연시간과 적은 버퍼를 필요로 함을 보였다

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.540-543
• /
• 1999

We propose a face tracking algorithm using skin-color based segmentation and a robust Hausdorff distance. First, we present L＊a＊b＊ color model and face segmentation algorithm. A face is segmented from the first frame of input video sequences using skin-color map. Then, we obtain an initial face model with Laplacian operator. For tracking, a robust Hausdorff distance is computed and the best possible displacement t. is selected. Finally, the previous face model is updated using the displacement t. It is robust to some noises and outliers. We provide an example to illustrate the proposed tracking algorithm in video sequences obtained from CCD camera.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.1093-1096
• /
• 1999

In this paper, video image segmentation algorithm based on color histogram and change detector is proposed. Color histograms are calculated from both changed region which is detected in the previous and current frame and unchanged region. With each histogram, modes and valleys are detected. Then, color vectors are calculated by averaging pixels in modes. Markers are extracted by labeling color vectors that represent modes, the watershed algorithm is applied to determine uncertain region. In growing region, the root mean square(RMS) of the distance between average pixel in marker region and adjacent pixel is used as a measure. The proposed algorithm based on color histogram and change detector segments video image fastly and effectively. And simulation results show that the proposed method determines the exact boundary between background and foreground.

• 전자공학회논문지B
• /
• 제31B권4호
• /
• pp.62-76
• /
• 1994

In this paper, a segmentation-based coding technique as applied to video sequences is proposed. A proposed method separates an image into contour and texture parts, then the visually-sensitive contour part is represented by chain codes and the visually-insensitive texture part is reconstructed by a representative motion vector of a region and mean of the segmented frame difference. It uses a change detector to find moving areas and adopts variable blocks to represent different motions correctly. For better quality of reconstructed images, the displaced frame difference between the original image and the motion compensated image reconstructed by the representative motion vector is segmented. Computer simulation with several video sequences shows that the proposed method gives better performance than the conventional ones in terms of the peak signal to noise ratio(PSNR) and compression ration.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1998년도 Proceedings of International Workshop on Advanced Image Technology
• /
• pp.29-33
• /
• 1998

In this paper, we propose a hierarchical segmentation method for tracking a semantic video object using a watershed algorithm based on morphological filtering. In the proposed method, each hierarchy consists of three steps: First, markers are extracted on the simplified current frame. Second, region growing by a modified watershed algorithm is performed for segmentation. Finally, the segmented regions are classified into 3 categories, i.e., inside, outside, and uncertain regions according to region probability values, which are acquired by the probability map calculated from a estimated motion field. Then, for the remaining uncertain regions, the above three steps are repeated at lower hierarchies with less simplified frames until every region is decided to a certain region. The proposed algorithm provides prospective results in video sequences such as Miss America, Clair, and Akiyo.

• 융합신호처리학회논문지
• /
• 제14권4호
• /
• pp.231-234
• /
• 2013

This paper introduces a mixture of background subtraction technique and K-Means clustering algorithm for removing shadows from video sequences. Lighting conditions cause an issue with segmentation. The proposed method can successfully eradicate artifacts associated with lighting changes such as highlight and reflection, and cast shadows of moving object from segmentation. In this paper, K-Means clustering algorithm is applied to the foreground, which is initially fragmented by background subtraction technique. The estimated shadow region is then superimposed on the background to eliminate the effects that cause redundancy in object detection. Simulation results depict that the proposed approach is capable of removing shadows and reflections from moving objects with an accuracy of more than 95% in every cases considered.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.930-932
• /
• 2003

For this study we used a CCD video camera to capture the pavement image information via the computer. During investigation processing, the CCD video camera captured 10${\sim}$30 images per second. If the vehicle velocity is too fast, the collected images will be duplicated and if the velocity is too slow there will be a gapped between images. Therefore, in order to control the efficiency of the image grabber we should add accessory tools such as the Differential Global Positioning System (DGPS) and odometer. Furthermore, Kalman Filtering can also solve these problems. After the CCD video camera captured the pavement images, we used the Least-Squares method to eliminate images of gradation which have non-uniform surfaces due to the illumination at night. The Fuzzy Entropy method calculates images of threshold segments and creates binary images. Finally, the Object Labeling algorithm finds objects that are cracks or noises from the binary image based on volume pixels of the object. We used these algorithms and tested them, also providing some discussion and suggestions.