• Title/Summary/Keyword: image clustering

Search Result 599, Processing Time 0.03 seconds

Farm disease detection procedure by image processing on Smart Farming

  • Cho, Sokpal;Chung, Heechang
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.405-407
    • /
    • 2017
  • The environmental change is affecting the farm products like tomato, and pepper, etc. This affects to lead smart farming yield. What is more, this inconstant conditions cause the farms to be infected by variety diseases. Therefore ICT technology is needed to detect and prevent the crops from being effected by diseases. This article suggests the procedure to help producer for identifying farms disease based on the detected image. This detects the kind of diseases with comparing the trained image data before and after disease emergence. First step monitors an image of farms and resize it. Its features are extracted on parameters such as color, and morphology, etc. The next steps are used for classification to classify the image as infected or non-infected. on the bassis of detection algorithm.

  • PDF

Image segmentation using fuzzy worm searching and adaptive MIN-MAX clustering based on genetic algorithm (유전 알고리즘에 기반한 퍼지 벌레 검색과 자율 적응 최소-최대 군집화를 이용한 영상 영역화)

  • Ha, Seong-Wook;Kang, Dae-Seong;Kim, Dai-Jin
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.109-120
    • /
    • 1998
  • An image segmentation approach based on the fuzzy worm searching and MIN-MAX clustering algorithm is proposed in this paper. This algorithm deals with fuzzy worm value and min-max node at a gross scene level, which investigates the edge information including fuzzy worm action and spatial relationship of the pixels as the parameters of its objective function. But the conventional segmentation methods for edge extraction generally need the mask information for the algebraic model, and take long run times at mask operation, whereas the proposed algorithm has single operation according to active searching of fuzzy worms. In addition, we also propose both genetic fuzzy worm searching and genetic min-max clustering using genetic algorithm to complete clustering and fuzzy searching on grey-histogram of image for the optimum solution, which can automatically determine the size of ranges and has both strong robust and speedy calculation. The simulation results showed that the proposed algorithm adaptively divided the quantized images in histogram region and performed single searching methods, significantly alleviating the increase of the computational load and the memory requirements.

  • PDF

A study on Improvement for distorted images of the Digital X-ray Scanner System based on Fuzzy Correction Algorithm

  • Baek, Jae-Ho;Kim, Kyung-Jung;Park, Mi-Gnon
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.173-176
    • /
    • 2005
  • This paper proposes a fuzzy correction algorithm that can correct the distorted medical image caused by the scanning nonlinear velocity of the Digital X-ray Scanner System (DX-Scanner) using the Multichannel Ionization Chamber (MIC). In the DX-Scanner, the scanned medical image is distorted for reasons of unsuitable integration time at the nonlinear acceleration period of the AC servo motor during the inspection of patients. The proposed algorithm finds the nonlinear motor velocity modeling through fuzzy system by clustering and reconstructs the normal medical image lines by calculating the suitable moving distance with the velocity of the motor using the modeling, acceleration time and integration time. In addition, several image processing is included in the algorithm. This algorithm analyzes exact pixel lines by comparing the distance of the acceleration period with the distance of the uniform velocity period in every integration time and is able to compensate for the velocity of the acceleration period. By applying the proposed algorithm to the test pattern for checking the image resolution, the effectiveness of this algorithm is verified. The corrected image obtained from distorted image is similar to the normal and better image for a doctor's diagnosis.

  • PDF

