• Title/Summary/Keyword: edge feature

Search Result 553, Processing Time 0.02 seconds

Automated Algorithm for Super Resolution(SR) using Satellite Images (위성영상을 이용한 Super Resolution(SR)을 위한 자동화 알고리즘)

  • Lee, S-Ra-El;Ko, Kyung-Sik;Park, Jong-Won
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.2
    • /
    • pp.209-216
    • /
    • 2018
  • High-resolution satellite imagery is used in diverse fields such as meteorological observation, topography observation, remote sensing (RS), military facility monitoring and protection of cultural heritage. In satellite imagery, low-resolution imagery can take place depending on the conditions of hardware (e.g., optical system, satellite operation altitude, image sensor, etc.) even though the images were obtained from the same satellite imaging system. Once a satellite is launched, the adjustment of the imaging system cannot be done to improve the resolution of the degraded images. Therefore, there should be a way to improve resolution, using the satellite imagery. In this study, a super resolution (SR) algorithm was adopted to improve resolution, using such low-resolution satellite imagery. The SR algorithm is an algorithm which enhances image resolution by matching multiple low-resolution images. In satellite imagery, however, it is difficult to get several images on the same region. To take care of this problem, this study performed the SR algorithm by calibrating geometric changes on images after applying automatic extraction of feature points and projection transform. As a result, a clear edge was found just like the SR results in which feature points were manually obtained.

Analysis of Shadow Effect on High Resolution Satellite Image Matching in Urban Area (도심지역의 고해상도 위성영상 정합에 대한 그림자 영향 분석)

  • Yeom, Jun Ho;Han, You Kyung;Kim, Yong Il
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.21 no.2
    • /
    • pp.93-98
    • /
    • 2013
  • Multi-temporal high resolution satellite images are essential data for efficient city analysis and monitoring. Yet even when acquired from the same location, identical sensors as well as different sensors, these multi-temporal images have a geometric inconsistency. Matching points between images, therefore, must be extracted to match the images. With images of an urban area, however, it is difficult to extract matching points accurately because buildings, trees, bridges, and other artificial objects cause shadows over a wide area, which have different intensities and directions in multi-temporal images. In this study, we analyze a shadow effect on image matching of high resolution satellite images in urban area using Scale-Invariant Feature Transform(SIFT), the representative matching points extraction method, and automatic shadow extraction method. The shadow segments are extracted using spatial and spectral attributes derived from the image segmentation. Also, we consider information of shadow adjacency with the building edge buffer. SIFT matching points extracted from shadow segments are eliminated from matching point pairs and then image matching is performed. Finally, we evaluate the quality of matching points and image matching results, visually and quantitatively, for the analysis of shadow effect on image matching of high resolution satellite image.

Emotion-based Video Scene Retrieval using Interactive Genetic Algorithm (대화형 유전자 알고리즘을 이용한 감성기반 비디오 장면 검색)

  • Yoo Hun-Woo;Cho Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.6
    • /
    • pp.514-528
    • /
    • 2004
  • An emotion-based video scene retrieval algorithm is proposed in this paper. First, abrupt/gradual shot boundaries are detected in the video clip representing a specific story Then, five video features such as 'average color histogram' 'average brightness', 'average edge histogram', 'average shot duration', and 'gradual change rate' are extracted from each of the videos and mapping between these features and the emotional space that user has in mind is achieved by an interactive genetic algorithm. Once the proposed algorithm has selected videos that contain the corresponding emotion from initial population of videos, feature vectors from the selected videos are regarded as chromosomes and a genetic crossover is applied over them. Next, new chromosomes after crossover and feature vectors in the database videos are compared based on the similarity function to obtain the most similar videos as solutions of the next generation. By iterating above procedures, new population of videos that user has in mind are retrieved. In order to show the validity of the proposed method, six example categories such as 'action', 'excitement', 'suspense', 'quietness', 'relaxation', 'happiness' are used as emotions for experiments. Over 300 commercial videos, retrieval results show 70% effectiveness in average.

