• 제목/요약/키워드: Merging Objects

검색결과 67건 처리시간 0.019초

Image Registration and Fusion between Passive Millimeter Wave Images and Visual Images (수동형 멀리미터파 영상과 가시 영상과의 정합 및 융합에 관한 연구)

  • Lee, Hyoung;Lee, Dong-Su;Yeom, Seok-Won;Son, Jung-Young;Guschin, Vladmir P.;Kim, Shin-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제36권6C호
    • /
    • pp.349-354
    • /
    • 2011
  • Passive millimeter wave imaging has the capability of detecting concealed objects under clothing. Also, passive millimeter imaging can obtain interpretable images under low visibility conditions like rain, fog, smoke, and dust. However, the image quality is often degraded due to low spatial resolution, low signal level, and low temperature resolution. This paper addresses image registration and fusion between passive millimeter images and visual images. The goal of this study is to combine and visualize two different types of information together: human subject's identity and concealed objects. The image registration process is composed of body boundary detection and an affine transform maximizing cross-correlation coefficients of two edge images. The image fusion process comprises three stages: discrete wavelet transform for image decomposition, a fusion rule for merging the coefficients, and the inverse transform for image synthesis. In the experiments, various types of metallic and non-metallic objects such as a knife, gel or liquid type beauty aids and a phone are detected by passive millimeter wave imaging. The registration and fusion process can visualize the meaningful information from two different types of sensors.

A new Clustering Algorithm for the Scanned Infrared Image of the Rosette Seeker (로젯 탐색기의 적외선 주사 영상을 위한 새로운 클러스터링 알고리즘)

  • Jahng, Surng-Gabb;Hong, Hyun-Ki;Doo, Kyung-Su;Oh, Jeong-Su;Choi, Jong-Soo;Seo, Dong-Sun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • 제37권2호
    • /
    • pp.1-14
    • /
    • 2000
  • The rosette-scan seeker, mounted on the infrared guided missile, is a device that tracks the target It can acquire the 2D image of the target by scanning a space about target in rosette pattern with a single detector Since the detected image is changed according to the position of the object in the field of view and the number of the object is not fixed, the unsupervised methods are employed in clustering it The conventional ISODATA method clusters the objects by using the distance between the seed points and pixels So, the clustering result varies in accordance with the shape of the object or the values of the merging and splitting parameters In this paper, we propose an Array Linkage Clustering Algorithm (ALCA) as a new clustering algorithm improving the conventional method The ALCA has no need for the initial seed points and the merging and splitting parameters since it clusters the object using the connectivity of the array number of the memory stored the pixel Therefore, the ALCA can cluster the object regardless of its shape With the clustering results using the conventional method and the proposed one, we confirm that our method is better than the conventional one in terms of the clustering performance We simulate the rosette scanning infrared seeker (RSIS) using the proposed ALCA as an infrared counter countermeasure The simulation results show that the RSIS using our method is better than the conventional one in terms of the tracking performance.

  • PDF

Image Restoration and Segmentation for PAN-sharpened High Multispectral Imagery (PAN-SHARPENED 고해상도 다중 분광 자료의 영상 복원과 분할)

  • Lee, Sanghoon
    • Korean Journal of Remote Sensing
    • /
    • 제33권6_1호
    • /
    • pp.1003-1017
    • /
    • 2017
  • Multispectral image data of high spatial resolution is required to obtain correct information on the ground surface. The multispectral image data has lower resolution compared to panchromatic data. PAN-sharpening fusion technique produces the multispectral data with higher resolution of panchromatic image. Recently the object-based approach is more applied to the high spatial resolution data than the conventional pixel-based one. For the object-based image analysis, it is necessary to perform image segmentation that produces the objects of pixel group. Image segmentation can be effectively achieved by the process merging step-by-step two neighboring regions in RAG (Regional Adjacency Graph). In the satellite remote sensing, the operational environment of the satellite sensor causes image degradation during the image acquisition. This degradation increases variation of pixel values in same area, and results in deteriorating the accuracy of image segmentation. An iterative approach that reduces the difference of pixel values in two neighboring pixels of same area is employed to alleviate variation of pixel values in same area. The size of segmented regions is associated with the quality of image segmentation and is decided by a stopping rue in the merging process. In this study, the image restoration and segmentation was quantitatively evaluated using simulation data and was also applied to the three PAN-sharpened multispectral images of high resolution: Dubaisat-2 data of 1m panchromatic resolution from LA, USA and KOMPSAT3 data of 0.7m panchromatic resolution from Daejeon and Chungcheongnam-do in the Korean peninsula. The experimental results imply that the proposed method can improve analytical accuracy in the application of remote sensing high resolution PAN-sharpened multispectral imagery.

