• Title/Summary/Keyword: Number Matching

Search Result 803, Processing Time 0.034 seconds

Hierarchical Search-based Fast Schemes for Consecutive Block Error Concealment (연속된 블록 오류 은닉을 위한 계층 탐색 기반의 고속 알고리즘)

  • Jeon Soo-Yeol;Sohn Chae-Bong;Oh Seoung-Jun;Ahn Chang-Beom
    • Journal of Broadcast Engineering
    • /
    • v.9 no.4 s.25
    • /
    • pp.446-454
    • /
    • 2004
  • With the growth of multimedia systems, compressing image data has become more important in the area of multimedia services. Since a compressed image bitstream can often be seriously distorted by various types of channel noise, an error concealment algorithm becomes a very important issue. In order to solve this problem, Hsia proposed the error concealment algorithm where he recovered lost block data using 1D boundary matching vectors. His algorithm, however, requires high computational complexity since each matching vector needs MAD (Mean Absolute Difference) values of all pixels, which is either a boundary line top or a boundary line bottom of a damaged block. We propose a hierarchical search-based fast error concealment scheme as well as its approximated version to reduce computational time. In the proposed scheme, a hierarchical search is applied to reduce the number of checking points for searching a vector. The error concealment schemes proposed in this paper can be about 3 times faster than Hsia's with keeping visual quality and PSNR.

An Efficient Method of IR-based Automated Keyword Tagging (정보검색 기법을 이용한 효율적인 자동 키워드 태깅)

  • Kim, Jinsuk;Choe, Ho-Seop;You, Beom-Jong
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2008.05a
    • /
    • pp.24-27
    • /
    • 2008
  • As shown in Wikipedia, tagging or cross-linking through major key-words improves the readability of documents. Recently, the Semantic Web rises the importance of social tagging as a key feature of the Web 2.0 and Tag Cloud has emerged as its crucial phenotype. In this paper we provides an efficient method of automated keyword tagging based on controlled term collection, where the computational complexity of O(mN) - if pattern matching algorithm is used - can be reduced to O(mlogN) - if Information Retrieval is adopted - while m is the length of target document and N is the total number of candidate terms to be tagged. The result shows that IR-based tagging speeds up 5.6 times compared with fast pattern matching algorithm.

  • PDF

Measurement of Travel Time Using Sequence Pattern of Vehicles (차종 시퀀스 패턴을 이용한 구간통행시간 계측)

  • Lim, Joong-Seon;Choi, Gyung-Hyun;Oh, Kyu-Sam;Park, Jong-Hun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.5
    • /
    • pp.53-63
    • /
    • 2008
  • In this paper, we propose the regional travel time measurement algorithm using the sequence pattern matching to the type of vehicles between the origin of the region and the end of the region, that could be able to overcome the limit of conventional method such as Probe Car Method or AVI Method by License Plate Recognition. This algorithm recognizes the vehicles as a sequence group with a definite length, and measures the regional travel time by searching the sequence of the origin which is the most highly similar to the sequence of the end. According to the assumption of similarity cost function, there are proposed three types of algorithm, and it will be able to estimate the average travel time that is the most adequate to the information providing period by eliminating the abnormal value caused by inflow and outflow of vehicles. In the result of computer simulation by the length of region, the number of passing cars, the length of sequence, and the average maximum error rate are measured within 3.46%, which means that this algorithm is verified for its superior performance.

  • PDF

Oncologic Outcomes after Laparoscopic and Open Distal Gastrectomy for Advanced Gastric Cancer: Propensity Score Matching Analysis

  • Kim, Sang Hyun;Chung, Yoona;Kim, Yong Ho;Choi, Sung Il
    • Journal of Gastric Cancer
    • /
    • v.19 no.1
    • /
    • pp.83-91
    • /
    • 2019
  • Purpose: This study aimed to compare the oncologic and short-term outcomes of laparoscopic distal gastrectomy (LDG) and open distal gastrectomy (ODG) for advanced gastric cancer (AGC). Materials and Methods: From July 2006 to November 2016, 384 patients underwent distal gastrectomy for AGC. Data on short- and long-term outcomes were prospectively collected and reviewed. Propensity score matching was applied at a ratio of 1:1 to compare the LDG and ODG groups. Results: The operative times were longer for the LDG group than for the ODG group. However, the time to resumption of diet and the length of hospital stay were shorter in the LDG group than in the ODG group (4.7 vs. 5.6 days, P=0.049 and 9.6 vs. 11.5 days, P=0.035, respectively). The extent of lymph node dissection in the LDG group was more limited than in the ODG group (P=0.002), although there was no difference in the number of retrieved lymph nodes between the 2 groups. The 3-year overall survival rates were 98% and 86.9% (P=0.018), and the 3-year recurrence-free survival rates were 86.3% and 75.3% (P=0.259), respectively, in the LDG and ODG groups. Conclusions: LDG is safe and feasible for AGC, with earlier recovery after surgery and longterm oncologic outcomes comparable to those of ODG.

