• Title/Summary/Keyword: 객체 추출

Search Result 1,481, Processing Time 0.022 seconds

SOM-Based $R^{*}-Tree$ for Similarity Retrieval (자기 조직화 맵 기반 유사 검색 시스템)

  • O, Chang-Yun;Im, Dong-Ju;O, Gun-Seok;Bae, Sang-Hyeon
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.507-512
    • /
    • 2001
  • Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The $R^{*}-Tree$ is the most successful variant of the R-Tree. In this paper, we propose a SOM-based $R^{*}-Tree$ as a new indexing method for high-dimensional feature vectors. The SOM-based $R^{*}-Tree$ combines SOM and $R^{*}-Tree$ to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based $R^{*}-Tree$ with of an SOM and $R^{*}-Tree$ using color feature vectors extracted from 40,000 images. The results show that the SOM-based $R^{*}-Tree$ outperform both the SOM and $R^{*}-Tree$ due to reduction of the number of nodes to build $R^{*}-Tree$ and retrieval time cost.

  • PDF

Potential Value Improvement Target Choice Methodology (PVTCM) in Construction Projects (건설 프로젝트의 잠재적 가치개선 대상 선정 방법론(PVTCM))

  • Yang, Jinkook
    • Korean Journal of Construction Engineering and Management
    • /
    • v.15 no.4
    • /
    • pp.11-19
    • /
    • 2014
  • Construction VE activities has occupies an important position as a key tool of the project in terms of budget and performance improvements. Reflecting this situation, VE application scope is being expanded than before. Thus, construction projects are required the continued research and development for effective use of construction VE. VE target choice method is the central part in the construction VE work. But, this has a problem with low utilization in practical terms. Accordingly, this study was developed the new methodology(PVTCM) for VE target selection of the construction VE work. Its contents are as follows: First, to analyze practical problem for VE target choice method through VE practical data. Second, to extract the high potential VE object based on the cost model and ideas similarity by excellent VE cases analysis. Third, to implement standardized VE object item by using affinity diagram for each construction type items. This research were conducted to experts interviews for comparison analysis with the cost model as one of a representative target selection method. As a result, proposed method were implemented significantly higher performance in terms of practical effectiveness than conventional method.

3D Medical Image Segmentation Using Region-Growing Based Tracking (영역 확장 기반 추적을 이용한 3차원 의료 영상 분할 기법)

  • Ko S.;Yi J.;Lim J.;Ra J. B.
    • Journal of Biomedical Engineering Research
    • /
    • v.21 no.3 s.61
    • /
    • pp.239-246
    • /
    • 2000
  • In this paper. we propose a semi-automatic segmentation algorithm to extract organ in 3D medical data by using a manually segmentation result in a sing1e slice. Generally region glowing based tracking method consists of 3 steps object projection. seed extraction and boundary decision by region growing. But because the boundary between organs in medical data is vague, improper seeds make the boundary dig into the organ or extend to the false region. In the proposed algorithm seeds are carefully extracted to find suitable boundaries between organs after region growing. And the jagged boundary at low gradient region after region growing is corrected by post-processing using Fourier descriptor. Also two-path tracking make it possible to catch up newly appeared areas. The proposed algorithm provides satisfactory results in segmenting 1 mm distance kidneys from X-rav CT body image set of 82 slices.

  • PDF

An Efficient Coding Technique of Holographic Video Signal using 3D Segment Scanning (분할영역의 3차원 스캐닝을 이용한 홀로그래픽 비디오 신호의 효율적인 부호화 기술)

  • Seo, Young-Ho;Choi, Hyun-Jun;Kim, Dong-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2C
    • /
    • pp.132-140
    • /
    • 2007
  • In this paper, we proposed a new technique to encode and decode the digital hologram. Since the digital hologram (or fringe pattern) is generated by interference of light, it has much different property from natural 2D (2 dimensional) images. First, we acquisite optical-sensed or computer-generated hologram by digital type, and then extract a chrominance component. The extracted digital hologram for coding is separated into segments to use multi-view properties. The segmented hologram shows the similar characteristics with picturing an object with 2D cameras in various point of view. Since fringe pattern is visually observed like as noise, we expect that the fringe pattern has poor coding efficiency. To obtain high efficiency, the segment is transformed with DCT (Discrete Cosine Transform) which resembles hologram generation process with high performance. Each transformed segment passes the 3D scanning process according to time and spatial correlation, and is organized into a video stream. Since the segment which correspond to frame of a video stream consists of the transformed coefficients with wide range of value, it is classified and re-normalized. Finally it is compressed with coding tools. The proposed algorithm illustrated that it has better properties for reconstruction of 16 times higher compression rate than the previous researches.

