• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.3
• /
• pp.341-346
• /
• 2012

In rehabilitation where ultrasonographic diagnosis is not popular, it could be subjective by medical expert's experience. Thus, it is necessary to develop an objective automative procedure in ultrasonic image analysis. A disadvantage of existing automative analytic procedure in musculoskeletal system is to designate an incorrect muscle area when the figure of fascia is vague. In this study, we propose a new procedure to extract more accurate muscle area in abdomen ultrasonic image for that purpose. After removing unnecessary noise from input image, we apply End-in Search algorithm to enhance the contrast between fascia and muscle area. Then after extracting initial muscle area by Up-Down search, we trace the fascia area with a mask based on morphological and directional information. By this tracing of mask movements, we can emphasize the fascia area to extract more accurate muscle area in result. This new procedure is proven to be more effective than existing methods in experiment using convex ultrasound images that are used in real world rehabilitation diagnosis.

• Journal of KIISE:Software and Applications
• /
• v.37 no.3
• /
• pp.214-221
• /
• 2010

The search-results clustering problem is defined as the automatic and on-line grouping of similar documents in search results returned from a search engine. In this paper, we propose a new search-results clustering algorithm specialized for a paper search service. Our system consists of two algorithmic phases: Category Hierarchy Generation System (CHGS) and Paper Clustering System (PCS). In CHGS, we first build up the category hierarchy, called the Field Thesaurus, for each research field using an existing research category hierarchy (KOSEF's research category hierarchy) and the keyword expansion of the field thesaurus by a word clustering method using the K-means algorithm. Then, in PCS, the proposed algorithm determines the category of each paper using top-down and bottom-up methods. The proposed system can be used in the application areas for retrieval services in a specialized field such as a paper search service.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.01a
• /
• pp.73-75
• /
• 2012

본 논문에서는 복부 초음파 영상에서 근육 영역의 명암 대비를 강조하기 위해서 Multiple 연산을 적용한 후, 명암 대비가 강조된 영상에서 수직 방향의 명암도가 200 이상인 픽셀들에 대해 퍼지 기법에 적용하여 이진화한다. 이진화된 영상에서 피부층과 외복사근 사이에 존재하는 피하지방을 추출하기 위해 Thick-Search 방법을 적용하여 피부층과 외복사근을 추출한 후, 피부층과 외복사근의 사이에 Up-Down Search 방법을 적용하여 피하지방층을 추출한다. 피하지방층이 추출된 영상에서 근막의 형태학적 정보를 이용하여 근막을 추출한다. 추출된 근막 사이에 대해 Up-Down Search 방법을 적용하여 근육의 후보 영역을 추출한 후, 근육의 형태학적 정보를 이용하여 최종적인 근육 층을 추출한다. 추출된 근육의 경계선을 Monotone Cubic Hermite 보간법을 이용하여 근육의 경계선을 보정한 후, 최소자승법을 이용하여 근육의 두께를 측정한다. 제안된 방법을 복부 초음파 영상에 적용하여 근막 및 근육 영역을 추출한 결과, 기존의 근육 추출 방법보다 정확하게 추출되었고, 근육의 두께 측정 결과도 전문의가 육안으로 측정한 결과와 근사한 것을 확인할 수 있었다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.353-358
• /
• 2008

The ocean has settled down in human mind as a territory and a leisure space from which anyone enjoys and takes a benefit under the national sovereignty, as the new era of Sea comes. In addition, because the population engaged in marine activities has rapidly increased, the number of marine accidents consequently has grown up as well. In this reason, currently it has been highlighted to devise safety measures to prevent large scale accidents or disasters on the oceans. Therefore, this thesis firstly points out issues and problems of current search and rescue operations, and secondly studies three primary factors of the search and rescue operations, which are decision of search range, decision of search asset, and decision of search duration. Finally, the thesis suggests a theoretical foundation of the search and rescue operations by applying the result of studies and the marine search theory through a theoretical approach to reasonable standards.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.9-15
• /
• 2011

In this paper, we propose a method to extract the external oblique muscle of abdomen images that is often excluded by previous method due to image distortion. In the preprocessing phase of the proposed method, we emphasize the brightness contrast with Ends-in search stretching algorithm after removing noise from the initial ultrasonic images. Then we apply average binarization in vertical direction to extract candidate fascia areas. After removing other areas than fascia with morphological characteristics, the lost part in the fascia during the process is restored with such characteristic information and location information. Then the skin area is also removed with information from the arc appearing in convex filming and the candidate muscle areas are extracted by overlapping two results two way up-down search algorithm. Another noise removing process is done to determine the muscle area. In case of obtaining obscure result, after restoring the muscle area by smearing method, the thickness of the muscle is measured by min square method. The experiment verifies that the proposed method is sufficiently effective to analyze the size and shape of muscles in abdomen in ultrasonography than previously used methods.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.403-404
• /
• 2008

In this paper, a new 4-way search window is developed for H.264 Motion Estimation(ME) to improve the memory bandwidth. The proposed 4-way(up, down, left, right) search window could improve the reuse of overlapped window data to reduce the redundancy access factor by 1.4, though the 1/3-way search window requires $7.7{\sim}11$ times of data retrieval redundantly. In experiments, the new implementation of 4-way search window on Altera Stratix-III could deal with CIF ($352{\times}288$) video of 3 reference frame, $48{\times}48$ search area and $16{\times}16$ macroblock by 30fps real time at 55.2MHz.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.12
• /
• pp.61-70
• /
• 2005

In this paper, we propose an efficient global placement algorithm which is an enhanced version of Hybrid Placer$^{[25]}$, a standard cell placement tool, which uses a middle-down approach. Combining techniques used in the well-known partitioner hMETIS and the RBLS(Relaxation Based Local Search) in Hybrid Placer improves the quality of global placements. Partitioning techniques of hMETIS is applied in a top-down manner and RBLS is used in each level of the top-down hierarchy to improve the global placement. The proposed new approach resolves the problem that Hybrid Placer seriously depends on initial placements and it speeds up without deteriorating the placement quality. Experimental results prove that solutions generated by the proposed method on the MCNC benchmarks are comparable to those by FengShui which is a well known placement tool. Compared to the results of the original Hybrid Placer, new method is 5 times faster on average and shows improvement on bigger circuits.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.405-406
• /
• 2008

This paper presents a high performance 2D PE architecture for H.264 Motion Estimation(ME). While existing 2D PE architectures reuse the overlapped data of adjacent search windows scanned in 1 or 3-way, the new architecture scan adjacent windows and multiple paths instead of single raster and zigzag scanning of adjacent windows in 4 way(up,down,left,right). By reducing the redundant access factor by 1.4, the new 4-way search window improve the memory bandwidth by 70-58% compared with 1/3-way search window. With Altera Stratix-III implementation, the high performance 2D PE architecture deals with SD ($720{\times}480$) video of 2 reference frame, $48{\times}48$ search area and $16{\times}16$ macroblock by 30fps at 97.1MHz.

• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.174-176
• /
• 1997

This paper proposes a unit commitment scheduling method based on hybrid genetic algorithm(GA). When the systems are scaled up, conventional genetic algorithms suffer from computational time limitations because of the growth of the search space. So greatly reduce the search space of the GA and to efficiently deal with the constraints of the problem, priority list unit ordering scheme are incorporated as the initial solution and the minimum up and down time constraints of the units are included. The violations of other constraints are handled by integrating penalty factors. To show the effectiveness of the proposed method. test results for system of 10 units is compared with results obtained using other methods.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.131-135
• /
• 2008

In this paper, we deal with a hierarchical location-allocation problem in designing the broadband convergence networks (BcN). The objective is to minimize the total cost of switch and cable while satisfying the quality of service (QoS). We formulate the problem as an integer programming model and develop the Tabu Search (TS) heuristic algorithm to find a good feasible solution within a reasonable time limit. Initial solution is obtained by using the tree structure. Three neighborhood generation mechanisms are used by local search heuristic: insertion, switch up, and switch down. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. We present promising computational results of the proposed solution procedures.