Container Image Recognition using Fuzzy-based Noise Removal Method and ART2-based Self-Organizing Supervised Learning Algorithm (퍼지 기반 잡음 제거 방법과 ART2 기반 자가 생성 지도 학습 알고리즘을 이용한 컨테이너 인식 시스템)

  • Kim, Kwang-Baek;Heo, Gyeong-Yong;Woo, Young-Woon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.7
    • /
    • pp.1380-1386
    • /
    • 2007
  • This paper proposed an automatic recognition system of shipping container identifiers using fuzzy-based noise removal method and ART2-based self-organizing supervised learning algorithm. Generally, identifiers of a shipping container have a feature that the color of characters is blacker white. Considering such a feature, in a container image, all areas excepting areas with black or white colors are regarded as noises, and areas of identifiers and noises are discriminated by using a fuzzy-based noise detection method. Areas of identifiers are extracted by applying the edge detection by Sobel masking operation and the vertical and horizontal block extraction in turn to the noise-removed image. Extracted areas are binarized by using the iteration binarization algorithm, and individual identifiers are extracted by applying 8-directional contour tacking method. This paper proposed an ART2-based self-organizing supervised learning algorithm for the identifier recognition, which improves the performance of learning by applying generalized delta learning and Delta-bar-Delta algorithm. Experiments using real images of shipping containers showed that the proposed identifier extraction method and the ART2-based self-organizing supervised learning algorithm are more improved compared with the methods previously proposed.

Query-based Answer Extraction using Korean Dependency Parsing (의존 구문 분석을 이용한 질의 기반 정답 추출)

  • Lee, Dokyoung;Kim, Mintae;Kim, Wooju
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.3
    • /
    • pp.161-177
    • /
    • 2019
  • In this paper, we study the performance improvement of the answer extraction in Question-Answering system by using sentence dependency parsing result. The Question-Answering (QA) system consists of query analysis, which is a method of analyzing the user's query, and answer extraction, which is a method to extract appropriate answers in the document. And various studies have been conducted on two methods. In order to improve the performance of answer extraction, it is necessary to accurately reflect the grammatical information of sentences. In Korean, because word order structure is free and omission of sentence components is frequent, dependency parsing is a good way to analyze Korean syntax. Therefore, in this study, we improved the performance of the answer extraction by adding the features generated by dependency parsing analysis to the inputs of the answer extraction model (Bidirectional LSTM-CRF). The process of generating the dependency graph embedding consists of the steps of generating the dependency graph from the dependency parsing result and learning the embedding of the graph. In this study, we compared the performance of the answer extraction model when inputting basic word features generated without the dependency parsing and the performance of the model when inputting the addition of the Eojeol tag feature and dependency graph embedding feature. Since dependency parsing is performed on a basic unit of an Eojeol, which is a component of sentences separated by a space, the tag information of the Eojeol can be obtained as a result of the dependency parsing. The Eojeol tag feature means the tag information of the Eojeol. The process of generating the dependency graph embedding consists of the steps of generating the dependency graph from the dependency parsing result and learning the embedding of the graph. From the dependency parsing result, a graph is generated from the Eojeol to the node, the dependency between the Eojeol to the edge, and the Eojeol tag to the node label. In this process, an undirected graph is generated or a directed graph is generated according to whether or not the dependency relation direction is considered. To obtain the embedding of the graph, we used Graph2Vec, which is a method of finding the embedding of the graph by the subgraphs constituting a graph. We can specify the maximum path length between nodes in the process of finding subgraphs of a graph. If the maximum path length between nodes is 1, graph embedding is generated only by direct dependency between Eojeol, and graph embedding is generated including indirect dependencies as the maximum path length between nodes becomes larger. In the experiment, the maximum path length between nodes is adjusted differently from 1 to 3 depending on whether direction of dependency is considered or not, and the performance of answer extraction is measured. Experimental results show that both Eojeol tag feature and dependency graph embedding feature improve the performance of answer extraction. In particular, considering the direction of the dependency relation and extracting the dependency graph generated with the maximum path length of 1 in the subgraph extraction process in Graph2Vec as the input of the model, the highest answer extraction performance was shown. As a result of these experiments, we concluded that it is better to take into account the direction of dependence and to consider only the direct connection rather than the indirect dependence between the words. The significance of this study is as follows. First, we improved the performance of answer extraction by adding features using dependency parsing results, taking into account the characteristics of Korean, which is free of word order structure and omission of sentence components. Second, we generated feature of dependency parsing result by learning - based graph embedding method without defining the pattern of dependency between Eojeol. Future research directions are as follows. In this study, the features generated as a result of the dependency parsing are applied only to the answer extraction model in order to grasp the meaning. However, in the future, if the performance is confirmed by applying the features to various natural language processing models such as sentiment analysis or name entity recognition, the validity of the features can be verified more accurately.

