• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1054-1064
• /
• 2012

HDR (high dynamic range) tone mapping algorithms are used in image processing that reduces the dynamic range of an image to be displayed on LDR (low dynamic range) devices properly. The retinex is one of the tone mapping algorithms to provide dynamic range compression, color constancy, and color rendition. It has been developed through multi-scale methods and luminance-based methods. Retinex algorithms still have drawbacks such as the emphasized noise and desaturation. In this paper, we propose a multi scale tone mapping algorithm for enhancement of contrast, saturation, and noise of HDR rendered images based on visual brightness functions. In the proposed algorithm, HSV color space has been used for preserving the hue and saturation of images. And the algorithm includes the estimation of minimum and maximum luminance level and a visual gamma function for the variation of viewing conditions. And subjective and objective evaluations show that proposed algorithm is better than existing algorithms. The proposed algorithm is expected to image quality enhancement in some fields that require a improvement of the dynamic range due to the changes in the viewing condition.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1127-1130
• /
• 2003

This paper introduces histogramic in-motion mapping for real-time map building with the Eyebot in motion. A histogram grid used in HIMM is updated through three PSD sensors. HIMM makes it possible to make fast map-building and avoid obstacles in real-time. Fast map-building allows the robot to immediately use the mapped information in real-time obstacle-avoidance algorithms. HIMM has been tested on the Eyebot. The Eyebot sends PSD data to computer and computer builds a 3D-Map based on PSD data.

• Korean Journal of Mathematics
• /
• v.24 no.2
• /
• pp.181-198
• /
• 2016

In this work, we suggest a new system of generalized nonlinear regularized nonconvex variational inequalities in a real Hilbert space and establish an equivalence relation between this system and fixed point problems. By using the equivalence relation we suggest a new perturbed projection iterative algorithms with mixed errors for finding a solution set of system of generalized nonlinear regularized nonconvex variational inequalities.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.04a
• /
• pp.145-150
• /
• 2003

Mobile mapping system is a surveying system that use vehicle carrying various sensors as CCD camera, GPS and IMU(Inertial measurement Unit). This system capturing images of forward direction continuously while running road. Use these images, then acquire road and road facilities information as facilities position, size or maintenance condition. In this study, we organized data and each data processing steps that are needed for 3 dimensional positioning. And develop digital photogrammetry S/W easy to use and accurate for mobile mapping system.

• East Asian mathematical journal
• /
• v.25 no.2
• /
• pp.141-146
• /
• 2009

In this paper, we introduce a new generalized nonlinear quasivariational inequality and establish its equivalence with a xed point problem by using the resolvent operator technique. Utilizing this equivalence, we suggest two iterative schemes, prove two existence theorems of solutions for the generalized nonlinear quasivariational inequality involving generalized cocoercive mapping and establish some convergence results of the sequences generated by the algorithms. Our results include several previously known results as special cases.

• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.61-73
• /
• 2016

In this paper, we consider the problems of convergence of parallel iterative algorithms for a system of nonlinear variational inequalities and nonexpansive mappings. Strong convergence theorems are established in the frame work of real Banach spaces.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.4
• /
• pp.771-790
• /
• 2006

The iterative algorithms with errors for nonexpansive mappings are investigated in Banach spaces. Strong convergence theorems for these algorithms are obtained. Our results improve the corresponding results in [5, 13-15, 23, 27-29, 32] as well as those in [1, 16, 19, 26] in framework of a Hilbert space.

• Journal of Biosystems Engineering
• /
• v.24 no.2
• /
• pp.135-144
• /
• 1999

An yield monitoring system plays a key role in precision farming. An yield monitoring system and a DGPS were implemented to a widely used domestic combine for yield mapping of a small sized paddy field, and yield mapping algorithms were investigated in this study. The yield variation in the 0.1ha rice paddy field was measured by installing a yield flow sensor and a grain moisture sensor at the end of the clean grain elevator discharging grains into a grain tank. Yield map of the test filed was drawn in a point map and a linear interpolated map based on the result of the field test. The size of a unit yield grid in yield mapping was determined based on the combine traveling speed, effective harvesting width and data storing period. It was possible to construct the yield map of a small sized paddy field.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.4
• /
• pp.209-218
• /
• 2016

This paper proposes a new lifetime aware buffer mapping method of a synchronous dataflow (SDF) graph on a hybrid memory system with DRAM and PRAM. Since the number of write operations on PRAM is limited, the number of written samples on PRAM is minimized to maximize the lifetime of PRAM. We improve the utilization of DRAM by mapping more buffers on DRAM through buffer sharing. The problem is formulated formally and solved by an optimal approach of an answer set programming. In experiment, the buffer mapping method with buffer sharing improves the PRAM lifetime by 63%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7B
• /
• pp.818-826
• /
• 2011

This paper proposes a novel FTL (Flash Translation Layer) algorithm employing sector-level mapping technique based on locality to reduce the number of erase operations in flash memory accesses. Sector-level mapping technique shows higher performance than other mapping techniques, even if it requires a large mapping table. The proposed algorithm reduces the size of mapping table by employing dynamic table update, processes sequential writes by exploiting sequential locality and extracts hot sector in random writes. Experimental results show that the number of erase operations has been reduced by 75.4%, 65.8%, and 10.3% respectively when compared with well-known BAST, FAST and sector mapping algorithms.