• Journal of the Korean Society for Library and Information Science
• /
• v.44 no.3
• /
• pp.117-135
• /
• 2010

This study investigated how college students seek and use information sources in their everyday lives. A total of 360 students from twelve colleges located in Seoul were randomly selected and participated in this study. The survey asked them what kind of information sources they use in their everyday life and what differences it has when they seek the information sources for their decision making time. Various criteria for evaluating information sources were reviewed to adopt in this study and collected data were analyzed using SPSS 17.0.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.425-428
• /
• 2002

본 논문에서는 한 장의 정면 얼굴 영상만으로 회전 변형을 수행할 수 있는 새로운 영상기반렌더링(Image Based Rendering, IBR) 기법을 제안한다. 3차원 기하학적 모델을 대신하면서 수평 회전 변형을 연출하기 위해, 특정 인물의 정면, 좌우 반측면, 좌우 측면의 얼굴 영상에 대한 표준 메쉬 집합을 작성한다. 변형하고자 하는 임의의 인물에 대해서는 정면 영상에 대한 메쉬만을 작성하고, 나머지 측면 참조 메쉬들은 표준 메쉬 집합에 의해 자동으로 생성된다. 입체적인 회전 효과를 연출하기 위해, 회전 변형시 발생할 수 있는 제어점들간의 중첩 및 역전을 허용하도록 기존의 두 단계 메쉬워프 알고리즘을 개선한 역전가능 메쉬워프 알고리즘(invertible meshwarp algorithm)을 제안한다. 이 알고리즘을 이용하여 다양한 남녀노소의 정면 얼굴 영상에 대해 회전에 따른 포즈 변형을 수행하여 비교적 자연스러운 포즈 변형 결과를 얻었다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.9
• /
• pp.237-246
• /
• 2016

DIBR (Depth Image Based Rendering) is a multimedia technology that generates the virtual multi-view images using a color image and a depth image, and it is used for creating glasses-less 3-dimensional display contents. This research describes the effect of depth accuracy about the objective quality of DIBR-based multi-view images. It first evaluated the minimum depth quantization bit that enables the minimum distortion so that people cannot recognize the quality degradation. It then presented the comparative analysis of non-uniform domain-division quantization versus regular linear quantization to find out how effectively express the accuracy of the depth information in same quantization levels according to scene properties.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.1213-1215
• /
• 2022

몰입형 비디오 부호화를 위한 MIV(MPEG Immersive Video) 표준은 제한된 3D 공간의 다양한 위치의 뷰(view)들을 효율적으로 압축하여 사용자에게 임의의 위치 및 방향에 대한 6 자유도(6DoF)의 몰입감을 제공한다. MIV 의 참조 소프트웨어인 TMIV(Test Model for Immersive Video)에서는 복수의 뷰 간 중복되는 영역을 제거하여 전송할 화소수를 줄이기 때문에 복호화기에서 렌더링(rendering)을 위해서 각 화소의 점유(occupancy) 정보도 전송되어야 한다. TMIV 는 점유맵을 깊이(depth) 아틀라스(atlas)에 포함하여 압축 전송하고, 부호화 오류로 인한 점유 정보 손실을 방지하기 위해 깊이값 표현을 위한 동적 범위의 일부를 보호대역(guard band)으로 할당한다. 이 보호대역을 줄여서 더 넓은 깊이값의 동적 범위를 사용하면 렌더링 화질을 개선시킬 수 있다. 따라서, 본 논문에서는 현재 TMIV 의 점유 정보 오류 분석을 바탕으로 이를 보정하는 기법을 제시하고, 깊이 동적 범위 확장에 따른 부호화 성능을 분석한다. 제안기법은 기존의 TMIV 와 비교하여 평균 1.3%의 BD-rate 성능 향상을 보여준다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.860-863
• /
• 2008

플래시 메모리는 우리 생활에 널리 사용되고 있는 휴대용 저장장치 중의 하나이다. 빠른 입출력 속도와 저전력, 무소음, 작은 크기 등의 장점을 가지나 덮어쓰기가 불가능하고 읽기/쓰기의 속도에 비해 소거 연산의 속도가 매우 느리다는 단점이 있다. 이를 보완하기 위해, 호스트와 플래시 메모리 사이에 버퍼 캐시를 두어 사용하고 있으며, 버퍼 캐시에 사용되는 교체 정책에 따라 플래시 메모리 장치의 성능이 크게 영향을 받는다. 본 논문에서는 블록 단위의 LRU 기법의 단점을 개선한 HPLRU 기법을 제안한다. HPLRU 기법은 최근에 자주 참조되었던 페이지인 핫 페이지 들을 모아 리스트를 만들어 관리하고, 이를 통해 페이지 적중률을 향상시키고 다른 페이지들로 인해 핫 페이지들이 소거되는 현상을 개선하였다. 이 알고리즘은 임의 데이터 패턴에 좋은 성능을 보이며 쓰기 발생 횟수를 많이 감소시키는 결과를 보였다.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_1
• /
• pp.1371-1383
• /
• 2022

