• 한국멀티미디어학회논문지
• /
• 제8권12호
• /
• pp.1572-1580
• /
• 2005

The common requirements for watermarking are usually invisibility, robustness, and capacity. We proposed the watermarking for 3D mesh model based on projection onto convex sets for invisibility and robustness among requirements. As such, a 3D mesh model is projected alternatively onto two convex sets until it converge a point. The robustness convex set is designed to be able to embed watermark into the distance distribution of vertices. The invisibility convex set is designed for the watermark to be invisible based on the limit range of vertex movement. The watermark can be extracted using the decision values and index that the watermark was embedded with. Experimental results verify that the watermarked mesh model has both robustness against mesh simplification, cropping, affine transformations, and vertex randomization and invisibility.

• 전자공학회논문지CI
• /
• 제43권2호
• /
• pp.81-92
• /
• 2006

본 논문에서는 3D 메쉬 모델에 대한 POCS 기반의 워터마킹 방법을 제안하였다. 제안한 방법에서는 워터마킹 시스템의 조건들 중 견고성 및 비가시성에 대한 볼록 집합을 설계한 후 3D 메쉬 모델의 꼭지점들을 이 두 집합들로 수렴 조건을 만족할 때 까지 반복 교대 투영한다. 견고성 제약 조건 집합은 각 꼭지점의 거리 분포에 워터마크를 삽입하는 방법에 의하여 정의되며, 비가시성 제약 조건 집합은 꼭지점 좌표의 변화량에 의하여 정의된다. 실험 결과로부터 제안한 방법이 좌표 변환, 스케일링, 메쉬 간단화, 절단, 및 꼭지점 잡음 첨가 등의 공격에 대한 우수한 견고성 및 비가시성을 확인하였다.

• 한국지반공학회:학술대회논문집
• /
• 한국지반공학회 2000년도 사면안정 학술발표회
• /
• pp.213-220
• /
• 2000

Numerical modeling of cut slope has some limits in simulating the real slopes. In the case of 2D analysis of slope stability, it is assumed that slope is simply straight even when it is concave or convex in plan view. In this study, 3D analysis in curved shape slopes has been conducted for the comparison with 2D analysis in terms of failure mode and factor of safety. For this, 3D analysis by FLAC3D was compared with 2D analysis in plane strain condition and axi-symmetric model condition by FLAC. It was also observed how safety factors of slopes were affected by the variation of the tensile strength and cohesion, which are important variables to decide whether the slope fails or not. 2D analysis of concave slopes under plane strain condition showed much smaller safety factors by 16-40 % errors depending on the radius of curvature of slopes, compared to the more realistic values from 3D analysis. In case of convex slopes, the lower values by 7-10 % has been reported. 2D analysis of axi-symmetric model showed also smaller safety factors by 6-10 % and by 2-4 %, in case of concave and convex slopes, respectively. Such results are expected to contribute to the better understanding of failure process and could be applied for improved design of slopes.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.397-410
• /
• 2007

Visualization of 2D and 3D data, which arises from some scientific phenomena, physical model or mathematical formula, in the form of curve or surface view is one of the important topics in Computer Graphics. The problem gets critically important when data possesses some inherent shape feature. For example, it may have positive feature in one instance and monotone in the other. This paper is concerned with the solution of similar problems when data has convex shape and its visualization is required to have similar inherent features to that of data. A rational cubic function [5] has been used for the review of visualization of 2D data. After that it has been generalized for the visualization of 3D data. Moreover, simple sufficient constraints are made on the free parameters in the description of rational bicubic functions to visualize the 3D convex data in the view of convex surfaces.

• 한국정밀공학회지
• /
• 제25권7호
• /
• pp.103-110
• /
• 2008

This paper presents a new approach of recognizing a 3D object using a single camera, based on the extended convex hull of its silhouette. It aims at minimizing the DB size and simplifying the processes for matching and feature extraction. For this purpose, two concepts are introduced: extended convex hull and measurable region. Extended convex hull consists of convex curved edges as well as convex polygons. Measurable region is the cluster of the viewing vectors of a camera represented as the points on the orientation sphere from which a specific set of surfaces can be measured. A measurable region is represented by the extended convex hull of the silhouette which can be obtained by viewing the object from the center of the measurable region. Each silhouette is represented by a relation graph where a node describes an edge using its type, length, reality, and components. Experimental results are included to show that the proposed algorithm works efficiently even when the objects are overlapped and partially occluded. The time complexity for searching the object model in the database is O(N) where N is the number of silhouette models.

