• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.343-364
• /
• 2021

In the 5G era, the communication networks tend to be ultra-densified, which will improve the accuracy of indoor positioning and further improve the quality of positioning service. In this study, we propose an indoor three-dimensional (3D) dynamic reconstruction fingerprint matching algorithm (DSR-FP) in a 5G ultra-dense network. The first step of the algorithm is to construct a local fingerprint matrix having low-rank characteristics using partial fingerprint data, and then reconstruct the local matrix as a complete fingerprint library using the FPCA reconstruction algorithm. In the second step of the algorithm, a dynamic base station matching strategy is used to screen out the best quality service base stations and multiple sub-optimal service base stations. Then, the fingerprints of the other base station numbers are eliminated from the fingerprint database to simplify the fingerprint database. Finally, the 3D estimated coordinates of the point to be located are obtained through the K-nearest neighbor matching algorithm. The analysis of the simulation results demonstrates that the average relative error between the reconstructed fingerprint database by the DSR-FP algorithm and the original fingerprint database is 1.21%, indicating that the accuracy of the reconstruction fingerprint database is high, and the influence of the location error can be ignored. The positioning error of the DSR-FP algorithm is less than 0.31 m. Furthermore, at the same signal-to-noise ratio, the positioning error of the DSR-FP algorithm is lesser than that of the traditional fingerprint matching algorithm, while its positioning accuracy is higher.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.12
• /
• pp.70-80
• /
• 1997

This paper proposes a hierarchical Hausdorff distance (HD) matching algorithm baased on coarse-to-fine approach. It reduces the computational complexity greatly by using the pyramidal structures consisting of distance transform (DT) and edge pyramids. Also, inthe proposed hierarchical HD matching, a thresholding method is presented to find an optimal matching position with small error, in which the threshold values are determined by using the property between adjacent level of a DT map pyramid. By computer simulation, the performance of the conventional and proposed hierarchical HD matching algorithms is compared in therms of the matching position for binary images containing uniform noise.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.4
• /
• pp.48-57
• /
• 1992

This paper addresses the estimation of the shift vector from aerial image sequences. The conventional feature-based and area-based matching methods are simulated for determining the suitable image registration scheme. Computer simulations show that the feature-based matching schemes based on the co-occurrence matrix, autoregressive model, and edge information do not give a reliable matching for aerial image sequences which do not have a suitable statistical model or significant features. In area-based matching methods we try various similarity functions for a matching measure and discuss the factors determining the matching accuracy. To reduce the estimation error of the shift vector we propose the reference window selection scheme. We also discuss the performance of the proposed algorithm based on the simulation results.

• 한국데이터정보과학회:학술대회논문집
• /
• 2006.11a
• /
• pp.21-27
• /
• 2006

Data fusion is generally defined as the use of techniques that combine data from multiple sources and gather that information in order to achieve inferences. Data fusion is also called data combination or data matching. Data fusion is divided in five branch types which are exact matching, judgemental matching, probability matching, statistical matching, and data linking. Currently, Gyeongnam province is executing the social survey every year with the provincials. But, they have the limit of the analysis as execute the different survey to 3 year cycles. In this paper, we study to data fusion of environmental survey data using sas macro. We can use data fusion outputs in environmental preservation and environmental improvement.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.22-33
• /
• 2019

This paper introduces an efficient fingerprint matching method based on multiple reference minutiae points. First, we attempt to effectively align two fingerprints by employing multiple reference minutiae points. However, the corresponding minutiae points between two fingerprints are ambiguous since a minutia of one fingerprint can be a match to any minutia of the other fingerprint. Therefore, we introduce a novel method based on linear classification concept to establish minutiae correspondences between two fingerprints. Each minutiae correspondence represents a possible alignment. For each possible alignment, a matching score is computed using minutiae and ridge orientation features and the maximum score is then selected to represent the similarity of the two fingerprints. The proposed method is evaluated using fingerprint databases, FVC2002 and FVC2004. In addition, we compare our approach with two existing methods and find that our approach outperforms them in term of matching accuracy, especially in the case of non-linear distorted fingerprints. Furthermore, the experiments show that our method provides additional advantages in low quality fingerprint images such as inaccurate position, missing minutiae, and spurious extracted minutiae.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.6
• /
• pp.853-856
• /
• 2021

In this paper, a low noise amplifier having high gain and low noise by using input and inter stage matching circuits has been designed. A current-reused two-stage common-source topology is adopted, which can obtain high gain and low power consumption. Deterioration of noise characteristics according to the source inductive degeneration matching is compensated by adopting additional matching circuits. Moreover trade-offs among noise, gain, linearity, impedance matching, and power dissipation have been considered. In this design, 0.18-mm CMOS process is employed for the simulation. The simulated results show that the designed low noise amplifier can provide high power gain and low noise characteristics.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.15 no.5
• /
• pp.37-43
• /
• 2006

The target of this study is development of web based mold discrimination system by matching vision information with CAD database. The use of 2D vision image makes possible speedy mold discrimination from many databases. The image processing such as preprocessing, cleaning is done for obtaining vivid image with object information. The web-based system is a program which runs to exchange messages between a server and a client by making of ActiveX control and the result of mold discrimination is shown on web-browser. For effective feature classification and extraction, signature method is used to make sensible information from 2D data. As a result, the possibility of proposed system is shown as matching feature information from vision image with CAD database samples.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.79-90
• /
• 2008

In the ubiquitous environment sensor network technologies have advanced for collecting information of the environment. With the rapid growth of sensor network technology, it is necessary and important to share the collected sensor data with a large base of diverse users. In order to provide dissemination of sensor data, we design an information dissemination system using an independent disseminator between provider and consumer. This paper describes how we designed the information dissemination system using one of the possible dissemination patterns for sensor networks, and an efficient matching algorithm called CGIM (Classed Grouping Index Matching) which employs a dynamic re-grouping scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.628-630
• /
• 2016

Compressive sensing can recover an original sparse signal from a few measurements. Its performance is affected by the number of non-zero elements in the signal. The knowledge of partial locations of non-zero elements can improve the recovery performance. In this paper, we apply the partial location knowledge to the multipath matching pursuit. The numerical results show it improves the signal recovery performance and the channel estimation performance in the ITU-VB channel.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.519-525
• /
• 2006

The traditional area-based matching or efficient matching methods using epipolar geometry and height restriction of stereo images, which have a confined search space for image matching, have still some disadvantages such as mismatching and timeconsuming, especially in the dense metropolitan city that very high and similar buildings exist. To solve these problems, a new image matching method through building recognition has been presented. This paper described building recognition in color stereo images using edge and color information as a elementary study of new matching scheme. We introduce the modified Hausdorff distance for using edge information, and the modified color indexing with 3-D RGB histogram for using color information. Color information or edge information alone is not enough to find conjugate building pairs. For edge information only, building recognition rate shows 46.5%, for color information only, 7.1%. However, building recognition rate distinctly increase 78.5% when both information are combined.