• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.10
• /
• pp.2403-2408
• /
• 2014

We designate multiple target areas for the advertisement disseminations in order to resolve the problem of advertisement transmission efficiency degradation due to overlapped device-to-device (D2D) transmissions and unnecessary advertisement transmissions. We here propose an efficient advertisement dissemination algorithm based on pre-selected target areas considering user density. In our proposed algorithm, relay nodes are gradually selected according to the locations of the target areas. We mathematically analyze D2D advertisement coverages of our proposed algorithm, and compare the various simulation results of the proposed algorithm with those of the conventional algorithm according to the several simulation scenarios via intensive simulations.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.2
• /
• pp.35-47
• /
• 2018

The 4th industrial revolution, digital image technology has developed beyond the limit of multimedia industry to advanced IT fusion and composite industry. Particularly, application technology related to HCI element algorithm in 3D image object recognition field is actively developed. 3D image object recognition technology evolved into intelligent image sensing and recognition technology through 3D modeling. In particular, image recognition technology has been actively studied in image processing using object recognition recognition processing, face recognition, object recognition, and 3D object recognition. In this paper, we propose a research method of human factor 3D image recognition technology applying human factor algorithm for 3D object recognition. 1. Methods of 3D object recognition using 3D modeling, image system analysis, design and human cognitive technology analysis 2. We propose a 3D object recognition parameter estimation method using FACS algorithm and optimal object recognition measurement method. In this paper, we propose a method to effectively evaluate psychological research techniques using 3D image objects. We studied the 3D 3D recognition and applied the result to the object recognition element to extract and study the characteristic points of the recognition technology.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.285-286
• /
• 2008

In this paper, we propose adaptive search channel estimate algorithm. The proposed algorithm is modified LMS algorithm which has a variable step size and parallel convolution. In simulation result, a error estimate accuracy of the proposed algorithm is about -20 dB and general LMS algorithm is about 10 dB. The proposed algorithm is better error estimate accuracy than general LMS algorithm.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1985.10a
• /
• pp.87-94
• /
• 1985

In this paper, enhancement of speech corrupted by additive white or colored noise is stuided. The nuconstrained frequency-domain block least-mean-square (UFBLMS) adaptation algorithm and its frequency-weighted version are newly applied to speech enhancement. For enhancement of speech degraded by white noise, the performance of the UFBLMS algorithm is superior to the spectral subtraction method or Wiener filtering technique by more than 3 dB in segmented frequency-weighted signal-to-noise ratio(FWSNERSEG) when SNR of speech is in the range of 0 to 10 dB. As for enhancement of noisy speech corrupted by colored noise, the UFBLMS algorithm is superior to that of the spectral subtraction method by about 3 to 5 dB in FWSNRSEG. Also, it yields better performance by about 2 dB in FWSNR and FWSNRSEG than that of time-domain least-mean-square (TLMS) adaptive prediction filter(APF). In view of the computational complexity and performance improvement in speech quality and intelligibility, the frequency-weighted UFBLMS algorithm appears to yield the best performance among various algorithms in enhancing noisy speech corrupted by white or colored noise.

• Journal of Information Technology Services
• /
• v.6 no.1
• /
• pp.151-158
• /
• 2007

D-class computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and search for equivalent $n{\times}n$ Boolean matrices according to a specific equivalence relation. It is easy to see that even multiplying all $n{\times}n$ Boolean matrices with themselves shows exponential time complexity and D-Class computation was left an unsolved problem due to its computational complexity. The vector-based multiplication theory shows that the multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices can be done much more efficiently. However, D-Class computation requires computation of equivalent classes in addition to the efficient multiplication. The paper discusses a theory and an algorithm for efficient D-class computation, and shows execution results of the algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.7
• /
• pp.651-658
• /
• 2011

An efficient modified $D^*$ lite algorithm is suggested, which can perform online path planning for mobile robots in dynamic indoor environment. Online path planning should plan and execute alternately in a short time, and hence it enables the robot avoid unknown dynamic obstacles which suddenly appear on robot's path. Based on $D^*$ Lite algorithm, we improved representation of edge cost, heuristic function, and priority queue management, to build a modified $D^*$ Lite algorithm. Performance of the proposed algorithm is revealed via extensive simulation study.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.8
• /
• pp.1528-1535
• /
• 1994

In this paper, a filtered-X LMS algorithm by new error path identification method is proposed for active noise control system. The proposed algorithm identifies accurately the error path transfer function using three microphones and the control of error signal through double loop scheme with on-line. In the computer simulation using the sinusoidal and the practical duct noise, the proposed algorithm reduces noise level about 29.1dB and 10.4dB, respectively. We can observe the improvement of about 0.5dB and 2.5dB in noise level compared with that obtained using the filtered-X LMS algorithm of Eriksson model.

• The Journal of Korea Robotics Society
• /
• v.17 no.3
• /
• pp.255-263
• /
• 2022

3D object detection pipelines often incorporate RGB-based object detection methods such as YOLO, which detects the object classes and bounding boxes from the RGB image. However, in complex environments where objects are heavily cluttered, bounding box approaches may show degraded performance due to the overlapping bounding boxes. Mask based methods such as Mask R-CNN can handle such situation better thanks to their detailed object masks, but they require much longer time for data preparation compared to bounding box-based approaches. In this paper, we present a 3D object recognition pipeline which uses either the YOLO or Mask R-CNN real-time object detection algorithm, K-nearest clustering algorithm, mask reduction algorithm and finally Principal Component Analysis (PCA) alg orithm to efficiently detect 3D poses of objects in a complex environment. Furthermore, we also present an improved YOLO based 3D object detection algorithm that uses a prioritized heightmap clustering algorithm to handle overlapping bounding boxes. The suggested algorithms have successfully been used at the Artificial-Intelligence Robot Challenge (ARC) 2021 competition with excellent results.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.2
• /
• pp.139-146
• /
• 2016

Recently, popularity of 3D technology has been growing significantly and it has many application parts in the various fields of industry. In order to overcome the limitations of 2D machine vision technologies based on 2D image, we need the 3D measurement technologies. There are many 3D measurement methods as such scanning probe microscope, phase shifting interferometry, confocal scanning microscope, white-light scanning interferometry, and so on. In this paper, we have used the extended depth of focus (EDF) algorithm among 3D measurement methods. The EDF algorithm is the method which extracts the 3D information from 2D images acquired by short range depth camera. In this paper, we propose the EDF algorithm using the edge informations of images and the average values of all pixel on z-axis to improve the performance of conventional method. To verify the performance of the proposed method, we use the various synthetic images made by point spread function(PSF) algorithm. We can correctly make a comparison between the performance of proposed method and conventional one because the depth information of these synthetic images was known. Through the experimental results, the PSNR of the proposed algorithm was improved about 1 ~ 30 dB than conventional method.