In this study, the amount of coal waste dump was calculated using six Digital Elevation Models (DEMs) produced between 2006 and 2018 in Jangseong-dong, Taebaek-si, Gangwon-do, and the subsidence was observed by applying the Persistent Scatterer Interferometric SAR (PSInSAR) technique on the Sentinel-1 SAR images. As a result of depositing activities using DEMs, a total of 1,668,980 m³ of coal waste was deposited over a period of about 12 years from 2006 to 2018. The observed subsidence rate from PSInSAR was -32.3 mm/yr and -40.2 mm/yr from the ascending and descending orbits, respectively. As the thickness of the waste pile increased, the rate of subsidence increased, and the more recent the completion of the deposit, the faster the subsidence tended to occur. The subsidence rates from the ascending and descending orbits were converted to vertical and horizontal east-west components, and 22 random reference points were set to compare the subsidence rate, the waste rock thickness, and the time of depositing completion. As a result, the subsidence rate of the reference point tended to increase as the thickness of the waste became thicker, similar to the PSInSAR results in relation to the waste thickness. On the other hand, there was no clear correlation between the completion time of the deposits and the rate Of subsidence at the reference points. This is because the time of completion of the deposits at all but 5 of the 22 reference points was too biased in 2010 and the correlation analysis was meaningless. As in this study, the use of DEM and PSInSAR is expected to be an effective alternative to compensate for the lack of field data in the safety management of coal waste deposits.

• Journal of Korean Society of Transportation
• /
• v.24 no.7 s.93
• /
• pp.27-40
• /
• 2006

The traffic information is provided, which based on the volume of traffic, speed, occupancy collected through the currently operating Vehicle Detector System(VDS). In addition to the trend in utilization fold of traffic information is increasing gradually with the applied various fields and users. Missing data in Vehicle detector data means series of data transmitted to controller without specific property. The missing data does not have a data property, so excluded at the whole data Process Hence, increasing ratio of missing data in VDS data inflicts unreliable representation of actual traffic situation. This study presented the imputation process due out which applied the methodologies that utilized adjacent stations reference and historical data utilize about missing data. Applied imputation process methodologies to VDS data or SeoHaeAn/Kyongbu Expressway, currently operation VDS, after processes at missing data ratio of an option. Imputation process held presented to per lane-30seconds-period, and morning/afternoon/daily time scope ranges classified, and analyzed an error of imputed data preparing for actual data. The analysis results, an low error occurred relatively in the results of the imputation process way that utilized a historical data compare with adjacent stations reference methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.85-91
• /
• 2015

This paper presents a novel frame rate up-conversion (FRUC) algorithm. Existing algorithms, in general, employ rectangular blocks for motion estimation and arbitrary shape of an actual object region cannot be precisely represented. On the other hand, the proposed wedge-shaped block partitioning algorithm partitions a rectangular block into two wedge-shaped blocks using the texture information, which makes better approximation for an actual object region. The wedge-shaped block partitioning algorithm as well as the adaptive motion vector prediction algorithm is used to reliably estimate the actual motion. Experimental results show that the proposed FRUC algorithm is superior to existing algorithms up to 1.988dB in PSNR and 0.0167 in SSIM comparisons.

• The Journal of the Korea Contents Association
• /
• v.16 no.8
• /
• pp.706-716
• /
• 2016

Because of efficient space utilization and fast key search times, B-trees have been widely accepted for the use of indexes in HDD-based DBMSs. However, when the B-ree is stored in flash memory, its costly operations of node updates may impair the performance of a DBMS. This is because the random updates in B-tree's leaf nodes could tremendously enlarge I/O costs for the garbage collecting actions of flash storage. To solve the problem, we make all the parents of leaf nodes the virtual nodes, which are not stored physically. Rather than, those nodes are dynamically generated and buffered by referring to their child nodes, at their access times during key searching. By performing node updates and tree reconstruction within a single flash block, our proposed B-tree can reduce the I/O costs for garbage collection and update operations in flash. Moreover, our scheme provides the better performance of key searches, compared with earlier flash-based B-trees. Through a mathematical performance model, we verify the performance advantages of the proposed flash B-tree.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.8
• /
• pp.472-483
• /
• 2002

This paper presents the design and implementation of a cache file system, umcFS, which is specifically designed to provide an efficient caching and transmission of streaming media. The proposed file system is based on the concept of file disk and implemented as an application level on top of a general-purpose file system. The file disk favors the continuity of cached media and provides an efficient I/O mechanism for cache server. umcFS statically allocates control blocks as well as media cache blocks. These blocks are referenced by the single-level indirect management structure. As the file system is designed as an application level, it is easy to develop and port to other systems. The performance of the implemented system shows that umcFS performs about 13% better than the native file system in randomly accessing the cache blocks of 1024KB.