• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.623-634
• /
• 2016

Most of existing frequent pattern mining methods address time efficiency and greatly rely on the primary memory. However, in the era of big data, the size of real-world databases to mined is exponentially increasing, and hence the primary memory is not sufficient enough to mine for frequent patterns from large real-world data sets. To solve this problem, there are some researches for frequent pattern mining method based on disk, but the processing time compared to the memory based methods took very time consuming. There are some researches to improve scalability of frequent pattern mining, but their processes are very time consuming compare to the memory based methods. In this paper, we present PPFP as a novel disk-based approach for mining frequent itemset from big data; and hence we reduced the main memory size bottleneck. PPFP algorithm is based on FP-growth method which is one of the most popular and efficient frequent pattern mining approaches. The mining with PPFP consists of two setps. (1) Constructing an IFP-tree: After construct FP-tree, we assign index number for each node in FP-tree with novel index numbering method, and then insert the indexed FP-tree (IFP-tree) into disk as IFP-table. (2) Mining frequent patterns with PPFP: Mine frequent patterns by expending patterns using stack based PUSH-POP method (PPFP method). Through this new approach, by using a very small amount of memory for recursive and time consuming operation in mining process, we improved the scalability and time efficiency of the frequent pattern mining. And the reported test results demonstrate them.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.11
• /
• pp.51-62
• /
• 2003

This paper presents a novel survivor memeory management and decoding techniques with sequential backward state transition control in the trace back Viterbi decoder. The Viterbi algorithm is an maximum likelihood decoding scheme to estimate the likelihood of encoder state for channel error detection and correction. This scheme is applied to a broad range of digital communication such as intersymbol interference removing and channel equalization. In order to achieve the area-efficiency VLSI chip design with high throughput in the Viterbi decoder in which recursive operation is implied, more research is required to obtain a simple systematic parallel ACS architecture and surviver memory management. As a method of solution to the problem, this paper addresses a progressive decoding algorithm with sequential backward state transition control in the trace back Viterbi decoder. Compared to the conventional trace back decoding techniques, the required total memory can be greatly reduced in the proposed method. Furthermore, the proposed method can be implemented with a simple pipelined structure with systolic array type architecture. The implementation of the peripheral logic circuit for the control of memory access is not required, and memory access bandwidth can be reduced Therefore, the proposed method has characteristics of high area-efficiency and low power consumption with high throughput. Finally, the examples of decoding results for the received data with channel noise and application result are provided to evaluate the efficiency of the proposed method.

• Journal of Broadcast Engineering
• /
• v.25 no.5
• /
• pp.698-708
• /
• 2020

VVC (Versatile Video Coding), which has been developing as a next generation video coding standard. Compared to HEVC (High Efficiency Video Coding), VVC is improved by about 34% in RA (Random Access) configuration and about 30% in LDB (Low-Delay B) configuration by adopting various techniques such as recursive block partitioning structure and GPM (Geometric Partitioning Mode). But the encoding complexity is increased by about 10x and 7x, respectively. In this paper, we propose a fast decision method of GPM mode and block partitioning using directionality of block to reduce encoding complexity of VVC. The proposed method is to apply the Hough transform to the current block to identify the directionality of the block, thereby determining the GPM mode and the specific block partitioning method to be skipped in the rate-distortion cost search process. As a result, compared to VTM8.0, the proposed method reduces about 31.01% and 29.84% encoding complexity for RA and LDB configuration with 2.48% and 2.69% BD-rate loss, respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.19-30
• /
• 2013

We study sub-Peres functions that are defined recursively as Peres function for random number generation. Instead of using two parameter functions as in Peres function, the sub-Peres functions uses only one parameter function. Naturally, these functions produce less random bits, hence are not asymptotically optimal. However, the sub-Peres functions runs in linear time, i.e., in O(n) time rather than O(n logn) as in Peres's case. Moreover, the implementation is even simpler than Peres function not only because they use only one parameter function but because they are tail recursive, hence run in a simple iterative manner rather than by a recursion, eliminating the usage of stack and thus further reducing the memory requirement of Peres's method. And yet, the output rate of the sub-Peres function is more than twice as much as that of von Neumann's method which is widely known linear-time method. So, these methods can be used, instead of von Neumann's method, in an environment with limited computational resources like mobile devices. We report the analyses of the sub-Peres functions regarding their running time and the exact output rates in comparison with Peres function and other known methods for random number generation. Also, we discuss how these sub-Peres function can be implemented.

• Journal of Broadcast Engineering
• /
• v.22 no.5
• /
• pp.541-547
• /
• 2017

