• ETRI Journal
• /
• 제44권3호
• /
• pp.379-388
• /
• 2022

This study proposes a novel low-complexity algorithm for computing inverse fast Fourier transform (IFFT)/fast Fourier transform (FFT) operations in binary phase shift keying-modulated orthogonal frequency division multiplexing (OFDM) communication systems without requiring any twiddle factor multiplications. The peak-to-average power ratio (PAPR) reduction capacity of an efficient PAPR reduction technique, that is, H-SLM method, is evaluated using the proposed IFFT algorithm without any complex multiplications, and the impact of oversampling factor for the accurate calculation of PAPR is analyzed. The power spectral density of an OFDM signal generated using the proposed multiplierless IFFT algorithm is also examined. Moreover, the bit-error-rate performance of the H-SLM technique with the proposed IFFT/FFT algorithm is compared with the classical methods. Simulation results show that the proposed IFFT/FFT algorithm used in the H-SLM method requires no complex multiplications, thereby minimizing power consumption as well as the area of IFFT/FFT processors used in OFDM communication systems.

• 전자공학회논문지B
• /
• 제31B권2호
• /
• pp.80-87
• /
• 1994

Fetal monitoring is a routine procedure to obtain a record of physiologic functions during pregnancy and labor. It is required to determine fetal heart frequency accurately. There are various types of fetal heart rate(FHR) determination and the most frequently applied method is transabdominal Doppler ultrasound. However, in the case of weak or noise corrupted Doppler ultrasound signals, conventional peak detections and the autocorrelation function method have many difficulties to determine FHR precisely. Also the autocorrelation function is effected by threshold level and window size. To solve these problems, the high resolution pitch determination algorinthm is introduced to detect FHR from Doppler ultrasound signals. This scheme digitally processes Doppler ultrasound signal for digital rectification, envelope detection, decimation and correlation calculation of two interconnected segments and then FHR is determined by its maximal value. Even in the case of a greatly smeared noise signal, this algorithm is able to search FHR more accurately than autocorrelation function by means of compensating FHR with a constant correlation threshold. This algorithm is simulated by 386-MATLAB on PC 486/DX and verified that it is superior to the autocorrelation function method.

• 전자공학회논문지T
• /
• 제36T권3호
• /
• pp.32-40
• /
• 1999

본 논문에서는 SEA (successive elimination algorithm) 기반의 고속 블록정합 움직임 추정 알고리즘을 제시한다. 제안하는 기법은 블록 움직임 벡터가 탐색영역의 중앙에 편향되어 분포한다는 특성에 기반 하여 기존의 SEA보다 탐색영역에서 탐색점의 수를 줄임으로써 성능을 향상시키는 기법이다. 또한 더 많은 연산량을 즐기기 위하여 제안된 기법은 블록정합에서 화소를 비교하는 연산량을 줄이는 RBMAD (reduced bits mean absolute difference) 정합기준과 블록정합에서 사용되는 화소의 수를 줄이는 부표본화 기법과 결합하였다. 제안된 기법은 완전탐색 (full-search, FS) 블록정합 알고리즘과 비슷한 성능을 유지하면서 기존의 고속 알고리즘보다 성능이 향상되었음을 실험을 통하여 확인하였다

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.887-890
• /
• 1998

We present a novel multi-resolution block matching algorithm (BMA) for fast motion estimation. At the coarsest level, a full search BMA (FSBMA) is performed for searching complex or random motion. Concurrently, spatial correlation of motion vector (MV) field is used for searching continuous motion. Here we present an efficient method for searching full resolution MVs without MV decimation even at the coarsest leve. After the coarsest level search, two or three initial MV candidates are chosen for the next level. At the further levels, the MV candidates are refined within much smaller search areas. Simulation results show that in comparison with FSBMA, the proposed BMA achieves a speed-up factor over 710 with minor PSNR degradation of 0.2dB at most, under a normal MPEG2 coding environment. Furthermore, our scheme is also suitable for hardware implementation due to regular data-flow.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권11호
• /
• pp.4463-4482
• /
• 2020

Mesh model generated from 3D reconstruction usually comes with lots of noise, which challenges the performance and robustness of mesh simplification approaches. To overcome this problem, we present a novel method for mesh simplification which could preserve structure and improve the accuracy. Our algorithm considers both the planar structures and linear features. In the preprocessing step, it automatically detects a set of planar structures through an iterative diffusion approach based on Region Seed Growing algorithm; then robust linear features of the mesh model are extracted by exploiting image information and planar structures jointly; finally we simplify the mesh model with plane constraint QEM and linear feature preserving strategies. The proposed method can overcome the known problem that current simplification methods usually degrade the structural characteristics, especially when the decimation is extreme. Our experimental results demonstrate that the proposed method, compared to other simplification algorithms, can effectively improve the quality of mesh and yield an increased robustness on noisy input mesh.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권4호
• /
• pp.167-174
• /
• 2002

This study describes a fetal heart rate(FHR) estimation algorithm using phonogram. Using a phonogram amplifier, various fetal heart sounds are collected in a university hospital. The FHR estimation algorithms consists of a lowpass filter, decimation, envelop detection, pitch detection, and post-processing. The post-processing is the FHR decision procedure using all informations of fetal heart rates. Using the algorithm and other parameters of fetal heart sound, a fetal monitoring software was developed. This can display the original signals, the FFT spectra, FHR and its trajectory. Even though the fetal phonogram amplifier detects the fetal heart sounds well, the sound quality is not so good as the ultrasonography. In case of very week fetal heart sound, autocorrelation of it showed clear periodicity. But two main peaks in one period is an obstacle in pitch detection and peaks are not so vivid. The proposed FHR estimation algorithm showed very accurate and stable results. Since the developed software displays multiple parameters in real time and has convenient functions, it will be useful for the phonogram-style fetal monitoring device.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 학술대회 논문집 정보 및 제어부문
• /
• pp.139-140
• /
• 2008

