• Journal of the Korean Institute of Intelligent Systems
• /
• 제25권4호
• /
• pp.377-385
• /
• 2015

This paper proposes a novel forward vehicle tracking algorithm based on the WMIL(Weighted Multiple Instance Learning) equipped with a particle filter. In the proposed algorithm Haar-like features are used to train a vehicle object detector to be tracked and the location of the object are obtained from the recognition result. In order to combine both the WMIL to construct the vehicle detector and the particle filter, the proposed algorithm updates the object location by executing the propagation, observation, estimation, and selection processes involved in particle filter instead of finding the credence map in the search area for every frame. The proposed algorithm inevitably increases the computation time because of the particle filter, but the tracking accuracy was highly improved compared to Ababoost, MIL(Multiple Instance Learning) and MIL-based ones so that the position error was 4.5 pixels in average for the videos of national high-way, express high-way, tunnel and urban paved road scene.

• Korean Journal of Optics and Photonics
• /
• 제10권1호
• /
• pp.21-26
• /
• 1999

The technique for calibrating standard particles larger than 1 $\mu$m by using an optical array sizing method has been established. The system consists of an optical microscope with transmission light source, a CCD camera, and a computer equipped with a frame grabber. The center distance between two spheres located at both ends of a row which consists of N spheres is measured in terms of pixel numbers, and divided by (N-1) to obtain the average pixel numbers per particle. This value is multiplied by length conversion constant, which has been determined in advance, to obtain the mean diameter of polystylene spheres. The length conversion constant is found from the microscopic image of calibrated standard stage micrometer plate. In order to reduce error in finding center positions of the scale and particles in the image, a software filter which dilates bright (or dark) object has been used. Spheres having nominal size of 1, 2, 3, 5, and 10$\mu$m were measured, and the maximum deviation of the measured mean diameter valus from their certified values was 0.7%. Standard particles which is larger than 1 $\mu$m can be calibrated by this method with measuredment uncertainy (k=2) lees than 1.53%.

• Journal of Science and Technology Studies
• /
• 제9권2호
• /
• pp.51-78
• /
• 2009

Usually, Technological failures have been recognized as a mundane and inevitable process of trial and error for finally achieving success, or pathological technologies clearly different from success. These approaches easily ignore that a failed technology also constructed complex technological networks with various actors for some times. Consequently, failed technologies failed not only technological realization, but also got a proper evaluation. This paper explore the emergence and decline of the city phone project (CT-2 technology), the very typical failure cases in the telecommunications industry at Korea. This story shows that the city phone project with low-price and low-technology could constructed a stable network at agreement the result from interaction between various actors, and then, changed because various actors gave technologies different meaning and desire. Finally, it suggests that collapse of its technological network was attributed to uncertain future and contingent, rather than technological limits.

• Journal of KIISE:Computer Systems and Theory
• /
• 제26권12호
• /
• pp.1539-1547
• /
• 1999

캐리-세이브 가산기 (CSA)는 회로 설계 과정에서 빠른 연산 수행을 위해 가장 널리 이용되는 연산기 중의 하나이다. 그러나, 현재까지 산업체에서 CSA를 이용한 설계는 설계자의 경험에 따른 수작업에 의존하고 있고 그 결과 최적의 회로를 만들기 위해 매우 많은 시간과 노력이 소비되고 있다. 이에 따라 최근 CSA를 기초로 하는 회로 합성 자동화 기법에 대한 연구의 필요성이 대두되고 있는 상황에서, 본 논문은 연산 속도를 최적화하는 효율적인 CSA 할당 알고리즘을 제안한다. 우리는 CSA 할당 문제를 2단계로 접근한다: (1) 연산식의 멀티 비트 입력들만을 고려하여 최소 수행 속도 (optimal-delay)의 CSA 트리를 할당한다; (2) (1)에서 구한 CSA 트리의 수행 속도 증가가 최소화 (minimal increase of delay) 되는 방향으로 CSA들의 캐리 입력 포트들에 나머지 싱글 비트 입력들을 배정한다. 실제 실험에서 우리의 제안된 알고리즘을 적용하여 연산식들의 회로 속도를 회로 면적의 증가 없이 상당한 수준까지 줄일 수 있었다.Abstract Carry-save-adder (CSA) is one of the most widely used implementations for fast arithmetics in industry. However, optimizing arithmetic circuits using CSAs is mostly carried out by the designer manually based on his/her design experience, which is a very time-consuming and error-prone task. To overcome this limitation, in this paper we propose an effective synthesis algorithm for solving the problem of finding an allocation of CSAs with a minimal timing for an arithmetic expression. Specifically, we propose a two step approach: (1) allocating a delay-optimal CSA tree for the multi-bit inputs of the arithmetic expression and (2) determining the assignment of the single-bit inputs to carry inputs of the CSAs which leads to a minimal increase of delay of the CSA tree obtained in step (1). For a number of arithmetic expressions, we found that our approach is very effective, reducing the timing of the circuits significantly without increasing the circuit area.

• Clinical and Experimental Pediatrics
• /
• 제45권4호
• /
• pp.524-528
• /
• 2002

Citrullinemia is a rare inborn error of metabolism of the urea cycle, and was first reported by McMurray, et al. in 1962. It is inherited as an autosomal recessive trait. The normal synthesis of argininosuccinic acid is blocked in this disease due to a deficiency of argininosuccinic acid synthetase(AS), which has been demonstrated in liver cells and fibroblasts. The clinical symptoms are vomiting, lethargy or irritability, convulsion and mental retardation. The diagnosis is made by the finding of an increased plasma citrulline level. Every effort should be made to reduce the blood ammonia level as rapidly as possible before irreversible brain damage occurs. This report describes a case of citrullinemia that was diagnosed through organic acid analysis and amino acid analysis, and reviews the related literatures.

