• 대한수학회논문집
• /
• 제25권3호
• /
• pp.419-426
• /
• 2010

In this paper, a three-step iterative method is considered for finding a common element in the set of fixed points of a non-expansive mapping and in the set of solutions of a variational inclusion problem in a real Hilbert space.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.92.2-92
• /
• 2002

Building autonomous robots have been a central objective of research in artificial intelligence. The development of techniques for autonomous navigation in real environment consist one of the main tendencies of the current researches about Robotics. An important problem in autonomous navigation is the necessity of dealing with a great amount of uncertainties inherent to the real environments. The paraconsistent logic has characteristics that make it become an adequate tool to solve this problem. In this work, it is proposed a technique of mapping the real world in the navigation of an autonomous robot using the paraconsistent logic.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1995년도 추계학술대회
• /
• pp.193-196
• /
• 1995

An algorithm using topological mapping has been developed for a real-time detection of the QRS complexes of ECG signals. As a measurement of QRS complex energy, we used topological mapping from one dimensional sampled ECG signals to two dimensional vectors. These vectors are reconstructed with the sampled ECG signals and the delayed ones. In this method, the detection rates of CRS complex vary with the parameters such as R-R interval average and peak detection threshold coefficient. We use mean, median, and iterative method to determint R-R interval average and peak estimation. We experiment on various value of search back coefficient and peak detection threshold coefficient to find optimal rule.

• 대한수학회지
• /
• 제41권4호
• /
• pp.667-680
• /
• 2004

We generalize a theorem of W. Benz by proving the following result: Let $H_{\theta}$ be a half space of a real Hilbert space with dimension $\geq$ 3 and let Y be a real normed space which is strictly convex. If a distance $\rho$ > 0 is contractive and another distance N$\rho$ (N $\geq$ 2) is extensive by a mapping f : $H_{\theta}$ \longrightarrow Y, then the restriction f│$_{\theta}$ $H_{+}$$\rho$/2// is an isometry, where $H_{\theta}$＋$\rho$/2/ is also a half space which is a proper subset of $H_{\theta}$. Applying the above result, we also generalize a classical theorem of Beckman and Quarles.

• 대한수학회논문집
• /
• 제25권1호
• /
• pp.129-137
• /
• 2010

In this paper, we introduce and study a system of nonlinear set-valued implicit variational inclusions (SNSIVI) with relaxed cocoercive mappings in real Banach spaces. By using resolvent operator technique for M-accretive mapping, we construct a new class of iterative algorithms for solving this class of system of set-valued implicit variational inclusions. The convergence of iterative algorithms is proved in q-uniformly smooth Banach spaces. Our results generalize and improve the corresponding results of recent works.

• 대한수학회지
• /
• 제41권3호
• /
• pp.461-477
• /
• 2004

It is shown that every almost linear mapping h : A\longrightarrowB of a unital $C^{*}$ -algebra A to a unital $C^{*}$ -algebra B is a homomorphism under some condition on multiplication, and that every almost linear continuous mapping h : A\longrightarrowB of a unital $C^{*}$ -algebra A of real rank zero to a unital $C^{*}$ -algebra B is a homomorphism under some condition on multiplication. Furthermore, we are going to prove the generalized Hyers-Ulam-Rassias stability of *-homomorphisms between unital $C^{*}$ -algebras, and of C-linear *-derivations on unital $C^{*}$ -algebras./ -algebras.

• KIEAE Journal
• /
• 제10권4호
• /
• pp.3-8
• /
• 2010

Recently, various daylight evaluation methods for visual environment have been developed; simulation analysis methods, numerical calculation, and data monitoring methods. However, it is impossible for simulation analysis to make real scenes and visualize real images exactly. Also, a numerical calculation is considered as an out of date and time-consuming mean. Therefore, for acquisition of accurate results, many studies often use the monitoring data methods. Especially, most studies regarding discomfort glare are evaluated by measuring the physical quantity of luminance through traditional measuring Minolta Luminance meters as an instrument. But, this method has a difficulty in measuring several points at the same time because of the limitation of spaces and time when mapping. So, this study focused on the potential usefulness of High Dynamic Range photography technique as a luminance mapping tool. In order to evaluate the accuracy of proposed programs such as webHDR, Photomatix and PHOTOLUX, this paper has conducted an experiment by using Canon EOS 5D and NICON Coolpix8400 digital camera.

• 한국멀티미디어학회논문지
• /
• 제11권8호
• /
• pp.1138-1145
• /
• 2008

최근에 다양한 분야에서 캐릭터 표정을 생성하는데 연기자 기반 표정 캡쳐 방법을 널리 사용하고 있다. 특히, 방송이나 게임 등의 분야에서는 실시간 요소와 연기자와 외형상의 차이가 큰 캐릭터의 경우에도 표정 표현이 가능한 다양성이 중요한 문제가 된다. 본 논문에서는 연기자 얼굴에서 캡쳐한 표정을 다양한 얼굴 모델에 적용하는 새로운 표정 애니메이션 방법을 제안한다. 이 방법을 사용하면 최소의 실시간 비용으로 캐릭터 표정을 생성하고 제어하는 것이 가능하다. 본 논문에서는 세 가지 핵심 이슈로서 얼굴 표정 캡쳐, 표정 대입, 표정 애니메이션을 다룬다. 그리고 연기자와 얼굴 모델 간의 특성이 매우 상이한 다양한 경우에 대하여 실험결과를 보여줌으로써 접근방식의 유효성을 증명한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• pp.281-284
• /
• 2007

A realization for image distortion correction processing system with DSP processor is presented in this paper. The image distortion correcting algorithm is realized by DSP processor for focusing on more real time processing than image quality. The lens and camera distortion coefficients are processed by YCbCr Lookup Tables and the correcting algorithm is applied to reverse mapping method for geometrical transform. The system experimentation results in the processing time about 34.6 msec on $720{\times}480$ curved image at 150 degree visual range.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권10호
• /
• pp.5063-5073
• /
• 2016

In this paper, an efficient texture compression method is proposed for fast rendering, which exploits the spatial correlation among blocks through intra-picture block matching. Texture mapping is widely used to enhance the visual quality of results in real-time rendering applications. For fast texture mapping, it is necessary to identify an effective trade-off between compression efficiency and computational complexity. The conventional compression methods utilized for image processing (e.g., JPEG) provide high compression efficiency while resulting in high complexity. Thus, low complexity methods, such as ETC1, are often used in real-time rendering applications. Although these methods can achieve low complexity, the compression efficiency is still lower than that of JPEG. To solve this problem, we propose a texture compression method by reducing the spatial redundancy between blocks in order to achieve the better compression performance than ETC1 while maintaining complexity that is lower than that of JPEG. Experimental results show that the proposed method achieves better compression efficiency than ETC1, and the decoding time is significantly reduced compared to JPEG while similar to ETC1.