default search action
S. M. Kamrul Hasan
Person information
- affiliation: Rochester Institute of Technology, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c16]Bidur Khanal
, S. M. Kamrul Hasan, Bishesh Khanal, Cristian A. Linte:
Investigating the impact of class-dependent label noise in medical image classification. Image Processing 2023 - 2022
- [c15]S. M. Kamrul Hasan, Cristian A. Linte:
Joint Segmentation and Uncertainty Estimation of Ventricular Structures from Cardiac MRI using a Bayesian CondenseUNet. EMBC 2022: 5047-5050 - [c14]S. M. Kamrul Hasan, Cristian A. Linte:
Calibration of cine MRI segmentation probability for uncertainty estimation using a multi-task cross-task learning architecture. Image-Guided Procedures 2022 - [c13]S. M. Kamrul Hasan, Cristian A. Linte:
STAMP: A Self-training Student-Teacher Augmentation-Driven Meta Pseudo-Labeling Framework for 3D Cardiac MRI Image Segmentation. MIUA 2022: 371-386 - 2021
- [c12]S. M. Kamrul Hasan, Cristian A. Linte:
A Multi-Task Cross-Task Learning Architecture for Ad Hoc Uncertainty Estimation in 3D Cardiac MRI Image Segmentation. CinC 2021: 1-4 - [c11]Roshan Reddy Upendra
Motion Extraction of the Right Ventricle from 4D Cardiac Cine MRI Using A Deep Learning-Based Deformable Registration Framework. EMBC 2021: 3795-3799 - [c10]S. M. Kamrul Hasan, Richard A. Simon, Cristian A. Linte:
Segmentation and removal of surgical instruments for background scene visualization from endoscopic/laparoscopic video. Image-Guided Procedures 2021 - [i4]S. M. Kamrul Hasan, Cristian A. Linte:
A Multi-Task Cross-Task Learning Architecture for Ad-hoc Uncertainty Estimation in 3D Cardiac MRI Image Segmentation. CoRR abs/2109.07702 (2021) - 2020
- [c9]S. M. Kamrul Hasan, Cristian A. Linte:
L-CO-Net: Learned Condensation-Optimization Network for Segmentation and Clinical Parameter Estimation from Cardiac Cine MRI. EMBC 2020: 1217-1220 - [c8]S. M. Kamrul Hasan, Cristian A. Linte:
CondenseUNet: a memory-efficient condensely-connected architecture for bi-ventricular blood pool and myocardium segmentation. Image-Guided Procedures 2020: 113151J - [i3]S. M. Kamrul Hasan, Cristian A. Linte:
CondenseUNet: A Memory-Efficient Condensely-Connected Architecture for Bi-ventricular Blood Pool and Myocardium Segmentation. CoRR abs/2004.02249 (2020) - [i2]S. M. Kamrul Hasan, Cristian A. Linte:
L-CO-Net: Learned Condensation-Optimization Network for Clinical Parameter Estimation from Cardiac Cine MRI. CoRR abs/2004.11253 (2020)
2010 – 2019
- 2019
- [c7]Niels F. Otani, Dylan Dang, Christopher Beam, Fariba Mohammadi, Brian Wentz, S. M. Kamrul Hasan, Suzanne M. Shontz, Karl Q. Schwarz, Sabu Thomas, Cristian A. Linte:
Toward Quantification and Visualization of Active Stress Waves for Myocardial Biomechanical Function Assessment. CinC 2019: 1-4 - [c6]S. M. Kamrul Hasan, Cristian A. Linte:
U-NetPlus: A Modified Encoder-Decoder U-Net Architecture for Semantic and Instance Segmentation of Surgical Instruments from Laparoscopic Images. EMBC 2019: 7205-7211 - [i1]S. M. Kamrul Hasan, Cristian A. Linte:
U-NetPlus: A Modified Encoder-Decoder U-Net Architecture for Semantic and Instance Segmentation of Surgical Instrument. CoRR abs/1902.08994 (2019) - 2018
- [j5]S. M. Kamrul Hasan
Two-step verification of brain tumor segmentation using watershed-matching algorithm. Brain Informatics 5(2) (2018) - [j4]S. M. Kamrul Hasan
Correction to: Two-step verification of brain tumor segmentation using watershed-matching algorithm. Brain Informatics 5(2) (2018) - 2016
- [j3]Ruhul A. Sarker
Managing risk in production scheduling under uncertain disruption. Artif. Intell. Eng. Des. Anal. Manuf. 30(3): 289-299 (2016) - 2013
- [j2]Ruhul A. Sarker
Hybrid Evolutionary Algorithm for job scheduling under machine maintenance. Appl. Soft Comput. 13(3): 1440-1447 (2013) - 2010
- [c5]S. M. Kamrul Hasan, Ruhul A. Sarker
Evolutionary scheduling with rescheduling option for sudden machine breakdowns. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2009
- [b1]S. M. Kamrul Hasan:
Evolutionary algorithms for solving job-shop scheduling problems in the presence of process interruptions. University of New South Wales, Canberra, Australia, 2009 - [j1]S. M. Kamrul Hasan, Ruhul A. Sarker
Memetic algorithms for solving job-shop scheduling problems. Memetic Comput. 1(1): 69-83 (2009) - [p1]S. M. Kamrul Hasan, Ruhul A. Sarker, Daryl Essam, David Cornforth:
A Genetic Algorithm with Priority Rules for Solving Job-Shop Scheduling Problems. Natural Intelligence for Scheduling, Planning and Packing Problems 2009: 55-88 - 2008
- [c4]S. M. Kamrul Hasan, Ruhul A. Sarker
GA with priority rules for solving Job-Shop Scheduling Problems. IEEE Congress on Evolutionary Computation 2008: 1913-1920 - 2007
- [c3]S. M. Kamrul Hasan, Ruhul A. Sarker
Hybrid Genetic Algorithm for Solving Job-Shop Scheduling Problem. ACIS-ICIS 2007: 519-524 - [c2]S. M. Kamrul Hasan, Ruhul A. Sarker
Modified genetic algorithm for job-shop scheduling: A gap utilization technique. IEEE Congress on Evolutionary Computation 2007: 3804-3811 - 2005
- [c1]Md. Shamsul Alam, S. M. Kamrul Hasan, Abu Sayeed Md. Sohail, Md. Mahmudul Hasan, Boshir Ahmed:
Application of Heuristic MMKP in Admission Control and QoS Adaptation for Distributed Video on Demand Service. DMS 2005: 234-240
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 20:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: