• Journal of Biomedical Engineering Research
• /
• v.8 no.2
• /
• pp.177-188
• /
• 1987

Detection of left ventricular boundary for the functional analysis of LV(left ventricle) is obtained using automatic boundary detection algorithm based on dynamic program ming method. This scheme reduces the edge searching time and ensures connective edge detection, since it does not require general edge operator, edge thresholding and linking process of other edge detection methods. The left ventricular diastolic volume and systolic volume were computed after this automatic boundary detection, and these volume data were applied to analyze LV ejection fraction.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.570-574
• /
• 1990

Detection of left ventricular boundary for the functional analysis of LV(left ventricle)is obtained using automatic boundary detection algorithm based on dynamic programming method. This scheme reduces the edge searching time and ensures connective edge detection, since it does not require general edge operator, edge thresholding and linking process of other edge. detection methods. The left ventricular diastolic volume and systolic volume and systolic volume were computed after this automatic boundary detection, and these Volume data wm applied to analyze LV ejection fraction.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.3
• /
• pp.63-69
• /
• 2002

Detailed routing is a problem assigning each net to a track after global routing. The most popular algorithms for detailed routing include left-edge algorithm, dogleg algorithm, and greedy channel routing algorithm. In this paper we propose a genetic algorithm searching solution space for the detailed routing problem. We compare the performance of proposed genetic algorithm(GA) for detailed routing with that of greedy channel routing algorithm by analyzing the results of each implementation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.323-326
• /
• 2007

When traveling on real road network, it generally takes less travel time in a near straight path than a zig-zaged path with same source and destination. In order to making a left(right/u) turn, the delay should be required to decrease the speed. The traffic signal waiting time of left(right/u) turn is probably longer than straight driving. In this paper, we revise the previous hierarchical path finding algorithm to reduce the number of turns. The algorithm proposed in this paper complied with a hierarchical $A^*$ algorithm, but has a distinct strategy for edge weight. We define an edge that makes a turn as a turn-edge and give the turn-edge lower weight to maintain the straightness of the whole path.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.2
• /
• pp.141-145
• /
• 2009

A C-to-SystemC synthesizer which processes the input behavior according to high-level synthesis, and then transforms the synthesis result into SystemC module code is implemented in this paper. In the synthesis process, the input behavioral description in C source code is scheduled using list scheduling algorithm and register allocation is performed using left-edge algorithm on the result of scheduling. In the SystemC process, the output from high-level synthesis process is transformed into SystemC module code by combining it with SystemC features such as channels and ports. The operation of the implemented C-to-SystemC synthesizer is validated through simulating the synthesis of elliptic wave filter in SystemC code. C-to-SystemC synthesizer can be used as a part of tool-chain which helps to implement SystemC design methodology covering from modeling to synthesis.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.2
• /
• pp.155-162
• /
• 1989

In this paper, we propose a channel router for non-rectangular channels with variable channel height and via minimization method. Non-rectangular routing areas are splitted into 3 parts, upper, lower and rectangular channel. The upper and lower parts are routed by a modified "left edge algorithm." The rectangular channel is routed by channel routing method using the channel representation graph. After routing, redundant vias are eliminated by the rules composed of 3 groups.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.7
• /
• pp.679-688
• /
• 2008

This paper presents an algorithm capable of detecting leading vehicles using a forward-looking camera. In fact, the accurate measurements of the contact locations of vehicles with road surface are prerequisites for the intelligent vehicle technologies based on a monocular vision. Relying on multistage processing of relevant edge features to the hypothesis generation of a vehicle, the proposed algorithm creates candidate positions being the left and right boundaries of vehicles, and searches for pairs to be vehicle boundaries from the potential positions by evaluating horizontal symmetry. The proposed algorithm is proven to be successful by experiments performed on images acquired by a moving vehicle.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.8
• /
• pp.1867-1873
• /
• 2015

Edge detection is one of image processing techniques applied for a variety of purposes in a number of areas and it is used as a necessary pretreatment process in most applications. In the conventional edge detection methods, there are Sobel, Prewitt, Roberts and LoG, etc using a fixed weights mask. Since conventional edge detection methods apply the images to the fixed weights mask, the edge detection characteristics appear somewhat insufficient. Therefore in this study, an algorithm for detecting the edge is proposed by applying the cross mask based on the center pixel and up, down, left and right mask based on the surrounding pixels of center pixel in order to solve these problems. And in order to assess the performance of proposed algorithm, it was compared with a conventional Sobel, Roberts, Prewitt and LoG edge detection methods.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.579-582
• /
• 1997

The two dimnesional echocardiography is widely used to evaluate regional wall motion abnormaility, because of its abilities to depict left ventricluar wall motion. A new method, color kinesis is a technology or echocardiographic assessment of left ventricular wall motion. In this paper, we proposed a algorithm or color kinesis which is based on acoustic quantification and automatically detects endocardial motion during systole on a frame-by-frame basis. The echocardiograms were obtained in the short-axis views in normal subjects. Automated edge detection and endocardial contour tracing algorithm was applied to each frames, quantitative analysis based on segmentation was performed, and pre-defined color overlays superimposed on the gray scale images. Segmental analysis of color kinesis provided automated, quantitative diagnosis of regional wall motion abnormality.

• Journal of Biomedical Engineering Research
• /
• v.15 no.3
• /
• pp.325-332
• /
• 1994

In this paper, a method is proposed to detect the endocardial contour of the left ventricle using the Hough transform with a weighted model and edge information from the 2D echocardiogram. The implementation of this method is as follows: first, an approximate model detection algorithm was implemented in order to detect the approximate endocardium model and the model center, then we constructed a weighted model with the detected model. Next, we found automatically the cavity center of the left ventricle performing the Hough transform which used the weighted model, and then we detected the endocardial contour using weighted model and edge image.