Win-Bin Huang

ORCID: 0000-0002-9174-5467
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Text Analysis Techniques
  • Advanced Steganography and Watermarking Techniques
  • scientometrics and bibliometrics research
  • Complex Network Analysis Techniques
  • Stock Market Forecasting Methods
  • Digital Media Forensic Detection
  • Topic Modeling
  • Advanced Data Compression Techniques
  • Advanced Image and Video Retrieval Techniques
  • Privacy-Preserving Technologies in Data
  • Online Learning and Analytics
  • Computer Graphics and Visualization Techniques
  • Vehicle License Plate Recognition
  • Advanced Vision and Imaging
  • Expert finding and Q&A systems
  • Image and Signal Denoising Methods
  • Biomedical Text Mining and Ontologies
  • Web Data Mining and Analysis
  • Video Coding and Compression Technologies
  • Cryptography and Data Security
  • Web visibility and informetrics
  • Policy Transfer and Learning
  • Generative Adversarial Networks and Image Synthesis
  • Credit Risk and Financial Regulations
  • Visual Attention and Saliency Detection

Peking University
2013-2024

Nanyang Technological University
2019

National Cheng Kung University
2004-2013

Abstract Interdisciplinary research is increasingly recognized as one of the solutions to today’s challenging scientific and societal issues. Many studies have aimed explore relationship between interdisciplinarity attention they receive from community well society. However, policy documents remains unclear. In this study, we utilize publications data on COVID-19 topic such a relationship. Through analysis interpretation empirical datasets, finds that there positive correlation in almost all...

10.1057/s41599-024-02915-8 article EN cc-by Humanities and Social Sciences Communications 2024-03-11

A novel feature region selection method for robust digital image watermarking is proposed in this paper. This aims to select a nonoverlapping set, which has the greatest robustness against various attacks and can preserve quality as much possible after watermarked. It first performs simulated attacking procedure using some predefined evaluate of every candidate region. According evaluation results, it then adopts track-with-pruning search minimal primary set resist most attacks. In order...

10.1109/tip.2010.2073475 article EN IEEE Transactions on Image Processing 2010-09-08

In this paper, a feature-based robust digital image watermarking algorithm is proposed to achieve the goal of authentication and protection simultaneously. The Hessian-Affine feature detector at first adopted extract characteristic regions an in watermark embedding scheme. Then copyright embedded into these according local orientation each pixel. Moreover, remainder are applied for by using block-wise fragile method. Similarly, detection scheme follows above procedure authentic information...

10.1109/icip.2007.4379867 article EN 2007-01-01

In the field of scientometrics, principal purpose for author co-citation analysis (ACA) is to map knowledge domains by quantifying relationship between co-cited pairs. However, traditional ACA has been criticized since its input insufficiently informative simply counting authors' frequencies. To address this issue, paper introduces a new method that reconstructs raw matrices regarding document unit counts and keywords references, named as Document- Keyword-Based Author Co-Citation Analysis...

10.2478/dim-2018-0009 article EN cc-by-nc-nd Data and Information Management 2018-08-15

In this paper, we propose to use contexts of superpixels as a prior improve semantic segmentation by the CRF framework. A graphical model is constructed on over-segmented images. Our main contribution take concept "superpixel embedding" into consideration, which formalized potential item for optimizing energy whole graph. We also introduce two ways calculating embedding potential. Experiments several popular datasets, e.g., MRSC-21 and PASCAL VOC, illustrate that our approach enhances...

10.1109/icip.2016.7532562 article EN 2022 IEEE International Conference on Image Processing (ICIP) 2016-08-17

Learning path offers personalized guidance in order to improve learners' performance e-learning systems. With the growth of learning resources, workload manually planning paths is increasing accordingly, which becomes a burden experts and teachers. Knowledge graph capable describing characteristics knowledge providing inspirations generate path. In this paper, we propose method generator based on graph, firstly generates sequence points by self-designed topological ranking algorithm then...

10.1145/3450148.3450155 article EN 2021-01-10

Set Partitioning in Hierarchical Trees (SPIHT) is a highly efficient technique for compressing Discrete Wavelet Transform (DWT) decomposed images. Though its compression efficiency little less famous than Embedded Block Coding with Optimized Truncation (EBCOT) adopted by JPEG2000, SPIHT has straight forward coding procedure and requires no tables. These make more appropriate algorithm lower cost hardware implementation. In this paper, modified presented. The modifications include...

10.1093/ietfec/e89-a.12.3613 article EN IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences 2006-12-01

Digital content is easily spread out in the era of cloud computing. However, challenge providing an identity-based access control mechanism to carry rating system for preventing specific digital from being obtained by inappropriate users. In this paper, we proposed a novel approach based on ciphertext-policy attribute-based encryption (iDAC). iDAC, still works even duplicated another server. Moreover, only one copy encrypted required share with multiple This could efficiently reduce overhead...

10.1109/icoin.2015.7057862 article EN 2022 International Conference on Information Networking (ICOIN) 2015-01-01

Business taxonomies are indispensable tools for investors to do equity research and make professional decisions. However, identify the structure of industry sectors in an emerging market is challenging two reasons. First, existing designed mature markets, which may not be appropriate classification small companies with innovative business models. Second, markets fast-developing, thus static cannot promptly reflect new features. In this article, we propose a method construct automatically...

10.48550/arxiv.1906.09694 preprint EN other-oa arXiv (Cornell University) 2019-01-01

A novel neural network based method for halftoning and inverse of digital images is presented. We first start from half-toning produced error diffusion methods using an RBF plus MLP network. The restored contone have had good quality already. Then, SLP used to refine the processing training process also involved. combined procedure produces half-tone corresponding continuous tone at same time. It found that these even better PSNR performance. Furthermore, resulted are visually sharper...

10.1109/icip.2004.1421882 article EN 2005-04-19

In modern information retrieval systems, the thesaurus is playing an increasingly important role. order to better describe and analyze domain news, this paper proposes a method of keyword extraction, further constructs effective thesaurus. Compared with previous research, grasps core in field by extracting combining keywords, improves effectiveness addition, conducts both manual analysis automated processing construct high-quality thesaurus, which has practical application value. The final...

10.1016/j.procs.2022.11.249 article EN Procedia Computer Science 2022-01-01

Set partitioning in hierarchical trees (SPIHT) is a highly efficient technique for compressing discrete wavelet transform (DWT) decomposed images. Though its compression efficiency little less than famous embedded block coding with optimized truncation (EBCOT) adopted by JPEG2000, codec standard still images, SPIHT has straightforward procedure and requires no tables. These make more appropriate algorithm hardware implementation. In this paper, modified presented. The modifications include...

10.1109/icics.2003.1292453 article EN 2004-07-09
Coming Soon ...