• Title/Summary/Keyword: Number Matching

Search Result 803, Processing Time 0.029 seconds

Location Estimation for Multiple Targets Using Tree Search Algorithms under Cooperative Surveillance of Multiple Robots (다중로봇 협업감시 시스템에서 트리 탐색 기법을 활용한 다중표적 위치 좌표 추정)

  • Park, So Ryoung;Noh, Sanguk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.9
    • /
    • pp.782-791
    • /
    • 2013
  • This paper proposes the location estimation techniques of distributed targets with the multi-sensor data perceived through IR sensors of the military robots. In order to match up targets with measured azimuths, we apply the maximum likelihood (ML), depth-first, and breadth-first tree search algorithms, in which we use the measured azimuths and the number of pixels on IR screen for pruning branches and selecting candidates. After matching up targets with azimuths, we estimate the coordinate of each target by obtaining the intersection point of the azimuths with the least square error (LSE) algorithm. The experimental results show the probability of missing target, mean of the number of calculating nodes, and mean error of the estimated coordinates of the proposed algorithms.

Feature-Based Image Retrieval using SOM-Based R*-Tree

  • Shin, Min-Hwa;Kwon, Chang-Hee;Bae, Sang-Hyun
    • Proceedings of the KAIS Fall Conference
    • /
    • 2003.11a
    • /
    • pp.223-230
    • /
    • 2003
  • Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R*-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R*-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R*-tree combines SOM and R*-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R*-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R*-tree with that of an SOM and an R*-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R*-tree outperforms both the SOM and R*-tree due to the reduction of the number of nodes required to build R*-tree and retrieval time cost.

  • PDF

Recognition of Car License Plates using Intensity Variation and Color Information (명암변화와 칼라정보를 이용한 차량 번호판 인식)

  • Kim, Pyeoung-Kee
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.12
    • /
    • pp.3683-3693
    • /
    • 1999
  • Most recognition methods of car licence plate have difficulties concerning plate recognition rates and system stability in that restricted car images are used and good image capture environment is required. To overcome these difficulties, I proposed a new recognition method of car licence plates, in which both intensity variation and color information are used. For a captured car image, multiple candidate plate-bands are extracted based on the number of intensity variation. To have an equal performance on abnormally dark and bright Images. plate lightness is calculated and adjusted based on the brightness of plate background. Candidate plate regions are extracted using contour following on plate color pixels in oath plate band. A candidate region is decided as a real plate region after extracting character regions and then recognizing them. I recognize characters using template matching since total number of possible characters is small and they art machine printed. To show the efficiency of the proposed method, I tested it on 200 car images and found that the method shows good performance.

  • PDF

Fixed IP-port based Application-Level Internet Traffic Classification (고정 IP-port 기반 응용 레벨 인터넷 트래픽 분석에 관한 연구)

  • Yoon, Sung-Ho;Park, Jun-Sang;Park, Jin-Wan;Lee, Sang-Woo;Kim, Myung-Sup
    • The KIPS Transactions:PartC
    • /
    • v.17C no.2
    • /
    • pp.205-214
    • /
    • 2010
  • As network traffic is dramatically increasing due to the popularization of Internet, the need for application traffic classification becomes important for the effective use of network resources. In this paper, we present an application traffic classification method based on fixed IP-port information. A fixed IP-port is a {IP address, port number, transport protocol}triple dedicated to only one application, which is automatically collected from the behavior analysis of individual applications. We can classify the Internet traffic more accurately and quickly by simple packet header matching to the collected fixed IP-port information. Therefore, we can construct a lightweight, fast, and accurate real-time traffic classification system than other classification method. In this paper we propose a novel algorithm to extract the fixed IP-port information and the system architecture. Also we prove the feasibility and applicability of our proposed method by an acceptable experimental result.

