• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.155-163
• /
• 1999

In this paper, we propose novel scene change detection and key frame selection techniques, which use two feature images, i.e., DC and edge images, extracted directly from MPEG compressed video. For fast edge image extraction. we suggest to utilize 5 lower AC coefficients of each DCT. Based on this scheme, we present another edge image extraction technique using AC prediction. Although the former is superior to the latter in terms of visual quality, both methods all can extract important edge features well. Simulation results indicate that scene changes such as cut. fades, and dissolves can be correctly detected by using the edge energy diagram obtained from edge images and histograms from DC images. In addition. we find that our edge images are comparable to those obtained in the spatial domain while keeping much lower computational cost. And based on HVS, a key frame of each scene can also be selected. In comparison with an existing method using optical flow. our scheme can select semantic key frames because we only use the above edge and DC images.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.17-24
• /
• 2014

Blind algorithms designed to maximize the probability that constant modulus errors become zero carry out some summation operations for a set of constant modulus errors at an iteration time inducing heavy complexity. For the purpose of reducing this computational burden induced from the summation, a new approach to the estimation of the zero-error probability (ZEP) of constant modulus errors (CME) and its gradient is proposed in this paper. The ZEP of CME at the next iteration time is shown to be calculated recursively based on the currently calculated ZEP of CME. It also is shown that the gradient for the weight update of the algorithm can be obtained by differentiating the ZEP of CME estimated recursively. From the simulation results that the proposed estimation method of ZEP-CME and its gradient produces exactly the same estimation results with a significantly reduced computational complexity as the block-processing method does.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.11-21
• /
• 2002

Although the matching Pursuit is effective for video coding at low bit rate, it has a Problem since it needs much more calculation than the conventional block-based video coding method. The proposed fast matching pursuit method reduces inner product calculation that takes the most part of entire calculation by utilizing the symmetry of the absolute values of the one-dimensional Gator dictionary bases, the modified dictionary which allows faster matching without causing image quality degradation, and a Property of the two-dimensional Gabor dictionary that can be grouped in advance to four classes according to its frequency characteristics. Proposed method needs only about 1/8 of multiplications compared to the well-known separability-based fast method proposed by Neff.

• Journal of Digital Policy
• /
• v.3 no.1
• /
• pp.27-32
• /
• 2024

In this paper, proposes a super resolution method that enhances the quality of results by refining texture features, contrasting each, and utilizing the results as weights. For the improvement of quality, a precise and clear restoration result in details such as boundary areas is crucial in super resolution, along with minimizing unnecessary artifacts like noise. The proposed method constructs a residual block structure with multiple paths and skip-connections for feature estimation in conventional Convolutional Neural Network (CNN)-based super resolution methods to enhance quality. Additional learning is performed for sharpened and blurred image results for further texture analysis. By contrasting each super resolution result and allocating weights through this process, the proposed method achieves improved quality in detailed and smoothed areas of the image. The experimental results of the proposed method, evaluated using the PSNR and SSIM values as quality metrics, show higher results compared to existing algorithms, confirming the enhancement in quality.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.1
• /
• pp.29-36
• /
• 2020

Wear-leveling techniques and Error Correction Codes (ECCs) are essential for the improvement of the reliability and durability of flash memories. Low-Density Parity-Check (LDPC) codes have higher error correction capabilities than conventional ECCs and have been applied to various flash memory-based storage devices. Conventional wear-leveling schemes using only the number of Program/Erase (P/E) cycles are not enough to reflect the actual aging differences of flash memory components. This paper introduces an actual aging measurement scheme for flash memory wear-leveling using LDPC decoding information. Our analysis, using error-rates obtained from an flash memory module, shows that LDPC decoding information can represent the aging degree of each block. We also show the effectiveness of the wear-leveling based on the proposed scheme through wear-leveling simulation experiments.

• Journal of The Korean Association of Information Education
• /
• v.24 no.4
• /
• pp.401-412
• /
• 2020

