• Title/Summary/Keyword: Morphology algorithm

Search Result 233, Processing Time 0.039 seconds

Parallelization of Cell Contour Line Extraction Algorithm (세포 외곽선 추출 알고리즘의 병렬화)

  • Lee, Ho Seok;Yu, Suk Hyun;Kwon, Hee Yong
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.10
    • /
    • pp.1180-1188
    • /
    • 2015
  • In this paper, a parallel cell contour line extraction algorithm using CUDA, which has no inner contour lines, is proposed. The contour of a cell is very important in a cell image analysis. It could be obtained by a conventional serial contour tracing algorithm or parallel morphology operation. However, the cell image has various damages in acquisition or dyeing process. They could be turn into several inner contours, which make a cell image analysis difficult. The proposed algorithm introduces a min-max coordinates table into each CUDA thread block, and removes the inner contour in parallel. It is 4.1 to 7.6 times faster than a conventional serial contour tracing algorithm.

A Study on Determination of Frontal QRS Electrical Axis by Minnesota Coding Method (MINNESOTA CODE 분류방식에 의한 전면 QRS 전기축 판정에 관한 연구)

  • Park, Dong-Chan;Lee, Myoung-Ho
    • Proceedings of the KIEE Conference
    • /
    • 1989.11a
    • /
    • pp.421-425
    • /
    • 1989
  • This paper present a algorithm for determination of the frontal QRS axis. Determination of electrical QRS axis helps In the differential diagnosis of wide QRS tachycardia and of hemiblock and In the localization of an accessory pathway. At first detecting R-point data and S-point data and two data is sumed and this data is determind such as positive or negative. Reference data is calculated by 9-point derivertives that is less affected by noise. Secondly, using data of lead2 calculate a morphology, this value is threshold for executing determination algorithm. This process is main body of this algorithm. As this algorithm have a six pattern of the axis that coded by minnesota ending method, the axis is determined more precisely than any other algorithm using 3 leads and affirm a relation of a axis and hemiblock and tachycardia.

  • PDF

Application of Image Processing Technique to Improve Production Efficiency of Fine Pitch Hole Based on Laser (레이저 미세피치 홀 가공의 생산효율성 향상을 위한 영상처리 측정 기법 적용)

  • Pyo, C.R.
    • Transactions of Materials Processing
    • /
    • v.19 no.5
    • /
    • pp.320-324
    • /
    • 2010
  • Multi-Layer Ceramic Circuit(MLCC) in the face of thousands of fine pitch multi hole is processed. However, the fine pitch multi hole has a size of only a few micrometers. Therefore, in order to curtail the measurement time and reduce error, the image processing measurement method is required. So, we proposed an image processing measurement algorithm which is required to accurately measure the fine pitch multi hole. The proposed algorithm gets image of the fine pitch multi hole, extracts object from the image by morphological process, and extracts the parameters of its position and feature by edge detecting process. In addition, we have used the sub-pixel algorithm to improve accuracy. As a result, the proposed algorithm shows 97% test-retest measurement reliability within 2 ${\mu}m$. We found that the algorithm was wellsuited for measuring the fine pitch multi hole.

An Eedge-Based Adaptive Morphology Algorithm for Image Nosie Reduction (에지 정보를 이용한 잡음 제겅용 적응적 수리 형태론 알고리즘)

  • 김상희;문영식
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.3
    • /
    • pp.84-96
    • /
    • 1997
  • In this paper an efficient morphologica algorithm for reducing gaussian and impulse noise in gray-scale image is presented. Based on the edge information the input image is partitioned into a flat region and an edge region, then different algorithms are selectively applied to each region. in case of impulse noise, MGR (morphologica grayscale reconstruction) algorithm with directional SE (structuring element) is applied to the flat region. For theedge region opening-closing (closing-opening) is used instead of dialation (erosion), so that the remaining noise around large objects can be removed. In case of gaussian noise, 5*5 OCCO(opening closing closing opening) and 3*3 DMF(directional morphological filter ) are used for the flat region and the edgeregion, respectively. In order to remove discontinuity at the edge boundary, the algorithm uses 3*3 OCCO around the edge region to reconstruct the final image. Experimetnal results have shown that the proposed algorithm achieves a high performance in terms of noise removal, detail preservation, and NMSE.

  • PDF

Enhanced technique for Arabic handwriting recognition using deep belief network and a morphological algorithm for solving ligature segmentation

  • Essa, Nada;El-Daydamony, Eman;Mohamed, Ahmed Atwan
    • ETRI Journal
    • /
    • v.40 no.6
    • /
    • pp.774-787
    • /
    • 2018
  • Arabic handwriting segmentation and recognition is an area of research that has not yet been fully understood. Dealing with Arabic ligature segmentation, where the Arabic characters are connected and unconstrained naturally, is one of the fundamental problems when dealing with the Arabic script. Arabic character-recognition techniques consider ligatures as new classes in addition to the classes of the Arabic characters. This paper introduces an enhanced technique for Arabic handwriting recognition using the deep belief network (DBN) and a new morphological algorithm for ligature segmentation. There are two main stages for the implementation of this technique. The first stage involves an enhanced technique of the Sari segmentation algorithm, where a new ligature segmentation algorithm is developed. The second stage involves the Arabic character recognition using DBNs and support vector machines (SVMs). The two stages are tested on the IFN/ENIT and HACDB databases, and the results obtained proved the effectiveness of the proposed algorithm compared with other existing systems.

