Demo Data from EDBT 2026 / reviewers in the wild / expert
Su Jun Leow
dblp:125/2869
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Computational fabrication · 77% Geometric modeling and processing · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational fabrication
papercraft design |
0.2 | 1 | 2014 | Surface and Contour-Preserving Origamic Architecture Paper Pop-Ups · IEEE Trans. Vis. Comput. Graph. 2014 |
Geometric modeling and processing › surface processing
surface segmentation |
0.1 | 1 | 2014 | Surface and Contour-Preserving Origamic Architecture Paper Pop-Ups · IEEE Trans. Vis. Comput. Graph. 2014 |
Methods — techniques the papers use, named apart from their topics
image-domain approach · 0.2foldability conditions · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Low-resource keyword search strategies for tamilabstractWe propose strategies for a state-of-the-art keyword search (KWS) system developed by the SINGA team in the context of the 2014 NIST Open Keyword Search Evaluation (OpenKWS14) using conversational Tamil provided by the IARPA Babel program. To tackle low-resource challenges and the rich morphological nature of Tamil, we present highlights of our current KWS system, including: (1) Submodular optimization data selection to maximize acoustic diversity through Gaussian component indexed N-grams; (2) Keywordaware language modeling; (3) Subword modeling of morphemes and homophones. Nancy F. Chen, Chongjia Ni, I-Fan Chen, Sunil Sivadas, Van Tung Pham, Haihua Xu 0001, Tze Siong Lau, Su Jun Leow, Boon Pang Lim, Cheung-Chi Leung, Lei Wang 0020, Chin-Hui Lee 0001, Alvina Goh, Chng Eng Siong, Bin Ma 0001, Haizhou Li 0001 |
ICASSP | 9 |
| 2015 | Language-resource independent speech segmentation using cues from a spectrogram imageabstractIn this paper, we use image processing techniques on the speech spectrogram to perform speech phoneme segmentation. The proposed method relies solely on visual cues on the spectrogram, without the need for language-specific training data. The results are evaluated on the TIMIT corpus, and compared to other unsupervised speech segmentation techniques, with comparable results obtained. We also fuse the results with those obtained by hidden Markov models (HMM) and HMM-based forced alignment to investigate if image features can provide an additional feature representation for speech processing tasks. With the fusion, up to 10% absolute improvement in segmentation accuracy over the HMM baselines can be obtained. Results are promising and suggests a strong potential for image-based features applying to speech processing. Su Jun Leow, Chng Eng Siong, Chin-Hui Lee 0001 |
ICASSP | 1 |
| 2015 | Language independent query-by-example spoken term detection using N-best phone sequences and partial matchingabstractIn this paper, we propose a partial sequence matching based symbolic search (SS) method for the task of language independent query-by-example spoken term detection. One main drawback of conventional SS approach is the high miss rate for long queries. This is due to high variations in symbol representation of query and search audios, especially in language independent scenario. The successful matching of a query with its instances in search audio becomes exponentially more difficult as the query grows longer. To reduce miss rate, we propose a partial matching strategy, in which all partial phone sequences of a query are used to search for query instances. The partial matching is also suitable for real life applications where exact match is usually not necessary and word prefix, suffix, and order should not affect the search result. When applied to the QUESST 2014 task, results show the partial matching of phone sequences is able to reduce miss rate of long queries significantly compared with conventional full matching method. In addition, for the most challenging inexact matching queries (type 3), it also shows clear advantage over DTW-based methods. Haihua Xu 0001, Lei Xie 0001, Cheung-Chi Leung, Hongjie Chen 0001, Jia Yu 0002, Hang Lv 0001, Lei Wang 0020, Su Jun Leow, Bin Ma 0001, Chng Eng Siong, Haizhou Li 0001 |
ICASSP | 10 |
| 2014 | Surface and Contour-Preserving Origamic Architecture Paper Pop-UpsabstractOrigamic architecture (OA) is a form of papercraft that involves cutting and folding a single sheet of paper to produce a 3D pop-up, and is commonly used to depict architectural structures. Because of the strict geometric and physical constraints, OA design requires considerable skill and effort. In this paper, we present a method to automatically generate an OA design that closely depicts an input 3D model. Our algorithm is guided by a novel set of geometric conditions to guarantee the foldability and stability of the generated pop-ups. The generality of the conditions allows our algorithm to generate valid pop-up structures that are previously not accounted for by other algorithms. Our method takes a novel image-domain approach to convert the input model to an OA design. It performs surface segmentation of the input model in the image domain, and carefully represents each surface with a set of parallel patches. Patches are then modified to make the entire structure foldable and stable. Visual and quantitative comparisons of results have shown our algorithm to be significantly better than the existing methods in the preservation of contours, surfaces, and volume. The designs have also been shown to more closely resemble those created by real artists. Sang N. Le, Su Jun Leow, Tuong-Vu Le-Nguyen, Conrado R. Ruiz Jr., Kok-Lim Low |
IEEE Trans. Vis. Comput. Graph. | 2 |