• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.658-663
• /
• 2018

In this paper, we consider node deployment algorithms for the sequence-based localization (SBL) which is recently employed for in-door positioning systems, Whereas previous node selection or deployment algorithms seek to place nodes at centrold of the region where more targets are likely to be found, we observe that the boundaries dividing such regions can be good locations for the nodes in SBL systems. Motivated by this observation, we propose an efficient node deployment algorithm that determines the boundaries by using the well-known K-means algorithm and find the potential node locations based on the bi-section method for low-complexity design. We demonstrate through experiments that the proposed algorithm achieves significant localization performance over random node allocation with a substantially reduced complexity as compared with a full search.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1164-1174
• /
• 2007

Antenna selection based MIMO schedulers are proposed to achieve the optimal performance with low complexity in uplink multiuser MIMO/FDD system. In this paper, three heuristic schedulers are proposed to approach the optimal performance which is achieved by the optimal Brute-Force Scheduler. Two search methods called sub-set and full-set way are also discussed to set up the antenna channels to be the candidates of the scheduler. Simulation results show that the sum rate and BER performance of the proposed CSS and SOAS schemes are about the same to that of the brute-force scheduler with affordable complexity, while RC-SOAS with further reduced complexity achieves almost the optimal performance in the case of small number of antennas. Moreover, the complexity can be additionally reduced by the sub-set search method when the number of transmit and receive antennas are 2 respectively, which is applicable in the realistic systems.

• Journal of Broadcast Engineering
• /
• v.18 no.6
• /
• pp.808-815
• /
• 2013

In this paper, we propose a novel fast and low-complexity Motion Estimation (ME) algorithm for Ultra High Definition (UHD) High Efficiency Video Coding (HEVC). Motion estimation occupies 77~81% of the amount of computation in HEVC. After all, the main key of video codec implementation is to find a fast and low-complexity motion estimation algorithm and architecture. We analyze the previous motion estimation algorithms and propose three optimal algorithm to reduce the computation proportion for HEVC. The proposed algorithm uses only 0.36% of the amount of operations compared to full search algorithm while maintaining compression performance with slight loss of 1.1%.

• Journal of the Institute of Convergence Signal Processing
• /
• v.20 no.2
• /
• pp.84-90
• /
• 2019

Tremendous computation of full search or lossless motion estimation algorithms for video coding has led development of many fast motion estimation algorithms. We still need proper control of computation and prediction quality. In the paper, we suggest an algorithm that reduces computation effectively and controls computational amount and prediction quality, while keeping prediction quality as almost the same as that of the full search. The proposed algorithm uses multiple thresholds for partial block sum and times of counting unchanged minimum position for each step. It also calculates the partial block matching error, removes impossible candidates early, implements fast motion estimation by comparing times of keeping the position of minimum error for each step, and controls prediction quality and computation easily by adjusting the thresholds. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.11
• /
• pp.33-39
• /
• 2014

We propose an optimal number of transmit antennas which maximizes energy-efficiency (EE) in multi-user massive multiple-input multiple-output (MIMO) downlink system with the maximal ratio transmission (MRT) precoding. With full channel state information at the transmitter (CSIT), we find a closed form solution by partial differential function with proper approximations using average channel gain, independence of individual channels, and average path loss. With limited feedback, we get a solution numerically by the bisection with approximations in the same manner, and analyze an effect of feedback bits on the optimal number of transmit antennas. Simulation results show that the optimal numbers of transmit antenna getting from proposed closed form solution and exhaustive search are nearly same.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.4
• /
• pp.199-205
• /
• 2018

So many fast motion estimation algorithms for prediction quality and computational reduction have been published due to tremendous computations of full search algorithm. In the paper, we suggest an algorithm that reduces computation effectively, while keeping prediction quality as almost same as that of the full search. The proposed algorithm based on multiple threshold filter calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, removes impossible candidates, and calculates optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain the better performance of calculation speed by reducing unnecessary computations. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

• Journal of the Korean Association of Oral and Maxillofacial Surgeons
• /
• v.45 no.5
• /
• pp.241-253
• /
• 2019