• 한국의류산업학회지
• /
• 제12권4호
• /
• pp.467-476
• /
• 2010

The purpose of this study was to develop a plausible methodology based on experimental data how to set up darts and split lines on 3D parametric body dressed with tight-fit garment. The results were as following: Through the process of making convex hull, the concave parts were straightened to make a convex hull, especially in the center part of bust, under breast part and scapular part. To figure out the optimum positions of darts and split lines, the inflection points of curve ratio were searched along the horizontal polylines of waist and bust. This procedures produced reliable results with low deviation. Using Rapidform, CATIA and Unigraphics, six patches of bodice patterns were drawn and aligned. Paired t-test results showed the outline and area between 3D surface and 2D were not significantly different, meaning this method could be adaptable when flattening 3D surfaces. The amount of waist dart measured on the pattern showed that the highest portion was allocated on 2nd dart(back), followed by 1st dart(back), 1st dart(front), 2nd dart(front)/side dart, and center back dart. A series of findings suggested that curve ration inflection point could be used as a guide to set up darts and split line on 3D parametric model with low deviation.

• Architectural research
• /
• 제13권3호
• /
• pp.19-29
• /
• 2011

Visibility of a space have been defined in several different ways: such as the axial line covering a convex space, a convex space defining the fattest shape in a space and an Isovist field formed by a field of vision at a given vantage point. Isovist fields are referred to as a descriptive medium to describe a movement by reviewing and analyzing geometric properties in them. Many descriptive methods for analysis of three-dimensional isovist are applied to analyzing the morphological properties in a 3D space more realistically. Although these models are regarded as a more advanced method for describing spatial properties, they have pros and cons such as complex mathematical calculations and somewhat arbitrary calibration in addition to huge consumption of memory space. These difficulties lead to the development of a three-dimensional visual accessibility model that explores the implication of building shape on the calculation of isovist fields drawn on a 2D plane. We propose a conceptual framework of how to measure the isovist field not as a 3D volume but as a combination of 2D plane on the ground with the 3D building shape of it's facade.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2007년도 추계학술대회 논문집
• /
• pp.303-304
• /
• 2007

• 한국통신학회논문지
• /
• 제29권11C호
• /
• pp.1592-1599
• /
• 2004

본 논문에서는 POSC 기반의 3D 메쉬 워터마킹 방법을 제안하였다. 제안한 방법에서는 3D 메쉬를 두 가지의 제약 조건 집합으로 수렴 조건을 만족할 때까지 반복 투영한다. 이들 집합은 워터마크를 삽입하기 위한 강인성 집합 및 비가시성 집합으로 구성된다. 원 모델없이 워터마크를 추출하기 위하여 제안한 방법에서는 워터마크가 삽입되는 위치 정보 및 결정치를 이용한다. 실험 결과로부터 제안한 방법이 메쉬 간단화, 절단, 아핀 변환, 및 랜덤 잡음 첨가 등의 공격에 우수한 강인성을 가짐을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4484-4501
• /
• 2019

In this paper, we put forward a delay-aware secure maximum distance separable (MDS) coded caching scheme to resist the eavesdropping attacks for device-to-device (D2D) content sharing by combining MDS coding with distributed caching. In particular, we define the average system delay to show the potential coupling of delay-content awareness, and learn the secure constraints to ensure that randomly distributed eavesdroppers cannot obtain enough encoded packets to recover their desired contents. Accordingly, we model such a caching problem as an optimization problem to minimize the average system delay with secure constraints and simplify it to its convex relaxation. Then we develop a delay-aware secure MDS coded caching algorithm to obtain the optimal caching policy. Extensive numerical results are provided to demonstrate the excellent performance of our proposed algorithm. Compared with the random coded caching scheme, uniform coded caching scheme and popularity based coded caching scheme, our proposed scheme has 3.7%, 3.3% and 0.7% performance gains, respectively.