• Title/Summary/Keyword: Global distortion

Search Result 103, Processing Time 0.022 seconds

KNOWLEDGE-BASED BOUNDARY EXTRACTION OF MULTI-CLASSES OBJECTS

  • Park, Hae-Chul;Shin, Ho-Chul;Lee, Jin-Sung;Cho, Ju-Hyun;Kim, Seong-Dae
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.1968-1971
    • /
    • 2003
  • We propose a knowledge-based algorithm for extracting an object boundary from low-quality image like the forward looking infrared image. With the multi-classes training data set, the global shape is modeled by multispace KL(MKL)[1] and curvature model. And the objective function for fitting the deformable boundary template represented by the shape model to true boundary in an input image is formulated by Bales rule. Simulation results show that our method has more accurateness in case of multi-classes training set and performs better in the sense of computation cost than point distribution model(PDM)[2]. It works well in distortion under the noise, pose variation and some kinds of occlusions.

  • PDF

A novel approach to design of local quantizers for distributed estimation

  • Kim, Yoon Hak
    • Journal of IKEEE
    • /
    • v.22 no.3
    • /
    • pp.558-564
    • /
    • 2018
  • In distributed estimation where each node can collect only partial information on the parameter of interest without communication between nodes and quantize it before transmission to a fusion node which conducts estimation of the parameter, we consider a novel quantization technique employed at local nodes. It should be noted that the performance can be greatly improved if each node can transmit its measurement to one designated node (namely, head node) which can quantize its estimate using the total rate available in the system. For this case, the best strategy at the head node would be simply to partition the parameter space using the generalized Lloyd algorithm, producing the global codewords, one of which is closest to the estimate is transmitted to a fusion node. In this paper, we propose an iterative design algorithm that seeks to efficiently assign the codewords into each of quantization partitions at nodes so as to achieve the performance close to that of the system with the head node. We show through extensive experiments that the proposed algorithm offers a performance improvement in rate-distortion perspective as compared with previous novel techniques.

Compression of 3D Mesh Geometry and Vertex Attributes for Mobile Graphics

  • Lee, Jong-Seok;Choe, Sung-Yul;Lee, Seung-Yong
    • Journal of Computing Science and Engineering
    • /
    • v.4 no.3
    • /
    • pp.207-224
    • /
    • 2010
  • This paper presents a compression scheme for mesh geometry, which is suitable for mobile graphics. The main focus is to enable real-time decoding of compressed vertex positions while providing reasonable compression ratios. Our scheme is based on local quantization of vertex positions with mesh partitioning. To prevent visual seams along the partitioning boundaries, we constrain the locally quantized cells of all mesh partitions to have the same size and aligned local axes. We propose a mesh partitioning algorithm to minimize the size of locally quantized cells, which relates to the distortion of a restored mesh. Vertex coordinates are stored in main memory and transmitted to graphics hardware for rendering in the quantized form, saving memory space and system bus bandwidth. Decoding operation is combined with model geometry transformation, and the only overhead to restore vertex positions is one matrix multiplication for each mesh partition. In our experiments, a 32-bit floating point vertex coordinate is quantized into an 8-bit integer, which is the smallest data size supported in a mobile graphics library. With this setting, the distortions of the restored meshes are comparable to 11-bit global quantization of vertex coordinates. We also apply the proposed approach to compression of vertex attributes, such as vertex normals and texture coordinates, and show that gains similar to vertex geometry can be obtained through local quantization with mesh partitioning.

Adaptive Subdivision for Geometry Coding of 3D Meshes (적응형 세분화를 이용한 3D 메쉬의 기하데이타 압축)

  • Lee Hae-Young
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.8
    • /
    • pp.547-553
    • /
    • 2006
  • We present a new geometry coding method for 3D meshes, an adaptive subdivision. Previous localized geometry coding methods have demonstrated better compression ratios than the global approach but they are considered hard to use in practice partly due to time - consuming quantization. Our new localized scheme replaces this quantization with an adaptive subdivision of the localized range. The deeper level a user chooses, the closer to the original the mesh will be restored. We also present an improved connectivity coder upon the current leading Angle-Analyzer's by applying a context-modeling. As a result, our new coder provides reliable and intuitive controls between bit-rate and distortion without losing efficiency.

Domain Mapping using Nonlinear Finite Element Formulation

  • Patro, Tangudu Srinivas;Voruganti, Hari K.;Dasgupta, Bhaskar;Basu, Sumit
    • International Journal of CAD/CAM
    • /
    • v.8 no.1
    • /
    • pp.29-36
    • /
    • 2009
  • Domain mapping is a bijective transformation of one domain to another, usually from a complicated general domain to a chosen convex domain. This is directly useful in many application problems like shape modeling, morphing, texture mapping, shape matching, remeshing, path planning etc. A new approach considering the domain as made up of structural elements, like membranes or trusses, is developed and implemented using the nonlinear finite element formulation. The mapping is performed in two stages, boundary mapping and inside mapping. The boundary of the 3-D domain is mapped to the surface of a convex domain (in this case, a sphere) in the first stage and then the displacement/distortion of this boundary is used as boundary conditions for mapping the interior of the domain in the second stage. This is a general method and it develops a bijective mapping in all cases with judicious choice of material properties and finite element analysis. The consistent global parameterization produced by this method for an arbitrary genus zero closed surface is useful in shape modeling. Results are convincing to accept this finite element structural approach for domain mapping as a good method for many purposes.

