• Title/Summary/Keyword: Automatic Distribution

Search Result 605, Processing Time 0.023 seconds

A Fingerprint Identification System using Large Database (대용량 DB를 사용한 지문인식 시스템)

  • Cha, Jeong-Hee;Seo, Jeong-Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.203-211
    • /
    • 2005
  • In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps; preprocessing, classification, and matching, in the classification. we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

  • PDF

AUTOMATIC DETECTION AND EXTRACTION ALGORITHM OF INTER-GRANULAR BRIGHT POINTS

  • Feng, Song;Ji, Kai-Fan;Deng, Hui;Wang, Feng;Fu, Xiao-Dong
    • Journal of The Korean Astronomical Society
    • /
    • v.45 no.6
    • /
    • pp.167-173
    • /
    • 2012
  • Inter-granular Bright Points (igBPs) are small-scale objects in the Solar photosphere which can be seen within dark inter-granular lanes. We present a new algorithm to automatically detect and extract igBPs. Laplacian and Morphological Dilation (LMD) technique is employed by the algorithm. It involves three basic processing steps: (1) obtaining candidate "seed" regions by Laplacian; (2) determining the boundary and size of igBPs by morphological dilation; (3) discarding brighter granules by a probability criterion. For validating our algorithm, we used the observed samples of the Dutch Open Telescope (DOT), collected on April 12, 2007. They contain 180 high-resolution images, and each has a $85{\times}68\;arcsec^2$ field of view (FOV). Two important results are obtained: first, the identified rate of igBPs reaches 95% and is higher than previous results; second, the diameter distribution is $220{\pm}25km$, which is fully consistent with previously published data. We conclude that the presented algorithm can detect and extract igBPs automatically and effectively.

Rainfall Estimation by X-band Marine Radar (X밴드 선박용 레이더를 이용한 강우 추정)

  • Kim, Kwang-Ho;Kwon, Byung-Hyuk;Kim, Min-Seong;Kim, Park-Sa;Yoon, Hong-Joo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.4
    • /
    • pp.695-704
    • /
    • 2018
  • The rainfall cases were identified by rainfall estimation techniques which were developed by using X - band marine radar. A digital signal converter was used to convert the signal received from the marine radar into digital reflectivity information. The ground clutter signal was removed and the errors caused by beam attenuation and beam volume changes were corrected. The reflectivity showed a linear relationship with the rain gauge rainfall. Quantitative rainfall was estimated by converting the radar signal into an cartesian coordinate system. When the rainfall was recorded more than $5mm\;hr^{-1}$ at three automatic weather stations, the rain cell distribution on the marine radar was consistent with that of the weather radar operated by Korea meteorological Adminstration.

East Reconstruction of 3D Human Model from Contour Lines (외곽선을 이용한 고속 3차원 인체모델 재구성)

  • Shin Byeong-Seok;Roh Sung;Jung Hoe-Sang;Chung Min Suk;Lee Yong Sook
    • Journal of Biomedical Engineering Research
    • /
    • v.25 no.6
    • /
    • pp.537-543
    • /
    • 2004
  • In order to create three-dimensional model for human body, a method that reconstructs geometric models from contour lines on cross-section images is commonly used. We can get a set of contour lines by acquiring CT or MR images and segmenting anatomical structures. Previously proposed method divides entire contour line into simply matched regions and clefts. Since long processing time is required for reconstructing cleft regions, its performance might be degraded when manipulating complex data such as cross-sections for human body. In this paper, we propose a fast reconstruction method. It generates a triangle strip with single tiling operation for simple region that does not contain branch structures. If there exist branches in contour lines, it partitions the contour line into several sub-contours by considering the number of vertices and their spatial distribution. We implemented an automatic surface reconstruction system by using our method which reconstructs three-dimensional models for anatomical structures.

Segmentation of Color Image using the Deterministic Annealing EM Algorithm (결정적 어닐링 EM 알고리즘을 이요한 칼라 영상의 분할)

  • Cho, Wan-Hyun;Park, Jong-Hyun;Park, Soon-Young
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.324-333
    • /
    • 2001
  • In this paper we present a novel color image segmentation algorithm based on a Gaussian Mixture Model(GMM). It is introduced a Deterministic Annealing Expectation Maximization(DAEM) algorithm which is developed using the principle of maximum entropy to overcome the local maxima problem associated with the standard EM algorithm. In our approach, the GMM is used to represent the multi-colored objects statistically and its parameters are estimated by DAEM algorithm. We also develop the automatic determination method of the number of components in Gaussian mixtures models. The segmentation of image is based on the maximum posterior probability distribution which is calculated by using the GMM. The experimental results show that the proposed DAEM can estimate the parameters more accurately than the standard EM and the determination method of the number of mixture models is very efficient. When tested on two natural images, the proposed algorithm performs much better than the traditional algorithm in segmenting the image fields.

  • PDF

A Study on Developing A Design of Cash Dispenser - With a Focus on LG Co. Cash Dispenser - (현금 인출기 디자인 개발 사례 연구 - (주) LG 전자 현금 인출기를 중심으로 -)

  • 오성진
    • Archives of design research
    • /
    • v.12 no.2
    • /
    • pp.5-16
    • /
    • 1999
  • Nowadays the banks, with a wide spread of credit transaction practice in every business, offer better services to their customers, while the automation of banking is being made more rapid progress in th light of efficient banking service. For example, it is true that the automation of cash payment for customers goes on its progress and the competition between companies is getting more serious. Lately the banks that pursue "Banking Automation System" expand distribution of cash dispenser for the better electronic computer service and for the better service for their customers in quality. Therefore the makers producing "CD" accelerate their development of CD in various ways in order to secure MIS as the leading group of th field. CD, a kind of an automatic paying, is being used generally, and has various functions and its design is getting more compact than ever. Under this situation, I studied more trustworthy and convenient CD design suggestions in the way of case study on the basis of the process of developing CD and I suggest the better way of developing the design of CD in the future.of CD in the future.

  • PDF