An Object-Based Verification Method for Microscale Weather Analysis Module: Application to a Wind Speed Forecasting Model for the Korean Peninsula (미기상해석모듈 출력물의 정확성에 대한 객체기반 검증법: 한반도 풍속예측모형의 정확성 검증에의 응용)

  • Kim, Hea-Jung;Kwak, Hwa-Ryun;Kim, Sang-il;Choi, Young-Jean
    • The Korean Journal of Applied Statistics
    • /
    • 제28권6호
    • /
    • pp.1275-1288
    • /
    • 2015
  • A microscale weather analysis module (about 1km or less) is a microscale numerical weather prediction model designed for operational forecasting and atmospheric research needs such as radiant energy, thermal energy, and humidity. The accuracy of the module is directly related to the usefulness and quality of real-time microscale weather information service in the metropolitan area. This paper suggests an object based verification method useful for spatio-temporal evaluation of the accuracy of the microscale weather analysis module. The method is a graphical method comprised of three steps that constructs a lattice field of evaluation statistics, merges and identifies objects, and evaluates the accuracy of the module. We develop lattice fields using various evaluation spatio-temporal statistics as well as an efficient object identification algorithm that conducts convolution, masking, and merging operations to the lattice fields. A real data application demonstrates the utility of the verification method.

Moving Object Detection and Tracking in Multi-view Compressed Domain (비디오 압축 도메인에서 다시점 카메라 기반 이동체 검출 및 추적)

  • Lee, Bong-Ryul;Shin, Youn-Chul;Park, Joo-Heon;Lee, Myeong-Jin
    • Journal of Advanced Navigation Technology
    • /
    • 제17권1호
    • /
    • pp.98-106
    • /
    • 2013
  • In this paper, we propose a moving object detection and tracking method for multi-view camera environment. Based on the similarity and characteristics of motion vectors and coding block modes extracted from compressed bitstreams, validation of moving blocks, labeling of the validated blocks, and merging of neighboring blobs are performed. To continuously track objects for temporary stop, crossing, and overlapping events, a window based object updating algorithm is proposed for single- and multi-view environments. Object detection and tracking could be performed with an acceptable level of performance without decoding of video bitstreams for normal, temporary stop, crossing, and overlapping cases. The rates of detection and tracking are over 89% and 84% in multi-view environment, respectively. The rates for multi-view environment are improved by 6% and 7% compared to those of single-view environment.

Chemical Properties of Star-Forming Dwarf Galaxies in Different Environments

  • Chung, Jiwon;Rey, Soo-Chang;Sung, Eon-Chang;Lee, Woong;Kim, Suk;Lee, Yongdae
    • The Bulletin of The Korean Astronomical Society
    • /
    • 제42권1호
    • /
    • pp.49.2-49.2
    • /
    • 2017
  • Star forming dwarf galaxies in various environments are attractive objects for investigating the environmental effects on chemical evolution of dwarf galaxies. Using SDSS DR7 spectroscopic data and GALEX ultraviolet (UV) imaging data, we study the chemical properties of star forming dwarf galaxies in various environments of the Virgo cluster, Ursa Major group, and field. We derived gas-phase abundance, galaxy mass, and UV specific star formation rate (sSFR) of subsample, early-type (ETD) and late-type star forming dwarf (LTD) galaxies, which are divided by visually classified galaxy morphology. We found no O/H enhancement of LTDs in cluster and group environments compared to the field, implying no environmental dependence of the mass-metallicity relation for LTDs. LTDs in the Virgo cluster and Ursa Major group have similar sSFR at a given galaxy mass, but they exhibit systematically lower sSFR than those in isolated field environment. We suggest that LTDs in the Virgo cluster are an infalling population that was recently accreted from the outside of the cluster. We found that ETDs in the Virgo cluster and Ursa Major group exhibit enhanced O/H compared to those in the field. However, no distinct difference of N/O of galaxies between different environments. The chemically evolved ETDs in the Virgo cluster and Ursa Major group also show similar mass-sSFR relation, but systematically lower sSFR at a fixed galaxy mass compared to the field counterparts. We suggest that ETDs in the Virgo cluster and Ursa Major group have evolved under the similar local environments. We also discuss the evolutionary path of ETDs and LTDs with respect to the environmental effects of ram pressure stripping and galaxy interaction/merging.

  • PDF