지상라이다는 고정도의 3차원 영상을 제공하고 레이저 빔을 현장이나 대상물에 발사하여 짧은 시간에 수백만점의 3차원좌표를 기록할 수 있는 최신 측량장비로서 다양한 응용분야에서 두각을 나타내고 있다. 본 연구에서는 지상라이다를 이용한 건축물의 3자윈 자동 윤곽선 추출을 다룬다. 지상라이다는 건축물의 3차원 윤곽선을 신속하게 추출할 수 있지만 지상기반 시스템이므로 여러 가지 장애물 때문에 건국물의 하단부에서는 추출이 쉽지 않다. 기존 항공라이다를 이용한 알고리즘에서는 사진의 색상차나 모폴로지 특성에 의존하여 범위를 제한하고, 이를 기반으로 윤곽선을 추출하였다. 하지만 지상라이다의 경우 항공라이다에 비해 분해능이 월등히 높다. 또한, 지상라이다는 지상에서 측정하기 때문에 항공라이다에서 어려운 건축물의 측면이나 정면도 윤곽선 추출이 가능하기 때문에 본 논문에서는 사진을 이용하지 않고 전처리를 하지 않은 데이터를 직접 이용하여 건물의 정면 윤곽선을 추출하는 것을 제안한다. 건물의 크기와 데이터 수 즉, 라이다로 측정한 포인트 수를 고려한 효율적인 Decimation방법을 제안하고 또한, Decimation된 데이터이서 지역적으로 제일 큰 값과 작은 값을 찾아낸다. 그 중 많이 벗어난 점을 편차를 이용하여 제거한다. 이렇게 찾아낸 건축물의 외곽점들을 이어 만든 윤곽선을 최종적으로 보간하여 좀 더 현실과 가까운 윤곽선 추출 방법을 제안한다.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1997년도 추계학술대회
• /
• pp.201-205
• /
• 1997

With the recent advance of Web and its associated technologies, information sharing on distribute computing environments has gained a great amount of attention from many researchers in many application areas, such as medicine, engineering, and business. One basic requirement of distributed medical consultation systems is that geographically dispersed, disparate participants are allowed to exchange information readily with each other. Such software also needs to be supported on a broad range of computer platforms to increase the software's accessibility. In this paper, the development of world-wide-web based medical consultation system or radiology imaging is addressed to provide the platform independence and great accessibility. The system supports sharing of 3-dimensional objects. We use VRML (Virtual Reality Modeling Language), which is the de-facto standard in 3-D modeling on the Web. 3-D objects are reconstructed from CT or MRI volume data using a VRML format, which can be viewed and manipulated easily in Web-browsers with a VRML plug-in. A Marching cubes method is used in the transformation of scanned volume data set to polygonal surfaces of VRML. A decimation algorithm is adopted to reduce the number of meshes in the resulting VRML file. 3-D volume data are often very large-sized, and hence loading the data on PC level computers requires a significant reduction of the size of the data, while minimizing the loss of the original shape information. This is also important to decrease network delays. A prototype system has been implemented (http://netopia.snu.ac.kr/-cyber/). and several sessions of experiments are carried out.

• 한국음향학회지
• /
• 제28권1호
• /
• pp.1-9
• /
• 2009

본 논문에서는 멀티채널 라이브 가라오케의 구현에 관한 내용을 담고 있다. TI사의 32비트 floating 연산 DSP인 TMS320C6713를 이용하여 6 채널의 MP3 복호화 및 템포/키 변환을 실시간으로 구현하였다. 6채널은 전면 L/R 악기, 후면 L/R 악기, 멜로디, 우퍼로 구성되며, 4 채널로 동작 시에는 후면 L/R 대신 드럼 L/R이 추가될 수 있다. 최종 출력 데이터는 5.1 채널 스피커에 맞춰서 출력된다. 템포 변환을 위하여 SOLA알고리즘을 적용시켰으며 시간영역에서 인터폴레이션(interpolation)과 데시메이션 (decimation)으로 키 변환을 수행하였다. 드럼 악기가 추가될 경우에는 일반악기와 분리하여 키 변환 시에 드럼 채널을 제외시키고, SOLA (Synchronized Overlap and Add) 수행 시에도 SOLA처리 단위인 프레임 사이즈를 다르게 두어 고음질의 템포 변환이 가능하도록 하였으며, 실시간 처리를 위하여 최적화를 하였다 6 채널을 이용하여 다양한 채널 구성이 가능하며 본 논문의 멀티채널 오디오 시스템은 고음질의 라이브 반주가 필요한 어느 곳에서나 효과적으로 적용될 수 있다.

• 디지털산업정보학회논문지
• /
• 제9권3호
• /
• pp.13-20
• /
• 2013

In this paper, we propose a multi-scale crack detection method. This method uses decomposition, composition, and shape properties. It is based on morphology algorithm, crack features. We use a morphology operator which extracts patterns of crack. It segments cracks and background using opening and closing operations. Morphology based segmentation is better than existing integration methods using subtraction in detecting a crack it has small width. However, morphology methods using only one structure element could detect only fixed width crack. Thus, we use decomposition and composition methods. We use a decimation method for decomposition. After decomposition and morphology operation, we get edge images given by binary values. Our method calculates values of properties such as the number of pixels and the maximum length of the segmented region. We decide whether the segmented region belongs to cracks according to those data. Experimental results show that our proposed multi-scale crack detection method has better results than those of existing detection methods.