Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daechul Park

dblp:01/6112 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
1since 2021 · last 2022
0000-0002-2114-0067ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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 architecture, parallel and distributed computing, and storage systems
2 papers
Embedded and real-time systems · 61% Parallel and multicore computing · 39%
Computer graphics and multimedia
1 paper
Image and video coding · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling › multiprocessor scheduling
global EDF scheduling
1.022022
Optimal Parallelization of Single/Multi-Segment Real-Time Tasks for Global EDF · IEEE Trans. Computers 2022
Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems · RTSS 2019
Embedded and real-time systems
real-time scheduling
1.022022
Optimal Parallelization of Single/Multi-Segment Real-Time Tasks for Global EDF · IEEE Trans. Computers 2022
Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems · RTSS 2019
Embedded and real-time systems › real-time scheduling
schedulability analysis
0.722022
Optimal Parallelization of Single/Multi-Segment Real-Time Tasks for Global EDF · IEEE Trans. Computers 2022
Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems · RTSS 2019
Parallel and multicore computing
parallel scheduling
0.612022
Optimal Parallelization of Single/Multi-Segment Real-Time Tasks for Global EDF · IEEE Trans. Computers 2022
Parallel and multicore computing
parallel programming models
0.622022
Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems · RTSS 2019
Optimal Parallelization of Single/Multi-Segment Real-Time Tasks for Global EDF · IEEE Trans. Computers 2022
Parallel and multicore computing › parallelization strategies
task parallelization
0.622022
Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems · RTSS 2019
Optimal Parallelization of Single/Multi-Segment Real-Time Tasks for Global EDF · IEEE Trans. Computers 2022
Image and video coding
rate control
0.011994
A stable feedback control of the buffer state using the controlled Lagrange multiplier method · IEEE Trans. Image Process. 1994
Image and video coding
rate-distortion optimization
0.011994
A stable feedback control of the buffer state using the controlled Lagrange multiplier method · IEEE Trans. Image Process. 1994

Methods — techniques the papers use, named apart from their topics

polynomial-time optimal algorithm · 0.6formal proof · 0.6one-way search · 0.4interference-based analysis · 0.4lyapunov stability theory · 0.0feedback control theory · 0.0
YearPublicationVenuePosition
2022 Optimal Parallelization of Single/Multi-Segment Real-Time Tasks for Global EDF
abstract
Targeting global EDF scheduling, this article proposes an optimal algorithm for parallelizing tasks with parallelization freedom. For this, we extend the interference-based sufficient schedulability analysis and derive monotonic increasing properties of both tolerance and interference for the schedulability. Leveraging those properties, we propose a one-way search–based optimal algorithm with polynomial time complexity. We present a formal proof of the optimality of the proposed algorithm. We first address the single-segment task model and then extend to the multi-segment task model. Our extensive experiments through both simulation and actual implementation show that our proposed approach can significantly improve the schedulability.
Youngeun Cho, Daechul Park, Seung Su Lee, Chang-Gun Lee
IEEE Trans. Computers3
2019 Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems
abstract
Targeting global EDF scheduling, this paper proposes a conditionally optimal algorithm for parallelizing tasks with parallelization freedom. For this, we extend the interference-based sufficient schedulability analysis and derive monotonic increasing properties of both tolerance and interference for the schedulability. Leveraging those properties, we propose a one-way search based conditionally optimal algorithm with polynomial time complexity. Our extensive experiments through both simulation and actual implementation show that our proposed approach can significantly improve the schedulability up to 60 percent.
Youngeun Cho, Do Hyung Kim 0003, Daechul Park, Seung Su Lee, Chang-Gun Lee
RTSS3
2014 A fast hybrid Jacket-Hadamard matrix based diagonal block-wise transform
Moon Ho Lee, Md. Hashem Ali Khan, Kyeong Jin Kim, Daechul Park
Signal Process. Image Commun.4
2006 Simple Element Inverse DCT/DFT Hybrid Architecture Algorithm
abstract
We address a new representation of DCT/DFT matrices via one hybrid architecture. Based on a element inverse matrix factorization algorithm, we show that the DCT and DFT have a same recursive computational pattern, and we can develop an hybrid architecture by using some diagonal matrices.
Moon Ho Lee, Daechul Park
ICASSP (3)3
1995 Lenticular stereoscopic imaging and displaying techniques with no special glasses
abstract
Autostereoscopic 3-D imaging and display system is implemented on the notebook 486 DxII PC with TFT active matrix LCD display module and accompanying lenticular sheet lens. An image processing board (e.g. Targa Plus which is commercially available) is used to capture and display the image. Display experiments for still images and animating graphics images were very promising and satisfactory. Measured depth perception is about 100 mm on a notebook PC LCD display unit. The compact design of lens-plate and TFT LCD display module would be appropriate for 3-D game machines, stereoscopic TV system on multimedia PC.
Daechul Park, Kyungtae Kim, Cheonhee Lee, Jungyoung Son, Yongbeom Lee
ICIP (3)1
1994 Adaptive Bayesian decision model for motion segmentation
Daechul Park
Pattern Recognit. Lett.1
1994 A stable feedback control of the buffer state using the controlled Lagrange multiplier method
abstract
We propose a stable feedback control algorithm of the buffer state using the controlled Lagrange multiplier in combined rate-distortion characteristics for a buffer-constrained adaptive quantization. The proposed algorithm is established using feedback control theory and is described by the state equation with nonlinearity in the feedback path. The nonlinearity of the state equation comes from the average distortion-rate curve of the information source. The stability of this buffer control algorithm is shown using Lyapunov stability theory. It is shown that the stability of the algorithm depends on average distortion-rate curve and buffer size, and sufficient conditions for the algorithm to be stable are obtained from the usual average distortion-rate curve. In addition, it is observed from experimental results that the performance of the proposed algorithm and the optimal algorithm is not significantly different. Although the proposed algorithm does not provide optimal performance, the algorithm can be implemented easily with quite low computational complexity, as compared with others.
Jinho Choi 0001, Daechul Park
IEEE Trans. Image Process.2
1990 Statistical analysis of a change detector based on image modeling of difference picture
abstract
A statistical analysis of a change detector for motion detection based on image modeling of a difference picture is presented. The approach is founded upon the fact that complete silhouettes of moving objects can be segmented at each frame time using a change detector based on image modeling of the difference picture. The change detection problem can be treated as a signal detection problem in which very little is known about the signal to be detected. The exact modeling of the background event is necessary for a robust change detector which can adapt to changing environments. The governing statistics for change measures, which have a form of sum of squares of the difference picture, can be inferred from the assumed Gaussian distribution of the stationary background in the difference picture and are used for calculation of the adaptive decision threshold for the change detector. It is shown that the adaptive decision threshold derived from the change measure minimizes the total probability of error as measured in false alarms and missed detections. Experimental results that support the underlying statistical analysis are presented.>
Daechul Park, Don R. Hush
ICASSP1