• Journal of information and communication convergence engineering
• /
• 제8권3호
• /
• pp.339-342
• /
• 2010

An iris image pattern positioning with preserved edge detector, ring zone and clock zone, frequency distribution and overlay matching is presented in this paper. Edge detector is required to be powerful and detail. That is proposed by overlaying Canny with LOG (CLOG). The two reference patterns are made from allocating each gray level on the clock zone and ring zone respectively. The normalized target image is overlaid with the clock zone reference pattern and the ring zone pattern to extract overlapped number, and make a matched frequency distribution to look through a symptom and position of human organ and tissue. The iterating experiments result in the ring and clock zone positioning evaluation.

• Genomics & Informatics
• /
• 제4권2호
• /
• pp.65-70
• /
• 2006

Peptide mass mapping is the matching of experimentally generated peptides masses with the predicted masses of digested proteins contained in a database. To identify proteins by matching their constituent fragment masses to the theoretical peptide masses generated from a protein database, the peptide mass fingerprinting technique is used for the protein identification. Thus, it is important to know the theoretical mass distribution of the database. However, few researches have reported the peptide mass distribution of a database. We analyzed the peptide mass distribution of non-redundant protein sequence database in the NCBI after digestion with 15 different types of enzymes. In order to characterize the peptide mass distribution with different digestion enzymes, a power law distribution (Zipfs law) was applied to the distribution. After constructing simulated digestion of a protein database, rank-frequency plot of peptide fragments was applied to generalize a Zipfs law curve for all enzymes. As a result, our data appear to fit Zipfs law with statistically significant parameter values.

• 응용통계연구
• /
• 제17권1호
• /
• pp.49-60
• /
• 2004

이 논문의 목적은 역 가우스 분포의 모수비가 관심의 대상일 때, 그 모수비에 대한 무정보적 사전분포를 구하는데 있다. 특별히, 모수비에 대한 확률대응사전분포와 기준 사전분포를 제안하였다. 먼저, 관심의 대상이 되는 모수에 대해 모수 직교화 변환을 구하고, 모수 직교화 변환을 이용하여 확률대응사전분포와 기준사전분포를 구하였다. 특히 확률대응사전분포의 일치차수는 1차임을 보였으며 2차 확률대응사전분포는 존재하지 않음을 보였다. 또한 제안된 사전분포에 의해 유도된 사후분포는 적절 분포임을 증명하였다. 모의 실험을 통하여 확률대응사전분포와 기준사전분포를 비교했으며, 실제자료를 이용하여 분석하는 예를 보였다.

• Journal of the Korean Data and Information Science Society
• /
• 제18권1호
• /
• pp.247-257
• /
• 2007

In this paper, we develop the noninformative priors for the common shape parameter in the gamma distributions. We develop the matching priors and reveal that the second order matching prior does not exist. It turns out that the one-at-a-time reference prior and the two group reference prior satisfy a first order probability matching criterion. Some simulation study is peformed.

• Journal of the Korean Data and Information Science Society
• /
• 제22권6호
• /
• pp.1241-1250
• /
• 2011

In this paper, we develop noninformative priors for the log-normal distributions when the parameter of interest is the common mean. We developed Jeffreys' prior, th reference priors and the first order matching priors. It turns out that the reference prior and Jeffreys' prior do not satisfy a first order matching criterion, and Jeffreys' pri the reference prior and the first order matching prior are different. Some simulation study is performed and a real example is given.

• Communications for Statistical Applications and Methods
• /
• 제18권4호
• /
• pp.467-475
• /
• 2011

This paper develops the noninformative priors for the stress-strength reliability from one parameter generalized exponential distributions. When this reliability is a parameter of interest, we develop the first, second order matching priors, reference priors in its order of importance in parameters and Jeffreys' prior. We reveal that these probability matching priors are not the alternative coverage probability matching prior or a highest posterior density matching prior, a cumulative distribution function matching prior. In addition, we reveal that the one-at-a-time reference prior and Jeffreys' prior are actually a second order matching prior. We show that the proposed reference prior matches the target coverage probabilities in a frequentist sense through a simulation study and a provided example.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1577-1584
• /
• 2007

Fingerprint verification is being adopted widely to provide positive identification with a high degree of confidence in all practical areas. This popular usage requires reliable methods for matching of these patterns. To meet the latest expectations, the paper presents a pair wise distance histogram method for fingerprint matching. Here, we introduced a randomized algorithm which exploits pair wise distances between the pairs of minutiae, as a basic feature for match. The method undergoes two steps for completion i.e. first it performs the matching locally then global matching parameters are calculated in second step. The proposed method is robust to common problems that fingerprint matching faces, such as scaling, rotation, translational changes and missing points etc. The paper includes the test of algorithm on various randomly generated minutiae and real fingerprints as well. The results of the tests resemble qualities and utility of method in related field.

• 전자공학회논문지S
• /
• 제34S권3호
• /
• pp.74-83
• /
• 1997

In this paper, a new stereo matching algorithm is proposed which uses th econstrainted optimization technique and the matching measures between the segments extracted from zero-crossing edges. The initial matching measures and average disparities are calculated by the features of segments on the searching window of the left and right images. The matching measure is calculated by applying an exponential function using the differences of slope, overlapped length and intensity. The coherency constraint is that neighbouring image points corresponding to the same object should have nearly the same disparities. The matching measures are iteratively updated by applying the coherency constraint. Simulation results on various images show that the proposed algorithm more acculately extracts the segment disparity.

• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1361-1369
• /
• 1996

Motion estimation is one of the key components for high quality video coding. In this paper, a new motion estimation scheme for MPEG-like video coder is suggested. The proposed temporally adaptive motion estimation scheme consists of five functional blocks: Temporal subband analysis (TSBA), extraction of temporal information, scene change detection (SCD), picture type replacement (PTR), and temporally adapted block matching algorithm (TABMA). Here all the functional components are based on the temporal subband analysis. In this papre, we applied the analysis part of subband decompostion to the temporal axis of moving picture sequence, newly defined the temporal activity distribution (TAD) and average TAD, and proposed the temporally adapted block matching algorithm, the scene change detection algorithm and picture type replacement algorithm which employed the results of the temporal subband analysis. A new block matching algorithm TABMA is capable of controlling the block matching area. According to the temporal activity distribution of objects, it allocates the search areas nonuniformly. The proposed SCD and PTR can prevent unavailable motion prediction for abrupt scene changes. Computer simulation results show that the proposed motion estimation scheme improve the quality of reconstructed sequence and reduces the number of block matching trials to 40% of the numbers of trials in conventional methods. The TSBA based scene change detection algorithm can detect the abruptly changed scenes in the intentionally combined sequence of this experiment without additional computations.

• 전자공학회논문지B
• /
• 제30B권6호
• /
• pp.76-85
• /
• 1993

In this paper, we propose a stroke matching method for the off-line recognition of handprinted Hangul. In this method, the preprocessing steps such as position normalization, contour tracing and thinning are carried out first. Then, after extracting features such as the firection component distribution of contour, the direction component distribution of skeleton, and the distribution of structural feature points, strokes are extracted and matched based on the midpont distribution of the direction and the length of each stroke. In order to reduce the recognition time, a preliminary classification based on the direction component distribution features of the contour is performed. In order to domonstrate the performance of the proposed method, experiments with 520 most frequently used Hangul were performed, and 90.7% of correct recognition rate and 0.46second of recognition time per one character has been obtained. This results reveal that the proposed method can absorb effectively the noise in input character and the variations of stroke slant.