• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.75-81
• /
• 2014

In a distribution of the digital image, there is a serious problem that is distributed an illegal forgery image by pirates. For the problem solution, this paper proposes an image forensic decision algorithm using an edge energy information of forgery image. The algorithm uses SA (Streaking Artifacts) and SPAM (Subtractive Pixel Adjacency Matrix) to extract the edge energy informations of original image according to JPEG compression rate(QF=90, 70, 50 and 30) and the query image. And then it decides the forge whether or not by comparing the edge informations between the original and query image each other. According to each threshold in TCJCR (Threshold by Combination of JPEG Compression Ratios), the matching of the edge informations of original and query image is excused. Through the matching experiments, TP (True Positive) and FN (False Negative) is 87.2% and 13.8% respectively. Thus, the minimum average decision error is 0.1349. Also, it is confirmed that the performed class evaluation of the proposed algorithm is 'Excellent(A)' because of the AUROC (Area Under Receiver Operating Characteristic) curve is 0.9388 by sensitivity and 1-specificity.

• The Journal of the Korea Contents Association
• /
• v.7 no.3
• /
• pp.9-16
• /
• 2007

This paper describe methodology that is distributed on 2-dimensional plane to much high-dimensional facial motion datas using Isomap algorithm, and user interface techniques to control facial expressions by selecting expressions while user navigates this space in real-time. Isomap algorithm is processed of three steps as follow; first define an adjacency expression of each expression data, and second, calculate manifold distance between each expressions and composing expression spaces. These facial spaces are created by calculating of the shortest distance(manifold distance) between two random expressions. We have taken a Floyd algorithm for it. Third, materialize multi-dimensional expression spaces using Multidimensional Scaling, and project two dimensions plane. The smallest adjacency distance to define adjacency expressions uses Pearson Correlation Coefficient. Users can control facial expressions of 3-dimensional avatar by using user interface while they navigates two dimension spaces by real-time.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.189-194
• /
• 2004

This paper describes method to distribute much high-dimensional facial expression motion data to 2 dimensional space, and method to create facial expression animation by select expressions that want by realtime as animator navigates this space. In this paper composed expression space using about 2400 facial expression frames. The creation of facial space is ended by decision of shortest distance between any two expressions. The expression space as manifold space expresses approximately distance between two points as following. After define expression state vector that express state of each expression using distance matrix which represent distance between any markers, if two expression adjoin, regard this as approximate about shortest distance between two expressions. So, if adjacency distance is decided between adjacency expressions, connect these adjacency distances and yield shortest distance between any two expression states, use Floyd algorithm for this. To materialize expression space that is high-dimensional space, project on 2 dimensions using Sammon's Mapping. Facial animation create by realtime with animators navigating 2 dimensional space using user interface.

• Interdisciplinary Bio Central
• /
• v.1 no.2
• /
• pp.8.1-8.6
• /
• 2009

Introduction: It is a challenge to design a protein score function which stabilizes the native structures of many proteins simultaneously. The coarse-grained description of proteins to construct the pairwise-contact score function usually ignores the backbone directionality of protein structures. We propose a new two-body score function which stabilizes all native states of 1,006 proteins simultaneously. This two-body score function differs from the usual pairwise-contact functions in that it considers two adjacent amino acids at two ends of each peptide bond with the backbone directionality from the N-terminal to the C-terminal. The score is a corresponding propensity for a directional alignment of two adjacent amino acids with their local environments. Results and Discussion: We show that the construction of a directional adjacency-score function was achieved using 1,006 training proteins with the sequence homology less than 30%, which include all representatives of different protein classes. After parameterizing the local environments of amino acids into 9 categories depending on three secondary structures and three kinds of hydrophobicity of amino acids, the 32,400 adjacency-scores of amino acids could be determined by the perceptron learning and the protein threading. These could stabilize simultaneously all native folds of 1,006 training proteins. When these parameters are tested on the new distinct 382 proteins with the sequence homology less than 90%, 371 (97.1%) proteins could recognize their native folds. We also showed using these parameters that the retro sequence of the SH3 domain, the B domain of Staphylococcal protein A, and the B1 domain of Streptococcal protein G could not be stabilized to fold, which agrees with the experimental evidence.

• Korean Journal of Community Nutrition
• /
• v.16 no.1
• /
• pp.98-112
• /
• 2011