Accelerated inflammation in peripheral artery disease patients with periodontitis

  • Kure, Keitetsu;Sato, Hiroki;Aoyama, Norio;Izumi, Yuichi
    • Journal of Periodontal and Implant Science
    • /
    • v.48 no.6
    • /
    • pp.337-346
    • /
    • 2018
  • Purpose: Peripheral artery disease (PAD) is a form of arteriosclerosis that occurs in the extremities and involves ischemia. Previous studies have reported that patients with periodontitis are at high risk for PAD. However, the relationship between these 2 diseases has not yet been fully elucidated. In this cross-sectional study, we investigated this relationship by comparing patients with PAD to those with arrhythmia (ARR) as a control group. Methods: A large-scale survey was conducted of patients with cardiovascular disease who visited Tokyo Medical and Dental University Hospital. We investigated their oral condition and dental clinical measurements, including probing pocket depth, bleeding on probing, clinical attachment level, and number of missing teeth; we also collected salivary and subgingival plaque samples and peripheral blood samples. All patients with PAD were extracted from the whole population (n=25), and a matching number of patients with ARR were extracted (n=25). Simultaneously, ARR patients were matched to PAD patients in terms of age, gender, prevalence of diabetes, hypertension, dyslipidemia, obesity, and the smoking rate (n=25 in both groups). Real-time polymerase chain reaction was performed to measure the bacterial counts, while the enzyme-linked immunosorbent assay method was used to measure anti-bacterial antibody titers and proinflammatory cytokine levels in serum. Results: PAD patients had more missing teeth ($18.4{\pm}2.0$) and higher serum levels of C-reactive protein ($1.57{\pm}0.85mg/dL$) and tumor necrosis factor-alpha ($70.3{\pm}5.7pg/mL$) than ARR patients ($12.0{\pm}1.7$, $0.38{\pm}0.21mg/dL$, and $39.3{\pm}4.5pg/mL$, respectively). Meanwhile, no statistically significant differences were found in other dental clinical measurements, bacterial antibody titers, or bacterial counts between the 2 groups. Conclusions: Our findings suggested that PAD patients had poorer oral and periodontal state with enhanced systemic inflammation.

HbA1c changes in patients with diabetes following periodontal therapy

  • Kim, Su-Hwan;Lee, Jihye;Kim, Won-Kyung;Lee, Young-Kyoo;Kim, Young-Sung
    • Journal of Periodontal and Implant Science
    • /
    • v.51 no.2
    • /
    • pp.114-123
    • /
    • 2021
  • Purpose: This retrospective cohort study aimed to assess the effect of nonsurgical periodontal therapy on glycated hemoglobin (HbA1c) levels in patients with both type 2 diabetes and chronic periodontitis. Methods: The intervention cohort (IC) comprised 133 patients with type 2 diabetes who received nonsurgical periodontal treatment, while the matching cohort (MC) included 4787 patients with type 2 diabetes who visited the Department of Endocrinology and Metabolism of Asan Medical Center. The patients in each cohort were divided into 3 groups according to their baseline HbA1c level: subgroup 1, HbA1c <7%; subgroup 2, 7%≤ HbA1c <9%; and subgroup 3, HbA1c ≥9%. Changes in HbA1c levels from baseline to 6 and 12 months were analyzed. In addition, the association between changes in HbA1c levels and the number of periodontal maintenance visits was investigated. Results: There were no statistically significant changes in HbA1c levels in the IC and MC or their subgroups when evaluated with repeated-measures analysis of variance. However, the IC showed maintenance of baseline HbA1c levels, while the MC had a trend for HbA1c levels to steadily increase as shown by pairwise comparisons (baseline to 6 months and baseline to 12 months). IC subgroup 1 also maintained steady HbA1c levels from 6 months to 12 months, whereas MC subgroup 1 presented a steady increase during the same period. The number of periodontal maintenance visits had no association with changes in HbA1c levels during the 1-year study duration. Conclusions: For patients with both type 2 diabetes and periodontitis, nonsurgical periodontal treatment and periodontal maintenance may help to control HbA1c levels.

A Novel GNSS Spoofing Detection Technique with Array Antenna-Based Multi-PRN Diversity

  • Lee, Young-Seok;Yeom, Jeong Seon;Noh, Jae Hee;Lee, Sang Jeong;Jung, Bang Chul
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.10 no.3
    • /
    • pp.169-177
    • /
    • 2021
  • In this paper, we propose a novel global navigation satellite system (GNSS) spoofing detection technique through an array antenna-based direction of arrival (DoA) estimation of satellite and spoofer. Specifically, we consider a sophisticated GNSS spoofing attack scenario where the spoofer can accurately mimic the multiple pseudo-random number (PRN) signals since the spoofer has its own GNSS receiver and knows the location of the target receiver in advance. The target GNSS receiver precisely estimates the DoA of all PRN signals using compressed sensing-based orthogonal matching pursuit (OMP) even with a small number of samples, and it performs spoofing detection from the DoA estimation results of all PRN signals. In addition, considering the initial situation of a sophisticated spoofing attack scenario, we designed the algorithm to have high spoofing detection performance regardless of the relative spoofing signal power. Therefore, we do not consider the assumption in which the power of the spoofing signal is about 3 dB greater than that of the authentic signal. Then, we introduce design parameters to get high true detection probability and low false alarm probability in tandem by considering the condition for the presence of signal sources and the proximity of the DoA between authentic signals. Through computer simulations, we compare the DoA estimation performance between the conventional signal direction estimation method and the OMP algorithm in few samples. Finally, we show in the sophisticated spoofing attack scenario that the proposed spoofing detection technique using OMP-based estimated DoA of all PRN signals outperforms the conventional spoofing detection scheme in terms of true detection and false alarm probability.