The Method of Vanishing Point Estimation in Natural Environment using RANSAC (RANSAC을 이용한 실외 도로 환경의 소실점 예측 방법)

  • Weon, Sun-Hee;Joo, Sung-Il;Choi, Hyung-Il
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.9
    • /
    • pp.53-62
    • /
    • 2013
  • This paper proposes a method of automatically predicting the vanishing point for the purpose of detecting the road region from natural images. The proposed method stably detects the vanishing point in the road environment by analyzing the dominant orientation of the image and predicting the vanishing point to be at the position where the feature components of the image are concentrated. For this purpose, in the first stage, the image is partitioned into sub-blocks, an edge sample is selected randomly from within the sub-block, and RANSAC is applied for line fitting in order to analyze the dominant orientation of each sub-block. Once the dominant orientation has been detected for all blocks, we proceed to the second stage and randomly select line samples and apply RANSAC to perform the fitting of the intersection point, then measure the cost of the intersection model arising from each line and we predict the vanishing point to be located at the average point, based on the intersection point model with the highest cost. Lastly, quantitative and qualitative analyses are performed to verify the performance in various situations and prove the efficiency of the proposed algorithm for detecting the vanishing point.

HEALING PATTERNS OF THE ACELLULAR DERMAL MATRIX DEPEND ON GRAFT METHOD IN THE RABBIT EARS (가토의 귀에서 무세포성 진피 기질의 이식 방법에 따른 치유 양상)

  • Ryu, Jae-Young;Ryu, Sun-Youl
    • Maxillofacial Plastic and Reconstructive Surgery
    • /
    • v.31 no.3
    • /
    • pp.216-221
    • /
    • 2009
  • Purpose: The retention of the basement membrane complex, which was the unique feature of the acellular dermal matrix ($AlloDerm^{(R)}$), plays an important role in the normal process of wound healing. The present study was aimed to compare the healing of the acellular dermal matrix according to the graft method in the rabbit ear. Materials and methods: Six mature rabbits weighing about 3.0 kg were used, $10\;{\times}\;5\;mm$ sized subcutaneous pockets were created between the ear skin and the underlying perichondrium. In the control group, the acellular dermal matrix was grafted with the basement membrane facing toward the perichondrium. On the contrary, the acellular dermal matrix was grafted with the basement membrane facing toward the skin side in the experimental group I. In the experimental group II, the acellular dermal matrix was grafted like rolled configuration with basement membrane side in. The grafted site was picked at 3, 7, and 21 days after the graft. Serial sections were processed by H-E stain and examined under light microscopy to assess the healing patterns. Results: There was no distinct volume loss in the gross examination, but resorption was observed from the edge of the acellular dermal matrix in the histological examination. The space of resorption was replaced by the newly formed fibrous tissues and vessels. The inflammatory cells were more increased at 7 days after the graft than the early days. However, inflammation was decreased at 21 days after the graft. Regardless of the graft direction, no differences were observed between the control and the experimental group I in the healing patterns. Conclusion: These results suggest that the acellular dermal matrix can be used simply and effectively without regard to the graft direction as a substitute of autogenous material for repairing soft tissue defect.