This study aimed to suggest a 1300 scale of a middle school foodservice facility floor plan which was compliant to the principle of HACCP, as well as ensuring food and work safety, and the flow of personnel and food materials. which consisted of 46 nutrition teachers and 6 experts, responded with a questionnaire on the relationship of functional area and space. Using their opinions, key principles for the design of the facility were single direction movement of food materials, customers and workers; minimization of the cross-contamination through the separation of functional space; and securement of customer-focused efficiency; staff-centered convenience and efficiency; and work and food safety. After the completion of an adjacency diagram, bubble diagram and program statement, the functional areas of a 1300 scale middle school food-service facility were allocated as follows: $9.9\;m^2$ for the receiving area, $56.1\;m^2$ for the pre-preparation area, $10.5\;m^2$ for the food storage area, $6.0\;m^2$ for the supplies storage area, $97.8\;m^2$ for the cooking area, $33.6\;m^2$ for the service area, $52.5\;m^2$ for dish washing area, cafeteria $410.5\;m^2$, $4.5\;m^2$ for the front room, for a total of $725.8\;m^2$. Expert groups have pointed to limitations within this model as there are no windows in the office for the influx of fresh outside air and a need for the straight line installation of steam-jacket and frying kettles on the sides of windows. This study can be useful as the guidelines for estimating the investment cost of the facility and placing the placement of functional areas and equipment in the renovation of the facility. It can be also useful data for a methodology of foodservice facility design.

• Journal of Cadastre & Land InformatiX
• /
• v.48 no.1
• /
• pp.215-228
• /
• 2018

After the housing shortage problem for the youths has invoked substantial social attention recently, Seoul's 2030 Youth Housing Program has been timely improvised and successfully providing the decent rental housing packages for the deprived youths of the City. Its housing supply rate, nevertheless, did not sufficiently catch up with the actual need of the youth group so that the program goal is seen by many to be difficult to readily achieve. In an effort to counteract such adversities, it is seen, in this study, that the clarification of the criteria that judges adjacency condition for up-zoning when a candidate housing site is adjoining to a denser land-use classes could be one effective method to augment its supply rate. This study, in this context, has performed spatial structure analyses via space syntax method against: 1) the conceptual diagram in the City's official manual that renders the acceptable adjacency conditions, and; 2) numerous real-world 2030 Youth Housing cases enlisted in the City's public notices that permit their construction. The consequences are that the axial map is not applicable whereas the convex map is adequate for the purpose at hand, and, among all the cases, those spaces that are adjacent with its Depth of less than 2 are seen to successfully satisfy the official adjacency condition for the up-zoning.

• Kyungpook Mathematical Journal
• /
• v.19 no.1
• /
• pp.127-134
• /
• 1979

A (0,1) matrix is acyclic if it does not have a permutation matrix of order 2 as a submatrix. A bipartite tournament is acyclic if and only if its adjacency matrix is acyclic. The concepts of (maximal) order of cyclicity of a matrix and a bipartite tournament are introduced and studied.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.12
• /
• pp.1225-1230
• /
• 2014

This paper investigates the group average-consensus and group formation-consensus problems for first-order multi-agent systems. The control protocol for group consensus is designed by considering the positive adjacency elements. Since each intra-group Laplacian matrix cannot be satisfied with the in-degree balance because of the positive adjacency elements between groups, we decompose the Laplacian matrix into an intra-group Laplacian matrix and an inter-group Laplacian matrix. Moreover, average matrices are used in the control protocol to analyze the stability of multi-agent systems with a fixed and undirected communication topology. Using the graph theory and the Lyapunov functional, stability analysis is performed for group average-consensus and group formation-consensus, respectively. Finally, some simulation results are presented to validate the effectiveness of the proposed control protocol for group consensus.

• The Korean Journal of Applied Statistics
• /
• v.33 no.2
• /
• pp.115-122
• /
• 2020

K-means clustering uses a spherical or elliptical metric to group data points; however, it does not work well for non-convex data such as the concentric circles. Spectral clustering, based on graph theory, is a generalized and robust technique to deal with non-standard type of data such as non-convex data. Results obtained by spectral clustering often outperform traditional clustering such as K-means. In this paper, we review spectral clustering and show important issues in spectral clustering such as determining the number of clusters K, estimation of scale parameter in the adjacency of two points, and the dimension reduction technique in clustering high-dimensional data.

• Journal of the Korea Computer Graphics Society
• /
• v.4 no.1
• /
• pp.11-19
• /
• 1998

Non-manifold topological operations such as Euler and Boolean operations provide a versatile environment for modeling domains. The implementation of these operations raises geometrical issues that need to be addressed to ensure the topological validity of the underlying model, and they uses the glue operation which provides a basic method to modify the topology of non-manifold models when vertices, edges and faces are contacting each other. Topological information such as adjacency relationships should be inferred when gluing non-manifold models. Two methods of reasoning can be employed to find the topological information : topological reasoning and geometrical reasoning. The topological method can infer the adjacency relationships by using stored topological information. On the other hand, the geometrical method can find topological ambiguities by considering the geometrical shape at the local area of gluing when the topological relations were not stored. This paper describes the geometrical reasoning method.