Simulation method of ground motion matching for multiple targets and effects of fitting parameter variation on the distribution of PGD

  • Wang, Shaoqing;Yu, Ruifang;Li, Xiaojun;Lv, Hongshan
    • Earthquakes and Structures
    • /
    • v.16 no.5
    • /
    • pp.563-573
    • /
    • 2019
  • When generating spectrum-compatible artificial ground motion in engineering practices, the effect of the variation in fitting parameters on the distribution of the peak ground displacement (PGD) has not yet drawn enough attention. In this study, a method for simulating ground motion matching for multiple targets is developed. In this method, a frequency-dependent amplitude envelope function with statistical parameters is introduced to simulate the nonstationarity of the frequency in earthquake ground motion. Then, several groups of time-history acceleration with different temporal and spectral nonstationarities were generated to analyze the effect of nonstationary parameter variations on the distribution of PGD. The following conclusions are drawn from the results: (1) In the simulation of spectrum-compatible artificial ground motion, if the acceleration time-history is generated with random initial phases, the corresponding PGD distribution is quite discrete and an uncertain number of PGD values lower than the limit value are observed. Nevertheless, the mean values of PGD always meet the requirement in every group. (2) If the nonstationary frequencies of the ground motion are taken into account when fitting the target spectrum, the corresponding PGD values will increase. A correlation analysis shows that the change in the mean and the dispersion values, from before the frequencies are controlled to after, correlates with the modal parameters of the predominant frequencies. (3) Extending the maximum period of the target spectrum will increase the corresponding PGD value and, simultaneously, decrease the PGD dispersion. Finally, in order to control the PGD effectively, the ground motion simulation method suggested in this study was revised to target a specified PGD. This novel method can generate ground motion that satisfies not only the required precision of the target spectrum, peak ground acceleration (PGA), and nonstationarity characteristics of the ground motion but also meets the required limit of the PGD, improving engineering practices.

An Innovative Framework to Classify Online Platforms (온라인 플랫폼의 분류 프레임워크 : 국내 플랫폼 사례연구를 중심으로)

  • Kang, Hyoung Goo;Kang, Chang-Mo;Jeon, Seong Min
    • The Journal of Information Systems
    • /
    • v.31 no.1
    • /
    • pp.59-90
    • /
    • 2022
  • Purpose This paper presents a new method of classifying online platforms. It also explains how to apply the framework using case studies and generate new insight about platform strategies and policy development. Design/methodology/approach This paper focuses on the relationship between platforms, especially the hierarchy and power relations, and broadly classifies platforms as follows: content/services, meta information, app stores, operating systems, and cloud. Both the content/service platform and the meta information platform have matching as their main function. However, most content/services tend to collect and access information through meta-information platforms, so meta-information platforms are closer to infrastructure than content/service platforms. App store, operating system, and cloud can be said to be platforms of platforms. A small number of companies in the US and China dominate platforms of platforms, and become the recent development and regulatory targets of their respective governments. Findings We should be wary of the attempts to regulate domestic platforms by importing foreign regulations that ignore the hierarchical structure that our framework highlights. We believe that Korea's strategy to become a true platform powerhouse is clear. As one of the few countries with significant companies in the area of meta information platforms, it will be necessary to fully utilize the position and advance into the strategically important area of platforms of platforms. Furthermore, it is necessary to encourage world-class companies to appear in Korea in the app store, operating system, and cloud. To do so, the government needs to introduce promotion policies to strategically nurture such platforms rather than to regulate them.

The Relationship between Parkinson's Disease and Acute Myocardial Infarction in Korea : A Nationwide Longitudinal Cohort Study

  • Sheen, Seung Hun;Hong, Je Beom;Kim, Hakyung;Kim, Jimin;Han, In-bo;Sohn, Seil
    • Journal of Korean Neurosurgical Society
    • /
    • v.65 no.4
    • /
    • pp.507-513
    • /
    • 2022
  • Objective : The goal of the following statewide age and gender-coordinated cohort study in Korea is to find out if there is a link between acute myocardial infarction (AMI) and Parkinson's disease (PD). Methods : Utilizing the National Health Insurance Sharing Service cohort, patient data were collected. Six thousand four hundred seventy-five individuals with PD were distinguished by utilizing the International Classification of Diseases 10 code G20 and have enrolled in the PD group. The number of participants decreased to 5259 after excluding 1039 patients who were hospitalized less than one time or who visited an outpatient clinic less than twice. Then, 26295 individuals were selected as part of the control group after case control matching was conducted through 1 : 5 age- and gender-coordinated matching. The Cox proportional hazard regression analysis and Kaplan-Meier method were utilized to analyze the likelihood of AMI in PD. Results : After controlling for age and gender, the hazard ratio of AMI in the PD group was 3.603 (95% confidence interval [CI], 2.837-4.577). After that, the following hazard ratio of AMI in the PD group was modified against for co-morbid medical disorders, resulting in 3.551 (95% CI, 2.795-4.511). According to a subgroup analysis, in males and females aged <65 and aged ≥65 and in the non-diabetes and diabetes, hypertension and non-hypertension, dyslipidemia and non-dyslipidemia subgroups, the AMI incidence rates were dramatically higher in the PD group compared to that of the control. Conclusion : Individuals with PD have a greater chance of AMI, according to this cross-national study.