Context-free Marker Controlled Watershed Transform for Efficient Multi-object Detection and Segmentation (다중 물체의 효과적 검출과 분할을 위한 문맥자유 마커제어 분수계 변환)

  • Seo, Gyeong-Seok;Jo, Sang-Hyeon;Choe, Heung-Mun;Park, Chang-Jun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • 제38권3호
    • /
    • pp.237-246
    • /
    • 2001
  • A high speed context-free marker-controlled and minima imposition-free watershed transform is proposed for efficient multi-object detection and segmentation from a complex background. The context-free markers are extracted from a complex backgrounded multi-object image using a noise tolerant attention operator. These make marker-controlled watershed possible for the over-segmentation reduction without region merging. The proposed method presents a marker-constrained labeling that can speed up the segmentation of a marker-controlled watershed transform by eliminating the necessity of the minima imposition. Simulation results show that the proposed method can efficiently detects and segments multiple objects from a complex background while reducing over- segmentation and the computation time.

  • PDF

Detecting Uncertain Boundary Algorithm using Constrained Delaunay Triangulation (제한된 델로네 삼각분할을 이용한 공간 불확실한 영역 탐색 기법)

  • Cho, Sunghwan
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • 제32권2호
    • /
    • pp.87-93
    • /
    • 2014
  • Cadastral parcel objects as polygons are fundamental dataset which represent land administration and management of the real world. Thus it is necessary to assure topological seamlessness of cadastral datasets which means no overlaps or gaps between adjacent parcels. However, the problem of overlaps or gaps are frequently found due to non-coinciding edges between adjacent parcels. These erroneous edges are called uncertain edges, and polygons containing at least one uncertain edge are called uncertain polygons. In this paper, we proposed a new algorithm to efficiently search parcels of uncertain polygons between two adjacent cadastral datasets. The algorithm first selects points and polylines around adjacent datasets. Then the Constrained Delaunay Triangulation (CDT) is applied to extract triangles. These triangles are tagged by the number of the original cadastral datasets which intersected with the triangles. If the tagging value is zero, the area of triangles mean gaps, meanwhile, the value is two, the area means overlaps. Merging these triangles with the same tagging values according to adjacency analysis, uncertain edges and uncertain polygons could be found. We have performed experimental application of this automated derivation of partitioned boundary from a real land-cadastral dataset.

Collection Fusion Algorithm in Distributed Multimedia Databases (분산 멀티미디어 데이터베이스에 대한 수집 융합 알고리즘)

  • Kim, Deok-Hwan;Lee, Ju-Hong;Lee, Seok-Lyong;Chung, Chin-Wan
    • Journal of KIISE:Databases
    • /
    • 제28권3호
    • /
    • pp.406-417
    • /
    • 2001
  • With the advances in multimedia databases on the World Wide Web, it becomes more important to provide users with the search capability of distributed multimedia data. While there have been many studies about the database selection and the collection fusion for text databases. The multimedia databases on the Web have autonomous and heterogeneous properties and they use mainly the content based retrieval. The collection fusion problem of multimedia databases is concerned with the merging of results retrieved by content based retrieval from heterogeneous multimedia databases on the Web. This problem is crucial for the search in distributed multimedia databases, however, it has not been studied yet. This paper provides novel algorithms for processing the collection fusion of heterogeneous multimedia databases on the Web. We propose two heuristic algorithms for estimating the number of objects to be retrieved from local databases and an algorithm using the linear regression. Extensive experiments show the effectiveness and efficiency of these algorithms. These algorithms can provide the basis for the distributed content based retrieval algorithms for multimedia databases on the Web.

  • PDF

Background Subtraction Algorithm Based on Multiple Interval Pixel Sampling (다중 구간 샘플링에 기반한 배경제거 알고리즘)

  • Lee, Dongeun;Choi, Young Kyu
    • KIPS Transactions on Software and Data Engineering
    • /
    • 제2권1호
    • /
    • pp.27-34
    • /
    • 2013
  • Background subtraction is one of the key techniques for automatic video content analysis, especially in the tasks of visual detection and tracking of moving object. In this paper, we present a new sample-based technique for background extraction that provides background image as well as background model. To handle both high-frequency and low-frequency events at the same time, multiple interval background models are adopted. The main innovation concerns the use of a confidence factor to select the best model from the multiple interval background models. To our knowledge, it is the first time that a confidence factor is used for merging several background models in the field of background extraction. Experimental results revealed that our approach based on multiple interval sampling works well in complicated situations containing various speed moving objects with environmental changes.