Concept Optimization for Mechanical Product Using Genetic Algorithm

  • Huang Hong Zhong;Bo Rui Feng;Fan Xiang Feng
    • Journal of Mechanical Science and Technology
    • /
    • v.19 no.5
    • /
    • pp.1072-1079
    • /
    • 2005
  • Conceptual design is the first step in the overall process of product design. Its intrinsic uncertainty, imprecision, and lack of information lead to the fact that current conceptual design activities in engineering have not been computerized and very few CAD systems are available to support conceptual design. In most of the current intelligent design systems, approach of principle synthesis, such as morphology matrix, bond graphic, or design catalogues, is usually adopted to deal with the concept generation, in which optional concepts are generally combined and enumerated through function analysis. However, as a large number of concepts are generated, it is difficult to evaluate and optimize these design candidates using regular algorithm. It is necessary to develop a new approach or a tool to solve the concept generation. Generally speaking, concept generation is a problem of concept synthesis. In substance, this process of developing design candidate is a combinatorial optimization process, viz., the process of concept generation can be regarded as a solution for a state-place composed of multi-concepts. In this paper, genetic algorithm is utilized as a feasible tool to solve the problem of combinatorial optimization in concept generation, in which the encoding method of morphology matrix based on function analysis is applied, and a sequence of optimal concepts are generated through the search and iterative process which is controlled by genetic operators, including selection, crossover, mutation, and reproduction in GA. Several crucial problems on GA are discussed in this paper, such as the calculation of fitness value and the criteria for heredity termination, which have a heavy effect on selection of better concepts. The feasibility and intellectualization of the proposed approach are demonstrated with an engineering case. In this work concept generation is implemented using GA, which can facilitate not only generating several better concepts, but also selecting the best concept. Thus optimal concepts can be conveniently developed and design efficiency can be greatly improved.

Development and Implementation of Noise-Canceling Technology for Digital Stethoscope (디지털 청진기를 위한 잡음 제거 기술 개발 및 구현)

  • Lee, Keunsang;Ji, Youna;Jeon, Youngtaek;Park, Young Chool
    • Journal of Biomedical Engineering Research
    • /
    • v.34 no.4
    • /
    • pp.204-211
    • /
    • 2013
  • In this paper, an algorithm for suppressing acoustic noises contained in stethoscope sound is proposed and implemented in real-time using an embedded DSP system. Sound collected by stethoscope is down-sampled and band-pass filtered, and later an NLMS adaptive filter is used to cancel the acoustic noise induced from external noise sources. Also, the unpredictable impulsive noises due to fabric friction and instantaneous tapping are detected using the SD-ROM algorithm, and suppressed using an algorithm approximating the morphology filter. The proposed algorithm was tested using signals collected with a digital stethoscope mockup, and implemented on an ARM920T-based DSP system.

An ECG baseline wandering elimination algorithm by using slope tracing waves (기울기 추적파를 이용한 ECG의 기저선 변동 제거 알고리즘)

  • Kim, Min-Kyu;Choi, Tea-Jong;Lee, Ki-Young;Kim, Jung-Kuk;Huh, Woong
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.32-34
    • /
    • 2005
  • This paper describes a new baseline wandering elimination algorithm for ECG based on waveform morphology analysis. The algorithm uses two slope tracing waves to separate the baseline wandering from ECG and approximates the separated baseline wandering to a corresponding sinusoid, and finally, subtracts the approximated sinusoid from the original ECG. The two slope tracing waves, the descending slope tracing wave and the ascending slope tracing wave, were developed for efficient determination of slope inverting points and sudden slope changing points. The algorithm has been applied to MIT/BIH database to verify its efficacy and validity in practical applications.

  • PDF

A hierarchical semantic video object racking algorithm using mathematical morphology

  • Jaeyoung-Yi;Park, Hyun-Sang;Ra, Jong-Beom
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1998.06b
    • /
    • pp.29-33
    • /
    • 1998
  • In this paper, we propose a hierarchical segmentation method for tracking a semantic video object using a watershed algorithm based on morphological filtering. In the proposed method, each hierarchy consists of three steps: First, markers are extracted on the simplified current frame. Second, region growing by a modified watershed algorithm is performed for segmentation. Finally, the segmented regions are classified into 3 categories, i.e., inside, outside, and uncertain regions according to region probability values, which are acquired by the probability map calculated from a estimated motion field. Then, for the remaining uncertain regions, the above three steps are repeated at lower hierarchies with less simplified frames until every region is decided to a certain region. The proposed algorithm provides prospective results in video sequences such as Miss America, Clair, and Akiyo.

  • PDF