Yu-Chi Lai

Prof. Yu-Chi Lai

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
25 March 2014 in Bulletin of the Seismological Society of America
Verified
Journal Article
Closed access
PDF file
RJR. Jolivet
R. Jolivet
ZDZ. Duputel
Z. Duputel
BRB. Riel
B. Riel
MSM. Simons
M. Simons
LRL. Rivera
L. Rivera
CTClifford Thurber
Clifford Thurber
Double‐difference seismic tomography can estimate velocity structure and event locations with high precision, but its high‐computation cost along with large memory usage prevents the use of a personal computer to process very large datasets and requires a long‐computation time. This work proposes graphics‐processing‐unit‐ (GPU)‐based acceleration schemes to run the algorithm on a personal computer for very large datasets more efficiently. Generally, the algorithm can be divided into five major steps: input, ray tracing, matrix construction, inversion, and output. This work focuses on accelerating the ray‐tracing and inversion steps, which take almost two‐thirds of the computation time. Before ray tracing, our algorithm preprocesses the data by sorting all recorded event–station paths according to their lengths. Therefore, those path estimation jobs assigned to GPU cores are suitable for the GPU architecture. Furthermore, our work also minimizes the usage of global and local memory to reduce the GPU computing time needed to handle a very large dataset. In addition to parallelizing the inversion computation, our work proposes a GPU‐based elimination method to reduce redundant computation in inversion for further acceleration. In our test, the proposed acceleration schemes can gain maximum speed‐up factors of 31.17 and 35.46 for ray tracing and inversion, respectively, in our test. Overall, the GPU‐based implementation can reach a maximum of 5.98 times faster than the central processing unit‐based implementation.

28 May 2019 in Symmetry
Verified
Journal Article
Open access
PDF file
VUVojtěch Uher
Vojtěch Uher
PGPetr Gajdoš
Petr Gajdoš
TVTomas Vantuch
Tomas Vantuch
YLYu-Chi Lai
Yu-Chi Lai
MRMichal Radecký
Michal Radecký
Space-filling curves (SFCs) represent an efficient and straightforward method for sparse-space indexing to transform an n-dimensional space into a one-dimensional representation. This is often applied for multidimensional point indexing which brings a better perspective for data analysis, visualization and queries. SFCs are involved in many areas such as big data analysis and visualization, image decomposition, computer graphics and geographic information systems (GISs). The indexing methods subdivide the space into logic clusters of close points and they differ in various parameters including the cluster order, the distance metrics, and the pattern shape. Beside the simple and highly preferred triangular and square uniform grids, the hexagonal uniform grids have gained high interest especially in areas such as GISs, image processing and data visualization for the uniform distance between cells and high effectiveness of circle coverage. While the linearization of hexagons is an obvious approach for memory representation, it seems there is no hexagonal SFC indexing method generally used in practice. The main limitation of hexagons lies in lacking infinite decomposition into sub-hexagons and similarity of tiles on different levels of hierarchy. Our research aims at defining a fast and robust hexagonal SFC method. The Gosper fractal is utilized to preserve the benefits of hexagonal grids and to efficiently and hierarchically linearize points in a hexagonal grid while solving the non-convex shape and recursive transformation issues of the fractal. A comparison to other SFCs and grids is conducted to verify the robustness and effectiveness of our hexagonal method.

4 November 2010 in International Journal of Communication Systems
Verified
Journal Article
Closed access
PDF file
GSGuan‐Ming Su
Guan‐Ming Su
YLYu-Chi Lai
Yu-Chi Lai
AKAndres Kwasinski
Andres Kwasinski
HWHaohong Wang
Haohong Wang

