• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.145-155
• /
• 2013

In this paper, we proposed a $4{\times}4$ block parallel architecture of interpolation for high-performance H.264/AVC Fractional Motion Estimation in 8K UHD($7680{\times}4320$) video real time processing. To improve throughput, we design $4{\times}4$ block parallel interpolation. For supplying the $10{\times}10$ reference data for interpolation, we design 2D cache buffer which consists of the $10{\times}10$ memory arrays. We minimize redundant storage of the reference pixel by applying the Search Area Stripe Reuse scheme(SASR), and implement high-speed plane interpolator with 3-stage pipeline(Horizontal Vertical 1/2 interpolation, Diagonal 1/2 interpolation, 1/4 interpolation). The proposed architecture was simulated in 0.13um standard cell library. The gate count is 436.5Kgates. The proposed H.264/AVC Fractional Motion Estimation can support 8K UHD at 30 frames per second by running at 187MHz.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.1
• /
• pp.49-55
• /
• 2017

Computed tomographic angiography (CTA) is widely used in the diagnosis and treatment of coronary artery disease because it shows not only the whole anatomical structure of the cardiovascular three-dimensionally but also provides information on the lesion and type of plaque. However, due to the large size of the image, there is a limitation in manually extracting coronary arteries, and related researches are performed to automatically extract coronary arteries accurately. As the coronary artery originate from the ascending aorta, the ascending aorta and ostium should be detected to extract the coronary tree accurately. In this paper, we propose an automatic segmentation for the ostium as a starting structure of coronary artery in CTA. First, the region of the ascending aorta is initially detected by using Hough circle transform based on the relative position and size of the ascending aorta. Second, the volume of interest is defined to reduce the search range based on the initial area. Third, the refined ascending aorta is segmented by using a two-dimensional geodesic active contour. Finally, the two ostia are detected within the region of the refined ascending aorta. For the evaluation of our method, we measured the Euclidean distance between the result and the ground truths annotated manually by medical experts in 20 CTA images. The experimental results showed that the ostia were accurately detected.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.145-151
• /
• 2004

We present an efficient data structure to obtain the range minima in an away in constant time. Recently, suffix ways are extensively used to search DNA sequences fast in bioinformatics. In constructing suffix arrays, solving the range minima problem is necessary When we construct suffix arrays, we should solve the range minima problem not only in a time-efficient way but also in a space-efficient way. The reason is that DNA sequences consist of millions or billions of bases. Until now, the most efficient data structure to find the range minima in an way in constant time is based on the method that converts the range minima problem in an array into the LCA (Lowest Common Ancestor) problem in a Cartesian tree and then converts the LCA problem into the range minima problem in a specific array. This data structure occupies O( n) space and is constructed in O(n) time. However since this data structure includes intermediate data structures required to convert the range minima problem in an array into other problems, it requires large space (=13n) and much time. Our data structure is based on the method that directly solves the range minima problem. Thus, our data structure requires small space (=5n) and less time in practice. As a matter of course, our data structure requires O(n) time and space theoretically.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.99-110
• /
• 2005

Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.746-758
• /
• 2006

Many objects existing on wide area environments have the replication characteristics according to how to categorize using their own names or properties. From the clients' requests, the existing naming and trading services have not supported with the binding service for replicated solver object with the same service type. For this reason, we present an integrated model that can support the selection of replicated object and dynamic binding services on wide-area computing environments. This model suggests provides not only location management of replicated objects but also active binding service which enables to select a least-loaded object on the system to keep the balance of load between systems. In this purpose, constructing both the service plan and model for support solver object's binding with replication property on wide area computing environments has been researched. In this paper, we showed the test environment and analyzed the performance evaluation of client/server binding procedures via integrated binding service in federation model and verified our model under the condition to see whether load balance can be applied to our model. For the performance evaluation of suggested wide area integrated binding service federation model, evaluated the integrated binding service of each domain and analyzed the performance evaluation of process for non-replication object's under federation model environment. Also, we analyzed the performance evaluation of the federation model between domains for wide area environment. From the execution results, we showed the federation model provides lowers search-cost on the physical tree structure of network.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.89-101
• /
• 2014

Recently, as domestic air traffic dramatically increases, the need of ATC(air traffic control) systems has grown for safe and efficient ATM(air traffic management). Especially, for smooth ATC, it is far more important that performance of display system which should show all air traffic situation in FIR(Flight Information Region) without additional latency is guaranteed. In this paper, we design a ASTERIX(All purpose STructured Eurocontrol suRveillance Information eXchange) parsing module to promote stable ATC by minimizing system loads, which is connected with reducing overheads arisen when we parse ASTERIX message. Our ASTERIX parsing module based on pattern matching creates patterns by analyzing received ASTERIX data, and handles following received ASTERIX data using pre-defined procedure through patterns. This module minimizes display errors by rapidly extracting only necessary information for display different from existing parsing module containing unnecessary parsing procedure. Therefore, this designed module is to enable controllers to operate stable ATC. The comparison with existing general bit level ASTERIX parsing module shows that ASTERIX parsing module based on pattern matching has shorter processing delay, higher throughput, and lower CPU usage.

• Journal of Environmental Impact Assessment
• /
• v.24 no.5
• /
• pp.532-548
• /
• 2015

