• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.1-10
• /
• 2006

This paper introduces the development XPERT(XML Query Processing Engine using Relational Technologies) which is based on relational model. In our system we have used a decomposed approach to store XML files in relational tables. XML queries are translated to SQLs according to the table schema, and then they are sent to the relational DBMS to get the results back. Our translation scheme produces AST(Abstract Syntax Tree) by analyzing XQuery expressions at first. And on traversing AST proper SQLs are generated. Translated SQLs can reduce the number of joins by using path information and utilize dewey number to preserve document originated orderings among compoments in XML. In addition we propose the efficient algorithms of XPath and XQuery translation. And finally we show the implementation of our prototype system for the functional evaluations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2253-2260
• /
• 2012

In this paper, an efficient hardware architecture is proposed for inverse transform and inverse quantization of H.264/AVC decoder. The previous inverse transform and quantization architecture has a different AC and DC coefficients decoding order. In the proposed architecture, IQ is achieved after IT regardless of the DC or AC coefficients. A common operation unit is also proposed to reduce the computational complexity of inverse quantization. Since division operation is included in the previous architecture, it will generate errors if the processing order is changed. In order to solve the problem, the division operation is achieved after IT to prevent errors in the proposed architecture. The architecture is implemented with 3-stage pipeline and a parallel vertical and horizontal IDCT is also implemented to reduce the operation cycle. As a result of analyzing the proposed ITIQ architecture operation cycle for one macroblock, the proposed one has improved by 45% than the previous one.

• Korean Journal of Optics and Photonics
• /
• v.20 no.1
• /
• pp.16-22
• /
• 2009

We propose a method to convert a two-dimensional movie to a three-dimensional movie using normalized cut and optical flow. In this paper, we segment an image of a two-dimensional movie to objects first, and then estimate the depth of each object. Normalized cut is one of the image segmentation algorithms. For improving speed and accuracy of normalized cut, we used a watershed algorithm and a weight function using optical flow. We estimate the depth of objects which are segmented by improved normalized cut using optical flow. Ordinal depth is estimated by the change of the segmented object label in an occluded region which is the difference of absolute values of optical flow. For compensating ordinal depth, we generate the relational depth which is the absolute value of optical flow as motion parallax. A final depth map is determined by multiplying ordinal depth by relational depth, then dividing by average optical flow. In this research, we propose the two-dimensional/three-dimensional movie conversion method which is applicable to all three-dimensional display devices and all two-dimensional movie formats. We present experimental results using sample two-dimensional movies.

• Journal of IKEEE
• /
• v.3 no.1 s.4
• /
• pp.150-160
• /
• 1999

This paper presents a new register transfer level synthesis method to overcome the disadvantages of the previous register transfer level synthesis systems. The previous register transfer level synthesis systems first translate from a hardware description language to sequential circuits inadequately. Secondly, the systems separate registers and combinational circuits and then optimize only combinational circuits. This paper describes their disadvantages and then proposes a new method to overcome their shortcomings. This paper also shows the effectiveness of the proposed method by using the proposed method at designing the controller of a surveillance system and the 8-bit signed multiplier.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.161-169
• /
• 2011

This paper presents a new register transfer level synthesis methodology for efficient SOC system design. The previous register transfer level synthesis systems first translate from a hardware description language to sequential circuits inadequately. Secondly, the systems separate registers and combinational circuits and then optimize only combinational circuits. This paper describes their disadvantages and then proposes a new method to overcome their shortcomings. This paper also shows the effectiveness of the proposed method by using the proposed method at designing the controller of a surveillance system.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.12
• /
• pp.1381-1388
• /
• 2014