4 February 2016 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
CYChih-Yuan Yao
Chih-Yuan Yao
SHShih-Hsuan Hung
Shih-Hsuan Hung
GLGuo-Wei Li
Guo-Wei Li
ICI-Yu Chen
I-Yu Chen
RAReza Adhitya
Reza Adhitya
YLYu-Chi Lai
Yu-Chi Lai
Manga are a popular artistic form around the world, and artists use simple line drawing and screentone to create all kinds of interesting productions. Vectorization is helpful to digitally reproduce these elements for proper content and intention delivery on electronic devices. Therefore, this study aims at transforming scanned Manga to a vector representation for interactive manipulation and real-time rendering with arbitrary resolution. Our system first decomposes the patch into rough Manga elements including possible borders and shading regions using adaptive binarization and screentone detector. We classify detected screentone into simple and complex patterns: our system extracts simple screentone properties for refining screentone borders, estimating lighting, compensating missing strokes inside screentone regions, and later resolution independently rendering with our procedural shaders. Our system treats the others as complex screentone areas and vectorizes them with our proposed line tracer which aims at locating boundaries of all shading regions and polishing all shading borders with the curve-based Gaussian refiner. A user can lay down simple scribbles to cluster Manga elements intuitively for the formation of semantic components, and our system vectorizes these components into shading meshes along with embedded Bézier curves as a unified foundation for consistent manipulation including pattern manipulation, deformation, and lighting addition. Our system can real-time and resolution independently render the shading regions with our procedural shaders and drawing borders with the curve-based shader. For Manga manipulation, the proposed vector representation can be not only magnified without artifacts but also deformed easily to generate interesting results.

31 July 2017 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
HWHong-Cyuan Wang
Hong-Cyuan Wang
YLYu-Chi Lai
Yu-Chi Lai
WCWen-Huang Cheng
Wen-Huang Cheng
CCChin-Yun Cheng
Chin-Yun Cheng
KHKai-Lung Hua
Kai-Lung Hua
Background extraction is generally the first step in many computer vision and augmented reality applications. Most existing methods, which assume the existence of a clean background during the reconstruction period, are not suitable for video sequences such as highway traffic surveillance videos, whose complex foreground movements may not meet the assumption of a clean background. Therefore, we propose a novel joint Gaussian conditional random field (JGCRF) background extraction algorithm for estimating the optimal weights of frame composition for a fixed-view video sequence. A maximum a posteriori problem is formulated to describe the intra- and inter-frame relationships among all pixels of all frames based on their contrast distinctness and spatial and temporal coherence. Because all background objects and elements are assumed to be static, patches that are motionless are good candidates for the background. Therefore, in the algorithm method, a motionless extractor is designed by computing the pixel-wise differences between two consecutive frames and thresholding the accumulation of variation across the frames to remove possible moving patches. The proposed JGCRF framework can flexibly link extracted motionless patches with desired fusion weights as extra observable random variables to constrain the optimization process for more consistent and robust background extraction. The results of quantitative and qualitative experiments demonstrated the effectiveness and robustness of the proposed algorithm compared with several state-of-the-art algorithms; the proposed algorithm also produced fewer artifacts and had a lower computational cost.

23 December 2016 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
KHKai-Lung Hua
Kai-Lung Hua
HWHong-Cyuan Wang
Hong-Cyuan Wang
CYChih-Hsiang Yeh
Chih-Hsiang Yeh
WCWen-Huang Cheng
Wen-Huang Cheng
YLYu-Chi Lai
Yu-Chi Lai
It is important to extract a clear background for computer vision and augmented reality. Generally, background extraction assumes the existence of a clean background shot through the input sequence, but realistically, situations may violate this assumption such as highway traffic videos. Therefore, our probabilistic model-based method formulates fusion of candidate background patches of the input sequence as a random walk problem and seeks a globally optimal solution based on their temporal and spatial relationship. Furthermore, we also design two quality measures to consider spatial and temporal coherence and contrast distinctness among pixels as background selection basis. A static background should have high temporal coherence among frames, and thus, we improve our fusion precision with a temporal contrast filter and an optical-flow-based motionless patch extractor. Experiments demonstrate that our algorithm can successfully extract artifact-free background images with low computational cost while comparing to state-of-the-art algorithms.