• Journal of Information Processing Systems
• /
• v.12 no.2
• /
• pp.322-331
• /
• 2016

Image compression is an essential technique for saving time and storage space for the gigantic amount of data generated by images. This paper introduces an adaptive source-mapping scheme that greatly improves bit-level lossless grayscale image compression. In the proposed mapping scheme, the frequency of occurrence of each symbol in the original image is computed. According to their corresponding frequencies, these symbols are sorted in descending order. Based on this order, each symbol is replaced by an 8-bit weighted fixed-length code. This replacement will generate an equivalent binary source with an increased length of successive identical symbols (0s or 1s). Different experiments using Lempel-Ziv lossless image compression algorithms have been conducted on the generated binary source. Results show that the newly proposed mapping scheme achieves some dramatic improvements in regards to compression ratios.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.4
• /
• pp.790-794
• /
• 2007

This paper presents a new index mapping method for DFT (Discrete Fourier Transform) and its application to multidimensional DFT. Unlike conventional index mapping methods such as DIT (Decimation in Time) or DIF (Decimation in Frequency) algorithms, the proposed method is based on two levels of decomposition and it can be very efficiently used for implementing multidimensional DFT as well as 1-dimensional DFT. The proposed pipelined architecture for multidimensional DFT is very flexible so that it can lead to the best tradeoff between performance and hardware requirements. Also, it can be easily extended to higher dimensional DFTs since the number of CEs (Computational Elements) and DCs (Delay Commutators) increase only linearly with the dimension. Various implementation options based on different radices and different pipelining depths will be presented.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.388-388
• /
• 2000

The complexity of nonlinear systems makes it difficult to ascertain their behavior using classical methods of analysis. Many efforts have been focused on the advanced algorithms and techniques that hold the promise of improving real-time optimal control while at the same time providing higher accuracy. In this paper, a fuzzy cell mapping method of real-time optimal control far nonlinear dynamical systems is proposed. This approach combines fuzzy logic with cell mapping techniques in order to find the optimal input level and optimal time interval in the finite set which change the state of a system to achieve a desired obiective. In order to illustrate this method, we analyze the behavior of an inverted pendulum using fuzzy cell mapping.

• Nonlinear Functional Analysis and Applications
• /
• v.29 no.1
• /
• pp.69-81
• /
• 2024

In this paper, we provide certain fixed point results for a generalized 𝛼-nonexpansive mapping, as well as a new iterative algorithm called SRJ-iteration for approximating the fixed point of this class of mappings in the setting of CAT(0) spaces. Furthermore, we establish strong and ∆-convergence theorem for generalized 𝛼-nonexpansive mapping in CAT(0) space. Finally, we present a numerical example to illustrate our main result and then display the efficiency of the proposed algorithm compared to different iterative algorithms in the literature. Our results obtained in this paper improve, extend and unify results of Abbas et al. [10], Thakur et al. [22] and Piri et al. [19].

• Communications of the Korean Mathematical Society
• /
• v.10 no.2
• /
• pp.301-304
• /
• 1995

Our main purpose in this paper is to discuss a new result on convergence of nonlinear contractive algorithms acting on different Banach spaces.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2011.05a
• /
• pp.185-185
• /
• 2011

Mapping of artificial levee lines, one of major tasks in river zone mapping, is critical to prevention of river flood, protection of environments and eco systems in river zones. Thus, mapping of artificial levee lines is essential for management and development of river zones. Coastal mapping including river zone mapping has been historically carried out using surveying technologies. Photogrammetry, one of the surveying technologies, is recently used technology for national river zone mapping in Korea. Airborne laser scanning has been used in most advanced countries for coastal mapping due to its ability to penetrate shallow water and its high vertical accuracy. Due to these advantages, use of LiDAR data in coastal mapping is efficient for monitoring and predicting significant topographic change in river zones. This paper introduces a method for construction of a 3D artificial levee line using a set of LiDAR points that uses normal vectors. Multiple steps are involved in this method. First, a 2.5-dimensional Delaunay triangle mesh is generated based on three nearest-neighbor points in the LiDAR data. Second, a median filtering is applied to minimize noise. Third, edge selection algorithms are applied to extract break edges from a Delaunay triangle mesh using two normal vectors. In this research, two methods for edge selection algorithms using hypothesis testing are used to extract break edges. Fourth, intersection edges which are extracted using both methods at the same range are selected as the intersection edge group. Fifth, among intersection edge group, some linear feature edges which are not suitable to compose a levee line are removed as much as possible considering vertical distance, slope and connectivity of an edge. Sixth, with all line segments which are suitable to constitute a levee line, one river levee line segment is connected to another river levee line segment with the end points of both river levee line segments located nearest horizontally and vertically to each other. After linkage of all the river levee line segments, the initial river levee line is generated. Since the initial river levee line consists of the LiDAR points, the pattern of the initial river levee line is being zigzag along the river levee. Thus, for the last step, a algorithm for smoothing the initial river levee line is applied to fit the initial river levee line into the reference line, and the final 3D river levee line is constructed. After the algorithm is completed, the proposed algorithm is applied to construct the 3D river levee line in Zng-San levee nearby Ham-Ahn Bo in Nak-Dong river. Statistical results show that the constructed river levee line generated using a proposed method has high accuracy in comparison to the ground truth. This paper shows that use of LiDAR data for construction of the 3D river levee line for river zone mapping is useful and efficient; and, as a result, it can be replaced with ground surveying method for construction of the 3D river levee line.

• Korean Journal of Mathematics
• /
• v.18 no.4
• /
• pp.441-464
• /
• 2010

In this paper, we introduce an iterative method for finding common elements of the set of solutions to a general system of variational inequalities for inverse-strongly accretive mappings and of the set of fixed points of strict pseudo-contractions in a real Banach space. The results presented in this paper mainly improve and extend the corresponding results announced by many others.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.75-86
• /
• 2010

An iterative algorithm was been studied which can be viewed as an extension of the previously known algorithms for asymptotically nonexpansive mappings. Subsequently, we study the convergence problem of the proposed iterative algorithm for asymptotically nonexpansive mappings under some mild conditions in Banach spaces.

• Communications of the Korean Mathematical Society
• /
• v.25 no.2
• /
• pp.313-325
• /
• 2010

General models for the relaxed proximal point algorithm using the notion of relative maximal accretiveness (RMA) are developed, and then the convergence analysis for these models in the context of solving a general class of nonlinear inclusion problems differs significantly than that of Rockafellar (1976), where the local Lipschitz continuity at zero is adopted instead. Moreover, our approach not only generalizes convergence results to real Banach space settings, but also provides a suitable alternative to other problems arising from other related fields.