• 대한기계학회논문집B
• /
• 제30권1호
• /
• pp.8-15
• /
• 2006

A Sparse Point Representation(SPR) based on interpolation wavelets is presented. The SPR is implemented for the purpose of CFD data compression. Unlike conventional wavelet transformation, the SPR relieves computing workload in the similar fashion of lifting scheme that includes splitting and prediction procedures in sequence. However, SPR skips update procedure that is major part of lifting scheme. Data compression can be achieved by proper thresholding method. The advantage of the SPR method is that, by keeping even point physical values, low frequency filtering procedure is omitted and its related unphysical thresholing mechanism can be avoided in reconstruction process. Extra singular feature detection algorithm is implemented for preserving singular features such as shock and vortices. Several numerical tests show the adequacy of SPR for the CFD data. It is also shown that it can be easily extended to nonlinear adaptive wavelets for enhanced feature capturing.

• East Asian mathematical journal
• /
• 제29권4호
• /
• pp.449-466
• /
• 2013

This paper started from a question: Can it help a student solve the problem to give supports in point of view of a teacher knowing the solution. We performed a case study to get an answer for the question. We analysed a case which students do not make full use of data in the mathematical problem from this point of view of the mental representation. We examined closely the cause for not making full use of data. We got that the wrong mental representation which the students get from data in the problem lead to not making full use of data. We knew that it is insufficient to present the data not making use of. To help a student truly, it is necessary to give a aid based on a student's mental representation. From the conclusion of study, We got that figuring out student's mental representation is important and hope that many investigation about student's mental representation for various problem occur with frequency.

• 한국정보통신학회논문지
• /
• 제8권5호
• /
• pp.1089-1095
• /
• 2004

주어진 네트워크에서 최적의 스타이너 트리를 구하는 문제는 NP-hard이며, 최적에 가까운 스타이너 트리를 구하기 위하여 유전자 알고리즘을 이용한다. 본 논문에서는 이 문제를 해결하기 위하여 유전자 알고리즘에서 염색체를 기존의 이진스트링 대신 부동소수점으로 표현하였다. 먼저 주어진 네트워크에 Prim의 알고리즘을 적용하여 스패닝 트리를 구하고, 부동소수점 표현을 갖는 유전자 알고리즘을 사용하여 새로운 스타이너 점을 트리에 추가하는 과정을 반복함으로써 최적에 가까운 스타이너 트리를 구했다 이 방법을 사용하면 이진스트링을 사용하는 기존의 방법에 비해서 트리가 보다 빠르고 정확하게 최적에 가까운 스타이너 트리에 접근했다.

• 디지털산업정보학회논문지
• /
• 제7권2호
• /
• pp.91-100
• /
• 2011

Free viewpoint TV can provide multi-angle view point images for viewer needs. In the real world, But all angle view point images can not be captured by camera. Only a few any angle view point images are captured by each camera. Group of the captured images is called multi-view image. Therefore free viewpoint TV wants to production of virtual sub angle view point images form captured any angle view point images. Interpolation methods are known of this problem general solution. To product interpolated view point image of correct angle need to depth image of multi-view image. Unfortunately, multi-view video including depth image is necessary to develop a new compression encoding technique for storage and transmission because of a huge amount of data. Layered depth image is an efficient representation method of multi-view video data. This method makes a data structure that is synthesis of multi-view color and depth image. This paper proposed enhanced compression method using layered depth image representation and H.264/AVC video coding technology. In experimental results, confirmed high compression performance and good quality reconstructed image.

• ETRI Journal
• /
• 제27권6호
• /
• pp.818-821
• /
• 2005

Recently, MPEG has opened activity to standardize scene representation for lightweight applications such as in mobile phones. The standard is named lightweight applications scene representation (LASeR) and can be applied to improve and make efficient rich media applications and services on mobile devices. In this standard, we proposed an efficient type codec for point data to maximize the bit efficiency of LASeR. In this paper, we describe the new method and the test results of the proposed scheme.

• 한국멀티미디어학회논문지
• /
• 제23권2호
• /
• pp.166-173
• /
• 2020

Multi-view images, which are widely used for providing free-viewpoint services, can enhance the quality of synthetic views when the number of views increases. However, there needs an efficient representation method because of the tremendous amount of data. In this paper, we propose a method for generating point cloud data for the efficient representation of multi-view color and depth images. The proposed method conducts sequential reconstruction of point clouds at each viewpoint as a method of deleting duplicate data. A 3D point of a point cloud is projected to a frame to be reconstructed, and the color and depth of the 3D point is compared with the pixel where it is projected. When the 3D point and the pixel are similar enough, then the pixel is not used for generating a 3D point. In this way, we can reduce the number of reconstructed 3D points. Experimental results show that the propose method generates a point cloud which can generate multi-view images while minimizing the number of 3D points.

• 전기학회논문지
• /
• 제56권2호
• /
• pp.428-431
• /
• 2007

A floating-point number system is used to represent a wide range of real numbers using finite number of bits. The standard the IEEE adopted in 1987 divides the range of real numbers into intervals of [$2^E,2^{E+1}$), where E is an Integer represented with finite bits, and defines equally spaced equal counts of discrete numbers in each interval. Since the numbers are defined discretely, not only the number representation itself includes errors but in floating-point arithmetic some strange behaviors are observed which cannot be agreed with the real world arithmetic. In this paper errors with floating-point number representation, those with arithmetic operations, and those due to order of arithmetic operations are analyzed theoretically with help of and verification with the results of some MATLAB program executions.

• 대한수학회보
• /
• 제48권5호
• /
• pp.1015-1021
• /
• 2011

A point of a Riemann surface X is said to be its fixed point if it is a fixed point of one of its nontrivial holomorphic automorphisms. We start this note by proving that the set Fix(X) of fixed points of Riemann surface X of genus g${\geq}$2 has at most 82(g-1) elements and this bound is attained just for X having a Hurwitz group of automorphisms, i.e., a group of order 84(g-1). The set of such points is invariant under the group of holomorphic automorphisms of X and we study the corresponding symmetric representation. We show that its algebraic type is an essential invariant of the topological type of the holomorphic action and we study its kernel, to find in particular some sufficient condition for its faithfulness.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1994년도 추계학술대회 논문집 학회본부
• /
• pp.75-77
• /
• 1994

This paper presents a method of obtaining transmission network equivalents from the network's driving-point admittance characteristic. Proposed method is based on modal decomposition representation for the large-scale interconnected system. As a result, Norton-type of discrete-time filter model can be generated. It can reproduce the driving-point admittance characteristic of the network. Furthermore proposed model can be implemented into the EMTP in a direct manner. The simulation results with the full system representation and the developed equivalent system showed a good agreement.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.17-22
• /
• 2009

In this paper, we discuss two fundamental issues of hybrid scene representation: constructing and rendering. A hybrid scene consists of triangular meshes and point-set models. Consider the maturity of modeling techniques of triangular meshes, we suggest that generate a point-set model from a triangular mesh might be an easier and more economical way. We improve stratified sampling by introducing the concept of priority. Our method has the flexibility that one may easily change the importance criteria by substituting priority functions. While many works were devoted to blend rendering results of point and triangle, our work tries to render point-set models and triangular meshes as individuals. We propose a novel way to eliminate depth occlusion artifacts and to texture a point-set model. Finally, we implement our rendering algorithm with the new features of the shader model 4.0 and turns out to be easily integrated with existing rendering techniques for triangular meshes.