A Reduction Method of Over-Segmented Regions at Image Segmentation based on Homogeneity Threshold (동질성 문턱 값 기반 영상분할에서 과분할 영역 축소 방법)

  • Han, Gi-Tae
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.1 no.1
    • /
    • pp.55-68
    • /
    • 2012
  • In this paper, we propose a novel method to solve the problem of excessive segmentation out of the method of segmenting regions from an image using Homogeneity Threshold($H_T$). The algorithm of the previous image segmentation based on $H_T$ was carried out region growth by using only the center pixel of selected window. Therefore it was caused resulting in excessive segmented regions. However, before carrying region growth, the proposed method first of all finds out whether the selected window is homogeneity or not. Subsequently, if the selected window is homogeneity it carries out region growth using the total pixels of selected window. But if the selected window is not homogeneity, it carries out region growth using only the center pixel of selected window. So, the method can reduce remarkably the number of excessive segmented regions of image segmentation based on $H_T$. In order to show the validity of the proposed method, we carried out multiple experiments to compare the proposed method with previous method in same environment and conditions. As the results, the proposed method can reduce the number of segmented regions above 40% and doesn't make any difference in the quality of visual image when we compare with previous method. Especially, when we compare the image united with regions of descending order by size of segmented regions in experimentation with the previous method, even though the united image has regions more than 1,000, we can't recognize what the image means. However, in the proposed method, even though image is united by segmented regions less than 10, we can recognize what the image is. For these reason, we expect that the proposed method will be utilized in various fields, such as the extraction of objects, the retrieval of informations from the image, research for anatomy, biology, image visualization, and animation and so on.

Bundle Block Adjustment of Omni-directional Images by a Mobile Mapping System (모바일매핑시스템으로 취득된 전방위 영상의 광속조정법)

  • Oh, Tae-Wan;Lee, Im-Pyeong
    • Korean Journal of Remote Sensing
    • /
    • v.26 no.5
    • /
    • pp.593-603
    • /
    • 2010
  • Most spatial data acquisition systems employing a set of frame cameras may have suffered from their small fields of view and poor base-distance ratio. These limitations can be significantly reduced by employing an omni-directional camera that is capable of acquiring images in every direction. Bundle Block Adjustment (BBA) is one of the existing georeferencing methods to determine the exterior orientation parameters of two or more images. In this study, by extending the concept of the traditional BBA method, we attempt to develop a mathematical model of BBA for omni-directional images. The proposed mathematical model includes three main parts; observation equations based on the collinearity equations newly derived for omni-directional images, stochastic constraints imposed from GPS/INS data and GCPs. We also report the experimental results from the application of our proposed BBA to the real data obtained mainly in urban areas. With the different combinations of the constraints, we applied four different types of mathematical models. With the type where only GCPs are used as the constraints, the proposed BBA can provide the most accurate results, ${\pm}5cm$ of RMSE in the estimated ground point coordinates. In future, we plan to perform more sophisticated lens calibration for the omni-directional camera to improve the georeferencing accuracy of omni-directional images. These georeferenced omni-directional images can be effectively utilized for city modelling, particularly autonomous texture mapping for realistic street view.

A Study on the Evaluation of the Different Thresholds for Detecting Urban Areas Using Remote-Sensing Index Images: A Case Study for Daegu, South Korea (원격탐사 지수 영상으로부터 도시 지역 탐지를 위한 임계점 평가에 관한 연구: 대구광역시를 사례로)

  • CHOUNG, Yun-Jae;LEE, Eung-Joon;JO, Myung-Hee
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.22 no.1
    • /
    • pp.129-139
    • /
    • 2019
  • Mapping urban areas using the earth observation satellites is useful for monitoring urban expansions and measuring urban developments. In this research, the different thresholds for detecting the urban areas separately from the remote-sensing index images (normalized-difference built-up index(NDBI) and urban index(UI) images) generated from the Landsat-8 image acquired in Daegu, South Korea were evaluated through the following steps: (1) the NDBI and UI images were separately generated from the given Landsat-8 image; (2) the different thresholds (-0.4, -0.2, and 0) for detecting the urban areas separately from the NDBI and UI images were evaluated; and (3) the accuracy of each detected urban area was assessed. The experiment results showed that the threshold -0.2 had the best performance for detecting the urban areas from the NDBI image, while the threshold -0.4 had the best performance for detecting the urban areas from the UI image. Some misclassification errors, however, occurred in the areas where the bare soil areas were classified into urban areas or where the high-rise apartments were classified into other areas. In the future research, a robust methodology for detecting urban areas, including the various types of urban features, with less misclassification errors will be proposed using the satellite images. In addition, research on analyzing the pattern of urban expansion will be carried out using the urban areas detected from the multi-temporal satellite images.