3D surface Reconstruction of Moving Object Using Multi-Laser Stripes Irradiation (멀티 레이저 라인 조사를 이용한 비등속 이동물체의 3차원 형상 복원)

  • Yi, Young-Youl;Ye, Soo-Young;Nam, Ki-Gon
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.2 s.314
    • /
    • pp.144-152
    • /
    • 2007
  • We propose a 3D modeling method for surface inspection of non-linear moving object. The laser lines reflect the surface curvature. We can acquire 3D surface information by analyzing projected laser lines on object. ill this paper, we use multi-line laser to make use of robust of single stripe method and high speed of single frame. Binarization and channel edge extraction method were used for robust laser line extraction. A new labeling method was used for laser line labeling. We acquired sink information between each 3D reconstructed frame by feature point matching, and registered each frame to one whole image. We verified the superiority of proposed method by applying it to container damage inspection system.

A Study on the Production of a Convergence Color-Responsive Lighting Bookcase (색상에 반응하는 융복합 조명 책꽂이 제작에 관한 연구)

  • Kang, Hee-Ra
    • Journal of Digital Convergence
    • /
    • v.13 no.6
    • /
    • pp.267-273
    • /
    • 2015
  • Recently, a wide range of products incorporating cutting-edge technology are being introduced in various sectors of design. Belkin's WeMo or Phillips' Hue are representative examples. In this context, the color-responsive lighting bookcase is a design product that would satisfy the needs of contemporary consumers who seek entertainment in their purchases. By installing lightings that change color according to the user's behavior, this design reconceptualizes the bookcase as a source of entertainment rather than a mundane object of household furnishing. The lighting apparatus can be detached and reattached, serving as stand-alone equipment. The lighting bookcase is modularized, comprising extensions equipped with MCU (Micro Controller Unit), RGB LED and color sensors. The bookcase as a whole is extendable towards four directions up to nine units with the lighting bookcase at the center. The extended, multiple lighting bookcases are wired to receive power from the main bookcase, and are equipped with RGB LEDs but not with MCUs or color sensors. Receiving power and color signals from the main lighting bookcase, the sub-bookcases feature changing shades of color. Also, it includes IoT(internet of Things). This study is a proposal of a design product, modularized to control the shades of the bookcase lighting using these sensors.

Computer - Aided Korean Wood Identification (COMPUTER를 이용(利用)한 한국산(韓國産) 목재(木材)의 식별(識別)에 관(關)한 연구(硏究))

  • Lee, Won-Yong;Chun, Su-Kyoung
    • Journal of the Korean Wood Science and Technology
    • /
    • v.18 no.2
    • /
    • pp.49-66
    • /
    • 1990
  • In order to identify an unknown wood sample native to Korea. the softwood databases(KSWCHUN; Korean SoftWood CHUN) and the hardwood databases(KHWCHUN; Korean HardWood CHUN) had been built. and the new computer searching programs(IDINEX; IDentification INformation EXpress) has been written in Turbo Pascal(V.5.0) and in Macro Assembly(V.5.0). The characters of the data were based on the 74 features of softwood and on the 148 features of hardwood which are a part of new "IAWA list of microscopic features for hardwood identification" published in 1989. For the purpose of this investigation the wood anatomical nature of 25 species of softwood(13 genera of 5 families) and of 112 species of hardwood(57 genera of 31 families) were observed under a scanning electron microscope and light microscope. and a lot of literature used. The IDINEX programs are based on edge-punched card keys. with several improvements. The maximum number of features in the IDINEX is 229. but that is fixed for a given database. Large numbers of taxa are handled efficiently and new taxa easily added. A search may be based on sequence numbers of features. Comparisons are made sequentially by feature and taxon using the entire suite of features specified to produce the list of possible matching taxa. The results are followings. (1) The databases of Korean wood and the searching programs(IDINEX) had been built. (2) The databases of Korean wood could be an information to search an unknown wood. (3) The databases would be valuable. for the new features, which were not mentioned in Korean wood up to the present. were observed in details. (4) The ultrastructures of the cell walls(warty layer) and crystals observed under a scanning electron microscope will be helpful to search an unknown wood in particular. (5) The searching process is more quick and accurate than the others. 6) We can obtain the information on the differences of a species from the other and search an unknown wood using probability. in IDINEX, (7) The IDINEX will be utilized to identify and classify an animal life, vegetable world, mineral kingdom, and so on.

  • PDF