• The Bulletin of The Korean Astronomical Society
• /
• v.35 no.2
• /
• pp.34.1-34.1
• /
• 2010

Studies suggest that activities in luminous AGNs, residing mostly in early-type galaxies, are triggered by merging. However, the observational evidence for the connection between mergers and AGN activity is not clear yet because tracer of the past merging activities such as tidal tail, shell are often too faint. To see if we can reveal the merging features with a small telescope, we observed an AGN, MARK 478, at z=0.077 with long exposure time (7550 seconds) in V filter at Maidanak observatory. Our 2-D fitting analysis shows that the host galaxy of MARK 478 has the bulge to the total luminosity ratio of 0.3. And the residual image, after subtracting point spread function (PSF), bulge and disk components, shows that the host galaxy has an arm-like feature that could be a spiral arm or a feature from minor merging. We also show that the structural parameters obtained from our 2-D fitting match well with those derived from HST image. The promising result suggests that studies of low redshift AGN host galaxies are possible with data from a small telescope. In order to allow a statistical analysis, we hope to expand our sample size in future.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.5
• /
• pp.1023-1029
• /
• 2011

In the industrial vision systems, image correction has great influence on the overall performance of measurement or inspection. The overall area of distorted image is usually splitted into small control areas, and each area is corrected by its control points. The performance of correction methods using control points can be improved by reduction of control areas because the computational time and memory highly depend on the number of control areas. We develop a merging algorithm that reduces control areas and preserves the correction accuracy. The algorithm merges the splitted control areas by use of quad tree method. Experimental results are presented to verify the usefulness of the proposed method.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.4
• /
• pp.421-430
• /
• 2010

Image segmentation technique is becoming increasingly important in the field of remote sensing image analysis in areas such as object oriented image classification to extract object regions of interest within images. This paper presents a new method for image segmentation in High Resolution Remote Sensing Image based on Improved Seeded Region Growing (ISRG) and Region merging. Firstly, multi-spectral edge detection was done using an entropy operator in pan-sharpened QuickBird imagery. Then, the initial seeds were automatically selected from the obtained multi-spectral edge map. After automatic selection of significant seeds, an initial segmentation was achieved by applying ISRG to consider spectral and edge information. Finally the region merging process, integrating region texture and spectral information, was carried out to get the final segmentation result. The accuracy assesment was done using the unsupervised objective evaluation method for evaluating the effectiveness of the proposed method. Experimental results demonstrated that the proposed method has good potential for application in the segmentation of high resolution satellite images.

• Korean Journal of Remote Sensing
• /
• v.14 no.2
• /
• pp.149-164
• /
• 1998

The main object of this study was to prove the effectiveness of different merging methods by using the high resolution IRS(Indian Remote Sensing Satellite)-1C panchromatic data and the multispectral Landsat TM data. The five methods used to merging the information contents of each of the satellite data were the intensity-hue-saturation(IHS), principal component analysis(PCA), high pass filter(HPF), ratio enhancement method and look-up-table(LUT) procedures. Two measures are used to evaluate the merging method. These measures include visual inspection and comparisons of the mean, standard deviation and root mean square error between merged image and original image data values of each band. The ratio enhancement method was well preserved the spectral characteristics of the data. From visual inspection, PCA method provide the best result, HPF next, ratio enhancement, IHS and LUT method the worst for the preservation of spatial resolution.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.700-702
• /
• 2007

We present a relevance feedback approach based on multi-class support vector machine (SVM) learning and cluster-merging which can significantly improve the retrieval performance in region-based image retrieval. Semantically relevant images may exhibit various visual characteristics and may be scattered in several classes in the feature space due to the semantic gap between low-level features and high-level semantics in the user's mind. To find the semantic classes through relevance feedback, the proposed method reduces the burden of completely re-clustering the classes at iterations and classifies multiple classes. Experimental results show that the proposed method is more effective and efficient than the two-class SVM and multi-class relevance feedback methods.

• The Journal of the Korea Contents Association
• /
• v.6 no.9
• /
• pp.19-27
• /
• 2006