This study evaluated and compared the donor site morbidity following minimally invasive and conventional open harvesting of iliac bone for secondary alveolar bone grafting in cleft palate patients. A thorough electronic search of PubMed, Google Scholar, EMBASE, and an institutional library and manual search of various journals was done; Inclusion criteria: 1) full-text articles using a minimally invasive or conventional open harvesting technique for iliac bone for secondary alveolar grafting in cleft palate patients and 2) articles published between January 1, 2001 and June 30, 2017 and Exclusion criteria: 1) articles published in languages other than English, 2) case reports, case series, animal studies, in vitro studies, and letters to the editor, and 3) full-text article unavailable even after writing to the authors. Preliminary screening of 274 studies excluded 223 studies for not meeting the eligibility criteria. Of the remaining 51 studies, 19 were removed for being duplicates. Of the remaining 32 studies, 15 were excluded after reading the abstract. Of the 17 studies that were left, 2 were excluded because they were in a language other than English, and 2 were excluded because the study group did not mention cleft palate patients. Thus, 13 studies providing results for a total of 654 patients were included in this qualitative synthesis. Minimally invasive bone graft harvest techniques are better than the conventional open iliac bone harvest method because they offer shorter operative time, decreased requirement for pain medications, less pain on discharge, and a shorter hospital stay.

• Journal of Periodontal and Implant Science
• /
• v.51 no.1
• /
• pp.3-17
• /
• 2021

Purpose: The pathology of peri-implantitis is still not fully understood and there have been recent challenges to the consensus on its aetiology and pathology, especially in comparison with periodontitis. The assessment of biomarkers allows a comparison of the pathology of these diseases. The aim of this systematic review was to answer the research question: "Is there a difference in the biomarkers associated with peri-implantitis compared with periodontitis in adult humans?" Methods: Electronic databases were searched and screened, and a manual search was also undertaken. The inclusion criteria were adults with peri-implantitis who had been compared to adults with periodontitis with the outcome of biomarkers assessed via biopsies or crevicular fluid samples in primary or secondary care settings, as recorded in case-control, case series and retrospective, prospective and cross-sectional observational studies. Two reviewers independently screened titles and abstracts and assessed full text articles for eligibility and inclusion. Both reviewers independently extracted data and assessed risk of bias. Differences in biomarker levels were the primary outcome and a narrative review was undertaken due to the heterogeneity of studies. Results: In total, 2,374 articles were identified in the search, of which 111 full-text articles were assessed for eligibility and 13 were included in the qualitative synthesis. Five of the 13 included studies were deemed to be at high risk of bias, with the others having moderate risk. All studies were cross-sectional and performed at university hospitals. Nine of the 13 included studies found significant differences in the levels of biomarkers or their ratios between periimplantitis and periodontitis. Four of the studies found no significant differences. Conclusions: Within the limitations of the included studies, it appears that there may be a difference in biomarker levels and ratios between peri-implantitis and periodontitis, suggesting that these disease processes are somewhat distinct.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.383-391
• /
• 2010

A Lifelog management system provides users with services to store, manage, and search their life logs. This paper proposes a fully-automatic collecting method of real world social contacts and lifelog search engine using collected social contact information as keyword. Wireless short-distance network devices in mobile phones are used to detect social contacts of their users. Human-Bluetooth relationship matrix is built based on the frequency of a human-being and a Bluetooth device being observed at the same time. Results show that with 20% of social contact information out of full social contact information of the observation times used for calculation, 90% of human-Bluetooth relationship can be correctly acquired. A lifelog search-engine that takes human names as keyword is suggested which compares two vectors, a row of Human-Bluetooth matrix and a vector of Bluetooth list scanned while a lifelog was created, using vector information retrieval model. This search engine returns more lifelog than existing text-matching search engine and ranks the result unlike existing search-engine.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.247-259
• /
• 2000

This paper introduces a new technique that reduces the search times and Improves the accuracy of motion estimation using high temporal and spatial correlation of motion vector. Instead of using the fixed first search Point of previously proposed search algorithms, the proposed method finds more accurate first search point as to compensating searching area using high temporal and spatial correlation of motion vector. Therefore, the main idea of proposed method is to find first search point to improve the performance of motion estimation and reduce the search times. The proposed method utilizes the direction of the same coordinate block of the previous frame compared with a block of the current frame to use temporal correlation and the direction of the adjacent blocks of the current frame to use spatial correlation. Based on these directions, we compute the first search point. We search the motion vector in the middle of computed first search point with two fixed search patterns. Using that idea, an efficient adaptive predicted direction search algorithm (APDSA) for block matching motion estimation is proposed. In the experimental results show that the PSNR values are improved up to the 3.6dB as depend on the Image sequences and advanced about 1.7dB on an average. The results of the comparison show that the performance of the proposed APDSA algorithm is better than those of other fast search algorithms whether the image sequence contains fast or slow motion, and is similar to the performance of the FS (Full Search) algorithm. Simulation results also show that the performance of the APDSA scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS algorithm.