• Journal of Computing Science and Engineering
• /
• 제10권2호
• /
• pp.68-73
• /
• 2016

An efficient texture compression method is proposed based on a block matching process between the current block and the previously encoded blocks. Texture mapping is widely used to improve the quality of rendering results in real-time applications. For fast texture mapping, it is important to find an optimal trade-off between compression efficiency and computational complexity. Low-complexity methods (e.g., ETC1 and DXT1) have often been adopted in real-time rendering applications because conventional compression methods (e.g., JPEG) achieve a high compression ratio at the cost of high complexity. We propose a block matching-based compression method that can achieve a higher compression ratio than ETC1 and DXT1 while maintaining computational complexity lower than that of JPEG. Through a comparison between the proposed method and existing compression methods, we confirm our expectations on the performance of the proposed method.

• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.939-944
• /
• 2010

Let H be a real Hilbert space. Let T : $H\;{\rightarrow}\;H$ be an averaged mapping with $F(T)\;{\neq}\;{\emptyset}$. Let {$\alpha_n$} be a real numbers in (0, 1). For given $x_0\;{\in}\;H$, let the sequence {$x_n$} be generated iteratively by $x_{n+1}\;=\;(1\;-\;{\alpha}_n)Tx_n$, $n\;{\geq}\;0$. Assume that the following control conditions hold: (i) $lim_{n{\rightarrow}{\infty}}\;{\alpha}_n\;=\;0$; (ii) $\sum^{\infty}_{n=0}\;{\alpha}_n\;=\;{\infty}$. Then {$x_n$} converges strongly to a fixed point of T.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.122-127
• /
• 2004

The color gamut mapping method that is used for enhancing the color reproduction quality between PC monitor and printer devices is adopted for display quality enhancement. The high definition display devices operate at the clock speed of around $70\;MHz\;\sim\;150\;MHz$ and permit several nano seconds for real-time processing. Thus, the concept of three-dimensional reduced resolution look-up table is used. The required hardware can be greatly reduced by look-up table resolution adjustment. The proposed hardware architecture is successfully implemented in ASIC and also successfully adopted in display quality enhancement purposes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권8호
• /
• pp.3981-4004
• /
• 2019

This paper proposes a novel method for locating objects in real space from a single remote image and measuring actual distances between them by automatic detection and perspective transformation. The dimensions of the real space are known in advance. First, the corner points of the interested region are detected from an image using deep learning. Then, based on the corner points, the region of interest (ROI) is extracted and made proportional to real space by applying warp-perspective transformation. Finally, the objects are detected and mapped to the real-world location. Removing distortion from the image using camera calibration improves the accuracy in most of the cases. The deep learning framework Darknet is used for detection, and necessary modifications are made to integrate perspective transformation, camera calibration, un-distortion, etc. Experiments are performed with two types of cameras, one with barrel and the other with pincushion distortions. The results show that the difference between calculated distances and measured on real space with measurement tapes are very small; approximately 1 cm on an average. Furthermore, automatic corner detection allows the system to be used with any type of camera that has a fixed pose or in motion; using more points significantly enhances the accuracy of real-world mapping even without camera calibration. Perspective transformation also increases the object detection efficiency by making unified sizes of all objects.

• 대한수학회보
• /
• 제39권1호
• /
• pp.43-51
• /
• 2002

The aim of this paper is to prove a convergence theorem of a generalized Ishikawa iteration sequence for two multi-valued strongly pseudo-contractive mappings by using an approximation method in real uniformly smooth Banach spaces. We generalize and extend the results of Chang and Chang, Cho, Lee, Jung, and Kang.

• Korean Journal of Mathematics
• /
• 제24권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.

• 대한수학회지
• /
• 제48권3호
• /
• pp.641-653
• /
• 2011

The intermediate value theorem for a continuous real valued function is a kind of Bolzano's theorem. Similar results also hold for compact, monotone or accretive mappings in Banach spaces. In this paper we give multivalued versions of Bolzano's theorem.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.154-154
• /
• 2000

The cooperative strategy for the teleoperated multi-agent system is presented. And this scheme has been applied to the teleoperated robot soccer system that is newly proposed. For the teleoperated robot soccer system, we made mapping functions to control a 2-wheeled mobile robot using a 2 DoF stickcontroller. The simulation with a real stickcontroller has been evaluated the performance of the proposed mapping function. Then, the basic cooperation strategy has been tested between teleoperated robot and autonomous robot It is shown that the multi-agent system for teleoperation can have a good performance for a job Like a scoring a goal

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.789-792
• /
• 2003

Pipe inspection has a great importance to ensure safety for the nuclear power plant. In this paper, we designed visual inspection module for the tube internal, which diameter is 15${\sim}$20mm. And we made inspection module which consisted of CCD camera and light. And the relation between image and real world coordinate is established. Image processing is performed to calculate mapping parameter and analyze the size of defect. For the calculation of mapping parameter, experiment is performed using grid type test pattern. Acquired image is processed to extract image coordinate. Edge detection, thresholding, median filtering and morphology filtering is applied to extract grid pattern. Extracted image coordinate is used to calculate image to real world mapping. Lens distortion was considered and corrected to get exact data. Coordinate transformation data is provided for the users to recognize easily. Experiment was performed using grid type test pattern, we extracted lens distortion parameter and real coordinate of defect point. Radial distortion of lens was corrected but tangential distortion was not considered. As continuum to this study, the tangential distortion of lens is considered and improvement of analy zing technique for the tube internal be explored continuously.

• 대한수학회보
• /
• 제49권4호
• /
• pp.799-813
• /
• 2012

In this paper, we first show that the iteration {$x_n$} defined by $x_{n+1}=P((1-{\alpha}_n)x_n +{\alpha}_nTP[{\beta}_nTx_n+(1-{\beta}_n)x_n])$ converges strongly to some fixed point of T when E is a real uniformly convex Banach space and T is a quasi-nonexpansive non-self mapping satisfying Condition A, which generalizes the result due to Shahzad [11]. Next, we show the strong convergence of the Mann iteration process with errors when E is a real uniformly convex Banach space and T is a quasi-nonexpansive self-mapping satisfying Condition A, which generalizes the result due to Senter-Dotson [10]. Finally, we show that the iteration {$x_n$} defined by $x_{n+1}={\alpha}_nSx_n+{\beta}_nT[{\alpha}^{\prime}_nSx_n+{\beta}^{\prime}_nTx_n+{\gamma}^{\prime}_n{\upsilon}_n]+{\gamma}_nu_n$ converges strongly to a common fixed point of T and S when E is a real uniformly convex Banach space and T, S are two quasi-nonexpansive self-mappings satisfying Condition D, which generalizes the result due to Ghosh-Debnath [3].