20 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 10 / 20
Yayın Cryptanalysis of a multi-chaotic systems based image cryptosystem(Elsevier Science BV, 2010-01-15) Solak, Ercan; Rhouma, Rhouma; Belghith, Safya MdimeghThis paper is a cryptanalysis of a recently proposed multi-chaotic systems based image cryptosystem. The cryptosystem is composed of two shuffling stages parameterized by chaotically generated sequences. We propose and implement two different attacks which completely break this encryption scheme.Yayın Cryptanalysis of Fridrich's chaotic image encryption(World Scientific Publishing, 2010-05) Solak, Ercan; Çokal, Cahit; Yıldız, Olcay Taner; Bıyıkoğlu, TürkerWe cryptanalyze Fridrich's chaotic image encryption algorithm. We show that the algebraic weaknesses of the algorithm make it vulnerable against chosen-ciphertext attacks. We propose an attack that reveals the secret permutation that is used to shuffle the pixels of a round input. We demonstrate the effectiveness of our attack with examples and simulation results. We also show that our proposed attack can be generalized to other well-known chaotic image encryption algorithms.Yayın Parallel univariate decision trees(Elsevier B.V., 2007-05-01) Yıldız, Olcay Taner; Dikmen, OnurUnivariate decision tree algorithms are widely used in data mining because (i) they are easy to learn (ii) when trained they can be expressed in rule based manner. In several applications mainly including data mining, the dataset to be learned is very large. In those cases it is highly desirable to construct univariate decision trees in reasonable time. This may be accomplished by parallelizing univariate decision tree algorithms. In this paper, we first present two different univariate decision tree algorithms C4.5 and univariate linear discriminant tree. We show how to parallelize these algorithms in three ways: (i) feature based; (ii) node based; (iii) data based manners. Experimental results show that performance of the parallelizations highly depend on the dataset and the node based parallelization demonstrate good speedups.Yayın Fully decentralized and collaborative multilateration primitives for uniquely localizing WSNs(Springer International Publishing AG, 2010) Çakıroğlu, Olca Arda; Erten, CesimWe provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and applies unique localization primitives on it. These primitives are based on constructing a special order for multilaterating the nodes within the cluster. The proposed primitives are fully collaborative and thus the number of iterations required to compute the localization is fewer than that of the conventional iterative multilateration approaches. This further limits the messaging requirements. With relatively small clusters and iteration counts, we can localize almost all the uniquely localizable nodes.Yayın Nearest neighbor weighted average customization for modeling faces(Springer, 2013-10) Abeysundera, Hasith Pasindu; Benli, Kristin Surpuhi; Eskil, Mustafa TanerIn this paper, we present an anatomically accurate generic wireframe face model and an efficient customization method for modeling human faces. We use a single 2D image for customization of the generic model. We employ perspective projection to estimate 3D coordinates of the 2D facial landmarks in the image. The non-landmark vertices of the 3D model are shifted using the translations of k nearest landmark vertices, inversely weighted by the square of their distances. We demonstrate on Photoface and Bosphorus 3D face data sets that the proposed method achieves substantially low relative error values with modest time complexity.Yayın On the online coalition structure generation problem(AI Access Foundationusc Information Sciences Inst, 2021) Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, ShmuelWe consider the online version of the coalition structure generation problem, in which agents, corresponding to the vertices of a graph, appear in an online fashion and have to be partitioned into coalitions by an authority (i.e., an online algorithm). When an agent appears, the algorithm has to decide whether to put the agent into an existing coalition or to create a new one containing, at this moment, only her. The decision is irrevocable. The objective is partitioning agents into coalitions so as to maximize the resulting social welfare that is the sum of all coalition values. We consider two cases for the value of a coalition: (1) the sum of the weights of its edges, and (2) the sum of the weights of its edges divided by its size. Coalition structures appear in a variety of application in AI, multi-agent systems, networks, as well as in social networks, data analysis, computational biology, game theory, and scheduling. For each of the coalition value functions we consider the bounded and unbounded cases depending on whether or not the size of a coalition can exceed a given value alpha. Furthermore, we consider the case of a limited number of coalitions and various weight functions for the edges, i.e., unrestricted, positive and constant weights. We show tight or nearly tight bounds for the competitive ratio in each case.Yayın Factored particle filtering with dependent and constrained partition dynamics for tracking deformable objects(Springer, 2014-10) Eskil, Mustafa TanerIn particle filtering, dimensionality of the state space can be reduced by tracking control (or feature) points as independent objects, which are traditionally named as partitions. Two critical decisions have to be made in implementation of reduced state-space dimensionality. First is how to construct a dynamic (transition) model for partitions that are inherently dependent. Second critical decision is how to filter partition states such that a viable and likely object state is achieved. In this study, we present a correlation-based transition model and a proposal function that incorporate partition dependency in particle filtering in a computationally tractable manner. We test our algorithm on challenging examples of occlusion, clutter and drastic changes in relative speeds of partitions. Our successful results with as low as 10 particles per partition indicate that the proposed algorithm is both robust and efficient.Yayın Univariate decision tree induction using maximum margin classification(Oxford Univ Press, 2012-03) Yıldız, Olcay TanerIn many pattern recognition applications, first decision trees are used due to their simplicity and easily interpretable nature. In this paper, we propose a new decision tree learning algorithm called univariate margin tree where, for each continuous attribute, the best split is found using convex optimization. Our simulation results on 47 data sets show that the novel margin tree classifier performs at least as good as C4.5 and linear discriminant tree (LDT) with a similar time complexity. For two-class data sets, it generates significantly smaller trees than C4.5 and LDT without sacrificing from accuracy, and generates significantly more accurate trees than C4.5 and LDT for multiclass data sets with one-vs-rest methodology.Yayın Facial expression recognition based on anatomy(Academic Press Inc Elsevier Science, 2014-02) Eskil, Mustafa Taner; Benli, Kristin SurpuhiIn this study, we propose a novel approach to facial expression recognition that capitalizes on the anatomical structure of the human face. We model human face with a high-polygon wireframe model that embeds all major muscles. Influence regions of facial muscles are estimated through a semi-automatic customization process. These regions are projected to the image plane to determine feature points. Relative displacement of each feature point between two image frames is treated as an evidence of muscular activity. Feature point displacements are projected back to the 3D space to estimate the new coordinates of the wireframe vertices. Muscular activities that would produce the estimated deformation are solved through a least squares algorithm. We demonstrate the representative power of muscle force based features on three classifiers; NB, SVM and Adaboost Ability to extract muscle forces that compose a facial expression will enable detection of subtle expressions, replicating an expression on animated characters and exploration of psychologically unknown mechanisms of facial expressions.Yayın An observation based muscle model for simulation of facial expressions(Elsevier Science BV, 2018-05) Erkoç, Tuğba; Ağdoğan, Didem; Eskil, Mustafa TanerThis study presents a novel facial muscle model for coding of facial expressions. We derive this model from unintrusive observation of human subjects in the progress of the surprise expression. We use a generic and single-layered face model which embeds major muscles of the human face. This model is customized onto the human subject's face on the first frame of the video. The last frame of the video is used to project a set of manually marked feature points to estimate the 3 dimensional displacements of vertices due to facial expression. Vertex displacements are used in a mass spring model to estimate the external forces, i.e. the muscle forces on the skin. We observed that the distribution of muscle forces resemble sigmoid or hyperbolic tangent functions. We chose hyperbolic tangent function as our base model and parameterized it using least squares. We compared the proposed muscle model with frequently used models in the literature.