3D Building Reconstruction and Visualization by Clustering Airborne LiDAR Data and Roof Shape Analysis

  • Lee, Dong-Cheon;Jung, Hyung-Sup;Yom, Jae-Hong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.25 no.6_1
    • /
    • pp.507-516
    • /
    • 2007
  • Segmentation and organization of the LiDAR (Light Detection and Ranging) data of the Earth's surface are difficult tasks because the captured LiDAR data are composed of irregularly distributed point clouds with lack of semantic information. The reason for this difficulty in processing LiDAR data is that the data provide huge amount of the spatial coordinates without topological and/or relational information among the points. This study introduces LiDAR data segmentation technique by utilizing histograms of the LiDAR height image data and analyzing roof shape for 3D reconstruction and visualization of the buildings. One of the advantages in utilizing LiDAR height image data is no registration required because the LiDAR data are geo-referenced and ortho-projected data. In consequence, measurements on the image provide absolute reference coordinates. The LiDAR image allows measurement of the initial building boundaries to estimate locations of the side walls and to form the planar surfaces which represent approximate building footprints. LiDAR points close to each side wall were grouped together then the least-square planar surface fitting with the segmented point clouds was performed to determine precise location of each wall of an building. Finally, roof shape analysis was performed by accumulated slopes along the profiles of the roof top. However, simulated LiDAR data were used for analyzing roof shape because buildings with various shapes of the roof do not exist in the test area. The proposed approach has been tested on the heavily built-up urban residential area. 3D digital vector map produced by digitizing complied aerial photographs was used to evaluate accuracy of the results. Experimental results show efficiency of the proposed methodology for 3D building reconstruction and large scale digital mapping especially for the urban area.

Hierarchical Grouping of Line Segments for Building Model Generation (건물 형태 발생을 위한 3차원 선소의 계층적 군집화)

  • Han, Ji-Ho;Park, Dong-Chul;Woo, Dong-Min;Jeong, Tai-Kyeong;Lee, Yun-Sik;Min, Soo-Young
    • Journal of IKEEE
    • /
    • v.16 no.2
    • /
    • pp.95-101
    • /
    • 2012
  • A novel approach for the reconstruction of 3D building model from aerial image data is proposed in this paper. In this approach, a Centroid Neural Network (CNN) with a metric of line segments is proposed for connecting low-level linear structures. After the straight lines are extracted from an edge image using the CNN, rectangular boundaries are then found by using an edge-based grouping approach. In order to avoid producing unrealistic building models from grouping lined segments, a hierarchical grouping method is proposed in this paper. The proposed hierarchical grouping method is evaluated with a set of aerial image data in the experiment. The results show that the proposed method can be successfully applied for the reconstruction of 3D building model from satellite images.

Cluster-Based Spin Images for Characterizing Diffuse Objects in 3D Range Data

  • Lee, Heezin;Oh, Sangyoon
    • Journal of Sensor Science and Technology
    • /
    • v.23 no.6
    • /
    • pp.377-382
    • /
    • 2014
  • Detecting and segmenting diffuse targets in laser ranging data is a critical problem for tactical reconnaissance. In this study, we propose a new method that facilitates the characterization of diffuse irregularly shaped objects using "spin images," i.e., local 2D histograms of laser returns oriented in 3D space, and a clustering process. The proposed "cluster-based spin imaging" method resolves the problem of using standard spin images for diffuse targets and it eliminates much of the computational complexity that characterizes the production of conventional spin images. The direct processing of pre-segmented laser points, including internal points that penetrate through a diffuse object's topmost surfaces, avoids some of the requirements of the approach used at present for spin image generation, while it also greatly reduces the high computational time overheads incurred by searches to find correlated images. We employed 3D airborne range data over forested terrain to demonstrate the effectiveness of this method in discriminating the different geometric structures of individual tree clusters. Our experiments showed that cluster-based spin images have the potential to separate classes in terms of different ages and portions of tree crowns.

The Pattern Segmentation of 3D Image Information Using FCM (FCM을 이용한 3차원 영상 정보의 패턴 분할)

  • Kim Eun-Seok;Joo Ki-See
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.5
    • /
    • pp.871-876
    • /
    • 2006
  • In this thesis, to accurately measure 3D face information using the spatial encoding patterns, the new algorithm to segment the pattern images from initial face pattern image is proposed. If the obtained images is non-homogeneous texture and ambiguous boundary pattern, the pattern segmentation is very difficult. Furthermore. the non-encoded areas by accumulated error are occurred. In this thesis, the FCM(fuzzy c-means) clustering method is proposed to enhance the robust encoding and segmentation rate under non-homogeneous texture and ambiguous boundary pattern. The initial parameters for experiment such as clustering class number, maximum repetition number, and error tolerance are set with 2, 100, 0.0001 respectively. The proposed pattern segmentation method increased 8-20% segmentation rate with conventional binary segmentation methods.

