• 천문학회보
• /
• 제38권2호
• /
• pp.46.2-46.2
• /
• 2013

We utilize Sloan Digital Sky Survey DR7 spectroscopic data of ~380 star forming galaxies in the Virgo cluster to investigate their chemical properties depending on the environments. The chemical evolution of galaxies is linked to their star formation histories as well as to the gas interchange in different environments. We derived star formation rate (SFR) and gaseous metallicity (e.g., oxygen abundance) of star forming galaxies. Combining with GALEX ultraviolet photometry and ALFALFA HI 21 cm data, we examine the relations between SFRs, metallicity, and HI deficiency of galaxies in various regions of the Virgo cluster. We also quantify the degree of ram pressure around galaxy using the ROSAT X-ray surface brightness map. We discuss environmental effects on the chemical properties and evolution of star forming galaxies.

• Journal of the Korean Data and Information Science Society
• /
• 제17권4호
• /
• pp.1141-1150
• /
• 2006

In this study, we performed spatial cluster analysis which considered spatial information using earthquake data for Korean peninsula occurred on 1978 year to 2005 year. Also, we look into how to be clustered for regions using earthquake magnitude and frequency based on spatial scan statistic. And, on the basis of the results, we constructed earthquake map by earthquake outbreak risk and gave a possible explanation for the results of spatial cluster analysis.

• 천문학회보
• /
• 제42권1호
• /
• pp.50.3-51
• /
• 2017

Discovered in the South Pole Telescope Sunyaev-Zel'dovich (SPT-SZ) survey, the galaxy cluster SPT-CL J0205-5829 at z = 1.322 might be the most massive known SZ-selected galaxy cluster at z > 1.2. The SZ and X-ray combined mass estimate is $M500=(4.8{\pm}0.8){\times}10^{14}M_{\odot}$. To confirm this extreme mass, we perform weak lensing analysis of SPT-CL J0205-5829 using HST data. Our analysis produces a mass estimate consistent with the previous results obtained from non-lensing methods. In this poster, we describe details of the method including shape measurement, PSF correction, source selection, and mass estimation. We also present a two-dimensional mass map and compare this to the galaxy distribution.

• 전자공학회논문지B
• /
• 제28B권9호
• /
• pp.739-746
• /
• 1991

This paper develops a modified multilayer perceptron architecture which speeds up learning as well as the net's mapping accuracy. In Phase I, a cluster partitioning algorithm like the Kohonen's self-organizing feature map or the leader clustering algorithm is used as the front end that determines the cluster to which the input data belongs. In Phase II, this cluster selects a subset of the hidden layer nodes that combines the input and outputs nodes into a subnet of the full scale backpropagation network. The proposed net has been applied to two mapping problems, one rather smooth and the other highly nonlinear. Namely, the inverse kinematic problem for a 3-link robot manipulator and the 5-bit parity mapping have been chosen as examples. The results demonstrate the proposed net's superior accuracy and convergence properties over the original backpropagation network or its existing improvement techniques.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2003년도 제2차 연례학술대회 발표논문집
• /
• pp.170-177
• /
• 2003

Gene expression data are the quantitative measurements of expression levels and ratios of numberous genes in different situations based on microarray image analysis results. The process to draw meaningful information related to genomic diseases and various biological activities from gene expression data is known as gene expression data analysis. In this paper, we present a hierarchical clustering method of gene expression data based on self organizing map which can analyze the clustering result of gene expression data more efficiently. Using our proposed method, we could eliminate the uncertainty of cluster boundary which is the inherited disadvantage of self organizing map and use the visualization function of hierarchical clustering. And, we could process massive data using fast processing speed of self organizing map and interpret the clustering result of self organizing map more efficiently and user-friendly. To verify the efficiency of our proposed algorithm, we performed tests with following 3 data sets, animal feature data set, yeast gene expression data and leukemia gene expression data set. The result demonstrated the feasibility and utility of the proposed clustering algorithm.

