• Title/Summary/Keyword: Intermediate Feature

Search Result 87, Processing Time 0.071 seconds

Molecular Dynamics of the M intermediate of photoactive yellow protein in solution

  • Sakurai, Minoru;Shiozawa, Mariko;Arai, Shohei;Inoue, Yoshio;Kamiya, Narutoshi;Higo, Junichi
    • Journal of Photoscience
    • /
    • v.9 no.2
    • /
    • pp.134-137
    • /
    • 2002
  • PYP consists of a water-soluble apoprotein and 4-hydroxycinnamyl chromophore bound to Cys69 via thiolester linkage, Upon absorption of a photon, the photocycle is initiated, leading to formation of several photo-intermediates. Among them, M intermediate is important to understand the signal transduction mechanism of PYP, because it is a putative signaling state. As well known, the dynamics of a protein is closely correlated with the occurrence of its function. Here we report the results of IO ns molecular dynamics (MD) simulation for the M intermediate in aqueous solution and discuss the characteristic feature of this state from a viewpoint of structural fluctuation.

  • PDF

Design of a Feature-based Multi-viewpoint Design Automation System

  • Lee, Kwang-Hoon;McMahon, Chris A.;Lee, Kwan-H.
    • International Journal of CAD/CAM
    • /
    • v.3 no.1_2
    • /
    • pp.67-75
    • /
    • 2003
  • Viewpoint-dependent feature-based modelling in computer-aided design is developed for the purposes of supporting engineering design representation and automation. The approach of this paper uses a combination of a multi-level modelling approach. This has two stages of mapping between models, and the multi-level model approach is implemented in three-level architecture. Top of this level is a feature-based description for each viewpoint, comprising a combination of form features and other features such as loads and constraints for analysis. The middle level is an executable representation of the feature model. The bottom of this multi-level modelling is a evaluation of a feature-based CAD model obtained by executable feature representations defined in the middle level. The mappings involved in the system comprise firstly, mapping between the top level feature representations associated with different viewpoints, for example for the geometric simplification and addition of boundary conditions associated with moving from a design model to an analysis model, and secondly mapping between the top level and the middle level representations in which the feature model is transformed into the executable representation. Because an executable representation is used as the intermediate layer, the low level evaluation can be active. The example will be implemented with an analysis model which is evaluated and for which results are output. This multi-level modelling approach will be investigated within the framework aimed for the design automation with a feature-based model.

Domain Adaptation Image Classification Based on Multi-sparse Representation

  • Zhang, Xu;Wang, Xiaofeng;Du, Yue;Qin, Xiaoyan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.5
    • /
    • pp.2590-2606
    • /
    • 2017
  • Generally, research of classical image classification algorithms assume that training data and testing data are derived from the same domain with the same distribution. Unfortunately, in practical applications, this assumption is rarely met. Aiming at the problem, a domain adaption image classification approach based on multi-sparse representation is proposed in this paper. The existences of intermediate domains are hypothesized between the source and target domains. And each intermediate subspace is modeled through online dictionary learning with target data updating. On the one hand, the reconstruction error of the target data is guaranteed, on the other, the transition from the source domain to the target domain is as smooth as possible. An augmented feature representation produced by invariant sparse codes across the source, intermediate and target domain dictionaries is employed for across domain recognition. Experimental results verify the effectiveness of the proposed algorithm.

Feature-Based Multi-Resolution Modeling of Solids Using History-Based Boolean Operations - Part I : Theory of History-Based Boolean Operations -

  • Lee Sang Hun;Lee Kyu-Yeul;Woo Yoonwhan;Lee Kang-Soo
    • Journal of Mechanical Science and Technology
    • /
    • v.19 no.2
    • /
    • pp.549-557
    • /
    • 2005
  • The requirements of multi-resolution models of feature-based solids, which represent an object at many levels of feature detail, are increasing for engineering purposes, such as analysis, network-based collaborative design, virtual prototyping and manufacturing. To provide multi-resolution models for various applications, it is essential to generate adequate solid models at varying levels of detail (LOD) after feature rearrangement, based on the LOD criteria. However, the non-commutative property of the union and subtraction Boolean operations is a severe obstacle to arbitrary feature rearrangement. To solve this problem we propose history-based Boolean operations that satisfy the commutative law between union and subtraction operations by considering the history of the Boolean operations. Because these operations guarantee the same resulting shape as the original and reasonable shapes at the intermediate LODs for an arbitrary rearrangement of its features, various LOD criteria can be applied for multi-resolution modeling in different applications.

Implementation of Object-based Multiview 3D Display Using Adaptive Disparity-based Segmentation

  • Park, Jae-Sung;Kim, Seung-Cheol;Bae, Kyung-Hoon;Kim, Eun-Soo
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2005.07b
    • /
    • pp.1615-1618
    • /
    • 2005
  • In this paper, implementation of object-based multiview 3D display using object segmentation and adaptive disparity estimation is proposed and its performance is analyzed by comparison to that of the conventional disparity estimation algorithms. In the proposed algorithm, firstly we can get segmented objects by region growing from input stereoscopic image pair and then, in order to effectively synthesize the intermediate view the matching window size is selected according to the extracted feature value of the input stereo image pair. Also, the matching window size for the intermediate view reconstruction (IVR) is adaptively selected in accordance with the magnitude of the extracted feature value from the input stereo image pair. In addition, some experimental results on the IVR using the proposed algorithm is also discussed and compared with that of the conventional algorithms.

  • PDF

