• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2113-2119
• /
• 1998

The optimization problem of BDDs plays an improtant role in the area of logic synthesis and formal verification. Since the variable ordering has great impacts on the size and form of BDD, finding a good variable order is very important problem. In this paper, a new variable ordering scheme called incremental optimization algorithm is presented. The proposed algorithm reduces search space more than a half of that of the conventional sifting algorithm, and computing time has been greatly reduced withoug depreciating the performance. Moreover, the incremental optimization algorithm is very simple than other variable reordering algorithms including the sifting algorithm. The proposed algorithm has been implemented and the efficiency has been show using may benchmark circuits.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.5
• /
• pp.25-32
• /
• 2004

An anti-fraud system that utilizes association rules of fraud as well as AFS (Anti Fraud System) for credit card payments in e-commerce is proposed. The association rules are found by applying the data mining algorithm to millions of transaction records that have been generated as a result of orders on goods through the Internet. When a customer begins to process an order by using transaction components of a secure messaging protocol, the degree of risk for the transaction is assessed by using the found rules. More credit information will be requested or the transaction is rejected if it is interpreted as risky.

• Journal of Korea Game Society
• /
• v.18 no.5
• /
• pp.59-66
• /
• 2018

In this paper, one of the traditional game, Gonu game, is implemented and experimented. The Minimax algorithm was applied as a technique to implement the Gonu game. We proposed an evaluation function to implement game in Minimax algorithm. We analyze the efficiency of algorithm for alpha beta pruning to improve the performance after implementation of Gonu game. Weights were analyzed for optimal analysis that affected the win or loss of the game. For the weighting analysis, a competition of human and computer was performed. We also experimented with computer and computer. As a result, we proposed a weighting value for optimal attack and defense.

• Journal of Korea Multimedia Society
• /
• v.25 no.4
• /
• pp.583-599
• /
• 2022

Although the object detection accuracy with a single image has been significantly improved with the advance of deep learning techniques, the detection accuracy for pig monitoring is challenged by occlusion problems due to a complex structure of a pig room such as food facility. These detection difficulties with a single image can be mitigated by using a video data. In this research, we propose a method in pig detection for video monitoring environment with a static camera. That is, by using both image processing and deep learning techniques, we can recognize a complex structure of a pig room and this information of the pig room can be utilized for improving the detection accuracy of pigs in the monitored pig room. Furthermore, we reduce the execution time overhead by applying a pruning technique for real-time video monitoring on an embedded board. Based on the experiment results with a video data set obtained from a commercial pig farm, we confirmed that the pigs could be detected more accurately in real-time, even on an embedded board.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.2
• /
• pp.3-10
• /
• 1999

This paper describes the development and evaluation of a Korean address input system employing automatic speech recognition technique as user interface for input Korean address. Address consists of cities, provinces and counties. The system works on a window 95 environment of personal computer with built-in soundcard. In the speech recognition part, the Continuous density Hidden Markov Model(CHMM) for making phoneme like units(PLUs) and One Pass Dynamic Programming(OPDP) algorithm is used for recognition. For address recognition, Finite State Automata(FSA) suitable for Korean address structure is constructed. To achieve an acceptable performance against the variation of speakers, microphones, and environmental noises, Maximum a posteriori(MAP) estimation is implemented in adaptation. And to improve the recognition speed, fast search method using variable pruning threshold is newly proposed. In the evaluation tests conducted for the 100 connected words uttered by 3 males the system showed above average 96.0% of recognition accuracy for connected words after adaption and recognition speed within 2 seconds, showing the effectiveness of the system.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.2
• /
• pp.267-275
• /
• 2013

Among data mining techniques, the association rule is the most recently developed technique, and it finds the relevance between two items in a large database. And it is directly applied in the field because it clearly quantifies the relationship between two or more items. When we determine whether an association rule is meaningful, we utilize interestingness measures such as support, confidence, and lift. Interestingness measures are meaningful in that it shows the causes for pruning uninteresting rules statistically or logically. But the criteria of these measures are chosen by experiences, and the number of useful rules is hard to estimate. If too many rules are generated, we cannot effectively extract the useful rules.In this paper, we designed a variety of non-linear regression equations considering all association thresholds between the number of rules and three interestingness measures. And then we diagnosed multi-collinearity and autocorrelation problems, and used analysis of variance results and adjusted coefficients of determination for the best model through numerical experiments.

• Journal of IKEEE
• /
• v.19 no.3
• /
• pp.342-348
• /
• 2015