An Improved Automatic Text Summarization Based on Lexical Chaining Using Semantical Word Relatedness (단어 간 의미적 연관성을 고려한 어휘 체인 기반의 개선된 자동 문서요약 방법)

  • Cha, Jun Seok;Kim, Jeong In;Kim, Jung Min
    • Smart Media Journal
    • /
    • v.6 no.1
    • /
    • pp.22-29
    • /
    • 2017
  • Due to the rapid advancement and distribution of smart devices of late, document data on the Internet is on the sharp increase. The increment of information on the Web including a massive amount of documents makes it increasingly difficult for users to understand corresponding data. In order to efficiently summarize documents in the field of automated summary programs, various researches are under way. This study uses TextRank algorithm to efficiently summarize documents. TextRank algorithm expresses sentences or keywords in the form of a graph and understands the importance of sentences by using its vertices and edges to understand semantic relations between vocabulary and sentence. It extracts high-ranking keywords and based on keywords, it extracts important sentences. To extract important sentences, the algorithm first groups vocabulary. Grouping vocabulary is done using a scale of specific weight. The program sorts out sentences with higher scores on the weight scale, and based on selected sentences, it extracts important sentences to summarize the document. This study proved that this process confirmed an improved performance than summary methods shown in previous researches and that the algorithm can more efficiently summarize documents.

A String Analysis based System for Classifying Android Apps Accessing Harmful Sites (유해 사이트를 접속하는 안드로이드 앱을 문자열 분석으로 검사하는 시스템)

  • Choi, Kwang-Hoon;Ko, Kwang-Man;Park, Hee-Wan;Youn, Jong-Hee
    • The KIPS Transactions:PartA
    • /
    • v.19A no.4
    • /
    • pp.187-194
    • /
    • 2012
  • This paper proposes a string analysis based system for classifying Android Apps that may access so called harmful sites, and shows an experiment result for real Android apps on the market. The system first transforms Android App binary codes into Java byte codes, it performs string analysis to compute a set of strings at all program points, and it classifies the Android App as bad ones if the computed set contains URLs that are classified because the sites provide inappropriate contents. In the proposed approach, the system performs such a classification in the stage of distribution before installing and executing the Apps. Furthermore, the system is suitable for the automatic management of Android Apps in the market. The proposed system can be combined with the existing methods using DNS servers or monitoring modules to identify harmful Android apps better in different stages.

A Study on a Ginseng Grade Decision Making Algorithm Using a Pattern Recognition Method (패턴인식을 이용한 수삼 등급판정 알고리즘에 관한 연구)

  • Jeong, Seokhoon;Ko, Kuk Won;Kang, Je-Yong;Jang, Suwon;Lee, Sangjoon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.7
    • /
    • pp.327-332
    • /
    • 2016
  • This study is a leading research project to develop an automatic grade decision making algorithm of a 6-years-old fresh ginseng. For this work, we developed a Ginseng image acquiring instrument which can take 4-direction's images of a Ginseng at the same time and obtained 245 jingen images using the instrument. The 12 parameters were extracted for each image by a manual way. Lastly, 4 parameters were selected depending on a Ginseng grade classification criteria of KGC Ginseng research institute and a survey result which a distribution of averaging 12 parameters. A pattern recognition classifier was used as a support vector machine, designed to "k-class classifier" using the OpenCV library which is a open-source platform. We had been surveyed the algorithm performance(Correct Matching Ratio, False Acceptance Ratio, False Reject Ratio) when the training data number was controlled 10 to 20. The result of the correct matching ratio is 94% of the $1^{st}$ ginseng grade, 98% of the $2^{nd}$ ginseng grade, 90% of the $3^{rd}$ ginseng grade, overall, showed high recognition performance with all grades when the number of training data are 10.

Assessment of Selective Withdrawal Facility in the Imha Reservoir Using CE-QUAL-W2 Model (CE-QUAL-W2 모델을 이용한 임하호 선택배제시설의 효과분석)

  • Lee, Sanguk;Kim, Jeongkon;Noh, Joonwoo;Ko, Ick Hwan
    • Journal of Korean Society on Water Environment
    • /
    • v.23 no.2
    • /
    • pp.228-235
    • /
    • 2007
  • For efficient turbid water withdrawal in the Imha reservoir, a selective withdrawal facility was recently installed and operated during summer season of year 2006. In this research, CE-QUAL-W2 model was utilized to assess the efficiency of the selective withdrawal facility, in comparison with the original surface withdrawal, on turbid water management. Model calibration was carried out using data observed at four automatic monitoring stations in the reservoir. It was found that the model appropriately simulated, with the RMSE less than 5.2 NTU, the observed vertical and horizontal distributions of water temperature and turbidity as well as the location of maximum turbid water at each monitoring station. The analysis results showed that selective withdrawal is more effective in removing high turbid water than surface withdrawal as selective withdrawal contributed to reducing $35Mm^3$ of high turbidity water (> 100 NTU) in the reservoir by increasing outflows of high turbid water. Therefore, effective management of turbid water in the reservoir can be achieved by changing locations of intake depending on turbid water distribution conditions. The results of this study will provide some basic information for establishing better operation strategies to cope with turbid water problems.