• Title/Summary/Keyword: image clustering

Search Result 599, Processing Time 0.024 seconds

Clustering Algorithm Using Hashing in Classification of Multispectral Satellite Images

  • Park, Sung-Hee;Kim, Hwang-Soo;Kim, Young-Sup
    • Korean Journal of Remote Sensing
    • /
    • v.16 no.2
    • /
    • pp.145-156
    • /
    • 2000
  • Clustering is the process of partitioning a data set into meaningful clusters. As the data to process increase, a laster algorithm is required than ever. In this paper, we propose a clustering algorithm to partition a multispectral remotely sensed image data set into several clusters using a hash search algorithm. The processing time of our algorithm is compared with that of clusters algorithm using other speed-up concepts. The experiment results are compared with respect to the number of bands, the number of clusters and the size of data. It is also showed that the processing time of our algorithm is shorter than that of cluster algorithms using other speed-up concepts when the size of data is relatively large.

COUNTING OF FLOWERS BASED ON K-MEANS CLUSTERING AND WATERSHED SEGMENTATION

  • PAN ZHAO;BYEONG-CHUN SHIN
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.27 no.2
    • /
    • pp.146-159
    • /
    • 2023
  • This paper proposes a hybrid algorithm combining K-means clustering and watershed algorithms for flower segmentation and counting. We use the K-means clustering algorithm to obtain the main colors in a complex background according to the cluster centers and then take a color space transformation to extract pixel values for the hue, saturation, and value of flower color. Next, we apply the threshold segmentation technique to segment flowers precisely and obtain the binary image of flowers. Based on this, we take the Euclidean distance transformation to obtain the distance map and apply it to find the local maxima of the connected components. Afterward, the proposed algorithm adaptively determines a minimum distance between each peak and apply it to label connected components using the watershed segmentation with eight-connectivity. On a dataset of 30 images, the test results reveal that the proposed method is more efficient and precise for the counting of overlapped flowers ignoring the degree of overlap, number of overlap, and relatively irregular shape.

No-reference Image Quality Assessment With A Gradient-induced Dictionary

  • Li, Leida;Wu, Dong;Wu, Jinjian;Qian, Jiansheng;Chen, Beijing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.288-307
    • /
    • 2016
  • Image distortions are typically characterized by degradations of structures. Dictionaries learned from natural images can capture the underlying structures in images, which are important for image quality assessment (IQA). This paper presents a general-purpose no-reference image quality metric using a GRadient-Induced Dictionary (GRID). A dictionary is first constructed based on gradients of natural images using K-means clustering. Then image features are extracted using the dictionary based on Euclidean-norm coding and max-pooling. A distortion classification model and several distortion-specific quality regression models are trained using the support vector machine (SVM) by combining image features with distortion types and subjective scores, respectively. To evaluate the quality of a test image, the distortion classification model is used to determine the probabilities that the image belongs to different kinds of distortions, while the regression models are used to predict the corresponding distortion-specific quality scores. Finally, an overall quality score is computed as the probability-weighted distortion-specific quality scores. The proposed metric can evaluate image quality accurately and efficiently using a small dictionary. The performance of the proposed method is verified on public image quality databases. Experimental results demonstrate that the proposed metric can generate quality scores highly consistent with human perception, and it outperforms the state-of-the-arts.

An Object Detection System using Eigen-background and Clustering (Eigen-background와 Clustering을 이용한 객체 검출 시스템)

  • Jeon, Jae-Deok;Lee, Mi-Jeong;Kim, Jong-Ho;Kim, Sang-Kyoon;Kang, Byoung-Doo
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.1
    • /
    • pp.47-57
    • /
    • 2010
  • The object detection is essential for identifying objects, location information, and user context-aware in the image. In this paper, we propose a robust object detection system. The System linearly transforms learning data obtained from the background images to Principal components. It organizes the Eigen-background with the selected Principal components which are able to discriminate between foreground and background. The Fuzzy-C-means (FCM) carries out clustering for images with inputs from the Eigen-background information and classifies them into objects and backgrounds. It used various patterns of backgrounds as learning data in order to implement a system applicable even to the changing environments, Our system was able to effectively detect partial movements of a human body, as well as to discriminate between objects and backgrounds removing noises and shadows without anyone frame image for fixed background.