Team-based programming methods are widely applied to solve various difficulties that pre-service teachers experience in the programming lessons. To prepare effective collaboration strategies necessary for them, it is necessary to analyze various collaborative factors that affect learners' programming competencies. Therefore, in this article, a questionnaire survey was conducted by dividing learners' collaboration factors into individual and team competencies, and the relationship between learners' programming competencies was analyzed. As a result of the verification, the program design competency showed significant results in all elements of the learner's personal competency, team techniques such as data sharing skills necessary for collaboration, and team collaboration. It was analyzed that an individual's understanding of learning and team collaboration influenced the program implementation competency. In addition, the group with relatively high team technique showed significant differences in programming competence, interest, and satisfaction. Accordingly, by linking meaningful factors related to individual and team competencies according to the programming process, a collaborative strategy practically necessary for pre-service teachers was suggested.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.812-820
• /
• 2012

In this paper, multiple pedestrians tracking system using Histogram of Oriented Gradient and occlusion detection is proposed. The proposed system is applicable to Intelligent Surveillance System. First, we detect pedestrian in a image sequence using pedestrian's feature. To get pedestrian's feature, we make block-histogram using gradient's direction histogram based on HOG(Histogram of Oriented Gradient), after that a pedestrian region is classified by using Linear-SVM(Support Vector Machine) training. Next, moving objects are tracked by using position information of the classified pedestrians. And we create motion trajectory descriptor which is used for content based event retrieval. The experimental results show that the proposed method is more fast, accurate and effective than conventional methods.

• Convergence Security Journal
• /
• v.19 no.5
• /
• pp.19-24
• /
• 2019

It is impossible to apply the routing protocol in the wired environment because MANET consists of only mobile nodes. Therefore, routing protocols considered these characteristics are required. In particular, if malicious nodes are not excluded in the routing phase, network performance will be greatly reduced. In this paper, we propose intrusion detection technique based on region to improve routing performance. In the proposed technique, the whole network is divided into certain areas, and then attack detection within the area using area management node is performed. It is a proposed method that can detect attack nodes in the path through cooperation with each other by using completion message received from member nodes. It also applied a method that all nodes participating in the network can share the attack node information by storing the detected attack node and sharing. The performance evaluation of the proposed technique was compared with the existing security routing techniques through the experiments and the superior performance of the proposed technique was confirmed.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1321-1327
• /
• 2019

This paper describes an efficient hardware implementation of modular square root (MSQR) computation over GF(p), which is the operation needed to map plaintext messages to points on elliptic curves for elliptic curve (EC)-ElGamal public-key encryption. Our method supports five sizes of elliptic curves over GF(p) defined by the National Institute of Standards and Technology (NIST) standard. For the Koblitz curves and the pseudorandom curves with 192-bit, 256-bit, 384-bit and 521-bit, the Euler's Criterion based on the characteristic of the modulo values was applied. For the elliptic curves with 224-bit, the Tonelli-Shanks algorithm was simplified and applied to compute MSQR. The proposed method was implemented using the finite field arithmetic circuit with 32-bit datapath and memory block of elliptic curve cryptography (ECC) processor, and its hardware operation was verified by implementing it on the Virtex-5 field programmable gate array (FPGA) device. When the implemented circuit operates with a 50 MHz clock, the computation of MSQR takes about 18 ms for 224-bit pseudorandom curves and about 4 ms for 256-bit Koblitz curves.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.6
• /
• pp.629-633
• /
• 2011

Recently, systems such as aircraft, trains and ships have become larger more complex. Therefore, the reliability calculation of these systems is more difficult. This paper presents a reliability calculation algorithm for a complex system with a solution that is difficult to analyze. When the system has a very complex structure, it is very difficult to find an analytical solution. In this case, we can assess system reliability using the failure enumeration method of the reliability path. In this research, we represent the reliability block diagram by an adjacent matrix and define the reliability path. We can find any system status by the failure enumeration of the reliability path, and thus we can calculate any kind of system reliability through this process. This result can be applied to RCM (Reliability-Centered Maintenance) and reliability information-management systems, in which the system reliability is composed of the reliabilities of individual parts.