Study on Collage Techniques Applied to Contemporary Fashion (현대패션에 수용된 콜라주의 표현기법에 관한 연구)

  • Kim, Sun-Young
    • The Research Journal of the Costume Culture
    • /
    • v.20 no.2
    • /
    • pp.129-143
    • /
    • 2012
  • This study focuses on the application of collage techniques to contemporary fashion and intends to show that collage techniques have a significant influence on contemporary fashion, leading to a more creative design aesthetic through the combination of fashion and art. The author carried out an empirical analysis focusing on domestic and global fashion collections from 2000S/S to 2010F/W, fashion publications, and internet data, along with a literature review. As a result, the papier-colle approach, as represented by cubism, showed a creative surface effect through the texture of the paper itself by applying real paper and other materials directly to the clothing items. Second, Dadaist ready-made expressed a distortion of the material and freedom of expression by creating a collage with ready-made fashion items and daily necessities. Third, a photomontage expressed unique images by printing various images of photos that contrasted in perspective. In addition to this, beauty in dissonance and a new sense of space by a collage of disparate material. Fourth, decalcomanie was expressed by printing methods, giving a stable image of the symmetry of the perfect landscape as well as the unintended effect of coincidence in abstract images and particular textures. Fifth, assemblage as the representative collage technique of pop art introduced the overall object itself or modified form by combining it with fashion to express three-dimensional aggregate structures.

The Humorous Beauty of Makeup Shown in TV Entertainment Programs (TV 오락프로그램에 나타난 메이크업의 해학미)

  • Kim, Min-Shin;Chae, Keum-Seok
    • Journal of the Korea Fashion and Costume Design Association
    • /
    • v.16 no.2
    • /
    • pp.127-137
    • /
    • 2014
  • The following are summary and result of this study. The purpose of this study was to research into TV makeup types focusing on Korean aesthetics with recognizing importance of Korean thought amid what the global interest pays attention to South Korea thanks to the recent influence of Hanryu(Korean wave). The humorous beauty reflects Korean people's optimistic attitude dubbed the realization of joy, anger, sorrow, and pleasure through opposition and convergence in ambivalent emotion with the superb attitude available for escaping from a stoic life. This is being indicated in the shocking form of embracing the avant-garde experiment through transforming and distorting by positively accepting humor and ugliness, which are the form of distortion and exaggeration, which strive for departing from sorrow through TV entertainment programs. This trend is being shown similarly to the tendency of giving mental satisfaction to human being with amusement while accepting ugliness as new beauty with the de-centralized recognition in the late 20th century. Accordingly, as the makeup of focusing on presenting character begins to be noted even in makeup, the similarity was being shown to the recent trend. This study is expected to contribute to continuous development in our country's makeup and TV broadcasting art field by being expanded the atmosphere of more systematic and in-depth research.

  • PDF

MPEG-4 Video Rate Control Algorithm using SOFM-Based Neural Classifier (SOFM 신경망 분류기를 이용한 MPEG-4 비디오 전송률 제어)

  • Park, Gwang-Hoon;Lee, Yoon-Jin
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.7
    • /
    • pp.425-435
    • /
    • 2002
  • This paper introduces a macroblock-based rate control algorithm using the neural classifier based in Self Organization feature Maps (SOFM). In contrast to the conventional rate control methods based on the mathematical rate distortion (RD) model and the feedback regression, proposed method can actively adapt to the rapid-varying image characteristics by establishing the global model for bitrate control and by using the SOFM based neural classifier to manage that model. Proposed rate control algorithm has 0.2 dB ~ 0.6 dB better performances than MPEG-4 macroblock-based rate control algorithm by evaluating with the encoded Peak Signal to Noise Ratios while maintaining similar overall computational complexity.

Development of Monthly Hydrological Cycle Assessment System Using Dynamic Water Balance Model Based on Budyko Framework (Budyko 프레임워크 기반 동적 물수지 모형을 활용한 월 단위 물순환 평가체계 개발)

  • Kim, Kyeung;Hwang, Soonho;Jun, Sang-Min;Lee, Hyunji;Kim, Sinae;Kang, Moon Seong
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.64 no.2
    • /
    • pp.71-83
    • /
    • 2022
  • In this study, an indicator and assessment system for evaluating the monthly hydrological cycle was prepared using simple factors such as the landuse status of the watershed and topographic characteristics to the dynamic water balance model (DWBM) based on the Budyko framework. The parameters a1 of DWBM are introduced as hydrologic cycle indicators. An indicator estimation regression model was developed using watershed characteristics data for the introduced indicator, and an assessment system was prepared through K-means cluster analysis. The hydrological cycle assessment system developed in this study can assess the hydrological cycle with simple data such as land use, CN, and watershed slope, so it can quickly assess changes in hydrological cycle factors in the past and present. Because of this advantage is expected that the developed assessment system can predict changes in the hydrological cycle and use an auxiliary tool for policymaking.