The winter ecology of individual yellow-throated martens(Martes flavigula) intemperate region of Korea were studied through snow-tracking. The study was performed across 3 winter seasons, from January 2011 to February 2013. Total distance of 49.8km was snow tracked (comprising 13 snow-tracking routes) to determine winter foraging habits, general behavior and movement paths of solitary and small groups (1-6 individuals; $mean=2.9{\pm}1.6$) of yellow-throated martens. The martens in the current study were omnivorous, with their winter diet including 9 animal and 5 plant species. Yellow-throated martens searched for food near and under the fallen logs and branches, root plates of fallen trees, around the roots of growing trees, and in small holes in the ground. They also climbed trees to search inside the tree holes and vacant bird nests. Foraging activity was estimated to occur at a frequency of 1.20 times/km, while territory marking occurred 1.42 times/km on average. Of the 60 documented foraging activities we observed, 17 were successful (28.3%). Moving activity and territory marking mainly occurred along ridges, whereas foraging activity was recorded in valleys, slopes, and forest edges. To protect the habitat of this species, the entire forest should be preserved, including the valleys, slopes, and even forest edges as well as main ridges.

• The Plant Pathology Journal
• /
• v.18 no.5
• /
• pp.251-258
• /
• 2002

A potyvirus was isolated from cultivated Iris plants showing leaf streak mosaic symptom. Reverse transcription and polymerase chain reaction (RT-PCR) product of 1 kb long which encoded partial nuclear inclusion B and N-terminal region of viral coat protein (CP) genes for potyviruses was successfully amplified with a set of potyvirus-specific degenerate primers with viral RNA samples from the infected leaves: The RT-PCR product was cloned into the plasmid vector and its nucleotide sequences were determined. The nucleotide sequence of a CDNA clone revealed that the virus was an isolate of Ornithogalum moseic virus (OrMV) based on BLAST search analysis and was denoted as OrMV Korean isolate (OrMV-Ky). To further characterize the CP gene of the virus, a pair of OrMV-specific primers was designed and used for amplification of the entire CP gene of OrMV-Kr, The virus was easily and reliably detected from virus-infected Iris leaves by using the RT-PCR with the set of virus-specific primers. The RT-PCR product of the CP gene of the virus was cloned and its sequences were determined from selected recombinant CDNA clones. Sequence analysis revealed that the CP of OrMV-Kr consisted of 762 nucleotides, which encoded 253 amino acid residues. The CP of OrMV-Ky has 94.1-98.0% amino acid sequence identities (20 amino acid alterations) with that of other three isolates of OrMV, Two NT rich potential N-glycosylation motif sequences, NCTS and NWTM, and a DAC triple box responsible for aphid transmission were conserved in CPs of all the strains of OrMV. The virus has 58.5-86.2% amino acid sequence identities with that of other 16 potyviruses, indicating OrMV to be a distinct species of the genus. OrMV-Ky was the most related with Pterostylia virus Yin the phylogenetic tree analysis of CP at the amino acid level. This is the first report on the occurrence of OrMV in Iris plants in Korea. Data in this study indicate that OrMV is found in cultivated Iris plants, and may have mixed infection of OrMV and Iris severe mosaic virus in Korea.

• Journal of Korea Water Resources Association
• /
• v.41 no.2
• /
• pp.149-162
• /
• 2008

The Soil and Water Assessment Tool (SWAT) developed by the USDA-Agricultural Research Service for the prediction of land management impact on water, sediment, and agricultural chemical yields in a large-scale basin was applied to Daecheong Reservoir basin to estimate the amount of soil losses from different land uses. The research outcomes provide important indications for reservoir managers and policy makers to search alternative watershed management practices for the mitigation of reservoir turbidity flow problems. After calibrations of key model parameters, SWAT showed fairly good performance by adequately simulating observed annual runoff components and replicating the monthly flow regimes in the basin. The specific soil losses from agricultural farm field, forest, urban area, and paddy field were 33.1, $2.3{\sim}5.4$ depending on the tree types, 1.0, and 0.1 tons/ha/yr, respectively in 2004. It was noticed that about 55.3% of the total annual soil loss is caused by agricultural activities although agricultural land occupies only 10% in the basin. Although the soil erosion assessment approach adopted in this study has some extent of uncertainties due to the lack of detailed information on crop types and management activities, the results at least imply that soil erosion control practices for the vulnerable agricultural farm lands can be one of the most effective alternatives to reduce the impact of turbidity flow in the river basin system.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.93-100
• /
• 2005

This study is to desist and implement an efficient microbial medical image retrieval system based on knowledge and content of them which can make use of more accurate decision on colony as doll as efficient education for new techicians. For this. re first address overall inference to set up flexible search path using rule-base in order U redure time required original microbial identification by searching the fastest path of microbial identification phase based on heuristics knowledge. Next, we propose a color ffature gfraction mtU, which is able to extract color feature vectors of visual contents from a inn microbial image based on especially bacteria image using HSV color model. In addition, for better retrieval performance based on large microbial databases, we present an integrated indexing technique that combines with B+-tree for indexing simple attributes, inverted file structure for text medical keywords list, and scan-based filtering method for high dimensional color feature vectors. Finally. the implemented system shows the possibility to manage and retrieve the complex microbial images using knowledge and visual contents itself effectively. We expect to decrease rapidly Loaming time for elementary technicians by tell organizing knowledge of clinical fields through proposed system.