Kim, Sung-Yeol;Lee, Sang-Beom;Kim, Yoo-Kyung;Ho, Yo-Sung
Journal of Broadcast Engineering
/
v.11
no.4
s.33
/
pp.471-482
/
2006
In this paper, we propose a new scheme to generate multi-view images utilizing depth map decomposition and adaptive edge smoothing. After carrying out smooth filtering based on an adaptive window size to regions of edges in the depth map, we decompose the smoothed depth map into four types of images: regular mesh, object boundary, feature point, and number-of-layer images. Then, we generate 3-D scenes from the decomposed images using a 3-D mesh triangulation technique. Finally, we extract multi-view images from the reconstructed 3-D scenes by changing the position of a virtual camera in the 3-D space. Experimental results show that our scheme generates multi-view images successfully by minimizing a rubber-sheet problem using edge smoothing, and renders consecutive 3-D scenes in real time through information decomposition of depth maps. In addition, the proposed scheme can be used for 3-D applications that need the depth information, such as depth keying, since we can preserve the depth data unlike the previous unsymmetric filtering method.
Journal of the Korean Society of Marine Environment & Safety
/
v.24
no.5
/
pp.583-590
/
2018
The objective of this study is to present a resistance performance map developed using the dimension parameters of a bilge keel appendage attached to a fishing vessel using CFD. The dimension parameters consist of three length and breadth measures of a bilge keel appendage from nine selected cases. The size of a bilge keel attached to an existing ship should be 90 % of the ship length and 5 % of the ship breadth. In this study, bilge keels with a length of 63 %, 77 % and 90 % and a breadth of 5 %, 7 % and 9 % were considered based on ship length and breadth. The effective power in each of the nine cases was predicted using CFD. Based on results from an existing ship, effective power in the case with the shortest length and longest breath was reduced by 0.3 %. The case with the longest length and breadth showed an increase in effective power of 1.7 %. The case with the shortest length and breadth showed a decrease in effective power of 2.3 %. The proposed map can be utilized to select dimensions according to the sailing and work patterns of fishing vessels from the perspective of resistance performance.
In this paper, we propose a Dilated Convolution Gate Linear Unit (DCGLU) to mitigate the lack of sparsity and small receptive field problems caused by the segmentation map extraction process in sound event detection with weak labels. In the advent of deep learning framework, segmentation map extraction approaches have shown improved performance in noisy environments. However, these methods are forced to maintain the size of the feature map to extract the segmentation map as the model would be constructed without a pooling operation. As a result, the performance of these methods is deteriorated with a lack of sparsity and a small receptive field. To mitigate these problems, we utilize GLU to control the flow of information and Dilated Convolutional Neural Networks (DCNNs) to increase the receptive field without additional learning parameters. For the performance evaluation, we employ a URBAN-SED and self-organized bird sound dataset. The relevant experiments show that our proposed DCGLU model outperforms over other baselines. In particular, our method is shown to exhibit robustness against nature sound noises with three Signal to Noise Ratio (SNR) levels (20 dB, 10 dB and 0 dB).
Journal of the Institute of Electronics Engineers of Korea SP
/
v.42
no.4
s.304
/
pp.95-102
/
2005
In this paper, we propose a user friendly object-based image retrieval system using the interaction between cortex and hippocampus. Most existing ways of queries in content-based image retrieval rely on query by example or query by sketch. But these methods of queries are not adequate to needs of people's various queries because they are not easy for people to use and restrict. We propose a method of automatic color object extraction using CSB tree map(Color and Spatial based Binary をn map). Extracted objects were transformed to bit stream representing information such as color, size and location by region labelling algorithm and they are learned by the hippocampal neural network using the interplay between cortex and hippocampus. The cells of exciting at peculiar features in brain generate the special sign when people recognize some patterns. The existing neural networks treat each attribute of features evenly. Proposed hippocampal neural network makes an adaptive fast content-based image retrieval system using excitatory learning method that forwards important features to long-term memories and inhibitory teaming method that forwards unimportant features to short-term memories controlled by impression.
The procedural generation algorithm is an algorithm that automatically generates a content to be used in a game by repeatedly executing a series of rules. As the size of the game increases, the amount of content used in the game increases. Accordingly, artificial intelligence research is actively conducted to automatically generate game contents using game artificial intelligence such as procedural generation. In this paper, we propose an algorithm to create 3D game world using procedural generation. The proposed algorithm generates a two-dimensional contour in which the path is naturally connected using Perlin-Noise whose noise is gradually changed. A three-dimensional Height-Map is created based on the generated two-dimensional contour lines. The generated Height-Map show that the shape of the map is normal and that the player is able to move around all the sections as in the game world created by hand. In the future, we will improve the performance of algorithms and apply them to game.
Korean Journal of Agricultural and Forest Meteorology
/
v.24
no.4
/
pp.234-243
/
2022
In Korea, hail damage occurs every year, and in the case of agriculture, it causes severe field crop and cultivation facility losses. Therefore, it is necessary to develop a hail information service system customized for Korea's primary production and crop-growing areas to minimize hail damage. However, the observation of hail is relatively more difficult than that of other meteorological variables, and the available data are also spatially and temporally variable. A hail information service system was developed to understand the temporal and spatial distribution of hail occurrence. As part of this, a hail observation database was established that integrated the observation data from Korea Meteorological Administration with the information from newspaper reports. Furthermore, a hail risk map was produced based on this database. The risk map presented the nationwide distribution and characteristics of hail showers from 1970 to 2018, and the northeastern region of South Korea was found to be relatively dangerous. Overall, hail occurred nationwide, especially in the northeast and some inland areas (Gangwon, Gyeongbuk, and Chungbuk province) and in winter, mainly on the north coast and some inland areas as graupel (small and soft hail). Analyzing the time of day, frequency, and hailstone size of hail shower occurrences by region revealed that the incidence of large hail stones (e.g., 10 cm at Damyang-gun) has increased in recent years and that showers occurred mainly in the afternoon when the updraft was well formed. By integrating multidisciplinary data, the temporal and spatial gap in hail data could be supplemented. The hail risk map produced in this study will be helpful for the selection of suitable crops and growth management strategies under the changing climate conditions.
Journal of The Korean Association For Science Education
/
v.30
no.7
/
pp.901-907
/
2010
The purpose of this study is to analyze methods for measuring the size of the Earth, put forth in 6 different Korean 8th grade science textbooks. The research questions are as follows: 1) Do they adequately map out the experiments for measuring the size of the earth by using the concept of the sun's altitude? 2) Do they reduce the size of the sun like as the Earth is similarly downsized to the globe? 3) Do they suggest the precise experimental conditions for selecting two equal longitudinal spots for measuring the size of the earth? 4) Do they design adequate experiments for exact measurement? 5) Do they offer a proportional expression for seeking the size of globe which is easily understood by students? 6) Do they develop experiments to measure actual size of the earth? Four graduate students and one researcher took part in this study. All conditions were unanimously agreed upon by the participants. The results are as follows. First, one publishing company must include the concept of the sun's altitude to accurately measure the size of the Earth. However, some textbooks fail to mention this. As such, the concept of the sun's altitude must be introduced to accurately measure the size of the Earth. Second, a reduced size globe is used as the actual earth so; the sun should be factored in with a reduced light value. Third, you have to lay a stress on two points at the same longitude. In other words, a shadow located at the same longitude from two randomly selected points. Most textbooks mention two points at the same longitude but two of them design the experiment with a shadow at the same longitude. Fourth, we need a method to precisely measure the angle between a stick and its shadow. The angle between the stick and the tip of its shadow is the sun's altitude difference. Fifth, we need to present more specific proportional expressions for calculating the size of the globe. Only 3 out of the 6 texts employed a proportional expression. Sixth, we need to calculate the size of the earth by accurately presenting the scale of the globe to attain the goal of the experiment. Two of the texts analyzed, designed the experiment for the purpose of calculating the size of the globe. Three of the texts designed their experiments to calculate the radius of globe which is not even relevant to the purpose of experiment.
Recently much research for developing forwarding table that support fast router without employing both special hardware and new protocols. This article introduces a new forwarding data structure based on the software to enable forwarding lookup to be penormed at giga-bit speed. The forwarding table is known as a bottleneck of the routers penormance due to its high complexity proportional to the forwarding table size. The recent research that based on the software uses a Patricia trie and its variants. and also uses a hash function with prefix length key and others. The proposed forwarding table structure construct a forwarding table by the bit stream array in which it constructs trie from routing table prefix entries and it represents each pointer pointing the child node and the associated forwarding table entry with one bit The trie structure and routing prefix pointer need a large memory when representing those by linked-list or array. but in the proposed data structure, the needed memory size is small enough since it represents information with one bit. Additionally, by use a lookup method that start searching at desired middle level we can shorten the search path. The introduced data structure. called bit-map trie shows that we can implement a fast forwarding engine on the conventional Pentium processor by reducing the backbone routing table fits into Level 2 cache of Pentium II processor and shortens the searching path. Our experiments to evaluate the performance of proposed method show that this bit-map trie accomplishes 5.7 million lookups per second.
Journal of the Korean Society of Environmental Restoration Technology
/
v.11
no.3
/
pp.94-106
/
2008
As populations inhabiting in natural ecosystem are fragmented by artificial barriers and habitats are destructed by development, extinction possibility of species is getting higher. It is necessary to design and to manage conservation areas and corridors considering animals' movement and migration for sustainable species diversity in present circumstances. 'Least-cost modeling' is one commonly employed approach in which dispersal costs are assigned to distinct habitat types and the last-costly dispersal paths among habitat patches are calculated using a geographical information system (GIS). This study aims to design ecological corridor using least-cost path method and to apply it to a regional ecological network considering movability of medium-large size mammals. This study was carried out over the metropolitan area, which has been deforested by rapid urbanization. Nevertheless there is connected with Gangwon province, Baekdudaegan mountain range and DMZ, considered where many forest species can migrate to this region. This study employs such an approach to develop least-cost path models for medium-large size mammals, have inhabited for this entire region. Considering those species, two forest areas as a source of species supply and forest areas more than 1,000ha are selected as focal forest areas. Movement and migration paths from species supply sources to focal forest areas are calculated by applying landscape permeability theory using land cover map, road density map and land slope map. Results showed least-cost paths from species supply sources to focal forest areas on two species. Wildcat and roe deer are different in some least-cost paths caused by their landscape permeability but paths show generally same specifics. The result of considering regional distribution of expected movement and migration paths to regional ecological network, low altitude mountains of western metropolitan area are evaluated important area for species connectivity. In national or regional levels ecological connectivity is essential to promote species diversity and to preserve integrated ecosystem. This study concludes that developing least-cost models from similar empirical data could significantly improve the utility of these tools.
The effects of artificial interference on the vegetation landscape in Mt. Nam of Seoul, Korea were clarified by analysing the distribution of vegetation landscape element and the number and size of patch depicted as a vegetation map in terms of landscape ecological principles. The effects of artificial interference on vegetation were also confirmed from the environmental gradient analysis on plant community extended from the lowland to the peak of that mountain. Vegetation landscape elements were divided into plantation and secondary forest in actual vegtation map. The ratio of plantation to secondary forest was higher in the lowland below mid-slope and the southern slope. Most afforested land were occupied by Robinia pseudoacacia and Populus tomentoglandulosa, Pinus rigida, P. koraiensis, Metasequoia glyptostroboides, Alnus hirsuta and so on are localy planted. In addition, projects to replace those afforested trees by P. densiflora as a kind of campaign for "Restoration of the one original feature of Mt. Nam" or to replace those tree species by planting young Abies holophylla or P. koraiensis under the mature afforested trees are also carried out in recent years. In cases of secondary forest, the southern slope was dominated by P. densiflora and the northern one by Q. mongolica. But the lowland of the northern slope is dominated by P. densiflora as the same as that in the southern slope. Vegetation landscape elements in Mt. Nam were much simplified comparing with that of suburban area around Seoul. The number of patches, which reflects the degree of diverse artificial interference was more in the lower area than in the upper area and more in the southern slope than in the northern one. On the other hand, the size of patch showed the antagonistic tendency to that of the number of patch. As a result of environmental gradient analysis, vegetation distribution in Mt. Nam was different from that in suburban area around Seoul. For example, Alnus japonica community, Zelkova serrata community, and Carpinus laxiflora community, which is established in mountain comparatively rare in artificial interference disappeared in Mt. Nam. As a result of analysis on vegetational succession in P. densiflora community and Q. mongolica community, both communities showed a tendency of retrogressive succession differently from that in control site located in suburban area around Seoul. In addition, species composition of P. densiflora and Q. mongolica communities in Mt. Nam were also different from those in Mt. Surak located around Seoul. It was interpreted that those results were originated from the environmental pollution and excessive arti ficial interferences.rferences.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.