Ruji P. Medina
Technological Institute of the Philippines Quezon City

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Modified fingerprinting localization technique of indoor positioning system based on coordinates Rhowel M. Dellosa; Arnel C. Fajardo; Ruji P. Medina
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 3: September 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i3.pp1345-1355

Abstract

The fingerprinting localization technique is the most commonly used localization technique of the indoor positioning system. It is used by several technologies for short and long range position estimation like wireless fidelity and radio frequency. There are several schemes used to estimate a location for the indoor environment but the drawbacks resulted in complexity issues. These drawbacks have negative effects on location estimation. In order to address these drawbacks, this work attempted to explore the fingerprinting localization technique for location estimation of the indoor environment that focuses on position estimation. Results showed that the simplicity of the design of position estimation without compromising the functionality of the operations was observed with 100% accuracy on position estimation.
Modified brute force algorithm to solve the closest pair of points problem based on dynamic warping Rhowel M. Dellosa; Arnel C Fajardo; Ruji P. Medina
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 3: September 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i3.pp1629-1636

Abstract

This paper introduces an algorithm to solve the closest pair of points problem in a 2D plane based on dynamic warping. The algorithm computes all the distances between the set of points P(x, y) and a reference point R(i, j), records all the result in a grid and finally determines the minimum distance using schematic steps. Results show that the algorithm of finding the closest pair of points has achieved less number of comparisons in determining the closest pair of points compared with the brute force and divide-and-conquer methods of the closest pair of points.