• Communications for Statistical Applications and Methods
• /
• 제12권1호
• /
• pp.139-147
• /
• 2005

It is interesting to locate homogeneous segments within a DNA sequence. Suppose that the DNA sequence has segments within which the observations follow the same residue frequency distribution, and between which observations have different distributions. In this setting, change points correspond to the end points of these segments. This article explores the use of a binary segmentation procedure in detecting the change points in the DNA sequence. The change points are determined using a sequence of nested hypothesis tests of whether a change point exists. At each test, we compare no change-point model with a single change-point model by using the Bayesian information criterion. Thus, the method circumvents the computational complexity one would normally face in problems with an unknown number of change points. We illustrate the procedure by analyzing the genome of the bacteriophage lambda.

• Communications for Statistical Applications and Methods
• /
• 제12권2호
• /
• pp.483-496
• /
• 2005

We consider the power law process which is assumed to have multiple changepoints. We propose a binary segmentation procedure for locating all existing changepoints. We select one model between the no-changepoints model and the single changepoint model by the Bayes factor. We repeat this procedure until no more changepoints are found. Then we carry out a multiple test based on the Bayes factor through the intrinsic priors of Berger and Pericchi (1996) to investigate the system behaviour of failure times. We demonstrate our procedure with a real dataset and some simulated datasets.

• Communications for Statistical Applications and Methods
• /
• 제12권1호
• /
• pp.207-216
• /
• 2005

A binary segmentation procedure is a simple recursive approach to detect clusters and provide inferences for the study space when the shape of the clusters and the number of clusters are unknown. The procedure involves a sequence of nested hypothesis tests of a single cluster versus a pair of distinct clusters. The size and the shape of the clusters evolve as the procedure proceeds. The procedure allows for various growth clusters and for arbitrary baseline densities which govern the form of the hypothesis tests. A real tree data is used to highlight the procedure.

• 한국통신학회논문지
• /
• 제27권3A호
• /
• pp.221-230
• /
• 2002

본 논문에서는 마코프 랜덤 필드를 이용해 움직이는 객체를 분할하는 새로운 방법을 제안하였다. 제안된 방법은 신호 탐지 이론에 기반을 두고 있다. 즉, 영상에서의 모션의 존재 유무는 binary decision rule에 의해 결정되고 잘못된 결정은 마코프 랜덤 필드 모델에 의해 수정된다. 전체적인 분할 과정은 2단계로 나뉘어진다. 첫 단계는 '모션탐지' 단계이며, 두번째 단계는 '객체분할' 단계이다. '모션탐지' 단계에서는 optical flow에 의해 발생하는 속도 벡터들에 대하여 binary decision rule을 적용하여 모tus의 존재 유무를 결정하는 과정이다. '객체분할' 단계에서는 첫 단계에서 원치 않게 발생하는 잡음을 제거한다. 이때 마코프 랜덤 필드로 가정하고 베이스 규칙에 의해 잡음을 제거한다. 실험결과, 연속영상에서 움직이는 객체의 영역을 효율적으로 분할함을 확인할 수 있었다.

• 디지털융복합연구
• /
• 제10권3호
• /
• pp.167-172
• /
• 2012

본 논문에서는 단일 프레임 영상에 존재하는 객체를 Active Contour 기반의 영역 분할 과정을 거쳐 분할하였다. Active Contour는 영상에서 객체의 윤곽 형태를 검출해내는 것으로 다중 객체 분할을 위해 각 객체의 윤곽 형태를 검출해 낼 수 있도록 다중 탐색 시작점을 갖도록 하였다. 생성된 객체 별 윤곽 정보를 기반으로 이진화하여 초기 객체 영역을 생성하였다. 초기 객체 영역 내부의 홀 영역과 픽셀 값의 변화로 인한 내부 분할을 hole filling을 수행하여 보정함으로써 최종 객체 영역을 생성하였다. 제안한 기법은 기존 영역 기반 분할의 문제점인 잡음이나 경계선 부근에서 객체 분할이 정확히 이루어지지 않는 부분을 보완하였다. 제안 방법을 비교하기 위해 실제 영상에 기존에 제안된 객체 분할 방법과 제안한 방법을 각각 적용하여 비교하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권11호
• /
• pp.5522-5540
• /
• 2018

Vehicular license plate (LP) recognition system has risen as a significant field of research recently because various explorations are currently being conducted by the researchers to cope with the challenges of LPs which include different illumination and angular situations. This research focused on restricted conditions such as using image of only one vehicle, stationary background, no angular adjustment of the skewed images. A real time vehicular LP recognition scheme is proposed for the skewed images for detection, segmentation and recognition of LP. In this research, a polar co-ordinate transformation procedure is implemented to adjust the skewed vehicular images. Besides that, window scanning procedure is utilized for the candidate localization that is based on the texture characteristics of the image. Then, connected component analysis (CCA) is implemented to the binary image for character segmentation where the pixels get connected in an eight-point neighbourhood process. Finally, optical character recognition is implemented for the recognition of the characters. For measuring the performance of this experiment, 300 skewed images of different illumination conditions with various tilt angles have been tested. The results show that proposed method able to achieve accuracy of 96.3% in localizing, 95.4% in segmenting and 94.2% in recognizing the LPs with an average localization time of 0.52s.

