• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.194-196
• /
• 2014

HEVC(High Efficiency Video Coding)는 재귀적 쿼드트리 분할 구조의 부호화단위(CU: Coding Unit)와 각 CU에서 다양한 예측단위(PU: Prediction Unit)를 제공하고, 율-왜곡 기반으로 최적의 CU와 PU를 결정함으로써 높은 부호화 효율을 얻을 수 있는 반면 부호화 복잡도 또한 크게 증가하는 문제가 있다. 본 논문에서는 부호화기의 복잡도를 감소시키기 위해 상위깊이의 부호화 정보를 이용한 고속 부호화 기법을 제안한다. 제안기법은 상위깊이 CU의 Sub-CBF(coded block flag)를 이용하여 현재깊이 CU에서의 PU를 조기 결정하여 PU 탐색을 고속화 한다. 또한 화면내(Intra) 예측 고속화를 위하여 현재 CU의 sub-CBF를 함께 사용하여 하위깊이에서의 화면내 예측을 생략한다. 실험결과 제안기법은 HM 14.0 대비 1.2%의 BD-rate 증가에 31.4%의 부호화 시간 감소 효과를 얻을 수 있었다.

• KSBB Journal
• /
• v.23 no.6
• /
• pp.484-488
• /
• 2008

Chlorinated phenols are widely used by the chemical industry as intermediate products in synthesis and previously were frequently applied to various industry fields. Peroxidases catalyze the peroxide-dependent oxidation of a range of inorganic and organic compounds. Peroxidase was shown to mineralize a variety of recalcitrant aromatic compounds and to oxidize a number of polycyclic aromatic and phenolic compounds. Among monomeric phenolic and nonphenolic compounds, peroxidase is known to oxidize its compounds. In this study, a colorimetric assay was developed to quantitatively evaluate the peroxidase activity for rapid screening. Color products of different intensity were developed proportionally to the peroxidase activity on agar plate and 96-well plate. This method correlates well with the RP-HPLC result. Using this screening method, 12 colonies of strain was screened which survived at high concentration of 2,4-DCP (1000 ppm) and with peroxidase activity for the $7^{th}$ round screening step on agar plate. These strains were utilized 2,4-DCP as a sole carbon source and produced peroxidase. After the screening test, four of the bacteria have significant better effect of COD removal on dye waste-water. COD removal of these was from 44% to 61%, respectively.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.12
• /
• pp.607-613
• /
• 2018

The aim of this study is to predict the exact time of parturition from analysis and classification of preliminary behavior based on parturition signals in sows. This study was conducted with 12 crossbred sows (with an average of 3.5 parities). Behavioral characteristics were analyzed for duration and the frequency of different behaviors on a checklist, which includes the duration of the basic behaviors (feeding, standing, lying down, and sitting). The frequency of specific behaviors (investigatory behavior, shame-chewing, scratching, and bar-biting) was also recorded. Image information was collected every two minutes for 24 hours before the first piglets were born. As a result, the basic behavior of a sows' standing time (22.6% of the time after 24 h, 24.9% after 12 h) and time lying down (55.9% after 24 h, 66.3% after 12 h) increased over the 12 h period before parturition, compared with the 24 h period before parturition (p<0.01). Feeding (13.42% after 24 h, 4.38% after 12 h) and sitting (8.2% after 24 h, 4.5% after 12 h) tended to decrease during the 12 h before parturition (p>0.05). The sows' investigatory behavior ($11.44{\pm}1.80$ after 24 h, $55.97{\pm}6.13$ after 12 h), scratching ($3.75{\pm}1.92$ after 24 h, $20.99{\pm}5.81$ after 12 h), and bar-biting ($0.69{\pm}0.15$ after 24 h, $3.71{\pm}1.53$ after 12 h) increased in the 12-hour period before parturition, compared with the 24-hour period before parturition (p<0.01). On the other hand, shame-chewing ($2.20{\pm}1.67$ after 24 h, $0.07{\pm}0.01$ after 12 h) decreased compared to the 12-hour period before parturition (p>0.05). Thus, standing, investigatory behavior, scratching, and bar-biting could be used as behaviors indicative of parturition in sows.

• Journal of KIISE:Software and Applications
• /
• v.32 no.2
• /
• pp.128-139
• /
• 2005

Moving object boundary is very important for moving object segmentation. But the moving object boundary shows broken boundary We invent a novel space-oriented boundary linking algorithm to link the broken boundary The boundary linking algorithm forms a quadrant around the terminating pixel in the broken boundary and searches forward other terminating pixel to link within a radius. The boundary linking algorithm guarantees shortest distance linking. We also register the background from image sequence. We construct two object masks, one from the result of boundary linking and the other from the registered background, and use these two complementary object masks together for moving object segmentation. We also suppress the moving cast shadow using Roberts gradient operator. The major advantages of the proposed algorithms are more accurate moving object segmentation and the segmentation of the object which has holes in its region using these two object masks. We experiment the algorithms using the standard MPEG-4 test sequences and real video sequence. The proposed algorithms are very efficient and can process QCIF image more than 48 fps and CIF image more than 19 fps using a 2.0GHz Pentium-4 computer.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.4
• /
• pp.371-377
• /
• 2013

