Loading...
Search for: similarity-measure
0.006 seconds
Total 36 records

    Predicting Customer Behavior Patterns and Applying Recommender System by Machine Learning Algorithms and Its Effect on Customer Satisfaction

    , M.Sc. Thesis Sharif University of Technology Kazemnasab Haji, Ali (Author) ; Akhavan Niaki, Taghi (Supervisor)
    Abstract
    In this research, it has been tried to use deep learning methods and embedding vector, in addition to user-item data, from user side information such as age, gender, city, etc., and also for item information such as product name, product category, etc. can be used to better understand customer behavior patterns and provide a relatively rich recommender system. The proposed model in this research has two phases, the first phase tries to identify the user and item feature vector and form the user similarity matrix and the user-item correlation matrix. The outputs of phase one are used as inputs of phase two. In the second phase of the model, using these inputs, Top-N recommendation are... 

    Robust Similarity Measure in Medical Image Registration

    , Ph.D. Dissertation Sharif University of Technology Ghaffari, Aboozar (Author) ; Fatemizadeh, Emadeddin (Supervisor)
    Abstract
    Image Registration is spatially alignment of two images in a wide range of applications such as remote sensing, computer assisted surgery, and medical image analysis and processing. In general, registration algorithms can be categorized as either intensity based or feature based. The feature based methods use the alignment between the extracted features in two images. The simplest feature is images intensity which is directly used in the intensity based method via similarity measure. This similarity measure quantifies the matching of two images.Similarity measure is main core of image registration algorithms. Spatially varying intensity dis-tortion is an important challenge in a wide range... 

    A Novel Structural Based Similarity Measure for MRI and Ultrasound Registration

    , M.Sc. Thesis Sharif University of Technology Moaven, Aria (Author) ; Fatemizadeh, Emadodin (Supervisor)
    Abstract
    One of the most important issues in medical image processing is the registration of images with various imaging modalities, because in this case, one can take advantage of these imaging modalities and sometimes fuse and use the useful information of each one in the form of a single image.As it was said, MRI and ultrasound images each have their own disadvantages and advantages, and by considering these two modalities, they have tried to integrate the good features of these two. As we know, one of the destructive cases in the MRI image is the inhomogeneity of the image, a inhomogeneity due to the fact that the main magnetic field is not constant and makes the parts of the image brighter or... 

    Image Classication for Content Based Image Retrieval

    , M.Sc. Thesis Sharif University of Technology Saboorian, Mohammad Mehdi (Author) ; Jamzad, Mansour (Supervisor)
    Abstract
    In this project we tried to to solve the problem of clustring images of a large image database. Considering that there is no prior information regarding domain of the images, we will review unsupervised clustring methods. For this, we will discuss about image description vector and similarity measures. At last, our contribution will be about finding the optimum number of clusters with the least of user invervention. Results of runnig our method on a databse with 1000 images is reported and compared to a similar method named CLUE. Our result shows considerable improvements when user feedback taken to account.
     

    Web User Profile Clustering Using Artificial Immune System

    , M.Sc. Thesis Sharif University of Technology Azimpour Kivi, Mozhgan (Author) ; Azmi, Reza (Supervisor) ; Khansari, Mohammad (Supervisor)
    Abstract
    Nowadays, a need for intelligent system that can assist web users in acquiring their desired information has been highlighted. In particular a mechanism for web user profiling which involves knowing the users and providing them with their preferred information is recommended to any website. To address this issue, Web Usage Mining (WUM) techniques have attracted many attentions. WUM is a kind of web mining process that tries to extract interesting usage patterns from the data that are obtained from the interaction of users with the web. The most important drawback of conventional, data mining based, WUM system is their inability to continuously learn the evolving patterns of web usage. On the... 

    Cellular Learning Automata and Its Applications in Pattern Recognition

    , M.Sc. Thesis Sharif University of Technology Ahangaran, Meysam (Author) ; Beigy, Hamid (Supervisor)
    Abstract
    Cellular learning automata (CLA) is a distributed computational model that is introduced recently. This model is combination of cellular automata (CA) and learning automata (LA) and is used in many applications such as image processing, channel assignment in cellular networks, VLSI placement, rumor diffusion and modeling of commerce networks, and obtained acceptable results in these applications. This model consists of computational units called cells and each cell has one or more learning automata. In each stage, each automaton chooses an action from its actions set and applies it to the environment. Each cell has some neighboring cells that constitute its local environment. The local rule... 

    Image Registration by Mapping Defined-Functions Around Regions of Interest

    , M.Sc. Thesis Sharif University of Technology Sarikhani, Hossein (Author) ; Manzuri, Mohammad Taghi (Supervisor)
    Abstract
    Image registration is the process of matching two or more images captured at different times, angles or even sensors. Image registration is finding a transformation between two images. Image registration has many applications in different fields of Image Processing and machine vision. In the field of remote sensing, image registration can be used for environmental monitoring, generating graphical maps and gathering data for geogeraphical information systems, also in the field of medical image processing it can be used to detect tumor growth. Generally whenever there is need to extract information from many images; image registration is considered as an important pre-processing step.... 

    Image Matching Based on Manifold Learning Methods

    , M.Sc. Thesis Sharif University of Technology Azampour, Mohammad Farid (Author) ; Fatemizadeh, Emad (Supervisor)
    Abstract
    Medical imaging is of interest because of information that will provide for doctors and registration is inevitable when we need to compare two or more images, taken from a subject at different times or with different sensors or when comparing two or more subjects together. Registration methods can be categorized in two major groups; methods based on feature and methods based on intensity. Methods in first group have three steps in common: feature extraction, finding matches and transform estimation. In second group it’s important to define a similarity measure and find the transform that minimizes this measure.
    Manifold learning algorithms are mostly used as a dimensionality reduction... 

    MR Image Registration under Variant Illumination

    , M.Sc. Thesis Sharif University of Technology Shirpour, Mohsen (Author) ; Manzouri, Mohammad Taghi (Supervisor)
    Abstract
    Image registration is defined as matching two or more than two images which are taken from a same scene in different times, from various views and using different sensors. By matching, we mean finding the transformation function between the images. Image registration
    has many application in medical domains such as analyzing changes in body limbs, supervision of the tumors growth, and robotic surgery. The challenges of image registration are unavailability of the transformation function, existence of the outliers in the images, changes in the images intensity, changes in the image geometry, noise, etc. Image registration consists of four steps: (i) feature extraction, (ii) choosing a... 

    Taxonomy learning using compound similarity measure

    , Article IEEE/WIC/ACM International Conference on Web Intelligence, WI 2007, Silicon Valley, CA, 2 November 2007 through 5 November 2007 ; January , 2007 , Pages 487-490 ; 0769530265 (ISBN); 9780769530260 (ISBN) Neshati, M ; Alijamaat, A ; Abolhassani, H ; Rahimi, A ; Hoseini, M ; Sharif University of Technology
    2007
    Abstract
    Taxonomy learning is one of the major steps in ontology learning process. Manual construction of taxonomies is a time-consuming and cumbersome task. Recently many researchers have focused on automatic taxonomy learning, but still quality of generated taxonomies is not satisfactory. In this paper we have proposed a new compound similarity measure. This measure is based on both knowledge poor and knowledge rich approaches to find word similarity. We also used Machine Learning Technique (Neural Network model) for combination of several similarity methods. We have compared our method with simple syntactic similarity measure. Our measure considerably improves the precision and recall of automatic... 

    Taxonomy construction using compound similarity measure

    , Article OTM Confederated International Conferences CoopIS, DOA, ODBASE, GADA, and IS 2007, Vilamoura, 25 November 2007 through 30 November 2007 ; Volume 4803 LNCS, Issue PART 1 , 2007 , Pages 915-932 ; 03029743 (ISSN); 9783540768463 (ISBN) Neshati, M ; Hassanabadi, L. S ; Sharif University of Technology
    Springer Verlag  2007
    Abstract
    Taxonomy learning is one of the major steps in ontology learning process. Manual construction of taxonomies is a time-consuming and cumbersome task. Recently many researchers have focused on automatic taxonomy learning, but still quality of generated taxonomies is not satisfactory. In this paper we have proposed a new compound similarity measure. This measure is based on both knowledge poor and knowledge rich approaches to find word similarity. We also used Neural Network model for combination of several similarity methods. We have compared our method with simple syntactic similarity measure. Our measure considerably improves the precision and recall of automatic generated taxonomies. ©... 

    Sparse-induced similarity measure: Mono-modal image registration via sparse-induced similarity measure

    , Article IET Image Processing ; Volume 8, Issue 12 , 1 December , 2014 , Pages 728-741 ; ISSN: 17519659 Ghaffari, A ; Fatemizadeh, E ; Sharif University of Technology
    Abstract
    Similarity measure is an important key in image registration. Most traditional intensity-based similarity measures (e.g. sum-of-squared-differences, correlation coefficient, mutual information and correlation ratio) assume a stationary image and pixel-by-pixel independence. These similarity measures ignore the correlation among pixel intensities; hence, a perfect image registration cannot be achieved especially in the presence of spatially varying intensity distortions and outlier objects that appear in one image but not in the other. It is supposed here that non-stationary intensity distortion (such as bias field) has a sparse representation in the transformation domain. Based on this... 

    Recovery of missing samples using sparse approximation via a convex similarity measure

    , Article 2017 12th International Conference on Sampling Theory and Applications, SampTA 2017, 3 July 2017 through 7 July 2017 ; 2017 , Pages 543-547 ; 9781538615652 (ISBN) Javaheri, A ; Zayyani, H ; Marvasti, F ; Anbarjafari, G ; Kivinukk, A ; Tamberg, G ; Sharif University of Technology
    Abstract
    In this paper, we study the missing sample recovery problem using methods based on sparse approximation. In this regard, we investigate the algorithms used for solving the inverse problem associated with the restoration of missed samples of image signal. This problem is also known as inpainting in the context of image processing and for this purpose, we suggest an iterative sparse recovery algorithm based on constrained l1-norm minimization with a new fidelity metric. The proposed metric called Convex SIMilarity (CSIM) index, is a simplified version of the Structural SIMilarity (SSIM) index, which is convex and error-sensitive. The optimization problem incorporating this criterion, is then... 

    RASIM: A novel rotation and scale invariant matching of local image interest points

    , Article IEEE Transactions on Image Processing ; Volume 20, Issue 12 , 2011 , Pages 3580-3591 ; 10577149 (ISSN) Amiri, M ; Rabiee, H. R ; Sharif University of Technology
    Abstract
    This paper presents a novel algorithm for matching image interest points. Potential interest points are identified by searching for local peaks in Difference-of-Gaussian (DoG) images. We refine and assign rotation, scale and location for each keypoint by using the SIFT algorithm. Pseudo log-polar sampling grid is then applied to properly scaled image patches around each keypoint, and a weighted adaptive lifting scheme transform is designed for each ring of the log-polar grid. The designed adaptive transform for a ring in the reference keypoint and the general non-adaptive transform are applied to the corresponding ring in a test keypoint. Similarity measure is calculated by comparing the... 

    PEN: Parallel English-Persian news corpus

    , Article Proceedings of the 2011 International Conference on Artificial Intelligence, ICAI 2011, 18 2011 through 21 July 2011 ; Volume 2 , July , 2011 , Pages 523-528 ; 9781601321855 (ISBN) Farajian, M. A ; ICAI 2011
    2011
    Abstract
    Parallel corpora are the necessary resources in many multilingual natural language processing applications, including machine translation and cross-lingual information retrieval. Manual preparation of a large scale parallel corpus is a very time consuming and costly procedure. In this paper, the work towards building a sentence-level aligned English-Persian corpus in a semi-automated manner is presented. The design of the corpus, collection, and alignment process of the sentences is described. Two statistical similarity measures were used to find the similarities of sentence pairs. To verify the alignment process automatically, Google Translator was used. The corpus is based on news... 

    Overlapped ontology partitioning based on semantic similarity measures

    , Article 2010 5th International Symposium on Telecommunications, IST 2010, 4 December 2010 through 6 December 2010 ; 2010 , Pages 1013-1018 ; 9781424481835 (ISBN) Etminani, K ; Rezaeian Delui, A ; Naghibzadeh, M ; Sharif University of Technology
    Abstract
    Today, public awareness about the benefits of using ontologies in information processing and the semantic web has increased. Since ontologies are useful in various applications, many large ontologies have been developed so far. But various areas like publication, maintenance, validation, processing, and security policies need further research. One way to better tackle these areas is to partition large ontologies into sub partitions. In this paper, we present a new method to partition large ontologies. For the proposed method, three steps are required: (1) transforming an ontology to a weighted graph, (2) partitioning the graph with an algorithm which recognizes the most important concepts,... 

    OptCAM: An ultra-fast all-optical architecture for DNA variant discovery

    , Article Journal of Biophotonics ; Volume 13, Issue 1 , August , 2020 Maleki, E ; Koohi, S ; Kavehvash, Z ; Mashaghi, A ; Sharif University of Technology
    Wiley-VCH Verlag  2020
    Abstract
    Nowadays, the accelerated expansion of genetic data challenges speed of current DNA sequence alignment algorithms due to their electrical implementations. Essential needs of an efficient and accurate method for DNA variant discovery demand new approaches for parallel processing in real time. Fortunately, photonics, as an emerging technology in data computing, proposes optical correlation as a fast similarity measurement algorithm; while complexity of existing local alignment algorithms severely limits their applicability. Hence, in this paper, employing optical correlation for global alignment, we present an optical processing approach for local DNA sequence alignment to benefit both... 

    Nonrigid registration of breast MR images using residual complexity similarity measure

    , Article Iranian Conference on Machine Vision and Image Processing, MVIP, Zanjan ; Sept , 2013 , Pages 241-244 ; 21666776 (ISSN); 9781467361842 (ISBN) Nekoo, A. H ; Ghaffari, A ; Fatemizadeh, E ; Sharif University of Technology
    IEEE Computer Society  2013
    Abstract
    Elimination of motion artifact in breast MR images is a significant issue in pre-processing step before utilizing images for diagnostic applications. Breast MR Images are affected by slow varying intensity distortions as a result of contrast agent enhancement. Thus a nonrigid registration algorithm considering this effect is needed. Traditional similarity measures such as sum of squared differences and cross correlation, ignore the mentioned distortion. Therefore, efficient registration is not obtained. Residual complexity is a similarity measure that considers spatially varying intensity distortions by maximizing sparseness of the residual image. In this research, the results obtained by... 

    Multiple attribute group decision making method using a new similarity measure in interval type-2 fuzzy sets: A case study

    , Article International Journal of Mathematics in Operational Research ; Volume 9, Issue 2 , 2016 , Pages 139-166 ; 17575850 (ISSN) Heidarzade, A ; Mahdavi, I ; Mahdavi Amiri, N ; Sharif University of Technology
    Inderscience Enterprises Ltd  2016
    Abstract
    Similarity measures are very important concepts in fuzzy sets theory. There are several definitions for similarity measures in both type-1 and interval type-2 fuzzy sets (IT2-FSs). Here, the problem of finding similarity between two IT2-FSs is considered. A new similarity measure is proposed and its performance is compared with existing approaches in literature. Furthermore, an application of this measure in multiple criteria group decision making problem is given. Based on the proposed similarity measure, the satisfaction degree for different alternatives are established which then are used to rank alternatives in multiple criteria group decision making. Finally, a case study concerning the... 

    Multi-modal deep distance metric learning

    , Article Intelligent Data Analysis ; Volume 21, Issue 6 , 2017 , Pages 1351-1369 ; 1088467X (ISSN) Roostaiyan, S. M ; Imani, E ; Soleymani Baghshah, M ; Sharif University of Technology
    IOS Press  2017
    Abstract
    In many real-world applications, data contain heterogeneous input modalities (e.g., web pages include images, text, etc.). Moreover, data such as images are usually described using different views (i.e. different sets of features). Learning a distance metric or similarity measure that originates from all input modalities or views is essential for many tasks such as content-based retrieval ones. In these cases, similar and dissimilar pairs of data can be used to find a better representation of data in which similarity and dissimilarity constraints are better satisfied. In this paper, we incorporate supervision in the form of pairwise similarity and/or dissimilarity constraints into...