• 한국정보디스플레이학회:학술대회논문집
• /
• 한국정보디스플레이학회 2008년도 International Meeting on Information Display
• /
• pp.730-733
• /
• 2008

In this paper, a novel CII method using a depth conversion technique is proposed. The proposed method can move a far 3D object near lenslet array and reduce the computation cost dramatically. To show the usefulness of the proposed method, we carry out the preliminary experiment and its results are presented.

• 한국광학회:학술대회논문집
• /
• 한국광학회 2008년도 동계학술발표회 논문집
• /
• pp.179-180
• /
• 2008

• ETRI Journal
• /
• 제32권5호
• /
• pp.801-809
• /
• 2010

This paper presents a statistical model-based noise suppression approach for voice recognition in a car environment. In order to alleviate the spectral whitening and signal distortion problem in the traditional decision-directed Wiener filter, we combine a decision-directed method with an original spectrum reconstruction method and develop a new two-stage noise reduction filter estimation scheme. When a tradeoff between the performance and computational efficiency under resource-constrained automotive devices is considered, ETSI standard advance distributed speech recognition font-end (ETSI-AFE) can be an effective solution, and ETSI-AFE is also based on the decision-directed Wiener filter. Thus, a series of voice recognition and computational complexity tests are conducted by comparing the proposed approach with ETSI-AFE. The experimental results show that the proposed approach is superior to the conventional method in terms of speech recognition accuracy, while the computational cost and frame latency are significantly reduced.

• 한국정보통신학회논문지
• /
• 제15권5호
• /
• pp.1171-1176
• /
• 2011

본 논문에서는 주기적으로 배치된 렌즈 배열을 이용한 광학 픽업과 평면기반 컴퓨터 집적 영상 복원 (CIIR) 기술에서 요소 영상 크기와 3차원 물체의 복원 깊이 위치에 따른 복원 성능에 대한 분석을 제시한다. 주기적으로 배치된 렌즈 배열에서는 3차원 물체를 픽업할 때 주기성으로 인한 희박 표본화가 발생함이 보고된다. 또한 희박 표본화가 발생하는 3차원 물체의 위치는 요소 영상의 크기와 관계식을 제시한다. 희박 표본화를 회피하는 방안을 제시하고, 이론의 평가를 위해서 컴퓨터 실험을 진행했고 그 결과는 이론을 잘 뒷받침함을 보였다.

• 한국정보통신학회논문지
• /
• 제16권10호
• /
• pp.2280-2286
• /
• 2012

본 논문에서는 고속 컴퓨터 집적 영상 복원 방법을 이용하여 새로운 형태의 3D 비선형 상관기를 제안한다. 고속 컴퓨터 집적 영상 복원 방법을 구현하기 위해서 기존의 방법에서 확대 과정을 제거함으로서 고속 계산이 가능하다. 제안하는 상관기는 먼저 기준 물체와 목표 물체의 요소 영상들을 렌즈 배열을 통해 픽업한다. 이 픽업된 영상에 고속 컴퓨터 집적 영상 복원 방법을 사용하여 목표 평면 영상과 기준 평면 영상들이 복원된다. 복원된 기준 평면 영상과 목표 평면 영상들 간의 비선형 상호상관을 통해 인식을 수행한다. 비선형 상관 연산의 사용은 상관기의 3D 물체 인식 성능 향상시킬 수 있다. 제안된 방법의 유용함을 보이기 위해 기존의 방법과 비교하여 기초적인 상관관계 실험을 수행하고 그 결과를 보고한다.

• 한국멀티미디어학회논문지
• /
• 제19권3호
• /
• pp.548-556
• /
• 2016

Integral imaging is an auto-stereoscopic display method that can produce 3D image of a finite viewing window through an array of micro elemental lenses. Integral imaging requires the pickup part of each elemental images acquisition and display part of reconstruction of the images. The successful reconstructed image depends on various parameters such as distance between lens arrays and display device, focal length of lenses, and a number of the array. In this paper, we present reconstruction emulator for display of Integral imaging in order to adjust parameters for 3D contents reconstruction and to observe the result from different configuration. Especially, we provide the user interface for the emulator to control the distance easily. We have confirmed through various experiments that the emulator adjusted the distance and could check error in the process of creating elemental images.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1990년도 가을 학술발표회 논문집
• /
• pp.105-110
• /
• 1990

Effective maintenance system for national highway bridges has been requested due to increasing numbers of bridges. In this study, bridge data base is established in accordance with rating criteria for the structural conditions and functions of bridges. Maintenance system using PC-80386 hardware and ORACLE software is developed to rank the priority of either reconstruction or repairing of bridges and to provide with those information to bridge maintenance staff in order to perform bridge maintenance effectively. With this pre-establised data base and computerized maintenance system, data and information for planning of bridge construction could be obtained in times.

• 한국CDE학회논문집
• /
• 제7권4호
• /
• pp.248-253
• /
• 2002

Delaunay triangulation is well balanced in the sense that the triangles tend toward equiangularity. And so, Delaunay triangulation hasn't some slivers triangle. It's commonly used in various field of CAD applications, such as reverse engineering, shape reconstruction, solid modeling and volume rendering. For Example, In this paper, an improved Delaunay triangulation is proposed in 2-dimensions. The suggested algorithm subdivides a uniform grids into sub-quad grids, and so efficient where points are nonuniform distribution. To get the mate from quad-subdivision algorithm, the area where triangulation-patch will be most likely created should be searched first.

• 전자공학회논문지B
• /
• 제33B권4호
• /
• pp.91-99
• /
• 1996

A hybrid approach employing both the genetic algorithm and the newton-raphson method is proposed for the electrical impedance computed tomography (EICT) image reconstruction. Computational experiments based on the new concept have shown promising results for several noise-free models. In particular, the resistance distribution of the tested models having resistivity ratio up to 100:1 has been reconstructed sucessfully. Using the proposed mehtod, it is also possible to get the reconstruction by the conventional iterative approaches be difficult to vonverge to a robust solution. If the compution power is enhanced further, the proposed method is expected to stimulate the practical applications of the EICT technology in the near future.

• Journal of Information Processing Systems
• /
• 제13권2호
• /
• pp.360-369
• /
• 2017

In this paper, a new iterative algorithm for reconstructing block sparse signals, called block backtracking-based adaptive orthogonal matching pursuit (BBAOMP) method, is proposed. Compared with existing methods, the BBAOMP method can bring some flexibility between computational complexity and reconstruction property by using the backtracking step. Another outstanding advantage of BBAOMP algorithm is that it can be done without another information of signal sparsity. Several experiments illustrate that the BBAOMP algorithm occupies certain superiority in terms of probability of exact reconstruction and running time.