• Journal of Korea Multimedia Society
• /
• 제17권3호
• /
• pp.342-352
• /
• 2014

This paper proposes an automatic segmentation method of cortical bone and trabecular bone and describes an implementation of structural analysis method of trabecular bone in micro-CT images. The proposed segmentation method extract bone region with binarization using a threshold value. Next, it finds adjacent contour lines from outer boundary line into inward direction and sets candidate regions of cortical bone. Next it remove cortical bone region by finding the candidate cortical region of which the average pixel value is maximum. We implemented the method which computes four structural indicators BV/TV, Tb.Th, Tb.Sp, Tb.N by using VTK(Visualization ToolKit) and sphere fitting algorithm. We applied the implemented method to twenty proximal femur of mouses and compared with the manual segmentation method. Experimental result shows that the average error rates between the proposed segmentation method and the manual segmentation method are less than 3% for the four structural indicatiors. This result means that the proposed method can be used instead of the combersome and time consuming manual segmentation method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• 제18권3호
• /
• pp.718-723
• /
• 2017

When structural analysis modelling methods of practical fields are investigated, a slab is generally modeled by a finite element mesh using plate elements and a shear wall is modeled using a shell element or wall element for 3-D structural analysis. The point worthy of notice in this practice is that a shear wall is modelled using only one wall or shell element divided by floors and column lines to produce structural models. The modeling method like this can cause analysis errors according to the type of computer programs in use, and these errors reduce the reliability of the analysis results. Therefore, to secure the reliability of structural analysis, studies of the causes of errors and finding reasonable modeling methods are necessary. In this study, the causes of analysis errors according to the modelling methods of a shear wall, which are used in practical fields, were investigated and some considering matters for modelling a shear wall are presented to reduce the analysis errors on these analysis results.

• International Journal of Aeronautical and Space Sciences
• /
• 제10권2호
• /
• pp.117-124
• /
• 2009

In the environment where various and complicated threat signals exist, RWR (Radar Warning Receiver), which can warn pilot of the existence of threats, has long been a necessary electronic warfare (EW) system to improve survivability of aircraft. The angle of arrival (AOA) information, the most reliable sorting parameter in the RWR, is measured by means of four-quadrant amplitude comparison direction finding (DF) technique. Each of four antennas (usually spiral antenna) of DF unit covers one of four quadrant zones, with 90 degrees apart with nearby antenna. According to the location of antenna installed in helicopter, RWR is subject to signal loss and interference by helicopter body and structures including tail bumper, rotor blade, and so on, causing a difficulty of detecting hostile emitters. In this paper, the performance degradation caused by signal interference by tail rotor blades has been estimated by measuring amplitude video signals into which RWR converts RF signals in case a part of antenna is screened by real tail rotor blade in anechoic chamber. The results show that corruption of pulse amplitude (PA) is main cause of DF error. We have proposed two algorithms for resolving the interference by tail rotor blades as below: First, expand the AOA group range for pulse grouping at the first signal analysis phase. Second, merge each of pulse trains with the other, that signal parameter except PRI and AOA is similar, after the first signal analysis phase. The presented method makes it possible to use RWR by reducing interference caused by blade screening in case antenna is screened by tail rotor blades.

• Journal of the Korean Society of Hazard Mitigation
• /
• 제10권1호
• /
• pp.43-48
• /
• 2010

Proctor test A or D method of compaction is the most common laboratory test for investigation of subgrade soil characteristics, however, compression type using roller is used in the field. The differences between laboratory and field compaction have considerable error as application to subgrade soil properties of laboratory test. The investigation of compacted soil is carried into effect to solve the problem. The gyratory compactor which is made to reproduce the field density of asphalt mixture, coming from traffic loads, has an advance to compact it similar to arrangement of field aggregate particles. This gyratory compactor has several problems of investigation of compacted soil, because it has designed to make initial asphalt specimens. The main objectives of this research are grasping problems when compacted soil test using the gyratory compactor and showing solutions. It has made a comparative study of difference of the percentage of water content and weight, which are before and after compaction, about the pressure of compaction, frequency of compaction and speed of compaction. And it also has investigated finding maximum percentage of water content which not occur change of percentage of water content after compaction and searching how has an effect on drawing compaction curve.

• The Journal of the Acoustical Society of Korea
• /
• 제21권3호
• /
• pp.274-284
• /
• 2002

Word segmentation errors occurring in text preprocessing often insert incorrect words into recognition vocabulary and cause poor language models for Korean large vocabulary continuous speech recognition. We propose an automatic word segmentation algorithm using Markov chains and syllable-based n-gram language models in order to correct word segmentation error in teat corpora. We assume that a sentence is generated from a Markov chain. Spaces and non-space characters are generated on self-transitions and other transitions of the Markov chain, respectively Then word segmentation of the sentence is obtained by finding the maximum likelihood path using syllable n-gram scores. In experimental results, the algorithm showed 91.58% word accuracy and 96.69% syllable accuracy for word segmentation of 254 sentence newspaper columns without any spaces. The algorithm improved the word accuracy from 91.00% to 96.27% for word segmentation correction at line breaks and yielded the decomposition accuracy of 96.22% for compound-noun decomposition.