This paper proposes three methods for improving the accuracy of auto-music transcription considering with time-varying tempo from monophonic sound. The first one that uses TV(Total Variation) filter for smoothing the pitch data reduces the fragmentation in the pitch segmentation result. Also, the measure finding method that combines three different ways based on pitch and energy of sound data, respectively as well as based on rules produces more stable result. In addition the temporal result of note-length encoding is corrected in optimal way that the resulted encoding minimizes the sum of quantization error in a measure while the sum of note-lengths is equal to the number of beats. In the experiment with 16 children songs, we obtained the improved result in which measure finding was complete, the accuracy of encoding for note-length and pitch was about 91.3 and 86.7, respectively.

• Journal of Broadcast Engineering
• /
• v.4 no.1
• /
• pp.44-58
• /
• 1999

In this paper, a rate-distortion based image segmentation algorithm is presented using a recursive merging with region adjacency graph (RAG). In the method, the dissimilarity between a pair of adjacent regions is represented as a Lagrangian cost function considered in rate-distortion sense. Lagrangian multiplier is estimated in each merging step, a pair of adjacent regions whose cost is minimal is searched and then the pair of regions are merged into a new region. The merging step is recursively performed until some termination criterion is reached. The proposed method thus is suitable for region-based coding or segmented-based coding. Experiment results for 256x256 Lena show that segmented-based coding using the proposed method yields PSNR improvement of about 2.5 - 3.5 dB. 0.8 -1.0 dB. 0.3 -0.6 dB over mean-difference-based method. distortion-based method, and JPEG, respectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.2
• /
• pp.209-214
• /
• 2020

The equitable partitioning problem(EPP) is classified as [0/1] binary skill existence or nonexistence and integer skill levels such as [1,2,3,4,5]. There is well-known a polynomial-time optimal solution finding algorithm for binary skill EPP. On the other hand, tabu search a kind of metaheuristic has apply to integer skill level EPP is due to unknown polynomial-time algorithm for it and this problem is NP-hard. This paper suggests heuristic greedy algorithm with polynomial-time to find the optimal solution for integer skill level EPP. This algorithm descending sorts of skill level frequency for each field and decides the lower bound(LB) that more than the number of group, packing for each group bins first, than the students with less than LB allocates to each bin additionally. As a result of experimental data, this algorithm shows performance improvement than the result of tabu search.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.186-193
• /
• 2003

In recent years the complexity of digital systems has increased dramatically. Although semiconductor manufacturers try to ensure that their products are reliable, it is almost impossible not to have faults somewhere in a system at any given time. As complexity of circuits increases, the necessity of more efficient organized and automated methods for test generation is growing. But, up to now, most of popular and extensive methods for test generation nay be those which sequentially produce an output for an input pattern. They inevitably require a lot of time to search each fault in a system. In this paper, corresponding test patterns are generated through the partitioning method among those based on the exhaustive method. In addition, the method, which can discovers faults faster than other ones that have been proposed ever by inserting a pattern in parallel, is designed and implemented.

• Applied Microscopy
• /
• v.37 no.4
• /
• pp.259-269
• /
• 2007

In this paper we explored a possibility of observation for effects of higher-order Laue zone(HOLZ) reflections on high resolution transmission electron microscope(HRTEM) images for illumination along an off-zone axis of a crystal. The analysis of the observation could give useful three dimensional crystal structure information. For the image simulation the Howie-Whelan equation was used with modification of including HOLZ reflections. This study clearly indicates that HRTEM images for a very thin crystal tilted by a few degrees from a zone axis show the effects of HOLZ reflections and contain some information of atomic arrangements along the zone axis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.841-849
• /
• 2012

This paper proposes an low-complexity soft-output multiple-input multiple-output (soft-MIMO) detection algorithm for achieving soft-output maximum-likelihood (soft-ML) performance under max-log approximation. The proposed algorithm is based on a parallel tree-search (PTS) applying a channel ordering by a sorted-QR decomposition (SQRD) with altered sort order. The empty-set problem that can occur in calculation of log-likelihood ratio (LLR) for each bit is solved by inserting additional nodes at each search level. Since only the closest node is inserted among nodes with opposite bit value to a selected node, the proposed node insertion scheme is very efficient in the perspective of computational complexity. The computational complexity of the proposed algorithm is approximately 37-74% of that of existing algorithms, and from simulation results for a $4{\times}4$ system, the proposed algorithm shows a performance degradation of less than 0.1dB.