Web-based indoor positioning system using QR-codes as markers

Location tracking has been quite an important tool in our daily life. The outdoor location tracking can easily be supported by GPS. However, the technology of tracking smart device users indoor position is not at the same maturity level as outdoor tracking. AR technology could enable the tracking on users indoor location by scanning the AR marker with their smart devices. However, due to several limitations (capacity, error tolerance, etc.) AR markers are not widely adopted. Therefore, not serving as a good candidate to be a tracking marker. This paper carries out a research question whether QR code can replace the AR marker as the tracking marker to detect smart devices’ user indoor position. The paper has discussed the research question by researching the background of the QR code and AR technology. According to the research, QR code should be a suitable choice to implement as a tracking marker. Comparing to the AR marker, QR code has a better capacity, higher error tolerance, and widely adopted. Moreover, a web application has also been implemented as an experiment to support the research question. It utilized QR code as a tracking marker for AR technology which built a 3D model on the QR code. Hence, the position of the user can be estimated from the 3D model. This paper discusses the experiment result by comparing a pre-fixed target user’s position and real experiment position with three different QR code samples. The limitation of the experiment and improvement ideas have also been discussed in this paper. According to the experiment, the research question has being answered that a combination of QR code and AR technology could deliver a satisfying indoor location result in a smart device user

Distance transform and template matching based methods for localization of barcodes and QR codes

Visual codes play an important role in automatic identification, which became an inseparable part of industrial processes. Thanks to the revolution of smartphones and telecommunication, it also becomes more and more popular in everyday life, containing embedded web addresses or other small informative texts. While barcode reading is straightforward in images having optimal parameters (fo cus, illumination, code orientation, and position), localization of code regions is still challenging in many scenarios. Every setup has its own characteristics, there fore many approaches are justifiable. Industrial applications are likely to have more fixed parameters like illumination, camera type and code size, and processing speed and accuracy are the most important requirements. In everyday use, like with smart phone cameras, a wide variety of code types, sizes, noise levels and blurring can be observed, but the processing speed is often not crucial, and the image acquisition process can be repeated in order for successful detection. In this paper, we address this problem with two novel methods for localization of 1D barcodes based on template matching and distance transformation, and a third method for QR codes. Our proposed approaches can simultaneously localize sev eral different types of codes. We compare the effectiveness of the proposed methods with several approaches from the literature using public databases and a large set of synthetic images as a benchmark. The evaluation shows that the proposed methods are efficient, having 84.3% Jaccard accuracy, superior to other approaches. One of the presented approaches is an improvement on our previous work. Our template matching based method is computationally more complex, however, it can be adapted to specific code types producing high accuracy. The other method uses distance transformation, which is fast and gives rough regions of interests that can contain valid visual code candidates

QR code detection under ROS implemented on the GPU

Tato diplomová práce se zabývá vývojem a implementací algoritmu pro detekci QR kódů s integrací do platformy ROS a výpočty běžícími na grafické kartě. Z rešerše současně dostupných nástrojů a technik je vybrán vhodný postup a algoritmus je napsán jako modul v programovacím jazyce Python, který je snadno integrovatelný do ROS. Ke zprostředkování výpočtů na vícejádrovém hardware, jako jsou grafické karty či vícejádrové procesory, je využita knihovna OpenCL.This master's thesis deals with the design and implementation of a QR code detection algorithm under the ROS platform with computations running on a graphical processing unit. Through a comparative survey of available tools and techniques, a suitable approach is chosen and the algorithm is written as a module in the Python programming language, ready to be implemented under the ROS platform. The OpenCL parallel computing platform is used to facilitate parallel computation on multi-core hardware, such as graphical processing units or multi-core CPUs.

Interactive Data Validation and Data Preprocessing of Contactless Medical Devices

Many current popular devices such as Fitbit and Apple Watch continuously monitor movement and activity, but they are primarily marketed towards individuals aiming for fitness improvements, and not those with chronic medical conditions. For people with chronic conditions, or elderly individuals, having to use a wearable can be obstructive and annoying. Furthermore, when trying to study patient motion or behavior, the use of the wearable can impact their actions due to the burden of having to wear the device. Thus, there is a need for a contactless medical device that does not apply this burden to its users. Given this, there is a related need to ensure appropriate validation and preprocessing of data collected from these devices. Using data from the Emerald Device of the Katabi Lab at MIT, this thesis aims to work on the issue of validation and preprocessing of this data.Bachelor of Scienc

An Integrated Method for Coding Trees, Measuring Tree Diameter, and Estimating Tree Positions