A Colony Counting Algorithm based on Distance Transformation (거리 변환에 기반한 콜로니 계수 알고리즘)

  • Mun, Hyeok;Lee, Bok Ju;Choi, Young Kyu
    • Journal of the Semiconductor & Display Technology
    • /
    • v.15 no.3
    • /
    • pp.24-29
    • /
    • 2016
  • One of the main applications of digital image processing is the estimation of the number of certain types of objects (cells, seeds, peoples etc.) in an image. Difficulties of these counting problems depends on various factors including shape and size variation, degree of object clustering, contrast between object and background, object texture and its variation, and so on. In this paper, a new automatic colony counting algorithm is proposed. We focused on the two applications: counting the bacteria colonies on the agar plate and estimating the number of seeds from images captured by smartphone camera. To overcome the shape and size variations of the colonies, we adopted the distance transformation and peak detection approach. To estimate the reference size of the colony robustly, we also used k-means clustering algorithm. Experimental results show that our method works well in real world applications.

Texture Comparison with an Orientation Matching Scheme

  • Nguyen, Cao Truong Hai;Kim, Do-Yeon;Park, Hyuk-Ro
    • Journal of Information Processing Systems
    • /
    • v.8 no.3
    • /
    • pp.389-398
    • /
    • 2012
  • Texture is an important visual feature for image analysis. Many approaches have been proposed to model and analyze texture features. Although these approaches significantly contribute to various image-based applications, most of these methods are sensitive to the changes in the scale and orientation of the texture pattern. Because textures vary in scale and orientations frequently, this easily leads to pattern mismatching if the features are compared to each other without considering the scale and/or orientation of textures. This paper suggests an Orientation Matching Scheme (OMS) to ease the problem of mismatching rotated patterns. In OMS, a pair of texture features will be compared to each other at various orientations to identify the best matched direction for comparison. A database including rotated texture images was generated for experiments. A synthetic retrieving experiment was conducted on the generated database to examine the performance of the proposed scheme. We also applied OMS to the similarity computation in a K-means clustering algorithm. The purpose of using K-means is to examine the scheme exhaustively in unpromising conditions, where initialized seeds are randomly selected and algorithms work heuristically. Results from both types of experiments show that the proposed OMS can help improve the performance when dealing with rotated patterns.

Extracting Ganglion in Ultrasound Image using DBSCAN and FCM based 2-layer Clustering (DBSCAN과 FCM 기반 2-Layer 클러스터링을 이용한 초음파 영상에서의 결절종 추출)

  • Park, Tae-eun;Song, Jae-uk;Kim, Kwang-baek
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.186-188
    • /
    • 2021
  • 본 논문에서는 초음파 영상에서 DBSCAN(Density-based spatial clustering of applications with noise)과 FCM 클러스터링 기반 양자화 기법을 적용하여 결절종을 추출하는 방법을 제안한다. 본 논문에서는 초음파 영상 촬영 시 좌우 상단의 지방층 영역과 하단 영역의 명암도가 어두운 영역을 잡음 영역으로 설정한다. 그리고 초음파 영상에 퍼지스트레칭 기법을 적용하여 잡음 영역을 최대한 제거 한 후에 ROI 영역을 추출한다. 추출된 ROI 영역에서 밀도 분포를 분석하기 위하여 히스토그램을 분석한 후에 DBSCAN을 적용하여 초음파 영상에서 결절종 후보에 해당되는 명암도를 추출한다. 추출한 후보 명암도를 대상으로 FCM 클러스터링 기법을 적용한다. FCM을 적용하는 단계에서 결절종의 저에코 혹은 무에코의 특징을 이용하여 클러스터 중심 값이 가장 낮은 클러스터를 양자화 한 후에 라벨링 기법을 적용시켜 결절종의 후보 객체를 추출한다. 제안된 결절종 추출 방법의 성능을 분석하기 위해 전문의가 결절종 영역을 표기한 초음파 영상과 표기되지 않은 초음파 영상 120쌍을 대상으로 DBSCAN, FCM, 그리고 제안된 방법 간의 성능을 비교 분석하였다. 제안된 방법에서는 120개의 초음파 영상에서 106개 결절종 영역이 추출되었고 FCM 기법에서는 80개가 추출되었고 DBSCAN에서는 36개가 추출되었다. 따라서 제안된 방법이 결절종 추출에 효율적인 것을 확인하였다.

  • PDF