Image-Based Application Testing Method Using Faster D2-Net for Identification of the Same Image (동일 이미지 판별을 위해 Faster D2-Net을 이용한 이미지 기반의 애플리케이션 테스트 방법)

  • Chun, Hye-Won;Jo, Min-Seok;Han, Sung-Soo;Jeong, Chang-Sung
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.11 no.2
    • /
    • pp.87-92
    • /
    • 2022
  • Image-based application testing proposes an application testing method via image structure comparison. This test method allows testing on various devices without relying on various types of device operating systems or GUI. Traditional studies required the creation of a tester for each variant in the existing case, because it differs from the correct image for operating system changes, screen animation execution, and resolution changes. The study determined that the screen is the same for variations. The tester compares the underlying structure of the objects in the two images and extracts the regions in which the differences exist in the images, and compares image similarity as characteristic points of the Faster D2-Net. The development of the Faster D2-Net reduced the number of operations and spatial losses compared to the D2-Net, making it suitable for extracting features from application images and reducing test performance time.

Comparison of short-term outcomes of open and laparoscopic assisted pancreaticoduodenectomy for periampullary carcinoma: A propensity score-matched analysis

  • Utpal Anand;Rohith Kodali;Kunal Parasar;Basant Narayan Singh;Kislay Kant;Sitaram Yadav;Saad Anwar;Abhishek Arora
    • Annals of Hepato-Biliary-Pancreatic Surgery
    • /
    • v.28 no.2
    • /
    • pp.220-228
    • /
    • 2024
  • Backgrounds/Aims: Postoperative pancreatic fistula is the key worry in the ongoing debate about the safety and effectiveness of total laparoscopic pancreaticoduodenectomy (TLPD). Laparoscopic-assisted pancreaticoduodenectomy (LAPD), a hybrid approach combining laparoscopic resection and anastomosis with a small incision, is an alternative to TLPD. This study compares the short-term outcomes and oncological efficacy of LAPD vs. open pancreaticoduodenectomy (OPD). Methods: A retrospective analysis of data of all patients who underwent LAPD or OPD for periampullary carcinoma at a tertiary care center in Northeast India from July 2019 to August 2023 was done. A total of 30 LAPDs and 30 OPDs were compared after 1:1 propensity score matching. Demographic data, intraoperative and postoperative data (30 days), and pathological data were compared. Results: The study included a total of 93 patients, 30 underwent LAPD and 62 underwent OPD. After propensity score matching, the matched cohort included 30 patients in both groups. The LAPD presented several advantages over the OPD group, including a shorter incision length, reduced postoperative pain, earlier initiation of oral feeding, and shorter hospital stays. LAPD was not found to be inferior to OPD in terms of pancreatic fistula incidence (Grade B, 30.0% vs. 33.3%), achieving R0 resection (100% vs. 93.3%), and the number of lymph nodes harvested (12 vs. 14, p = 0.620). No significant differences in blood loss, short-term complications, pathological outcomes, readmissions, and early (30-day) mortality were observed between the two groups. Conclusions: LAPD has comparable safety, technical feasibility, and short-term oncological efficacy.

A MODEL-ORDER REDUCTION METHOD BASED ON KRYLOV SUBSPACES FOR MIMO BILINEAR DYNAMICAL SYSTEMS

  • Lin, Yiqin;Bao, Liang;Wei, Yimin
    • Journal of applied mathematics & informatics
    • /
    • v.25 no.1_2
    • /
    • pp.293-304
    • /
    • 2007
  • In this paper, we present a Krylov subspace based projection method for reduced-order modeling of large scale bilinear multi-input multi-output (MIMO) systems. The reduced-order bilinear system is constructed in such a way that it can match a desired number of moments of multi-variable transfer functions corresponding to the kernels of Volterra series representation of the original system. Numerical examples report the effectiveness of this method.