• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.2
• /
• pp.76-84
• /
• 2014

As the number of high-density videos increase, parallel processing approaches are necessary to process a large-scale of video data. When a processing method of video data requires thousands of simple operations, GPU-based parallel processing is preferred to CPU-based parallel processing by way of reducing the time and space complexities of a given computation problem. This paper studies the parallel design and implementation of a shot-boundary detection algorithm. The proposed shot-boundary detection algorithm uses pixel brightness comparisons and global histogram data among the blocks of frames, and the computation of these data is characterized with the high parallelism for the related operations. In order to maximize these operations in parallel, the computations of the pixel brightness and histogram are designed in parallel and implemented in NVIDIA GPU. The GPU-based shot detection method is tested with 10 videos from the set of videos in National Archive of Korea. In experiments, the detection rate is similar but the computation time is about 10 time faster to that of the CPU-based algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.2
• /
• pp.224-229
• /
• 2005

Generally, genetic algorithm (GA) has too much time and space complexity when it is running in the typical processor. Therefore, we are forced to use the high-performance and expensive processor by this reason. It also works as a barrier to implement real device, such a small mobile robot, which is required only simple rules. To solve this problem, this paper presents and proposes enhanced processor-architecture for the faster GA processing. A typical processor architecture can be enhanced and specialized by two approaches: one is a sorting network, the other is a residue number system (RNS). A sorting network can improve the time complexity of which needs to compare the populations' fitness. An RNS can reduce the magnitude of the largest bit that dictates the speed of arithmetic operation. Consequently, it can make the total logic size smaller and innovate arithmetic operation speed faster.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1675-1685
• /
• 2012

DVC (Distributed Video Coding) technique plays an essential role in providing low-complexity video encoder. But, in order to achieve the better rate-distortion performances, most DVC systems need feedback channel for parity bit control. This causes the DVC-based system to have high decoding latency and becomes as one of the most critical problems to overcome for a real implementation. In order to overcome this problem and to accelerate the commercialization of the DVC applications, this paper analyzes an effect of LDPCA frame size for adaptive LDPCA frame-based parity bit request estimations. First, this paper presents the LDPCA segmentation method in pixel-domain and explains the temporal-based bit request estimation method and the spatial-based bit request estimation method using the statistical characteristics between adjacent LDPCA frames. Through computer simulations, it is shown that the better performance and fast decoding is observed specially when the LDPCA frame size is 3168 in QCIF resolution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.413-423
• /
• 2017

In this paper, we propose a ultrasonic and RF-based indoor localization system. In previous work, various systems were proposed for indoor localization, but they have limitation in applicability due to time-synchronization, complexity, or accuracy. To overcome such problems, an indoor localization system with ultrasonic and RF is proposed. A transmitting system is composed of a pair of ultrasonic and RF transmitters and the receiving system is composed of multiple ultrasonic receivers and one RF receiver. The theoretical performance limitation is also analyzed. To verify localization performance, we have implemented a receiving systems and a transmitting system using Arduino modules. Experiments were performed in $2m{\times}2m{\times}2m$ space and the localization errors had a mean of 6.1cm and a standard deviation of 1.6cm.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.7 no.1
• /
• pp.61-70
• /
• 1996

M-ary differential phase shift keying(DPSK)is a bandwidth efficient digital modulation technique and recently has attracted increased attention in mobile satellite communication application where the available radio bandwidth is limited. Coherent detection offers good BER performance in AWGN channel. However, it requires long acquisition times in fading environment. In this paper, we analyze the BER performance of M-ary DPSK signal using the Multiple Differ- ential Feedback Detection(MDFD) technique in Rician fading and shadowed Rician fading channel. MDFD is an efficient scheme to decrease the performance gap between differential and coherent reception by increasing the complexity of the conventional differential receiver to some extent. Compared to the multiple symbol maximum likelihood detection technique, the multiple differential feedback detection technique has a much simpler structure for hardware implementation. Espe- cially, this technique has application to land mobile satellite channel which can vary in time and space between AWGN and rapidly fading channel.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.8
• /
• pp.576-582
• /
• 2004