• 천문학회보
• /
• 제39권2호
• /
• pp.45.2-45.2
• /
• 2014

To measure the mass distribution of galaxy systems weak-lensing analysis has been widely used because it directly measures the total mass of a system regardless of its baryon content and dynamical state. However, the weak-lensing only provides a map of projected surface mass density. On the other hand, galaxy redshift surveys provide a map of the three-dimensional galaxy distribution. It thus can resolve the structures along the line of sight projected in the weak-lensing map. Therefore, the comparison of structures identified in the weak-lensing maps and in the redshift surveys is an important test of the issues limiting applications of weak-lensing to the identification of galaxy clusters. Geller et al. (2010) and Kurtz et al. (2012) compared massive clusters identified in a dense redshift survey with significant weak-lensing map convergence peaks. Both assessments of the efficiency of weak-lensing map for cluster identification did not draw a general conclusion, because the sample is so small. Thus, we additionally perform deep imaging observations of fields in a dense galaxy redshift survey that contain galaxy clusters at z~0.2-0.5, using CFHT Megacam.

• 한국멀티미디어학회논문지
• /
• 제14권5호
• /
• pp.595-606
• /
• 2011

This paper proposes a robust watermarking scheme for GIS digital map by using the geometric properties of polyline and polygon, which are the fundamental components in vector data structure. In the proposed scheme, we calculate the lengths and the perimeters of all polylines and polygons in a map and cluster them to a number of groups. Then we embed the binary watermark by changing the mean of lengths and perimeters in an embedding group. For improving the safety and robustness, we permute the binary watermark through PRNS(pseudo-random number sequence) processing and embed it repeatedly in a model. Experimental results verified that our scheme has a good invisibility, safety and robustness to various geometric attacks and also our scheme needs not the original map in the extracting process of watermark.

• 한국컴퓨터정보학회논문지
• /
• 제22권12호
• /
• pp.63-68
• /
• 2017

In this paper, we propose a bounding box prediction algorithm using multiple probability maps to improve object detection result of object detector. Although the performance of object detectors has been significantly improved, it is still not perfect due to technical problems and lack of learning data. Therefore, we use the result correction method to obtain more accurate object detection results. In the proposed algorithm, the preprocessed bounding box created as a result of object detection by the object detector is clustered in various form, and a conditional probability is given to each cluster to make multiple probability map. Finally, multiple probability map create new bounding box of object using morphological elements. Experiment results show that the newly predicted bounding box reduces the error in ground truth more than 45% on average compared to the previous bounding box.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제6권1호
• /
• pp.10-14
• /
• 2006

Many clustering methods have been studied. For the most part of these methods may be needed to determine the number of clusters. But, there are few methods for determining the number of population clusters objectively. It is difficult to determine the cluster size. In general, the number of clusters is decided by subjectively prior knowledge. Because the results of clustering depend on the number of clusters, it must be determined seriously. In this paper, we propose an efficient method for determining the number of clusters using hybrid' self organizing map and new criterion for evaluating the clustering result. In the experiment, we verify our model to compare other clustering methods using the data sets from UCI machine learning repository.

• 천문학회보
• /
• 제44권2호
• /
• pp.75.1-75.1
• /
• 2019

We introduce a novel method for reconstructing the projected dark matter mass maps of merging galaxy clusters by applying the convolutional neural network (CNN) to their weak lensing maps. We generate synthesized grayscale images from given weak lensing maps that preserve their averaged galaxy ellipticity. We then apply them to multi-layered CNN with architectures of alternating convolution and trans-convolution filters to predict the mass maps. We train our architecture with 1,000 Subaru/Suprime-Cam mock weak lensing maps, and our method have better mass map prediction than the Kaiser-Squires method with the following three aspects: (1) better pixel-to-pixel correlation, (2) more accurate finding of density peak position, and (3) free from mass-sheet degeneracy. We also apply our method to the HST weak lensing map of the El Gordo cluster and compare our result to the previous studies.