• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2010년도 춘계학술대회
• /
• 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
• /
• 제41권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.

• 로봇학회논문지
• /
• 제17권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
• /
• 제35권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.

• 전자공학회논문지B
• /
• 제28B권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.

• 디지털산업정보학회논문지
• /
• 제4권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.

• 대한수학회지
• /
• 제58권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
• /
• 제43권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.

• 전기전자학회논문지
• /
• 제22권1호
• /
• pp.68-73
• /
• 2018

본 논문에서는 $360^{\circ}$ 원형영상을 평면영상에 매핑하기 위한 효율적인 알고리즘을 제안한다. 제안된 알고리즘은 평면영상의 크기 구하기, 카메라와 평면영상 사이의 각 지점에 따른 거리 계산, 카메라와 평면영상이 수평으로 이루는 각도 산출, 카메라와 평면영상이 수직으로 이루는 각도 산출, $360^{\circ}$ 원형영상의 픽셀들을 평면영상의 픽셀에 매칭시키는 픽셀의 위치 계산 등 5단계로 구성된다. 제안한 $360^{\circ}$ 원형영상을 평면영상에 매핑하기 위한 효율적인 알고리즘을 평가하기 위하여 실험한 결과, 매핑된 평면영상의 복원율은 99%, 매핑된 평면영상의 화질은 72%로서 상용 소프트웨어의 기준치보다 높은 결과를 산출했기 때문에 알고리즘의 효용성이 확인되었다.

• 정보처리학회논문지A
• /
• 제14A권1호
• /
• pp.73-76
• /
• 2007

단위원의 내부로부터 Jordan 영역으로의 등각사상을 구하는 것은 일반적으로 비선형방정식인 Theodorsen 방정식을 푸는 것으로 귀결된다. 저자는 이 비선형 방정식의 수치적 해법 중 가장 효율적인 방법으로 알려진 Wegmann의 해법에 저주파 필터를 적용하여 개선하고 새로운 산법의 수렴성을 이론적으로 증명한 바 있다[1, 2]. 또한 이 해법에 있어 참값을 모르더라도 오차평가가 가능한 방법을 제안하였다[3]. 본 논문에서는 참값을 모르더라도 오차평가가 가능한 연구결과를 이용하여 주어진 문제영역과 허용오차에 따라 자동으로 수치등각사상이 결정되는 알고리즘을 제안한다. 이 알고리즘에서는 지금까지 경험에 의존했었던 표본수와 저주파 필터 파라메터가 주어진 문제영역에 따라 자동으로 결정된다. 이것은 문제의 난이도가 문제영역의 변형에 의존한다는 전제로 문제영역의 모양을 결정하는 함수를 Fourier 급수로 전개, 분석하여 얻을 수 있다. 수치실험을 통해 그 유효성을 입증한다.