Image Clustering Using Machine Learning : Study of InceptionV3 with K-means Methods. (머신 러닝을 사용한 이미지 클러스터링: K-means 방법을 사용한 InceptionV3 연구)

  • Nindam, Somsauwt;Lee, Hyo Jong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2021.11a
    • /
    • pp.681-684
    • /
    • 2021
  • In this paper, we study image clustering without labeling using machine learning techniques. We proposed an unsupervised machine learning technique to design an image clustering model that automatically categorizes images into groups. Our experiment focused on inception convolutional neural networks (inception V3) with k-mean methods to cluster images. For this, we collect the public datasets containing Food-K5, Flowers, Handwritten Digit, Cats-dogs, and our dataset Rice Germination, and the owner dataset Palm print. Our experiment can expand into three-part; First, format all the images to un-label and move to whole datasets. Second, load dataset into the inception V3 extraction image features and transferred to the k-mean cluster group hold on six classes. Lastly, evaluate modeling accuracy using the confusion matrix base on precision, recall, F1 to analyze. In this our methods, we can get the results as 1) Handwritten Digit (precision = 1.000, recall = 1.000, F1 = 1.00), 2) Food-K5 (precision = 0.975, recall = 0.945, F1 = 0.96), 3) Palm print (precision = 1.000, recall = 0.999, F1 = 1.00), 4) Cats-dogs (precision = 0.997, recall = 0.475, F1 = 0.64), 5) Flowers (precision = 0.610, recall = 0.982, F1 = 0.75), and our dataset 6) Rice Germination (precision = 0.997, recall = 0.943, F1 = 0.97). Our experiment showed that modeling could get an accuracy rate of 0.8908; the outcomes state that the proposed model is strongest enough to differentiate the different images and classify them into clusters.

Sea Cucumber (Stichopus japonicus) Grading System Based on Morphological Features during Rehydration Process (수화 시의 형태학적 특징에 따른 건해삼의 등급 분류 시스템 개발)

  • Lee, Choong Uk;Yoon, Won Byong
    • Journal of the Korean Society of Food Science and Nutrition
    • /
    • v.46 no.3
    • /
    • pp.374-380
    • /
    • 2017
  • Image analysis and k-mean clustering were conducted to develop a grading system of dried sea cucumber (SC) based on rehydration rate. The SC images were obtained by taking pictures in a box under controlled light conditions. The region of interest was extracted to depict the shape of the SC in a 2D graph, and those 2D shapes were rendered to build a 3D model. The results from the image analysis provided the morphological features of the SC, including length, width, surface area, and volume, to obtain the parameters of the k-mean clustering weight. The k-mean clustering classified the SC samples into three different grades. Each SC sample was rehydrated at $30^{\circ}C$ for 40 h. During rehydration, the flux of each grade was analyzed. Our study demonstrates that the mass transfer rate of SC increased as the surface area increased, and the grade of SC was classified based on rehydration rate. This study suggests that the optimal rehydration process for SC can be achieved by applying a suitable grading system.

Speckle Reduction based on Neuro-Fuzzy Technique (뉴로-퍼지를 이용한 스펙클 제거)

  • Kil, Se-Kee;Jeon, Yu-Yong;Oh, Hyung-Seok;Nishimura, Toshihiro;Kwon, Jang-Woo;Lee, Sang-Min
    • Journal of IKEEE
    • /
    • v.12 no.3
    • /
    • pp.158-166
    • /
    • 2008
  • Medical ultrasound has benefits in mobility and safety than any other medical techniques such as X-ray, CT and MRI but has speckle noise which decrease the ability of an observer to distinguish the fine details in diagnostic examination. But simple removing of speckle often causes losing boundary information. Then, in this paper, we presented a novel neuro-fuzzy method which could remove speckle efficiently without loss of boundary information. Proposed method consists of image clustering by fuzzy algorithm and image processingby neural networks which was learned by back propagation. From the experiments for simulation image and real ultrasound image, we could verify the proposed method.

  • PDF