A computer code that is based on the Pseudo-spectral finite difference algorithm using staggered grid is developed for the wave propagation modeling in the time domain. The advantage of a finite difference approximation is that any geometrically complicated media can be modeled. Staggered grids are advantageous as it provides much more accuracy than using a regular grid. Pseudo-spectral methods are those that evaluate spatial derivatives by multiplying a wavenumber by the Fourier transform of a pressure wave-field and performing the inverse Fourier transform. This method is very stable and reduces memory and the number of computations. The synthetic results by this algorithm agree with the analytic solution in the infinite and half space. The time domain modeling was implemented in various models. such as half-space. Pekeris waveguide, and range dependent environment. The snapshots showing the total wave-field reveals the Propagation characteristic or the acoustic waves through the complex ocean environment.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.53-60
• /
• 2011

In order to augment the robustness of OFDM system to Rayleigh multipath fading, there exist two smart antenna algorithms, namely, Pre-FFT smart antenna and Post-FFT smart antenna. After the mathematical modeling of both smart antenna algorithms, computer simulations have been carried to compare and analyze the performance of generalized eigen problem based Pre-FFT algorithm and the performance of Wiener solution based Post-FFT algorithm. It has been shown that the Post-FFT smart antenna far outperforms the Pre-FFT smart antenna due to the computational complexities. Especially it is so when the multipath signal arrives at beyond the guard interval and a rich co-channel interferer is introduced. Performance of a subcarrier clustering method proposed to lessen the computing load has been compared to that of a typical Wiener solution based Post-FFT smart antenna. Performance comparison between MRC(Maximum Ratio Combining) diversity based Post-FFT algorithm and typical Post-FFT algorithm has also been carried.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.8 no.2
• /
• pp.116-125
• /
• 1997

This paper presents a novel method, entitled Orthogonal Weights Searching(OWS), for the Direction-Of-Arrival(DOA) estimation. Utilizing the modified Conjugate Gradient Method(MCGM), the weight vector which is orthogonal to the signal subspace is directly computed from the signal matrix. The proposed method does not require the computation of the eigenvalues and eigenvectors. In addition, the new technique excludes the procedure for the detection of the number of signals under the assumption that the number of weights in the array is greater than the number of input signals. Since the proposed technique can be performed independently of the detection procedure, it shows a good performance in adverse signal environments in which the detection of the number of array inputs cannot be obtained successfully. The performance of the proposed technique is compared with that of the convectional eigen-decomposition method in terms of angle resolution for a given signal-to-noise ratio(SNR) and a required amount of computations.

• The Journal of the Korea Contents Association
• /
• v.13 no.11
• /
• pp.523-532
• /
• 2013

Since conventional methods for the reconstruction of 3D objects used a number of cameras or pictures, they required specific hardwares or they were sensitive to the photography environment with a lot of processing time. In this paper, we propose a 3D object reconstruction method using one photograph based on structured light in ubiquitous environments. We use color pattern of the conventional method for structured light. In this paper, we propose a novel pipeline consisting of various image processing techniques for line pattern extraction and matching, which are very important for the performance of the object reconstruction. And we propose the optimal cost function for the pattern matching. Using our method, it is possible to reconstruct a 3D object with efficient computation and easy setting in ubiquitous or mobile environments, for example, a smartphone with a subminiature projector like Galaxy Beam.

• The Journal of the Korea Contents Association
• /
• v.13 no.1
• /
• pp.19-29
• /
• 2013

In the current Internet environment where there is high space complexity of information, search engines aim to provide accurate information that users want. But content-based method adopted by most of search engines cannot be used as an effective tool in the current Internet environment. As content-based method gives different weights to each web page using morphological characteristics of vocabulary, the method has its drawbacks of not being effective in distinguishing each web page. To resolve this problem and provide useful information to the users, this paper proposes an evaluation method based on categories. Category-based evaluation method is to extend query to semantic relations and measure the similarity to web pages. In applying weighting to web pages, category-based evaluation method utilizes user response to web page retrieval and categories of query and thus better distinguish web pages. The method proposed in this paper has the advantage of being able to effectively provide the information users want through search engines and the utility of category-based evaluation technique has been confirmed through various experiments.