The Joint Exploration Model (JEM), which is a reference SW codec of the Joint Video Exploration Team (JVET) exploring the future video standard technology, provides a recursive Quadtree plus Binary Tree (QTBT) block structure. QTBT can achieve enhanced coding efficiency by adding new block structures at the expense of largely increased computational complexity. In this paper, we propose a fast decision algorithm of QTBT block partitioning depth that uses the rate-distortion (RD) cost of the upper and current depth to reduce the complexity of the JEM encoder. Experimental results showed that the computational complexity of JEM 5.0 can be reduced up to 21.6% and 11.0% with BD-rate increase of 0.7% and 1.2% in AI (All Intra) and RA (Random Access), respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2353-2362
• /
• 2015

In this paper, we employ the single channel full duplex radio for wireless local area network (WLAN) systems, and design digital interference cancellers using adaptive signal processing. When the full duplex scheme is used for WLAN systems with multiple transmit and receive antennas, some interference is caused through the feedback of transmit signals from multiple antennas. To remove the feedback interference, we derive the least mean square (LMS), normalized LMS (NLMS), and recursive least squares (RLS) algorithms based on adaptive signal processing techniques. In addition, we analyze the theoretical convergence of the proposed LMS and RLS methods. The channel capacity of full duplex radios increases by two times than that of half duplex radios, when the packet error rate (PER) performances for the two systems are identical. Through numerical simulations in WLAN systems, it is shown that the full duplex method with the proposed interference cancellers has a similar PER performance with the conventional half duplex transmission scheme.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.6
• /
• pp.1-10
• /
• 2007

This paper presents a direct nonlinear multivariable self-tuning PID controller using neural network which adapts to the changing parameters of the nonlinear multivariable system with noises and time delays. The nonlinear multivariable system is divided linear part and nonlinear part. The linear controller are used the self-tuning PID controller that can combine the simple structure of a PID controllers with the characteristics of a self-tuning controller, which can adapt to changes in the environment. The linear controller parameters are obtained by the recursive least square. And the nonlinear controller parameters are achieved the through the Back-propagation neural network. In order to demonstrate the effectiveness of the proposed algorithm, the computer simulation results are presented to adapt the nonlinear multivariable system with noises and time delays and with changed system parameter after a constant time. The proposed PID type nonlinear multivariable self-tuning method using neural network is effective compared with the conventional direct multivariable adaptive controller using neural network.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.288-294
• /
• 2011

In this paper we define the probability models for determining the disparity map given stereo images and derive the methods for solving the problem, which is proven to be equivalent to an energy-based stereo matching. Under the assumptions the difference between the pixel on the left image and the corresponding pixel on the right image and the difference between the disparities of the neighboring pixels are exponentially distributed, a recursive approach for estimating the MRF regularizing parameter is proposed. The proposed method alternates between estimating the parameters with the intermediate disparity map and estimating the disparity map with the estimated parameters, after computing it with random initial parameters. Our algorithm is applied to the stereo matching algorithms based on the dynamic programming and belief propagation to verify its operation and measure its performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.155-160
• /
• 2003

This paper presents a multiple face detector based on a robust pupil detection technique. The pupil detector uses active illumination that exploits the retro-reflectivity property of eyes to facilitate detection. The detection range of this method is appropriate for interactive desktop and kiosk applications. Once the location of the pupil candidates are computed, the candidates are filtered and grouped into pairs that correspond to faces using heuristic rules. To demonstrate the robustness of the face detection technique, a dual mode face tracker was developed, which is initialized with the most salient detected face. Recursive estimators are used to guarantee the stability of the process and combine the measurements from the multi-face detector and a feature correlation tracker. The estimated position of the face is used to control a pan-tilt servo mechanism in real-time, that moves the camera to keep the tracked face always centered in the image.

• Cartoon and Animation Studies
• /
• s.13
• /
• pp.83-96
• /
• 2008

Digital production method in animation has enabled us to reconstruction the real world in the way we had sought in visual all. However, spectator's visual desire is not satisfied with mere photographic visual reconstruction. It demands traditional picturesque qualify with involves a great deal of contingencies and errors. Naturally, Digital film technology has also sometimes tried to simulate analogue technique such as hand drawing so on. This is not caused by nostalgia, but by recursive instinct. The spectator's visual desire for media doesn't remain only precision of real world but require mental demand on successive visual and perceptive errors while repealing ripeness of new media and going through perception and recognition. This spectator's desire and visual art technology pursuits variously its visual perfection in history.