High speed implementation of digital filters is required in high data rate applications such as hard-wired wide band modem and high resolution video codec. Since the critical path of the digital filter is the MAC (multiplication and accumulation) circuit, the filter coefficient with sparse non-zero bits enables high speed implementation with adders of low hardware cost. Compressive sensing has been reported to be very successful in sparse representation and sparse signal recovery. In this paper a filter design method for digital FIR filters with CSD (canonic signed digit) coefficients using compressive sensing technique is proposed. The sparse non-zero signed bits are selected in the greedy fashion while pruning the mistakenly selected digits. A few design examples show that the proposed method can be utilized for designing sparse CSD coefficient digital FIR filters approximating the desired frequency response.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2006.11a
• /
• pp.127-132
• /
• 2006

Quantization in video coding plays an important role in controlling the bit-rate of compressed video bit-streams. It has been used as an important control means to adjust the amount of bit-streams to at]owed bandwidth of delivery networks and storage. Due to the dependent nature of video coding, dependent quantization has been proposed and applied for MPEG-2 video coding to better maintain the quality of reconstructed frame for given constraints of target bit-rate. Since Scalable Video Coding (SVC) being currently standardized exhibits highly dependent coding nature not only between frames but also lower and higher scalability layers where the dependent quantization can be effectively applied, in this paper, we propose a dependent quantization scheme for SVC and compare its performance in visual qualities and bit-rates with the current JSVM reference software for SVC. The proposed technique exploits the frame dependences within each GOP of SVC scalability layers to formulate dependent quantization. We utilize Lagrange optimization, which is widely accepted in R-D (rate-distortion) based optimization, and construct trellis graph to find the optimal cost path in the trellis by minimizing the R-D cost. The optimal cost path in the trellis graph is the optimal set of quantization parameters (QP) for frames within a GOP. In order to reduce the complexity, we employ pruning procedure using monotonicity property in the trellis optimization and cut the frame dependency into one GOP to decrease dependency depth. The optimal Lagrange multiplier that is used for SVC is equal to H.264/AVC which is also used in the mode prediction of the JSVM reference software. The experimental result shows that the dependent quantization outperforms the current JSVM reference software encoder which actually takes a linear increasing QP in temporal scalability layers. The superiority of the dependent quantization is achieved up to 1.25 dB increment in PSNR values and 20% bits saving for the enhancement layer of SVC.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.4
• /
• pp.39-46
• /
• 2009

Generally, Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, we propose an abstract graph for path-finding with dynamic information. The abstract graph is a simple graph as real road network is abstracted. The abstract graph is created by fixed-size cells and real road network. Path-finding with the abstract graph is composed of two step searching, path-finding on the abstract graph and on the real road network. We performed path-finding algorithm with the abstract graph against A* algorithm based on fixed-size cells on road network that consists of 106,254 edges. In result of evaluation of performance, cost of exploring in path-finding with the abstract graph is about 3~30% less than A* algorithm based on fixed-size cells. Quality of path in path-finding with the abstract graph is, However, about 1.5~6.6% more than A* algorithm based on fixed-size cells because edges eliminated are not candidates for path-finding.

• Horticultural Science & Technology
• /
• v.32 no.4
• /
• pp.454-462
• /
• 2014

This study was carried out to determine the effect of tree height on light transmission, spray penetration, tree growth performance, fruit quality attributes, and labor productivity in the slender-spindle system of 'Hongro'/M.9 apple trees. With increasing tree height, the light penetration into the internal parts of the canopy decreased, especially in the lower canopy. Leaf area index (LAI) increased with increasing tree height, thereby leading to a reduction in the extent of spray penetration into the interior of the canopy. With increasing tree height, shoot growth was more vigorous but produced slender shoots in the upper canopy compared to the lower canopy. Although the soluble solid content and coloration of fruit decreased, there was no difference in fruit firmness and acidity. In addition, the number of final fruit set increased, although the production of large fruit (> 305 g) decreased. The increase in tree height also significantly increased the labor required for practices such as thinning of flowers and fruits, pruning, and harvesting. Nevertheless, this problem of increased in labor input in taller trees would was eased by use of a mechanical lift. Utilizing a lift for thinning the flowers of trees 4.5 m in height saved 14.6 min per tree, compared to the use of ladder. Therefore, it is highly considerable that in order to enhance light transmission and fruit coloration, light conditions should be improved in the internal tree canopy of slender-spindle systems.