Loading...
Search for:
mirsadeghi--s
0.134 seconds
Total 11665 records
Unsupervised image segmentation by mutual information maximization and adversarial regularization
, Article IEEE Robotics and Automation Letters ; Volume 6, Issue 4 , 2021 , Pages 6931-6938 ; 23773766 (ISSN) ; Royat, A ; Rezatofighi, H ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2021
Abstract
Semantic segmentation is one of the basic, yet essential scene understanding tasks for an autonomous agent. The recent developments in supervised machine learning and neural networks have enjoyed great success in enhancing the performance of the state-of-the-art techniques for this task. However, their superior performance is highly reliant on the availability of a large-scale annotated dataset. In this letter, we propose a novel fully unsupervised semantic segmentation method, the so-called Information Maximization and Adversarial Regularization Segmentation (InMARS). Inspired by human perception which parses a scene into perceptual groups, rather than analyzing each pixel individually, our...
Cobalt-based metal-organic framework-functionalized graphene oxide modified electrode as a new electrochemical sensing platform for detection of free chlorine in aqueous solution
, Article Analytical Biochemistry ; Volume 681 , 2023 ; 00032697 (ISSN) ; Pourmortazavi, M ; Ehsani, A ; Mirsadeghi, S ; Sharif University of Technology
Academic Press Inc
2023
Abstract
This work reports the profit of using a MOF compound for developing a sensitive electrochemical sensor to free chlorine detection in an aqueous solution. Co-MOF and FGO composites were synthesized and combined with the carbon paste (CP) to prepare an efficient electrochemical sensor with high sensing ability. The fabricated Co-MOF and FGO composites were characterized by SEM, EDX, FT-IR, and XRD techniques. Meanwhile, cyclic voltammetry (CV) and electrochemical impedance spectroscopy (EIS) were utilized to assess the electrochemical performance of the Co-MOF-FGO/CP modified electrode. Under the optimized condition, the amperometric detection showed that the reduction current of free chlorine...
Coupling from the past for the null recurrent markov chain
, Article Annals of Applied Probability ; Volume 34, Issue 4 , 2024 , Pages 3631-3664 ; 10505164 (ISSN) ; Haji Mirsadeghi, M. O ; Khaniha, S ; Sharif University of Technology
2024
Abstract
The Doeblin graph of a countable state space Markov chain describes the joint pathwise evolutions of the Markov dynamics starting from all possible initial conditions, with two paths coalescing when they reach the same point of the state space at the same time. Its bridge Doeblin subgraph only contains the paths starting from a tagged point of the state space at all possible times. In the irreducible, aperiodic, and positive recurrent case, the following results are known: the bridge Doeblin graph is an infinite tree that is unimodularizable. Moreover, it contains a single bi-infinite path which allows one to build a perfect sample of the stationary state of the Markov chain. The present...
More accurate suppression of compton continuum based on list mode data acquisition technique
, Article Radiation Physics and Chemistry ; Volume 222 , 2024 ; 0969806X (ISSN) ; Mohtashami, S ; Tourang, M ; Mirsadeghi Moziraji, M ; Sharif University of Technology
2024
Abstract
Compton suppression is a beneficial technique employed in gamma-spectroscopy to decrease the Compton continuum and enhance the detection efficiency for various radionuclide identification/measurement applications. However, for cascade gamma-emitters radionuclides the conventional approach of Compton suppression (i.e., surrounding HPGe with NaI(Tl)/plastic detectors) removes all coincident events and reduces the detection efficiency. In this study, to address this challenge, a new approach is proposed that uses serial geometry (i.e., NaI(Tl) detector + sample + HPGe detector), more accurate coincidence time window, and the recorded gamma-ray energy in the detectors. The approach is...
Point-map-probabilities of a point process and Mecke's invariant measure equation
, Article Annals of Probability ; Volume 45, Issue 3 , 2017 , Pages 1723-1751 ; 00911798 (ISSN) ; Haji Mirsadeghi, M. O ; Sharif University of Technology
Institute of Mathematical Statistics
2017
Abstract
A compatible point-shift F maps, in a translation invariant way, each point of a stationary point process Φ to some point of Φ. It is fully determined by its associated point-map, f, which gives the image of the origin by F. It was proved by J. Mecke that if F is bijective, then the Palm probability of Φ is left invariant by the translation of -f . The initial question motivating this paper is the following generalization of this invariance result: in the nonbijective case, what probability measures on the set of counting measures are left invariant by the translation of -f ? The point-map-probabilities of Φ are defined from the action of the semigroup of point-map translations on the space...
Point-shift foliation of a point process
, Article Electronic Journal of Probability ; Volume 23 , 2018 ; 10836489 (ISSN) ; Haji Mirsadeghi, M. O ; Sharif University of Technology
University of Washington
2018
Abstract
A point-shift F maps each point of a point process Φ to some point of Φ. For all translation invariant point-shifts F, the F-foliation of Φ is a partition of the support of Φ which is the discrete analogue of the stable manifold of F on Φ. It is first shown that foliations lead to a classification of the behavior of point-shifts on point processes. Both qualitative and quantitative properties of foliations are then established. It is shown that for all point-shifts F, there exists a point-shift F⊥, the orbits of which are the F-foils of Φ, and which is measure-preserving. The foils are not always stationary point processes. Nevertheless, they admit relative intensities with respect to one...
Sparse Quadratic Discriminant Analysis and Community Bayes
, M.Sc. Thesis Sharif University of Technology ; Haji Mirsadeghi, Miromid (Supervisor)
Abstract
In this thesis, various methods for solving the classification problem with algorithms for some of their estimations, will be discussed. First, linear discriminant analysis (LDA), which is the most basic likelihood based method of classification is studied. In the next section, regularized discriminant analysis, a version of LDA in which the covariance matrix of each class is shrank toward the identity matrix, is studied. Then the ridge fusion in which a penalty is added to the likelihood function so that in the joint estimation of covariance matrices of dierent classes, all arrays become equal as much as possible is discussed. In the joint graphical lasso,precision matrices of dierent...
Preclustering algorithms for imprecise points
, Article 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, 22 June 2020 through 24 June 2020 ; Volume 162 , 2020 ; de Berg, M ; Farahzad, S ; Haji Mirsadeghi, M. O ; Saghafian, M ; Sharif University of Technology
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
2020
Abstract
We study the problem of preclustering a set B of imprecise points in Rd: we wish to cluster the regions specifying the potential locations of the points such that, no matter where the points are located within their regions, the resulting clustering approximates the optimal clustering for those locations. We consider k-center, k-median, and k-means clustering, and obtain the following results. Let B := {b1, . . ., bn} be a collection of disjoint balls in Rd, where each ball bi specifies the possible locations of an input point pi. A partition C of B into subsets is called an (f(k), α)preclustering (with respect to the specific k-clustering variant under consideration) if (i) C consists of...
Preclustering algorithms for imprecise points
, Article Algorithmica ; Volume 84, Issue 6 , 2022 , Pages 1467-1489 ; 01784617 (ISSN) ; de Berg, M ; Farahzad, S ; Haji Mirsadeghi, M. O ; Saghafian, M ; Sharif University of Technology
Springer
2022
Abstract
We study the problem of preclustering a set B of imprecise points in Rd: we wish to cluster the regions specifying the potential locations of the points such that, no matter where the points are located within their regions, the resulting clustering approximates the optimal clustering for those locations. We consider k-center, k-median, and k-means clustering, and obtain the following results. Let B: = { b1, … , bn} be a collection of disjoint balls in Rd, where each ball bi specifies the possible locations of an input point pi. A partition C of B into subsets is called an (f(k) , α) -preclustering (with respect to the specific k-clustering variant under consideration) if (i) C consists of...
The power of punica granatum: a natural remedy for oxidative stress and inflammation; a narrative review
, Article Journal of Ethnopharmacology ; Volume 330 , 2024 ; 03788741 (ISSN) ; Mohammadkhani, N ; Azizi, B ; Mohammadi, M ; Ebrahimpour, S ; Tabatabaei Malazy, O ; Mirsadeghi, S ; Ale Ebrahim, M ; Sharif University of Technology
2024
Abstract
Ethnopharmacological relevance: Pomegranate 'Punica granatum' offers multiple health benefits, including managing hypertension, dyslipidemia, hyperglycemia, insulin resistance, and enhancing wound healing and infection resistance, thanks to its potent antioxidant and anti-inflammatory properties. It has been symbolized by life, health, femininity, fecundity, and spirituality. Aim of the study: Although laboratory and animal studies have been conducted on the healing effects of pomegranate, there needs to be a comprehensive review on its anti-oxidative and anti-inflammatory effects in chronic disorders. We aim to provide a comprehensive review of these effects based on in-vitro, in-vivo, and...
Consistency of Lasso Estimator
, M.Sc. Thesis Sharif University of Technology ; Haji Mirsadeghi, Mir Omid (Supervisor)
Abstract
In this thesis, we are going to study the consistency properties of one of the most well-known linear estimators – LASSO estimator. First, we bring up some necessary background for introducing this estimator. Then, we are able to introduce primary and secondary forms of LASSO estimator. After that, we prove that primary form of the LASSO estimator is weakly consistent under certain weak conditions. We, also, prove a much stronger statement about the secondary form. We prove that the secondary form is strongly consistent. What’s more, with extra assumptions, we specify the convergence rate of the estimator. Finally, we propose a method for determining free parameter of primary form of LASSO,...
Biased Random Walk On Galton-Watson Tree With Leaves
, M.Sc. Thesis Sharif University of Technology ; Haji Mirsadeghi, Mir Omid (Supervisor)
Abstract
We consider a biased random walk Xn on a Galton-watson tree with leaves in the subballistic regime. We prove that there exists an explicit constant ϒ = ϒ(β) ε (0,1),such that |Xn| is of order n. If Δn be the hitting time of level n, we prove that Δn{n1{ is tight. More ever we show thatΔn{n1{ does not converge in law. We prove that along the sequences npkq Xk\ , Δn{n1{ converges to certain infinity divisible laws. Key tools for the proof are the classical Harris decomposition for Galton-Watson trees, a new variant of regeneration times and the careful analysis of triangular arrays of i.i.d. random variables
Estimation and Inference of Heterogeneous Treatment Effects using Random Forests
, M.Sc. Thesis Sharif University of Technology ; Haji Mirsadeghi, Mir Omid (Supervisor)
Abstract
Sometimes, the relationship between two random variables is not a correlation, but, a causal relationship where only changes in one of the two variables can lead to changes in the second one. The importance of examining such cause-effect relationships lies in the fact that sometimes, beyond just knowing the correlation between two variables, we are looking for an active effect on one, and knowing whether or not other correlated variables will also change with the change of this variable is of key importance. Such a process of exploring and analyzing cause-effect relationships is called causal learning. Based on this, in this thesis, we will first review the methods of causal inference, as...
Combinational therapy of lithium and human neural stem cells in rat spinal cord contusion model
, Article Journal of Cellular Physiology ; Volume 234, Issue 11 , 2019 , Pages 20742-20754 ; 00219541 (ISSN) ; Sadrosadat, H ; Jaberi, R ; Zareikheirabadi, M ; Mirsadeghi, S ; Naghdabadi, Z ; Ghaneezabadi, M ; Fardmanesh, M ; Baharvand, H ; Kiani, S ; Sharif University of Technology
Wiley-Liss Inc
2019
Abstract
A large number of treatment approaches have been used for spinal cord injury improvement, a medically incurable disorder, and subsequently stem cell transplantation appears to be a promising strategy. The main objective of this study is to ascertain whether combinational therapy of human neural stem cells (hNSCs) together with lithium chloride improves cell survival, proliferation, and differentiation in a rat spinal contusion model, or not. Contusive spinal cord injury was implemented on Wistar male rats. Experimental groups comprised of: control, hNSCs transplanted, lithium chloride (Li), and hNSCs and lithium chloride (hNSCs + Li). In every experimental group, locomotor activity score and...
Optimal paths on the space-time SINR random graph
, Article Advances in Applied Probability ; Volume 43, Issue 1 , 2011 , Pages 131-150 ; 00018678 (ISSN) ; Blaszczyszyn, B ; Haji Mirsadeghi, M. O ; Sharif University of Technology
2011
Abstract
We analyze a class of signal-to-interference-and-noise-ratio (SINR) random graphs. These random graphs arise in the modeling packet transmissions in wireless networks. Tn contrast to previous studies on STNR graphs, we consider both a space and a time dimension. The spatial aspect originates from the random locations of the network nodes in the Euclidean plane. The time aspect stems from the random transmission policy followed by each network node and from the time variations of the wireless channel characteristics. The combination of these random space and time aspects leads to fluctuations of the SINR experienced by the wireless channels, which in turn determine the progression of packets...
Balancing Admission Control, Speedup, and Waiting Time in Multi-Server Queuing Systems
, M.Sc. Thesis Sharif University of Technology ; Haji Mirsadeghi, Mir Omid (Supervisor)
Abstract
To reduce customer waiting times in various service conditions, admission control and service speedup can be implemented during times of congestion. In a healthcare setting, this may result in a patient being redirected to an alternative treatment facility. Additionally, waiting for patients can have negative impacts on their health and controlling population density can be costly. Implementing these measures may also take too much time or deviate from the ideal treatment. In this thesis, we will evaluate multi-server queuing systems by considering both speed and admission control simultaneously. We will use dynamic programming to determine the optimal control characteristics and calculate...
Controlling the False Discovery Rate Via Knockoffs
, M.Sc. Thesis Sharif University of Technology ; Haji MirSadeghi, Mir Omid (Supervisor)
Abstract
In many fields of science, we observe a response variable together with a large number of potential explanatory variables, and would like to be able to discover which variables are truly associated with the response. At the same time, we need to know that the false discovery rate (FDR)—the expected fraction of false discoveries among all discoveries—is not too high, in order to assure the scientist that most of the discoveries are indeed true and replicable. This paper introduces the knockoff filter, a new variable selection procedure controlling the FDR in the statistical linear model whenever there are at least as many observations as variables. This method achieves exact FDR control in...
Objective Method
, M.Sc. Thesis Sharif University of Technology ; Haji Mirsadeghi, Mir Omid (Supervisor)
Abstract
In this thesis we introduce the objective method for solving combinatorial probability problems and combinatorial optimization. For introducing this method, we consider its application in solving problems such as graphs maximal partial matching problem. Then we introduce mean-field model, which has a close relationship with this method. Finally we use this method to discuss perfect mathching with minimal cost in complete graphs, and using obtaind theorems and concepts from solving this problem, like involution invariance and standard construction, we find an answer for random assigment problem, which is one of the most practical problems in the class of optimization problems
Limiting Geodesics for First-Passage Ppercolation on Subsets of Z^2
, M.Sc. Thesis Sharif University of Technology ; Haji Mirsadeghi, Mir Omid (Supervisor)
Abstract
In this dissertation, we investigate the problem of the existence of finite geodetic sequences from point to point (0, n). This has not been proven in the general case. In this dissertation, we present an article that illustrates this question in a particular case of z ^ 2 subspaces whose self and complement are infinite and connected (e.g., slit planes, half-planes, and sectors). Writing x_n for the sequence of boundary vertices, we show that the sequence of geodesics from any point to x_n has an almost sure limit assuming only existence of finite geodesics. For all passage-time configurations, we show existence of a limiting Busemann function. Specializing to the case of the half-plane, we...
Causal Inference and CUPED Randomized Experiments
, M.Sc. Thesis Sharif University of Technology ; Haji Mirsadeghi, Mir Omid (Supervisor)
Abstract
In today’s world, large internet companies carry a lot of data. The tests with low triggering rate are designed for causal inference. By regarding the economic scale of Internet companies and high decision -making speeds, it is essential to use variance reduction methods to estimate the causal effect of treatment with sufficient precision. To this goal, the trigger- dilute analysis method is designed and used. When it comes to partial triggering, the stimulation analysis method loses its efficiency, so a new replacement method is designed in which an unbiased estimation along with the reduction of variance is presented to estimate ITT within one-way experiments. This method is based on the...