This paper is proposed a wavelet-based the order statistics MAD(Median Absolute Deviation) method of SAR(Synthetic Aperture Radar) image for image enhancement. also The method of compared and defined the threshold the wavelet coefficients using MAD of the wavelet coefficients of the detail subbands was proposed to effectively image enhancement. In order to complement the disadvantage, the threshold of the proposed method sets up the image statistic and excludes the distortion. The hardware design is used FPGA of Xilinx and DSP system for the image enhancement and compressed encoding of the proposed algorithm. Therefore the proposed method is totally verified by comparing with the several other images.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.3
• /
• pp.43-49
• /
• 2012

Information obtained from DFD(Data Flow Diagram) are very important in system maintenance, because most legacy systems are analyzed using DFD in structured analysis. In our thesis, we design and implement an extractor for design sequence of database tables using DFD. Our extractor gets DFDs as input data, transform them into a directed graph, and extract design sequence of DB tables. We show practicality of our extractor by applying it to a s/w system in operation.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.241-244
• /
• 2009

최근 모바일폰에 500만 화소 이상의 카메라 모듈이 장착되는 등 모바일 장치에서 고해상도 영상의 인코딩 및 디코딩에 대한 요구가 크게 늘어남에 따라 저성능 시스템에서 실시간으로 동작하는 영상 코덱 구현에 대한 필요성이 증대되고 있다. 본 논문은 JPEG 디코딩의 마지막 단계인 컬러변환 과정에 대해 계산 복잡도를 최적화하는 기법을 제안하고 성능을 평가하였다. 제안된 기법은 JPEG 디코딩 과정에서 IDCT(Inverse Discrete Cosine Transform) 변환과 컬러변환 간의 선형성을 바탕으로 이들 연산 순서를 재배열함으로써 컬러변환 과정에서 요구되는 계산 횟수를 줄이고, 재배열된 부동소수점 연산에 대해 정수 맵핑을 적용하여 계산 복잡도를 줄임으로써 실행시간을 최적화하였다. 임베디드 시스템 개발 플랫폼에서의 성능 평가를 통해 제안된 기법이 기존의 컬러변환 기법들과 비교하여 실행시간을 크게 단축함을 얄 수 있었으나 복원 영상의 화질이 상대적으로 저하됨을 확인하였다.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2843-2845
• /
• 1999

Temporal 웨이브릿 변환은 2차원 이미지 시퀀스 즉, 프레임 사이의 시간적 변화를 포함한다. Temporal 웨이브릿 변환은 우선 2차원 이미지를 프레임 단위로 행방향, 열방향의 순서로 웨이브릿 변환을 수행한 후 원영상의 1/2 해상도의 영상 프레임 시퀀스를 시간축 방향으로 웨이브릿 변환을 수행한다. Temporal Wavelet 변환의 결과로 나온 계수는 각 프레임의 특성과 프레임과 프레임 사이의 특성을 포함한다. 본 논문에서는 이 Temporal 웨리브릿 변환 결과로 나온 계수의 특성을 이용하여 물체의 움직임을 추적하는 Division Rule을 제시하고, 더욱 정확한 결과를 얻기 위해 Division Rule이 적용된 결과에 실험적으로 최적화된 가중치를 결정하여 컨벌루션을 적용한다.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.420-436
• /
• 2007

The choice of an effective indexing method is crucial to guarantee the performance of the spatial join operator which is heavily used in geographical information systems. The $R^*$-tree based method is renowned as one of the most representative indexing methods. In this paper, we propose an efficient spatial join technique based on the DOT(Double Transformation) index, and compare it with the spatial Join technique based on the $R^*$-tree index. The DOT index transforms the MBR of an spatial object into a single numeric value using a space filling curve, and builds the $B^+$-tree from a set of numeric values transformed as such. The DOT index is possible to be employed as a primary index for spatial objects. The proposed spatial join technique exploits the regularities in the moving patterns of space filling curves to divide a query region into a set of maximal sub-regions within which space filling curves traverse without interruption. Such division reduces the number of spatial transformations required to perform the spatial join and thus improves the performance of join processing. The experiments with the data sets of various distributions and sizes revealed that the proposed join technique is up to three times faster than the spatial join method based on the $R^*$-tree index.