Benson Lam

Benson Lam


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 September 2022 in Pattern Recognition
Verified
Journal Article
Closed access
TNTsz Ching Ng
Tsz Ching Ng
SCSiu Kai Choy
Siu Kai Choy
BLBenson Lam
Benson Lam
KYKwok Wai Yu
Kwok Wai Yu


1 December 2016 in Land Use Policy
Verified
Journal Article
Closed access
BLBenson Lam
Benson Lam
CYCarisa K.W. Yu
Carisa K.W. Yu
SCSiu Kai Choy
Siu Kai Choy
JLJacky K.T. Leung
Jacky K.T. Leung

21 July 2020 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
BLBenson Lam
Benson Lam
ALAlan Wee-Chung Liew
Alan Wee-Chung Liew
Many image processing and pattern recognition problems can be formulated as binary quadratic programming (BQP) problems. However, solving a large BQP problem with a good quality solution and low computational time is still a challenging unsolved problem. Current methodologies either adopt an independent random search in a semi-definite space or perform search in a relaxed biconvex space. However, the independent search has great computation cost as many different trials are needed to get a good solution. The biconvex search only searches the solution in a local convex ball, which can be a local optimal solution. In this paper, we propose a BQP solver that alternatingly applies a deterministic search and a stochastic neighborhood search. The deterministic search iteratively improves the solution quality until it satisfies the KKT optimality conditions. The stochastic search performs bootstrapping sampling to the objective function constructed from the potential solution to find a stochastic neighborhood vector. These two steps are repeated until the obtained solution is better than many of its stochastic neighborhood vectors. We compare the proposed solver with several state-of-the-art methods for a range of image processing and pattern recognition problems. Experimental results showed that the proposed solver not only outperformed them in solution quality but also with the lowest computational complexity.

ACAmanda Chu
Amanda Chu
BLBenson Lam
Benson Lam
ATAgnes Tiwari
Agnes Tiwari
MSMike Ka Pui So
Mike Ka Pui So
Patient data or information collected from public health and health care surveys are of great research value. Usually, the data contain sensitive personal information. Doctors, nurses, or researchers in the public health and health care sector do not analyze the available datasets or survey data on their own, and may outsource the tasks to third parties. Even though all identifiers such as names and ID card numbers are removed, there may still be some occasions in which an individual can be re-identified via the demographic or particular information provided in the datasets. Such data privacy issues can become an obstacle in health-related research. Statistical disclosure control (SDC) is a useful technique used to resolve this problem by masking and designing released data based on the original data. Whilst ensuring the released data can satisfy the needs of researchers for data analysis, there is high protection of the original data from disclosure. In this research, we discuss the statistical properties of two SDC methods: the General Additive Data Perturbation (GADP) method and the Gaussian Copula General Additive Data Perturbation (CGADP) method. An empirical study is provided to demonstrate how we can apply these two SDC methods in public health research.

6 October 2021 in Applied Stochastic Models in Business and Industry
Verified
Journal Article
Closed access
PDF file
ACAmanda M. Y. Chu
Amanda M. Y. Chu
CIChun Yin Ip
Chun Yin Ip
BLBenson Lam
Benson Lam
MSMike Ka Pui So
Mike Ka Pui So