Three-Dimensional Shape Recognition and Classification Using Local Features of Model Views and Sparse Representation of Shape Descriptors

  • Kanaan, Hussein;Behrad, Alireza
    • Journal of Information Processing Systems
    • /
    • v.16 no.2
    • /
    • pp.343-359
    • /
    • 2020
  • In this paper, a new algorithm is proposed for three-dimensional (3D) shape recognition using local features of model views and its sparse representation. The algorithm starts with the normalization of 3D models and the extraction of 2D views from uniformly distributed viewpoints. Consequently, the 2D views are stacked over each other to from view cubes. The algorithm employs the descriptors of 3D local features in the view cubes after applying Gabor filters in various directions as the initial features for 3D shape recognition. In the training stage, we store some 3D local features to build the prototype dictionary of local features. To extract an intermediate feature vector, we measure the similarity between the local descriptors of a shape model and the local features of the prototype dictionary. We represent the intermediate feature vectors of 3D models in the sparse domain to obtain the final descriptors of the models. Finally, support vector machine classifiers are used to recognize the 3D models. Experimental results using the Princeton Shape Benchmark database showed the average recognition rate of 89.7% using 20 views. We compared the proposed approach with state-of-the-art approaches and the results showed the effectiveness of the proposed algorithm.

The facial expression generation of vector graphic character using the simplified principle component vector (간소화된 주성분 벡터를 이용한 벡터 그래픽 캐릭터의 얼굴표정 생성)

  • Park, Tae-Hee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.9
    • /
    • pp.1547-1553
    • /
    • 2008
  • This paper presents a method that generates various facial expressions of vector graphic character by using the simplified principle component vector. First, we analyze principle components to the nine facial expression(astonished, delighted, etc.) redefined based on Russell's internal emotion state. From this, we find principle component vector having the biggest effect on the character's facial feature and expression and generate the facial expression by using that. Also we create natural intermediate characters and expressions by interpolating weighting values to character's feature and expression. We can save memory space considerably, and create intermediate expressions with a small computation. Hence the performance of character generation system can be considerably improved in web, mobile service and game that real time control is required.

A Study on Attention Mechanism in DeepLabv3+ for Deep Learning-based Semantic Segmentation (딥러닝 기반의 Semantic Segmentation을 위한 DeepLabv3+에서 강조 기법에 관한 연구)

  • Shin, SeokYong;Lee, SangHun;Han, HyunHo
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.10
    • /
    • pp.55-61
    • /
    • 2021
  • In this paper, we proposed a DeepLabv3+ based encoder-decoder model utilizing an attention mechanism for precise semantic segmentation. The DeepLabv3+ is a semantic segmentation method based on deep learning and is mainly used in applications such as autonomous vehicles, and infrared image analysis. In the conventional DeepLabv3+, there is little use of the encoder's intermediate feature map in the decoder part, resulting in loss in restoration process. Such restoration loss causes a problem of reducing segmentation accuracy. Therefore, the proposed method firstly minimized the restoration loss by additionally using one intermediate feature map. Furthermore, we fused hierarchically from small feature map in order to effectively utilize this. Finally, we applied an attention mechanism to the decoder to maximize the decoder's ability to converge intermediate feature maps. We evaluated the proposed method on the Cityscapes dataset, which is commonly used for street scene image segmentation research. Experiment results showed that our proposed method improved segmentation results compared to the conventional DeepLabv3+. The proposed method can be used in applications that require high accuracy.

Enhancement of Object Detection using Haze Removal Approach in Single Image (단일 영상에서 안개 제거 방법을 이용한 객체 검출 알고리즘 개선)

  • Ahn, Hyochang;Lee, Yong-Hwan
    • Journal of the Semiconductor & Display Technology
    • /
    • v.17 no.2
    • /
    • pp.76-80
    • /
    • 2018
  • In recent years, with the development of automobile technology, smart system technology that assists safe driving has been developed. A camera is installed on the front and rear of the vehicle as well as on the left and right sides to detect and warn of collision risks and hazards. Beyond the technology of simple black-box recording via cameras, we are developing intelligent systems that combine various computer vision technologies. However, most related studies have been developed to optimize performance in laboratory-like environments that do not take environmental factors such as weather into account. In this paper, we propose a method to detect object by restoring visibility in image with degraded image due to weather factors such as fog. First, the image quality degradation such as fog is detected in a single image, and the image quality is improved by restoring using an intermediate value filter. Then, we used an adaptive feature extraction method that removes unnecessary elements such as noise from the improved image and uses it to recognize objects with only the necessary features. In the proposed method, it is shown that more feature points are extracted than the feature points of the region of interest in the improved image.

Feature-Oriented Requirements Change Management with Value Analysis (가치분석을 통한 휘처 기반의 요구사항 변경 관리)

  • Ahn, Sang-Im;Chong, Ki-Won
    • The Journal of Society for e-Business Studies
    • /
    • v.12 no.3
    • /
    • pp.33-47
    • /
    • 2007
  • The requirements have been changed during development progresses, since it is impossible to define all of software requirements. These requirements change leads to mistakes because the developers cannot completely understand the software's structure and behavior, or they cannot discover all parts affected by a change. Requirement changes have to be managed and assessed to ensure that they are feasible, make economic sense and contribute to the business needs of the customer organization. We propose a feature-oriented requirements change management method to manage requirements change with value analysis and feature-oriented traceability links including intermediate catalysis using features. Our approach offers two contributions to the study of requirements change: (1) We define requirements change tree to make user requirements change request generalize by feature level. (2) We provide overall process such as change request normalization, change impact analysis, solution dealing with change request, change request implementation, change request evaluation. In addition, we especially present the results of a case study which is carried out in asset management portal system in details.

  • PDF