• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.176-179
• /
• 2010

In this paper, we propose a fast implementation of Bilateral filter for tone mapping algorithm. Bilateral filter is able to preserve detail while at the same time prevent halo-ing artifacts because of improper scale selection by ensuring image smoothed that not only depend on pixel closeness, but also similarity. We accelerate Bilateral filter by using a piecewise linear approximation and recursive Gaussian filter as its domain filter. Recursive Gaussian filter is scale independent filter that combines low cost 1D filter which makes this filter much faster than conventional convolution filter and filtering in frequency domain. The experiment results show that proposed method is simpler and faster than previous method without mortgaging the quality.

• ETRI Journal
• /
• v.41 no.2
• /
• pp.207-223
• /
• 2019

Network function virtualization can significantly improve the flexibility and effectiveness of network appliances via a mapping process called service function chaining. However, the failure of any single virtualized network function causes the breakdown of the entire chain, which results in resource wastage, delays, and significant data loss. Redundancy can be used to protect network appliances; however, when failures occur, it may significantly degrade network efficiency. In addition, it is difficult to efficiently map the primary and backups to optimize the management cost and service reliability without violating the capacity, delay, and reliability constraints, which is referred to as the reliability-aware service chaining mapping problem. In this paper, a mixed integer linear programming formulation is provided to address this problem along with a novel online algorithm that adopts the joint protection redundancy model and novel backup selection scheme. The results show that the proposed algorithm can significantly improve the request acceptance ratio and reduce the consumption of physical resources compared to existing backup algorithms.

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

Due to the limited field of view of the pinhole camera, there is a lack of stability and accuracy in camera pose estimation applications such as visual SLAM. Nowadays, multiple-camera setups and large field of cameras are used to solve such issues. However, a multiple-camera system increases the computation complexity of the algorithm. Therefore, in multiple camera-assisted visual simultaneous localization and mapping (vSLAM) the multi-view tracking algorithm is proposed that can be used to balance the budget of the features in tracking and local mapping. The proposed algorithm is based on PanoSLAM architecture with a panoramic camera model. To avoid the scale issue 3D LiDAR is fused with omnidirectional camera setup. The depth is directly estimated from 3D LiDAR and the remaining features are triangulated from pose information. To validate the method, we collected a dataset from the outdoor environment and performed extensive experiments. The accuracy was measured by the absolute trajectory error which shows comparable robustness in various environments.

• Journal of applied mathematics & informatics
• /
• v.35 no.3_4
• /
• pp.313-321
• /
• 2017

In this note we establish a new non-convex hybrid iteration algorithm corresponding to Khan iterative process [4] and prove strong convergence theorems of common fixed points for a uniformly closed asymptotically family of countable quasi-Lipschitz mappings in Hilbert spaces. Moreover, the main results are applied to get the common fixed points of finite family of quasi-asymptotically nonexpansive mappings. The results presented in this article are interesting extensions of some current results.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.9
• /
• pp.739-746
• /
• 1991

This paper develops a modified multilayer perceptron architecture which speeds up learning as well as the net's mapping accuracy. In Phase I, a cluster partitioning algorithm like the Kohonen's self-organizing feature map or the leader clustering algorithm is used as the front end that determines the cluster to which the input data belongs. In Phase II, this cluster selects a subset of the hidden layer nodes that combines the input and outputs nodes into a subnet of the full scale backpropagation network. The proposed net has been applied to two mapping problems, one rather smooth and the other highly nonlinear. Namely, the inverse kinematic problem for a 3-link robot manipulator and the 5-bit parity mapping have been chosen as examples. The results demonstrate the proposed net's superior accuracy and convergence properties over the original backpropagation network or its existing improvement techniques.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.3
• /
• pp.77-83
• /
• 2008

In this paper, CPLD low power technology mapping for reuse module design under the time constraint is proposed. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed algorithm is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource. Also, we are obtainable the optimal the scheduling result in experimental results of our using chaining and multi-cycling in the scheduling techniques. Low power circuit make using CPLD technology mapping algorithm for selection reuse module by scheduling.

• Journal of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.525-552
• /
• 2021

In this paper, we introduce two general iterative algorithms (one implicit algorithm and one explicit algorithm) for finding a common element of the solution set of the variational inequality problems for a continuous monotone mapping, the zero point set of a set-valued maximal monotone operator, and the fixed point set of a continuous pseudocontractive mapping in a Hilbert space. Then we establish strong convergence of the proposed iterative algorithms to a common point of three sets, which is a solution of a certain variational inequality. Further, we find the minimum-norm element in common set of three sets.

• ETRI Journal
• /
• v.43 no.4
• /
• pp.594-602
• /
• 2021

Recently, quantitative and repetitive inspections of the old urban area were conducted because many structures exceed their designed lifetime. The health of a building can be validated from the condition of the outer wall, while the slant angle of the wall widely serves as an indicator of urban regeneration projects. Mostly, the inspector directly measures the inclination of the wall or partially uses 3D point measurements using a static light detection and ranging (LiDAR). These approaches are costly, time-consuming, and only limited space can be measured. Therefore, we propose a mobile mapping system and automatic slant map generation algorithm, configured to capture urban environments online. Additionally, we use the LiDAR-inertial mapping algorithm to construct raw point clouds with gravity information. The proposed method extracts walls from raw point clouds and measures the slant angle of walls accurately. The generated slant angle map is evaluated in indoor and outdoor environments, and the accuracy is compared with real tiltmeter measurements.

• Journal of IKEEE
• /
• v.22 no.1
• /
• pp.68-73
• /
• 2018

In this paper, we propose an efficient algorithm for mapping a $360^{\circ}$ circular image to a planar image. The proposed algorithm consists of obtaining size of the planar image, calculating the distance between the camera and the planar image, calculating horizontal angle of camera and planar image, calculating vertical angle between camera and planar image, calculating the position of a pixel that matches pixels in a $360^{\circ}$ circular image to pixels in a planar image. Experiments were performed to evaluate the efficient algorithm for mapping the proposed $360^{\circ}$ circular image to the plane image. The reconstruction rate of the mapped plane image was confirmed 99% and the image quality of the mapped plane image was confirmed 72%. Since the results were higher than the standard values of commercial software, the effectiveness of the algorithm was confirmed.

• The KIPS Transactions:PartA
• /
• v.14A no.1 s.105
• /
• pp.73-76
• /
• 2007

The determination of the conformal maps from the unit disk onto a Jordan region has been completed by solving the Theodorsen equation which is an nonlinear equation for the boundary correspondence function. Wegmann's method has been well known for the efficient mothed among the many suggestions for the Theodorsen equation. We proposed an improved method for convergence by applying a low-frequency pass filter to the Wegmann's method and theoretically proved convergence of improved iteration[1, 2]. And we proposed an effective method which makes it possible to estimate an error even if the real value is nut acquired[3]. In this paper, we propose an automatic algorithm for numerical conformal mapping bared on this error analysis in our early study. By this algorithm numerical conformal mapping is determined automatically according to the given domain of problem and the required accuracy. The discrete numbers and parameters of the low-frequency filter were acquired only by experience. This algorithm, however, is able to determine the discrete numbers and parameters of the low-frequency filter automatically in accordance with the given region This results from analyzing the function, which may decide the shape of the given domain under the assumption that the degree of the problem depends of the transformation of a given domain, as seen in the Fourier Transform. This proposed algorithm is also ploved by numerical experience.