• Title/Summary/Keyword: Reverse-Update Data

Search Result 5, Processing Time 0.021 seconds

Reverse-Update Adversarial Data for Enhancing Adversarial Attack and Adversarial Training Performance (적대적 공격 및 방어 기술의 성능 향상을 위한 역방향 적대적 데이터 생성 연구)

  • Jung Yup Rhee;Wonyoung Cho;Leo Hyun Park;Taekyoung Kwon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.34 no.5
    • /
    • pp.981-991
    • /
    • 2024
  • Adversarial attacks, which induce malfunctions in AI technologies, can be applied to various domains and models, easily compromising SOTA (State-of-the-Art) models. Although adversarial defense techniques have been developed to counter these attacks, their applicability is limited due to constraints. Consequently, not only is the adoption of AI technology delayed, but also advanced research is restricted. To address this issue, this paper introduces a novel concept of adversarial data by reversing the sign of the loss function update in adversarial attacks. Experiments were conducted by applying the reverse-update adversarial data to data poisoning and adversarial training environments, showing that it can reduce the model's performance up to 72% and is most effective in enhancing robustness in 6 out of 9 environments. Ultimately, the proposed data can stimulate extensive research on adversarial attacks and defenses, further promoting the advancement of defense technology and contributing to the safe adoption of AI.

Automatic Local Update of Triangular Mesh Models Based on Measurement Point Clouds (측정된 점데이터 기반 삼각형망 곡면 메쉬 모델의 국부적 자동 수정)

  • Woo, Hyuck-Je;Lee, Jong-Dae;Lee, Kwan-H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.5
    • /
    • pp.335-343
    • /
    • 2006
  • Design changes for an original surface model are frequently required in a manufacturing area: for example, when the physical parts are modified or when the parts are partially manufactured from analogous shapes. In this case, an efficient 3D model updating method by locally adding scan data for the modified area is highly desirable. For this purpose, this paper presents a new procedure to update an initial model that is composed of combinatorial triangular facets based on a set of locally added point data. The initial surface model is first created from the initial point set by Tight Cocone, which is a water-tight surface reconstructor; and then the point cloud data for the updates is locally added onto the initial model maintaining the same coordinate system. In order to update the initial model, the special region on the initial surface that needs to be updated is recognized through the detection of the overlapping area between the initial model and the boundary of the newly added point cloud. After that, the initial surface model is eventually updated to the final output by replacing the recognized region with the newly added point cloud. The proposed method has been implemented and tested with several examples. This algorithm will be practically useful to modify the surface model with physical part changes and free-form surface design.

Registration multiple range views (복수의 거리영상 간의 변환계수의 추출)

  • 정도현;윤일동;이상욱
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.2
    • /
    • pp.52-62
    • /
    • 1997
  • To reconstruct the complete 3-D shape of an object, seveal range images form different viewpoints should be merged into a single model. The process of extraction of the transformation parameters between multiple range views is calle dregistration. In this paper, we propose a new algorithm to find the transformation parameters between multiple range views. Th eproposed algorithm consists of two step: initial estimation and iteratively update the transformation. To guess the initial transformation, we modify the principal axes by considering the projection effect, due to the difference fo viewpoints. Then, the following process is iterated: in order to extract the exact transformation parameters between the range views: For every point of the common region, find the nearest point among the neighborhood of the current corresponding point whose correspondency is defined by the reverse calibration of the range finder. Then, update the transformation to satisfy the new correspondencies. In order to evaluate the performance the proposed registration algorithm, some experiments are performed on real range data, acquired by space encoding range finder. The experimental results show that the proposed initial estimation accelerate the following iterative registration step.

  • PDF

Stable AMOLED Displays using a-Si:H Backplanes

  • Nathan, Arokia;Alexander, Stefan;Sakariya, Kapil;Servati, Peyman;Tao, Sheng;Striakhilev, Denis;Kumak, Anil;Sambandan, Sanjiv;Jafarabadiashtiani, Shahin;Vygranenko, Yuri
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.343-347
    • /
    • 2004
  • As a first demonstration of proven stability for a-Si, over 7000h of stability data for a high drive current a-Si AMOLED pixel driver circuit was presented at SID 2004. Also demonstrated was an AMOLED display operating at 6V using the IGNIS 4-T pixel driver circuit [1] and based on a top-emission reverse OLED architecture. In this paper, an update to that information is presented with test data that is representative of lifetime in excess of 25,000 hours taking into account pertinent acceleration factors, extracted from high current drive and high temperature stressing conditions. Lifetimes will continue to increase, given the high and ever-increasing OLED efficiency.

  • PDF

An Accelerated Simulated Annealing Method for B-spline Curve Fitting to Strip-shaped Scattered Points

  • Javidrad, Farhad
    • International Journal of CAD/CAM
    • /
    • v.12 no.1
    • /
    • pp.9-19
    • /
    • 2012
  • Generation of optimum planar B-spline curve in terms of minimum deviation and required fairness to approximate a target shape defined by a strip-shaped unorganized 2D point cloud is studied. It is proposed to use the location of control points as variables within the geometric optimization framework of point distance minimization. An adaptive simulated annealing heuristic optimization algorithm is developed to iteratively update an initial approximate curve towards the target shape. The new implementation comprises an adaptive cooling procedure in which the temperature change is adaptively dependent on the objective function evolution. It is shown that the proposed method results in an improved convergence speed when compared to the standard simulated annealing method. A couple of examples are included to show the applicability of the proposed method in the surface model reconstruction directly from point cloud data.