Development of the ICF/KCF code set the people with Nervous System Disease: Based on Physical Therapy (신경계 환자 평가를 위한 ICF/KCF 코드세트 개발: 물리치료 중심으로)

  • Ju-Min Song;Sun-Wook Park
    • Journal of the Korean Society of Physical Medicine
    • /
    • v.18 no.1
    • /
    • pp.99-110
    • /
    • 2023
  • PURPOSE: This study was conducted to suggest a way to easily understand and utilize the International Classification of Functioning, Disability and Health (ICF) or Korean Standard Classification of Functioning, Disability and Health (KCF), a common and standard language related to health information. METHODS: The tools used by physical therapists to evaluate the functioning of neurological patients were collected from 10 domestic hospitals. By applying the ICF linking rule, two experts compared, analyzed, and linked the concepts in the items of the collected tools and the ICF/KCF codes. The frequency of use of the selected tool, the matching rate of the liking results of two experts, and the number of the codes linked were treated as descriptive statistics and the code set was presented as a list. RESULTS: The berg balance scale, trunk impairment scale, timed up and go test, functional ambulation category, 6 Minute walk test, manual muscle test, and range of motion measurements were the most commonly used tools for evaluating the functioning. The total number of items of the seven tools was 33, and the codes linked to the ICF/KCF were 69. Twenty-two codes were mapped, excluding duplicate codes. Ten codes in the body function, 11 codes in the activity, and one code in the environmental factor were included. CONCLUSION: The information on the development process of the code set will increase the understanding of ICF/KCF and the developed code set can conveniently be used for collecting patients' functioning information.

Development of Travel Time Estimation Algorithm for National Highway by using Self-Organizing Neural Networks (자기조직형 신경망 이론을 이용한 국도 통행시간 추정 알고리즘)

  • Do, Myungsik;Bae, Hyunesook
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.28 no.3D
    • /
    • pp.307-315
    • /
    • 2008
  • The aim of this study is to develop travel time estimation model by using Self-Organized Neural network(in brief, SON) algorithm. Travel time data based on vehicles equipped with GPS and number-plate matching collected from National road number 3 (between Jangji-IC and Gonjiam-IC), which is pilot section of National Highway Traffic Management System were employed. We found that the accuracies of travel time are related to location of detector, the length of road section and land-use properties. In this paper, we try to develop travel time estimation using SON to remedy defects of existing neural network method, which could not additional learning and efficient structure modification. Furthermore, we knew that the estimation accuracy of travel time is superior to optimum located detectors than based on existing located detectors. We can expect the results of this study will make use of location allocation of detectors in highway.

Landslide Risk Assessment of Cropland and Man-made Infrastructures using Bayesian Predictive Model (베이지안 예측모델을 활용한 농업 및 인공 인프라의 산사태 재해 위험 평가)

  • Al, Mamun;Jang, Dong-Ho
    • Journal of The Geomorphological Association of Korea
    • /
    • v.27 no.3
    • /
    • pp.87-103
    • /
    • 2020
  • The purpose of this study is to evaluate the risk of cropland and man-made infrastructures in a landslide-prone area using a GIS-based method. To achieve this goal, a landslide inventory map was prepared based on aerial photograph analysis as well as field observations. A total of 550 landslides have been counted in the entire study area. For model analysis and validation, extracted landslides were randomly selected and divided into two groups. The landslide causative factors such as slope, aspect, curvature, topographic wetness index, elevation, forest type, forest crown density, geology, land-use, soil drainage, and soil texture were used in the analysis. Moreover, to identify the correlation between landslides and causative factors, pixels were divided into several classes and frequency ratio was also extracted. A landslide susceptibility map was constructed using a bayesian predictive model (BPM) based on the entire events. In the cross validation process, the landslide susceptibility map as well as observation data were plotted with a receiver operating characteristic (ROC) curve then the area under the curve (AUC) was calculated and tried to extract a success rate curve. The results showed that, the BPM produced 85.8% accuracy. We believed that the model was acceptable for the landslide susceptibility analysis of the study area. In addition, for risk assessment, monetary value (local) and vulnerability scale were added for each social thematic data layers, which were then converted into US dollar considering landslide occurrence time. Moreover, the total number of the study area pixels and predictive landslide affected pixels were considered for making a probability table. Matching with the affected number, 5,000 landslide pixels were assumed to run for final calculation. Based on the result, cropland showed the estimated total risk as US $ 35.4 million and man-made infrastructure risk amounted to US $ 39.3 million.