Accurately measuring tree diameter at breast height (DBH) and estimating tree positions in a sample plot are important in tree mensuration. The main aims of this paper include (1) developing a new, integrated device that can identify trees using the quick response (QR) code technique to record tree identifications, measure DBH, and estimate tree positions concurrently; (2) designing an innovative algorithm to measure DBH using only two angle sensors, which is simple and can reduce the impact of eccentric stems on DBH measures; and (3) designing an algorithm to estimate the position of the tree by combining ultra-wide band (UWB) technology and altitude sensors, which is based on the received signal strength indication (RSSI) algorithm and quadrilateral localization algorithm. This novel device was applied to measure ten 10 × 10 m square plots of diversified environments and various tree species to test its accuracy. Before measuring a plot, a coded sticker was fixed at a height of 1.3 m on each individual tree stem, and four UWB module anchors were set up at the four corners of the plot. All individual trees\u27 DBHs and positions within the plot were then measured. Tree DBH, measured using a tree caliper, and the values of tree positions, measured using tape, angle ruler, and inclinometer, were used as the respective reference values for comparison. Across the plots, the decode rate of QR codes was 100%, with an average response time less than two seconds. The DBH values had a bias of 1.89 mm (1.88% in relative terms) and a root mean square error (RMSE) of 5.38 mm (4.53% in relative terms). The tree positions were accurately estimated; the biases on the x-axis and the y-axis of the tree position were -8.55-14.88 cm and -12.07-24.49 cm, respectively, and the corresponding RMSEs were 12.94-33.96 cm and 17.78-28.43 cm. The average error between the estimated and reference distances was 30.06 cm, with a standard deviation of 13.53 cm. The device is cheap and friendly to use in addition to its high accuracy. Although further studies are needed, our method provides a great alternative to conventional tools for improving the efficiency and accuracy of tree mensuration

Navigation behavior design and representations for a people aware mobile robot system

There are millions of robots in operation around the world today, and almost all of them operate on factory floors in isolation from people. However, it is now becoming clear that robots can provide much more value assisting people in daily tasks in human environments. Perhaps the most fundamental capability for a mobile robot is navigating from one location to another. Advances in mapping and motion planning research in the past decades made indoor navigation a commodity for mobile robots. Yet, questions remain on how the robots should move around humans. This thesis advocates the use of semantic maps and spatial rules of engagement to enable non-expert users to effortlessly interact with and control a mobile robot. A core concept explored in this thesis is the Tour Scenario, where the task is to familiarize a mobile robot to a new environment after it is first shipped and unpacked in a home or office setting. During the tour, the robot follows the user and creates a semantic representation of the environment. The user labels objects, landmarks and locations by performing pointing gestures and using the robot's user interface. The spatial semantic information is meaningful to humans, as it allows providing commands to the robot such as ``bring me a cup from the kitchen table". While the robot is navigating towards the goal, it should not treat nearby humans as obstacles and should move in a socially acceptable manner. Three main navigation behaviors are studied in this work. The first behavior is the point-to-point navigation. The navigation planner presented in this thesis borrows ideas from human-human spatial interactions, and takes into account personal spaces as well as reactions of people who are in close proximity to the trajectory of the robot. The second navigation behavior is person following. After the description of a basic following behavior, a user study on person following for telepresence robots is presented. Additionally, situation awareness for person following is demonstrated, where the robot facilitates tasks by predicting the intent of the user and utilizing the semantic map. The third behavior is person guidance. A tour-guide robot is presented with a particular application for visually impaired users.Ph.D

Voronoi diagrams in the max-norm: algorithms, implementation, and applications

Voronoi diagrams and their numerous variants are well-established objects in computational geometry. They have proven to be extremely useful to tackle geometric problems in various domains such as VLSI CAD, Computer Graphics, Pattern Recognition, Information Retrieval, etc. In this dissertation, we study generalized Voronoi diagram of line segments as motivated by applications in VLSI Computer Aided Design. Our work has three directions: algorithms, implementation, and applications of the line-segment Voronoi diagrams. Our results are as follows: (1) Algorithms for the farthest Voronoi diagram of line segments in the Lp metric, 1 ≤ p ≤ ∞. Our main interest is the L2 (Euclidean) and the L∞ metric. We first introduce the farthest line-segment hull and its Gaussian map to characterize the regions of the farthest line-segment Voronoi diagram at infinity. We then adapt well-known techniques for the construction of a convex hull to compute the farthest line-segment hull, and therefore, the farthest segment Voronoi diagram. Our approach unifies techniques to compute farthest Voronoi diagrams for points and line segments. (2) The implementation of the L∞ Voronoi diagram of line segments in the Computational Geometry Algorithms Library (CGAL). Our software (approximately 17K lines of C++ code) is built on top of the existing CGAL package on the L2 (Euclidean) Voronoi diagram of line segments. It is accepted and integrated in the upcoming version of the library CGAL-4.7 and will be released in september 2015. We performed the implementation in the L∞ metric because we target applications in VLSI design, where shapes are predominantly rectilinear, and the L∞ segment Voronoi diagram is computationally simpler. (3) The application of our Voronoi software to tackle proximity-related problems in VLSI pattern analysis. In particular, we use the Voronoi diagram to identify critical locations in patterns of VLSI layout, which can be faulty during the printing process of a VLSI chip. We present experiments involving layout pieces that were provided by IBM Research, Zurich. Our Voronoi-based method was able to find all problematic locations in the provided layout pieces, very fast, and without any manual intervention