Mean shift procedure is applied for the data points in the joint spatial-range domain and achieves a high quality. However, a color image is segmented differently according to the inputted spatial parameter or range parameter and the demerit is that the image is broken into many small regions in case of the small parameter. In this paper, to improve this demerit, we propose the method that groups similar regions using region merging method for over-segmented images. The proposed method converts a over-segmented image in RGB color space into in HSI color space and merges similar regions by hue information. Here, to preserve edge information, the region merge constraints are used to decide whether regions are merged or not. After then, we merge the regions in RGB color space for non-processed regions in HSI color space. Experimental results show the superiority in region's segmentation results.

• Korean Journal of Remote Sensing
• /
• v.22 no.6
• /
• pp.601-612
• /
• 2006

This study proposes RAG (Region Adjancency Graph)-based image segmentation for large imagery in remote sensing. The proposed algorithm uses CN-chain linking for computational efficiency and multi-window operation of sliding structure for memory efficiency. Region-merging due to RAG is a process to find an edge of the best merge and update the graph according to the merge. The CN-chain linking constructs a chain of the closest neighbors and finds the edge for merging two adjacent regions. It makes the computation time increase as much as an exact multiple in the increasement of image size. An RNV (Regional Neighbor Vector) is used to update the RAG according to the change in image configuration due to merging at each step. The analysis of large images requires an enormous amount of computational memory. The proposed sliding multi-window operation with horizontal structure considerably the memory capacity required for the analysis and then make it possible to apply the RAG-based segmentation for very large images. In this study, the proposed algorithm has been extensively evaluated using simulated images and the results have shown its potentiality for the application of remotely-sensed imagery.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.283-286
• /
• 2001

In this paper, we present a robust region segmentation method based on the watershed transformation of a pseudo-distance map (PDM). A usual approach for the segmentation of a gray-scale image with the watershed algorithm is to apply it to a gradient magnitude image or the Euclidean distance map (EDM) of an edge image. However, it is well known that this approach suffers from the oversegmentation of the given image due to noisy gradients or spurious edges caused by a thresholding operation. In this paper we show thor applying the watershed algorithm to the EDM, which is a regularized version of the EDM and is directly computed form the edgestrength function (ESF) of the input image, significantly reduces the oversegmentation, and the final segmentation results obtained by a simple region-merging process are more reliable and less noisy than those of the gradient-or EDM-based methods. We also propose a simple and efficient region-merging criterion considering both boundary strengths and inner intensities of regions to be merged. The robustness of our method is proven by testing it with a variety of synthetic and real images.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2994-3001
• /
• 2000

In this paper. a method for color image segmentation using region merging is proposed. A inhomogeneity which exists in image is reduced by smoothing with non-linear filtering. saturation enhancement and intensity averaging in previous step of image segmentation. and a similar regions are segmented by non-uniform quantization using zero-crossing information of color histogram. A edge strength of initial region is measured using high frequency energy of wavelet transform. A candidate region which is merged in next step is selected by doing this process. A similarity measure for region merging is processed using Euclidean distance of R. G. B color channels. A Proposed method can reduce an over-segmentation results by irregular light sources et. al, and we illustrated that the proposed method is reasonable by simulation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.113-120
• /
• 2005

3D reconstruction of a scene structure from un-calibrated image sequences has been long one of the central problems in computer vision. For 3D reconstruction in Euclidean space, projective reconstruction, which is classified into the merging method and the factorization, is needed as a preceding step. By calculating all camera projection matrices and structures at the same time, the factorization method suffers less from dia and error accumulation than the merging. However, the factorization is hard to analyze precisely long sequences because it is based on the assumption that all correspondences must remain in all views from the first frame to the last. This paper presents a new projective reconstruction method for recovery of 3D structure over long sequences. We break a full sequence into sub-sequences based on a quantitative measure considering the number of matching points between frames, the homography error, and the distribution of matching points on the frame. All of the projective reconstructions of sub-sequences are registered into the same coordinate frame for a complete description of the scene. no experimental results showed that the proposed method can recover more precise 3D structure than the merging method.