Accuracy Analysis for Slope Movement Characterization by comparing the Data from Real-time Measurement Device and 3D Model Value with Drone based Photogrammetry (도로비탈면 상시계측 실측치와 드론 사진측량에 의한 3D 모델값의 정확도 비교분석)

  • CHO, Han-Kwang;CHANG, Ki-Tae;HONG, Seong-Jin;HONG, Goo-Pyo;KIM, Sang-Hwan;KWON, Se-Ho
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.23 no.4
    • /
    • pp.234-252
    • /
    • 2020
  • This paper is to verify the effectiveness of 'Hybrid Disaster Management Strategy' that integrates 'RTM(Real-time Monitoring) based On-line' and 'UAV based Off-line' system. For landslide prone area where sensors were installed, the conventional way of risk management so far has entirely relied on RTM data collected from the field through the instrumentation devices. But it's not enough due to the limitation of'Pin-point sensor'which tend to provide with only the localized information where sensors have stayed fixed. It lacks, therefore, the whole picture to be grasped. In this paper, utilizing 'Digital Photogrammetry Software Pix4D', the possibility of inference for the deformation of ungauged area has been reviewed. For this purpose, actual measurement data from RTM were compared with the estimated value from 3D point cloud outcome by UAV, and the consequent results has shown very accurate in terms of RMSE.

Abnormal Crowd Behavior Detection via H.264 Compression and SVDD in Video Surveillance System (H.264 압축과 SVDD를 이용한 영상 감시 시스템에서의 비정상 집단행동 탐지)

  • Oh, Seung-Geun;Lee, Jong-Uk;Chung, Yongw-Ha;Park, Dai-Hee
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.6
    • /
    • pp.183-190
    • /
    • 2011
  • In this paper, we propose a prototype system for abnormal sound detection and identification which detects and recognizes the abnormal situations by means of analyzing audio information coming in real time from CCTV cameras under surveillance environment. The proposed system is composed of two layers: The first layer is an one-class support vector machine, i.e., support vector data description (SVDD) that performs rapid detection of abnormal situations and alerts to the manager. The second layer classifies the detected abnormal sound into predefined class such as 'gun', 'scream', 'siren', 'crash', 'bomb' via a sparse representation classifier (SRC) to cope with emergency situations. The proposed system is designed in a hierarchical manner via a mixture of SVDD and SRC, which has desired characteristics as follows: 1) By fast detecting abnormal sound using SVDD trained with only normal sound, it does not perform the unnecessary classification for normal sound. 2) It ensures a reliable system performance via a SRC that has been successfully applied in the field of face recognition. 3) With the intrinsic incremental learning capability of SRC, it can actively adapt itself to the change of a sound database. The experimental results with the qualitative analysis illustrate the efficiency of the proposed method.

Fundamental Study on Algorithm Development for Prediction of Smoke Spread Distance Based on Deep Learning (딥러닝 기반의 연기 확산거리 예측을 위한 알고리즘 개발 기초연구)

  • Kim, Byeol;Hwang, Kwang-Il
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.27 no.1
    • /
    • pp.22-28
    • /
    • 2021
  • This is a basic study on the development of deep learning-based algorithms to detect smoke before the smoke detector operates in the event of a ship fire, analyze and utilize the detected data, and support fire suppression and evacuation activities by predicting the spread of smoke before it spreads to remote areas. Proposed algorithms were reviewed in accordance with the following procedures. As a first step, smoke images obtained through fire simulation were applied to the YOLO (You Only Look Once) model, which is a deep learning-based object detection algorithm. The mean average precision (mAP) of the trained YOLO model was measured to be 98.71%, and smoke was detected at a processing speed of 9 frames per second (FPS). The second step was to estimate the spread of smoke using the coordinates of the boundary box, from which was utilized to extract the smoke geometry from YOLO. This smoke geometry was then applied to the time series prediction algorithm, long short-term memory (LSTM). As a result, smoke spread data obtained from the coordinates of the boundary box between the estimated fire occurrence and 30 s were entered into the LSTM learning model to predict smoke spread data from 31 s to 90 s in the smoke image of a fast fire obtained from fire simulation. The average square root error between the estimated spread of smoke and its predicted value was 2.74.