• 대한의용생체공학회:의공학회지
• /
• 제19권6호
• /
• pp.571-575
• /
• 1998

초음파 영상 진단 장비의 중요한 특징 중의 하나는 실시간으로 생체내의 연부 조직에 대한 정보를 보여준다는 것이다. 심초음파도는 심장판막 및 심벽의 상태를 실시간 단면 영상으로 보여줄 수 있으므로 심장 질환 진단에 널리 이용되고 잇다. 그러나, 초음파 영상은 스펙클 잡음이나 영상 탈락 등으로 인하여 화질이 많이 열화되어 있다. 그러므로, 이러한 초음파 영상을 개선시킬 수 있는 새로운 기술을 개발하는 것이 매우 중요하다. 본 연구에서는 심초음파도의 개선된 이진 영상을 검출하기 위한 영상 처리 기술을 제안한다. 아날로그 영상인 심초음파도로부터 디지털 동영상 파일을 만들고, 이것을 다시 프레임 단위로 각각 8bit 그레이 레벨을 갖는 정지 영상으로 변환하여 저장하였다. 효율적인 영상 처리를 위해 심중격과 삼첨판을 중심으로 한 심장 부위를 관심 영역으로 두었고, 스펙클 잡음이 포함된 각각의 영상은 영상 개선 필터와 모폴러지 필터를 이용하여 처리되었다. 그 결과, 원 영상이나 문턱치에 의한 이진 영상에 비해 명확한 윤곽선을 가진 개선된 이진 영상을 얻을 수 있었다. 결론적으로, 본 논문에서 제안한 장법은 보다 최적의 초음파 이진 영상 처리 기술 개발과 심초음파 영상의 좌심실벽 운동과 같은 정량적 분석에 중요한 심벽 윤곽선 검출 등에 기여할 수 있을 것이라 생각된다.

• Transactions on Control, Automation and Systems Engineering
• /
• 제4권3호
• /
• pp.224-230
• /
• 2002

In this paper, a counting algorithm hybridized with an adaptive automatic thresholding method based on Otsu's method and the algorithm that elongates markers obtained by the well-known watershed algorithm is proposed to enhance the exactness of the microcell counting in microscopic images. The proposed counting algorithm can be stated as follows. The transformed full image captured by CCD camera set up at microscope is divided into cropped images of m$\times$n blocks with an appropriate size. The thresholding value of the cropped image is obtained by Otsu's method and the image is transformed into binary image. The microbial cell images below prespecified pixels are regarded as noise and are removed in tile binary image. The smoothing procedure is done by the area opening and the morphological filter. Watershed algorithm and the elongating marker algorithm are applied. By repeating the above stated procedure for m$\times$n blocks, the m$\times$n segmented images are obtained. A superposed image with the size of 640$\times$480 pixels as same as original image is obtained from the m$\times$n segmented block images. By labeling the superposed image, the counting result on the image of microbial cells is achieved. To prove the effectiveness of the proposed mettled in counting the microbial cell on the image, we used Acinetobacter sp., a kind of ammonia-oxidizing bacteria, and compared the proposed method with the global Otsu's method the traditional watershed algorithm based on global thresholding value and human visual method. The result counted by the proposed method shows more approximated result to the human visual counting method than the result counted by any other method.

• 대한원격탐사학회지
• /
• 제10권2호
• /
• pp.133-160
• /
• 1994

In this paper, we propose a comprehensive geometric correction algorithm of Along Track Scanning Radiometer(ATSR) images. The procedure consists of two cascaded modules; precorrection and fine co-location. The pre-correction algorithm is based on the navigation model which was derived in mathematical forms. This model was applied for correction raw(un-geolocated) ATSR images. The non-systematic geometric errors are also introduced as the limitation of the geometric correction by this analytical method. A fast and automatic algorithm is also presented in the paper for co-locating nadir and forward views of the ATSR images by using a binary cross-correlation matching technique. It removes small non-systematic errors which cannot be corrected by the analytic method. The proposed algorithm does not require any auxiliary informations, or a priori processing and avoiding the imperfect co-registratio problem observed with multiple channels. Coastlines in images are detected by a ragion segmentation and an automatic thresholding technique. The matching procedure is carried out with binaty coastline images (nadir and forward), and it gives comparable accuracy and faster processing than a patch based matching technique. This technique automatically reduces non-systematic errors between two views to .$\pm$ 1 pixel.

• 응용통계연구
• /
• 제22권1호
• /
• pp.115-127
• /
• 2009

The purpose of statistical analyses of array-CGH experiment data is to divide the whole genome into regions of equal copy number, to quantify the copy number in each region and finally to evaluate its significance of being different from two. Several statistical procedures have been proposed which include the circular binary segmentation, and a Gaussian based local regression for detecting break points (GLAD) by estimating a piecewise constant function. We propose in this note a penalized spline regression and its simultaneous confidence band(SCB) approach to evaluate the statistical significance of regions of genetic gain/loss. The region of which the simultaneous confidence band stays above 0 or below 0 can be considered as a region of genetic gain or loss. We compare the performance of the SCB procedure with GLAD and hidden Markov model approaches through a simulation study in which the data were generated from AR(1) and AR(2) models to reflect spatial dependence of the array-CGH data in addition to the independence model. We found that the SCB method is more sensitive in detecting the low level copy number alterations.