14 citations · 20 across the 13 of their papers we have counts for
13 papers
Local Binary Pattern(LBP) Optimization for Feature Extraction
Zeinab Sedaghatjoo, Hossein Hosseinzadeh, Bahram Sadeghi Bigham
The rapid growth of image data has led to the development of advanced image processing and computer vision techniques, which are crucial in various applications such as image class…
E-learning model for art education: Case study in Iran
Bahram Sadeghi Bigham, Mahboubeh Fannakhosrow, Aliakbar Safipour +2
According to the characteristics of art, art education according to Bloom's classification, should take place at high and close to the level of creativity. E-learning related to th…
Fingerprint Matching using the Onion Peeling Approach and Turning Function
Nazanin Padkan, B. Sadeghi Bigham, Mohammad Reza Faraji
Fingerprint, as one of the most popular and robust biometric traits, can be used in automatic identification and verification systems to identify individuals. Fingerprint matching…
Tiling Rectangles and the Plane using Squares of Integral Sides
Bahram Sadeghi Bigham, Mansoor Davoodi, Samaneh Mazaheri +1
We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or…
Lower Bound for Sculpture Garden Problem
Marzieh Eskandari, Bahram Sadeghi Bigham
The purpose of the current study is to investigate a special case of art gallery problem, namely Sculpture Garden Problem. In the said problem, for a given polygon , the ultimat…
Minimum Constraint Removal Problem for Line Segments is NP-hard
Bahram Sadeghi Bigham
In the minimum constraint removal (), there is no feasible path to move from the starting point towards the goal and, the minimum constraints should be removed in order to fin…
A new metaheuristic approach for the art gallery problem
Bahram Sadeghi Bigham, Sahar Badri, Nazanin Padkan
In the problem "Localization and trilateration with the minimum number of landmarks", we faced the 3-Guard and classic Art Gallery Problems. The goal of the art gallery problem is…
Creating A New Color Space utilizing PSO and FCM to Perform Skin Detection by using Neural Network and ANFIS
Kobra Nazari, Samaneh Mazaheri, Bahram Sadeghi Bigham
Skin color detection is an essential required step in various applications related to computer vision. These applications will include face detection, finding pornographic images i…
Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls
Bahram Sadeghi Bigham
In this study, a geometric version of an NP-hard problem ("Almost " problem) is introduced which has potential applications in clustering, separation axis, binary sensor net…
Iterated Greedy Algorithms for the Hop-Constrained Steiner Tree Problem
Farzane Yahyanejad, Bahram Sadeghi Bigham
The Hop-Constrained Steiner Tree problem (HCST) is challenging NP-hard problem arising in the design of centralized telecommunication networks where the reliability constraints mat…
Greedy Harmony Search Algorithm for the Hop Constrained Connected Facility Location
Farzane Yahyanejad, Bahram Sadeghi Bigham
We present a simple, robust and efficient harmony search algorithm for the Hop Constrained Connected Facility Location problem (HCConFL). The HCConFL problem is NP-hard that models…
Extracting an English-Persian Parallel Corpus from Comparable Corpora
Akbar Karimi, Ebrahim Ansari, Bahram Sadeghi Bigham
Parallel data are an important part of a reliable Statistical Machine Translation (SMT) system. The more of these data are available, the better the quality of the SMT system. Howe…
Design, Implementation and Evaluation of MTBDD based Fuzzy Sets and Binary Fuzzy Relations
Hamid A. Toussi, Bahram Sadeghi Bigham
For fast and efficient analysis of large sets of fuzzy data, elimination of redundancies in the memory representation is needed. We used MTBDDs as the underlying data-structure to…