• Title/Summary/Keyword: Morphological operations

Search Result 108, Processing Time 0.059 seconds

A Real-time Motion Object Detection based on Neighbor Foreground Pixel Propagation Algorithm (주변 전경 픽셀 전파 알고리즘 기반 실시간 이동 객체 검출)

  • Nguyen, Thanh Binh;Chung, Sun-Tae
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.1
    • /
    • pp.9-16
    • /
    • 2010
  • Moving object detection is to detect foreground object different from background scene in a new incoming image frame and is an essential ingredient process in some image processing applications such as intelligent visual surveillance, HCI, object-based video compression and etc. Most of previous object detection algorithms are still computationally heavy so that it is difficult to develop real-time multi-channel moving object detection in a workstation or even one-channel real-time moving object detection in an embedded system using them. Foreground mask correction necessary for a more precise object detection is usually accomplished using morphological operations like opening and closing. Morphological operations are not computationally cheap and moreover, they are difficult to be rendered to run simultaneously with the subsequent connected component labeling routine since they need quite different type of processing from what the connected component labeling does. In this paper, we first devise a fast and precise foreground mask correction algorithm, "Neighbor Foreground Pixel Propagation (NFPP)" which utilizes neighbor pixel checking employed in the connected component labeling. Next, we propose a novel moving object detection method based on the devised foreground mask correction algorithm, NFPP where the connected component labeling routine can be executed simultaneously with the foreground mask correction. Through experiments, it is verified that the proposed moving object detection method shows more precise object detection and more than 4 times faster processing speed for a image frame and videos in the given the experiments than the previous moving object detection method using morphological operations.

Improving the Quality of Filtered Lidar Data by Local Operations

  • Seo, Su-Young
    • Korean Journal of Remote Sensing
    • /
    • v.23 no.3
    • /
    • pp.189-198
    • /
    • 2007
  • Introduction of lidar technology have contributed to a wide range of applications in generating quality surface models. Accordingly, because of the importance of terrain surface models in mapping applications, rigorous studies have been performed to extract ground points from a lidar data point cloud. Although most filters have been shown abilities to extract ground points with their parameters tuned, however, most experiments revealed that there are certain limitations in optimizing filter parameters and the correction of remaining misclassified points is not straightforward. In this study, therefore, a method to improve the quality of filtered lidar data is proposed, which exploits neighboring surface properties arising between immediate neighbors. The method comprises a sequence of procedures which can reduce commission and omission errors. Commission errors occurring in low-rise objects are reduced by utilizing morphological operations. On the other hand, omission errors are reduced by adding missing ground points around step edges. Experimental results show that the qualities of filtered data can be improved considerably by the proposed method.

Facial Region Tracking in YCbCr Color Coordinates (YCbCr 컬러 영상 변환을 통한 얼굴 영역 자동 검출)

  • Han, M.H.;Kim, K.S.;Yoon, T.H.;Shin, S.W.;Kim, I.Y.
    • Proceedings of the KIEE Conference
    • /
    • 2005.05a
    • /
    • pp.63-65
    • /
    • 2005
  • In this study, the automatic face tracking algorithm is proposed by using the color and edge information of a color image. To reduce the effects of variations in the illumination conditions, an acquired CCD color image is first transformed into YCbCr color coordinates, and subsequently the morphological image processing operations, and the elliptical geometric measures are applied to extract the refined facial area.

  • PDF

