{"title":"Crack detection in historic structures using an improved Prewitt filter: Case study of the Historic Si-o-se-pol Bridge in Iran","authors":"Morteza Saadatmorad, Erfan Rezaei-Sedehi, Samir Khatir","doi":"10.46223/hcmcoujs.acs.en.14.1.41.2024","DOIUrl":"https://doi.org/10.46223/hcmcoujs.acs.en.14.1.41.2024","url":null,"abstract":"In contrast to new and modern structures, historical structures have cultural significance, and it is essential to make an effort to preserve them. For this purpose, fast and accurate damage detection of historical structures plays a crucial role. Thus, the current study introduces a novel and effective tool for detecting cracks in historic structures. A new and modified version of the Prewitt filter is proposed to detect cracks in the Si-o-se-pol Bridge, a historic bridge in Iran. Results of crack detection using vertical and horizontal Prewitt filters are compared to those obtained from the proposed improved filter. The findings show that the improved Prewitt filter has significantly better performance compared to the vertical and horizontal Prewitt filters.","PeriodicalId":518622,"journal":{"name":"HCMCOU Journal of Science – Advances in Computational Structures","volume":"114 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140528470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Metaheuristic Optimization Algorithms: an overview","authors":"Brahim Benaissa, Masakazu Kobayashi, Musaddiq Al, Tawfiq Khatir, Mohamed El, Amine Elaissaoui Elmeliani","doi":"10.46223/hcmcoujs.acs.en.14.1.47.2024","DOIUrl":"https://doi.org/10.46223/hcmcoujs.acs.en.14.1.47.2024","url":null,"abstract":"Metaheuristic optimization algorithms are known for their versatility and adaptability, making them effective tools for solving a wide range of complex optimization problems. They don't rely on specific problem types, gradients, and can explore globally while handling multi-objective optimization. They strike a balance between exploration and exploitation, contributing to advancements in optimization. However, it's important to note their limitations, including the lack of a guaranteed global optimum, varying convergence rates, and their somewhat opaque functioning. In contrast, metaphor-based optimization algorithms, while intuitively appealing, have faced controversy due to potential oversimplification and unrealistic expectations. Despite these considerations, metaheuristic algorithms continue to be widely used for tackling complex problems. This research paper aims to explore the fundamental components and concepts that underlie optimization algorithms, focusing on the use of search references and the delicate balance between exploration and exploitation. Visual representations of the search behavior of selected metaheuristic algorithms will also be provided.","PeriodicalId":518622,"journal":{"name":"HCMCOU Journal of Science – Advances in Computational Structures","volume":"52 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140528507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}