• Title/Summary/Keyword: given information

Search Result 7,120, Processing Time 0.038 seconds

Frontal Face Generation Algorithm from Multi-view Images Based on Generative Adversarial Network

  • Heo, Young- Jin;Kim, Byung-Gyu;Roy, Partha Pratim
    • Journal of Multimedia Information System
    • /
    • v.8 no.2
    • /
    • pp.85-92
    • /
    • 2021
  • In a face, there is much information of person's identity. Because of this property, various tasks such as expression recognition, identity recognition and deepfake have been actively conducted. Most of them use the exact frontal view of the given face. However, various directions of the face can be observed rather than the exact frontal image in real situation. The profile (side view) lacks information when comparing with the frontal view image. Therefore, if we can generate the frontal face from other directions, we can obtain more information on the given face. In this paper, we propose a combined style model based the conditional generative adversarial network (cGAN) for generating the frontal face from multi-view images that consist of characteristics that not only includes the style around the face (hair and beard) but also detailed areas (eye, nose, and mouth).

A study on Shopping Orientation and Information Source by Male's Clothing Benefits (남성집단의 의복추구혜택에 따른 쇼핑성향과 정보원에 관한 연구)

  • 김지현;홍금희
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.24 no.1
    • /
    • pp.43-54
    • /
    • 2000
  • The purpose of this study is to help male-clothing companies in investigating male shopping orientation and information source with clothing benefits. As for the method of the research, 428 male consumers were the object for the data of this research. The major results of this study are as follows : 1. The dimensions of clothing benefits were composed of the better appearances, the social status, the personality and the comfort. The dimensions of shopping orientation were composed of pleasant, planned, loyal and individual shopping orientations. 2. The consumer with clothing benefits were classified three groups: better appearances, comfort and careless. In the consumer's classified shopping orientation the group of pursuing personality and better appearances were given higher score at each level, while careless group was given the lowest score at each level of shopping orientation. 3. In case of using information source with classified consumers, the group of personality and better appearances got information through the marketer-oriented information source and neutral information source, the group of pursuing comfort got lots of information through human information source, the group seldom used all information source.

  • PDF

Aspect-Based Sentiment Analysis with Position Embedding Interactive Attention Network

  • Xiang, Yan;Zhang, Jiqun;Zhang, Zhoubin;Yu, Zhengtao;Xian, Yantuan
    • Journal of Information Processing Systems
    • /
    • v.18 no.5
    • /
    • pp.614-627
    • /
    • 2022
  • Aspect-based sentiment analysis is to discover the sentiment polarity towards an aspect from user-generated natural language. So far, most of the methods only use the implicit position information of the aspect in the context, instead of directly utilizing the position relationship between the aspect and the sentiment terms. In fact, neighboring words of the aspect terms should be given more attention than other words in the context. This paper studies the influence of different position embedding methods on the sentimental polarities of given aspects, and proposes a position embedding interactive attention network based on a long short-term memory network. Firstly, it uses the position information of the context simultaneously in the input layer and the attention layer. Secondly, it mines the importance of different context words for the aspect with the interactive attention mechanism. Finally, it generates a valid representation of the aspect and the context for sentiment classification. The model which has been posed was evaluated on the datasets of the Semantic Evaluation 2014. Compared with other baseline models, the accuracy of our model increases by about 2% on the restaurant dataset and 1% on the laptop dataset.

Output Phase Assignment Algorithm for Multilevel Logic Synthesis (다단 논리합성을 위한 출력 Phase 할당 알고리즘)

  • 이재흥;정종화
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.28A no.10
    • /
    • pp.847-854
    • /
    • 1991
  • This paper presents a new output phase assignment algorithm which determines the phases of all the nodes in a given boolean network. An estimation function is defined, which is represented by the relation between the literals in the given function expression. A weight function, WT (fi, fj) is defined, which is represented by approximate amount of common subexpression between function fi and fj. Common Subexpression Graph(CSG) is generated for phase selection by the weight function between all given functions. We propose a heuristic algorithm finding subgraph of which sum of weights has maximum by assigning phases into the given functions. The experiments with MCNC benchmarks show the efficiency of the proposed method.

  • PDF

A Technique for Generating Query Workloads of Various Distributions for Performance Evaluations (성능평가를 위한 다양한 분포를 갖는 질의 작업부하의 생성 기법)

  • 서상구
    • Journal of Information Technology Applications and Management
    • /
    • v.9 no.1
    • /
    • pp.27-44
    • /
    • 2002
  • Performance evaluations of database algorithms are usually conducted on a set of queries for a given test database. For more detailed evaluation results, it is often necessary to use different query workloads several times. Each query workload should reflect the querying patterns of the application domain in real world, which are non-uniform in the usage frequencies of attributes in queries of the workload for a given database. It is not trivial to generate many different query workloads manually, while considering non-uniform distributions of attributes'usage frequencies. In this paper we propose a technique to generate non-uniform distributions, which will help construct query workloads more efficiently. The proposed algorithm generates a query-attribute usage distribution based on given constraints on usage frequencies of attributes and qreries. The algorithm first allocates as many attributes to queries as Possible. Then it corrects the distribution by considering attributes and queries which are not within the given frequency constraints. We have implemented and tested the performance of the proposed algorithm, and found that the algorithm works well for various input constraints. The result of this work could be extended to help automatically generate SQL queries for various database performance benchmarking.

  • PDF