An Efficient Method for Korean Noun Extraction Using Noun Patterns (명사 출현 특성을 이용한 효율적인 한국어 명사 추출 방법)

  • 이도길;이상주;임해창
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.1_2
    • /
    • pp.173-183
    • /
    • 2003
  • Morphological analysis is the most widely used method for extracting nouns from Korean texts. For every Eojeol, in order to extract nouns from it, a morphological analyzer performs frequent dictionary lookup and applies many morphonological rules, therefore it requires many operations. Moreover, a morphological analyzer generates all the possible morphological interpretations (sequences of morphemes) of a given Eojeol, which may by unnecessary from the noun extraction`s point of view. To reduce unnecessary computation of morphological analysis from the noun extraction`s point of view, this paper proposes a method for Korean noun extraction considering noun occurrence characteristics. Noun patterns denote conditions on which nouns are included in an Eojeol or not, which are positive cues or negative cues, respectively. When using the exclusive information as the negative cues, it is possible to reduce the search space of morphological analysis by ignoring Eojeols not including nouns. Post-noun syllable sequences(PNSS) as the positive cues can simply extract nouns by checking the part of the Eojeol preceding the PNSS and can guess unknown nouns. In addition, morphonological information is used instead of many morphonological rules in order to recover the lexical form from its altered surface form. Experimental results show that the proposed method can speed up without losing accuracy compared with other systems based on morphological analysis.

(Automatic detection of pulmonary nodules in X-ray chest images) (흉부 X선 영상에서의 폐 노쥴 자동 탐지 기법)

  • Sung, Won;Kim, Eui-Jung;Park, Jong-Won
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.9
    • /
    • pp.1279-1286
    • /
    • 2002
  • Generally, radiologists can fail to detect pulmonary nodules in up to 30%. If an automatic system can inform the radiologists of thelocations of the doubtful nodules in the X-ray chest images, the frequency of mistakenly observed numbers of the nodules can be potentially reduced. This software is using morphological filtering and two feature-extraction techniques. The morphological filtering is the first process, which subsequently adds the operations of erosion and dilation to the original images so that this process can transform the original X-ray chest images into manageable ones. The false-positives are frequently being mistaken as nodules but actually these are not real nodules. The second process is the two feature-extraction techniques which are used to reduce the false-positives. Therefore, this system will make more effective detection of pulmonary nodules by reducing the false-positives when applied to the X-ray chest images which is difficult to get accurate detection.

  • PDF

Directional Feature Extraction of Handwritten Numerals using Local min/max Operations (Local min/max 연산을 이용한 필기체 숫자의 방향특징 추출)

  • Jung, Soon-Won;Park, Joong-Jo
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.10 no.1
    • /
    • pp.7-12
    • /
    • 2009
  • In this paper, we propose a directional feature extraction method for off-line handwritten numerals by using the morphological operations. Direction features are obtained from four directional line images, each of which contains horizontal, vertical, right-diagonal and left-diagonal lines in entire numeral lines. Conventional method for extracting directional features uses Kirsch masks which generate edge-shaped double line images for each direction, whereas our method uses directional erosion operations and generate single line images for each direction. To apply these directional erosion operations to the numeral image, preprocessing steps such as thinning and dilation are required, but resultant directional lines are more similar to numeral lines themselves. Our four [$4{\times}4$] directional features of a numeral are obtained from four directional line images through a zoning method. For obtaining the higher recognition rates of the handwrittern numerals, we use the multiple feature which is comprised of our proposed feature and the conventional features of a kirsch directional feature and a concavity feature. For recognition test with given features, we use a multi-layer perceptron neural network classifier which is trained with the back propagation algorithm. Through the experiments with the CENPARMI numeral database of Concordia University, we have achieved a recognition rate of 98.35%.

  • PDF

VLSI Architecture Design of Reconstruction Filter for Morphological Image Segmentation (형태학적 영상 분할을 위한 재구성 필터의 VLSI 구조 설계)

  • Lee, Sang-Yeol;Chung, Eui-Yoon;Lee, Ho-Young;Kim, Hee-Soo;Ha, Yeong-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.12
    • /
    • pp.41-50
    • /
    • 1999
  • In this paper, the new VLSI architecture of a reconstruction filter for morphological image segmentation is proposed. The filter, based on the $h_{max}$ operation, simplifies the interior of each region while preserving the boundary information. The proposed architecture adopts a partitioned memory structure and an efficient image scanning strategy to reduce the operations. The proposed memory partitioning scheme makes it possible that every data required for processing can be read from each memory at a time, resulting in parallel data processing. By the extended connectivity consideration, the operation is much decreased because more simplification is achieved in scanning stage. The selective raster scan strategy endows the satisfactory noise removal capability with negligible hardware complexity increase. The proposed architecture is designed using VHDL, and functional evaluation is performed by the CAD tool, Mentor. The experiment results show that the proposed architecture can simplify image profile with less than 18% operations of the conventional method.

  • PDF

