• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2013.05a
• /
• pp.985-986
• /
• 2013

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2010.05a
• /
• pp.951-952
• /
• 2010

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.10a
• /
• pp.655-656
• /
• 2009

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2011.06a
• /
• pp.1595-1596
• /
• 2011

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

Structure-from-Motion(SfM), Multi-view Stereo(MVS)이 이용되는 3D Reconstruction 과정에서 생성된 3D 포인트 클라우드는 RGB 영상에 기반하여 생성되므로 실제 객체 혹은 Scene 과 달리 point 와 point 간에 존재하는 빈 공간이 발생한다. 이를 개선하기 위하여 3D 포인트 클라우드를 이용하여 3D Mesh 를 복원하는 Mesh Reconstruction 과정을 거치게 된다. 본 논문에서는 Mesh Reconstruction 과정에서 자유공간 지지도에 기반해 수정한 가중치를 이용하는 효율적인 방법을 제안한다. 실험을 통하여 제안한 알고리즘을 이용한 복원 결과가 기존보다 개선됨을 보인다.

• Journal of Broadcast Engineering
• /
• v.19 no.2
• /
• pp.250-256
• /
• 2014

Non-reference P frame coding is used to enhance coding efficiency in low-delay encoding configuration of Internet Video Coding (IVC), which is being standardized as a royalty-free video codec in MPEG. The existing method of non-reference P frame coding which was adopted in the reference Test Model of IVC (ITM) 4.0 adaptively applies a non-reference P frame with a fixed coding structure based on the magnitude of motion vectors (MVs), however, which unexpectedly degrades the coding efficiency for some sequences. In this paper, the existing non-reference P frame coding is improved by changing non-reference P frame coding structure and applying a new adaptive method using the ratio of the amount of generated bits of non-reference frames to that of reference frames as well as MVs. Experimental results show that the proposed non-reference P frame coding gives 6.6% BD-rate bit saving in average over ITM 7.0.

• Journal of Internet Computing and Services
• /
• v.17 no.4
• /
• pp.61-68
• /
• 2016

In this paper, an implementation method of augmented reality (AR) technology using Web 3.0 information services in the field of disaster response is proposed. The structure and characteristics of semantic web-based Web 3.0 are realized and a AR based mobile visual search (MVS) applied in the disaster sites is described. Based on Web 3.0 and AR MVS, a semantic web ontology oriented configuration scheme for disaster-related information and the communication scheme of information provided by AR technology are proposed. For the purpose of providing disaster-related and customized information to the disaster response site quickly and accurately, a method of leveraging Web 3.0 information services in AR technology is presented.

• Polymer(Korea)
• /
• v.29 no.2
• /
• pp.156-160
• /
• 2005

$\alpha,\omega-Vinyl$ poly (dimethyl-methylphenyl) siloxane prepolymer (VPMPS ) was prepared by the equilibrium polymerization of octamethylcyclotetrasiloxane $(D_4)$, 1,3,5-trimethyl-1,3,5-triphenylcyclotrisiloxane $(D_3^{Me,Ph)$, and 1,1,3,3-tetramethyl-1,3-divinyldisiloxane (MVS). And also, of $\alpha,\omega-hydrogen$ poly(dimethyl-methyl)siloxane prepolymer (HPDMS) as end blocker was prepared from octamethylcyclotetrasiloxane $(D_4)$, 1,3,5-trimethylcyclotrisiloxane $(D_3^:Me,H})$, and 1,1,3,3-tetramethyldisiloxane (MS). Nickel ferrite nanoparticles having spinel magnetic material was prepared by the sol-gel method using PAA as a chelating agent. Poly(organosiloxane) rubber nanocomposite containing silica and nickel ferrite ultrafine powder modified with 1,3-divinyltetramethyldisilazane (VMS) was prepared by compounding VPMPS, HPDMS, and catalyst in high speed dissolver. The mechanical properties, heat dissipating away characteristics, and volume resistivities for POX-30 and POX-50 were measured.

• Polymer(Korea)
• /
• v.29 no.2
• /
• pp.161-165
• /
• 2005

$\alpha,\omega-Vinyl$ poly(dimethyl-methylphenyl) siloxane propelymer (VPMPS ) was prepared by the equilibrium polymerization of octamethylcyclotetrasiloxane $(D_4)$, 1,3,5-trimethyl-1,3,5-triphenylcyclotrisiloxane $(D_3^{MePh})$, and 1,1,3,3-tetramethyl-1,3-divinylsiloxane (MVS) as end-blocker. And also, $\alpha,\omega-hydrogen$ poly(dimethyl-methyltrifluoropropyl)siloxane prepolymer (HPDMFS) was prepared from $D_4$, 1,3,5-trimethyl-1,3.5-trifluoropropylcyclotrisiloxane $(D_3^{MeF3P})$, and 1,1,3,3-tetramethyldisiloxane. Poly(organosiloxane) rubber composite containing high thermal conductive filler was prepared by compounding VPMPS, HPDMFS, spherical alumina, and catalyst in high speed dissolver. The crosslinking density of poly (organosiloxane) composite was measured by oscillation rheometer. Poly(organosiloxane) composites of TC-POXR-2 and TC-POXR-4 prepared by controlling average diameters of thermal conductive filler, spherical alumina according to Horsfield's packing model were shown to 1.13 W/mK for TC-POXR-2 and 1.19 W/mK for TC-POXR-4.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.575-581
• /
• 2010

With widespread use of the Internet and improvements in streaming media and compression technology, digital music, video, and image can be distributed instantaneously across the Internet to end-users. However, most conventional Digital Right Management are often not secure and not fast enough to process the vast amount of data generated by the multimedia applications to meet the real-time constraints. The SVC offers temporal, spatial, and SNR scalability to varying network bandwidth and different application needs. Meanwhile, for many multimedia services, security is an important component to restrict unauthorized content access and distribution. This suggests the need for new cryptography system implementations that can operate at SVC. In this paper, we propose a new scrambling encryption for reserving the characteristic of scalability in MPEG4-SVC. In the base layer, the proposed algorithm is applied and performed the selective scambling. And it encrypts various MVS and intra-mode scrambling in the enhancement layer. In the decryption, it decrypts each encrypted layers by using another encrypted keys. Throughout the experimental results, the proposed algorithms have low complexity in encryption and the robustness of communication errors.