Bayesian Inference for Littlewood-Verrall Reliability Model

  • Choi, Ki-Heon;Choi, Hae-Ja
    • Journal of the Korean Data and Information Science Society
    • /
    • v.14 no.1
    • /
    • pp.1-9
    • /
    • 2003
  • In this paper we discuss Bayesian computation and model selection for Littlewood-Verrall model using Gibbs sampling. A numerical example with a simulated data is given.

  • PDF

User Reputation computation Method Based on Implicit Ratings on Social Media

  • Bok, Kyoungsoo;Yun, Jinkyung;Kim, Yeonwoo;Lim, Jongtae;Yoo, Jaesoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1570-1594
    • /
    • 2017
  • Social network services have recently changed from environments for simply building connections among users to open platforms for generating and sharing various forms of information. Existing user reputation computation methods are inadequate for determining the trust in users on social media where explicit ratings are rare, because they determine the trust in users based on user profile, explicit relations, and explicit ratings. To solve this limitation of previous research, we propose a user reputation computation method suitable for the social media environment by incorporating implicit as well as explicit ratings. Reliable user reputation is estimated by identifying malicious information raters, modifying explicit ratings, and applying them to user reputation scores. The proposed method incorporates implicit ratings into user reputation estimation by differentiating positive and negative implicit ratings. Moreover, the method generates user reputation scores for individual categories to determine a given user's expertise, and incorporates the number of users who participated in rating to determine a given user's influence. This allows reputation scores to be generated also for users who have received no explicit ratings, and, thereby, is more suitable for social media. In addition, based on the user reputation scores, malicious information providers can be identified.

Source Information Estimation Using Enemy's Single-Ping and Underwater Geographic Information in Non-Cooperative Bistatic Sonar (비협동 양상태 소나에서 적함 송신기의 단일 능동 신호와 해저 지형 정보를 이용한 송신기 정보 추정)

  • Lee, Dong-Hwa;Nam, Jong-Geun;Jung, Tae-Jin;Lee, Kyun-Kyung
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.2
    • /
    • pp.196-203
    • /
    • 2010
  • The bistatic sonar operations using a spatially-separated source and receiver are classified into cooperative and non-cooperative operations. In the cooperative operation, an active signal of a friendly ship is used and the source information is known previously. In the non-cooperative operation, an active signal of the enemy is used and it is difficult to find out the source information. The source information consists of the range, speed, course and frequency of the source. It gives advantage to operating bistatic sonar. This paper suggests a method of estimating the source information with geographic information in the sea and the single-ping of the enemy. The source range is given using one geographic point. And the source speed, course and the frequency of the enemy's source signal are given using two geographic points. Finally, the validity of the scheme is confirmed through a simulation study.

Two-Daughter Problem and Selection Effect (두 딸 문제와 선택 효과)

  • Kim, Myeongseok
    • Korean Journal of Logic
    • /
    • v.19 no.3
    • /
    • pp.369-400
    • /
    • 2016
  • If we learn that 'Mrs Lee has two children and at least one of them is a daughter', what is our credence that her two children are all girls? Obviously it is 1/3. By assuming some other obvious theses it seem to be argued that our credence is 1/2. Also by just supposing we learn trivial information about the future, it seem to be argued that we must change our credence 1/3 into 1/2. However all of these arguments are fallacious, cannot be sound. When using the conditionalization rule to evaluate conformation of a hypothesis by an evidence, or to estimate credence change by information intake, there are some points to keep in mind. We must examine whether relevant information was given through a random procedure or a biased procedure. If someone with full information releases to us particular partial information, an observation, a testimony, an evidence selected intentionally by him, which means the particular partial information was not given by chance, or was not given accidentally or naturally to us, then the conditionalization rule should be employed very cautiously or restrictedly.

  • PDF

Block Boundary Detection Technique for Adaptive Blocking Artifacts Reduction (적응적 블록화 현상 제거를 위한 블록 경계 검출 기법)

  • Kim, Sung-Deuk;Lim, Kyoung-Won
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.2
    • /
    • pp.11-19
    • /
    • 2010
  • Most of deblocking filters assumes that the block boundaries are accurately known and the coding information like quantization parameters are available. In some applications such as commercial television, however, many external video inputs without known block boundary and coding information arc given. If a decompressed video sequence heavily degraded with blocking artifacts is given through the external video port, it is absolutely necessary to detect block boundaries and control the strength of deblocking filtering by analysing the given images. This paper presents an efficient method to find the block boundaries and estimate the strength of the blocking artifacts without the knowledge of coding information. In addition, the confidence of the estimated blocking artifact information is also evaluated to control the adaptive deblocking filter robustly. Experiment results show that the estimated block boundary locations and strength relative strength and confidence information are practically good enough to reduce the blocking artifacts without prior knowledge.