Multi-Level Segmentation of Infrared Images with Region of Interest Extraction

  • Yeom, Seokwon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.4
    • /
    • pp.246-253
    • /
    • 2016
  • Infrared (IR) imaging has been researched for various applications such as surveillance. IR radiation has the capability to detect thermal characteristics of objects under low-light conditions. However, automatic segmentation for finding the object of interest would be challenging since the IR detector often provides the low spatial and contrast resolution image without color and texture information. Another hindrance is that the image can be degraded by noise and clutters. This paper proposes multi-level segmentation for extracting regions of interest (ROIs) and objects of interest (OOIs) in the IR scene. Each level of the multi-level segmentation is composed of a k-means clustering algorithm, an expectation-maximization (EM) algorithm, and a decision process. The k-means clustering initializes the parameters of the Gaussian mixture model (GMM), and the EM algorithm estimates those parameters iteratively. During the multi-level segmentation, the area extracted at one level becomes the input to the next level segmentation. Thus, the segmentation is consecutively performed narrowing the area to be processed. The foreground objects are individually extracted from the final ROI windows. In the experiments, the effectiveness of the proposed method is demonstrated using several IR images, in which human subjects are captured at a long distance. The average probability of error is shown to be lower than that obtained from other conventional methods such as Gonzalez, Otsu, k-means, and EM methods.

EEIRI: Efficient Encrypted Image Retrieval in IoT-Cloud

  • Abduljabbar, Zaid Ameen;Ibrahim, Ayad;Hussain, Mohammed Abdulridha;Hussien, Zaid Alaa;Al Sibahee, Mustafa A.;Lu, Songfeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5692-5716
    • /
    • 2019
  • One of the best means to safeguard the confidentiality, security, and privacy of an image within the IoT-Cloud is through encryption. However, looking through encrypted data is a difficult process. Several techniques for searching encrypted data have been devised, but certain security solutions may not be used in IoT-Cloud because such solutions are not lightweight. We propose a lightweight scheme that can perform a content-based search of encrypted images, namely EEIRI. In this scheme, the images are represented using local features. We develop and validate a secure scheme for measuring the Euclidean distance between two descriptor sets. To improve the search efficiency, we employ the k-means clustering technique to construct a searchable tree-based index. Our index construction process ensures the privacy of the stored data and search requests. When compared with more familiar techniques of searching images over plaintexts, EEIRI is considered to be more efficient, demonstrating a higher search cost of 7% and a decrease in search accuracy of 1.7%. Numerous empirical investigations are carried out in relation to real image collections so as to evidence our work.

Motion Parameter Estimation and Segmentation with Probabilistic Clustering (활률적 클러스터링에 의한 움직임 파라미터 추정과 세그맨테이션)

  • 정차근
    • Journal of Broadcast Engineering
    • /
    • v.3 no.1
    • /
    • pp.50-60
    • /
    • 1998
  • This paper addresses a problem of extraction of parameteric motion estimation and structural motion segmentation for compact image sequence representation and object-based generic video coding. In order to extract meaningful motion structure from image sequences, a direct parameteric motion estimation based on a pre-segmentation is proposed. The pre-segmentation which considers the motion of the moving objects is canied out based on probabilistic clustering with mixture models using optical flow and image intensities. Parametric motion segmentation can be obtained by iterated estimation of motion model parameters and region reassignment according to a criterion using Gauss-Newton iterative optimization algorithm. The efficiency of the proposed methoo is verified with computer simulation using elF real image sequences.

  • PDF