A Stroke-Based Text Extraction Algorithm for Digital Videos (디지털 비디오를 위한 획기반 자막 추출 알고리즘)

  • Jeong, Jong-Myeon;Cha, Ji-Hun;Kim, Kyu-Heon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.3
    • /
    • pp.297-303
    • /
    • 2007
  • In this paper, the stroke-based text extraction algorithm for digital video is proposed. The proposed algorithm consists of four stages such as text detection, text localization, text segmentation and geometric verification. The text detection stage ascertains that a given frame in a video sequence contains text. This procedure is accomplished by morphological operations for the pixels with higher possibility of being stroke-based text, which is called as seed points. For the text localization stage, morphological operations for the edges including seed points ate adopted followed by horizontal and vortical projections. Text segmentation stage is to classify projected areas into text and background regions according to their intensity distribution. Finally, in the geometric verification stage, the segmented area are verified by using prior knowledge of video text characteristics.

Automatic Lung Segmentation using Hybrid Approach (하이브리드 접근 기법을 사용한 자동 폐 분할)

  • Yim, Yeny;Hong, Helen;Shin, Yeong-Gil
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.7
    • /
    • pp.625-635
    • /
    • 2005
  • In this paper, we propose a hybrid approach for segmenting the lungs efficiently and automatically in chest CT images. The proposed method consists of the following three steps. first, lungs and airways are extracted by two- and three-dimensional automatic seeded region growing and connected component labeling in low-resolution. Second, trachea and large airways are delineated from the lungs by two-dimensional morphological operations, and the left and right lungs are identified by connected component labeling in low-resolution. Third, smooth and accurate lung region borders are obtained by refinement based on image subtraction. In experiments, we evaluate our method in aspects of accuracy and efficiency using 10 chest CT images obtained from 5 patients. To evaluate the accuracy, we Present results comparing our automatic method to manually traced borders from radiologists. Experimental results show that proposed method which use connected component labeling in low-resolution reduce processing time by 31.4 seconds and maximum memory usage by 196.75 MB on average. Our method extracts lung surfaces efficiently and automatically without additional processing like hole-filling.

Automated Segmentation of the Lateral Ventricle Based on Graph Cuts Algorithm and Morphological Operations

  • Park, Seongbeom;Yoon, Uicheul
    • Journal of Biomedical Engineering Research
    • /
    • v.38 no.2
    • /
    • pp.82-88
    • /
    • 2017
  • Enlargement of the lateral ventricles have been identified as a surrogate marker of neurological disorders. Quantitative measure of the lateral ventricle from MRI would enable earlier and more accurate clinical diagnosis in monitoring disease progression. Even though it requires an automated or semi-automated segmentation method for objective quantification, it is difficult to define lateral ventricles due to insufficient contrast and brightness of structural imaging. In this study, we proposed a fully automated lateral ventricle segmentation method based on a graph cuts algorithm combined with atlas-based segmentation and connected component labeling. Initially, initial seeds for graph cuts were defined by atlas-based segmentation (ATS). They were adjusted by partial volume images in order to provide accurate a priori information on graph cuts. A graph cuts algorithm is to finds a global minimum of energy with minimum cut/maximum flow algorithm function on graph. In addition, connected component labeling used to remove false ventricle regions. The proposed method was validated with the well-known tools using the dice similarity index, recall and precision values. The proposed method was significantly higher dice similarity index ($0.860{\pm}0.036$, p < 0.001) and recall ($0.833{\pm}0.037$, p < 0.001) compared with other tools. Therefore, the proposed method yielded a robust and reliable segmentation result.