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

J. C. Lee

dblp:88/3314 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 1996
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Computer networks · 1Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1 · 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.

Artificial intelligence
1 paper
Robot navigation and mapping · 67% Motion planning and robot control · 33%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › localization
dead reckoning
0.011996
Dead-reckoning for a two-wheeled mobile robot on curved surfaces · ICRA 1996
Robotics › Motion planning and robot control › robot kinematics
mobile robot kinematics
0.011996
Dead-reckoning for a two-wheeled mobile robot on curved surfaces · ICRA 1996
Robotics › Robot navigation and mapping › localization › robot localization
mobile robot localization
0.011996
Dead-reckoning for a two-wheeled mobile robot on curved surfaces · ICRA 1996
Physical-layer communications
interference cancellation
0.011994
A narrowband interference canceller with an adjustable center weight · IEEE Trans. Commun. 1994
Physical-layer communications › spread spectrum
direct-sequence spread spectrum
0.011994
A narrowband interference canceller with an adjustable center weight · IEEE Trans. Commun. 1994
Physical-layer communications
spread spectrum
0.011994
A narrowband interference canceller with an adjustable center weight · IEEE Trans. Commun. 1994
Audio and music processing
speech processing
0.011985
A frequency-weighted block LMS algorithm and its application to speech processing · Proc. IEEE 1985
Data integration and cleaning › data transformation
data restructuring
0.011975
Optimal Choice of Data Restructuring Points · VLDB 1975

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

dead-reckoning formula · 0.0adaptive filtering · 0.0frequency-weighted mean-squared error minimization · 0.0stochastic modeling · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1996 Dead-reckoning for a two-wheeled mobile robot on curved surfaces
abstract
Recently various kinds of tasks such as the inspections on the curved wall of a vessel are performed by mobile robots. In those cases, the robot has to travel on curved surfaces along the prespecified path and has to know its current position for the successful accomplishment of the tasks. In this paper, we propose a dead-reckoning formula for a two-wheeled mobile robot moving on a curved plane, and illustrate the formula with examples for cylindrical surfaces. The performance of the proposed algorithm will be analyzed through a series of experiments by the magnet wheeled mobile robot developed in our laboratory.
K. R. Kim, J. C. Lee
ICRA2
1994 A narrowband interference canceller with an adjustable center weight
abstract
An adaptive interference canceller with an adjustable center weight is proposed to improve the performance of the conventional fixed center-weight canceller for applications in data transmission systems such as normal binary phase shift keying (BPSK) and direct sequence spread spectrum BPSK modems. The performance of the new interference canceller is shown to be better than that of the conventional canceller by analysis.>
M. Anwar Hasan, J. C. Lee, Vijay K. Bhargava
IEEE Trans. Commun.2
1992 Performance of constant modulus adaptive digital filters for interference cancellation
O. W. Kwon, Chong Kwan Un, J. C. Lee
Signal Process.3
1985 Adaptive digital filtering of differentially coded signals
abstract
In this paper the performance and realization of adaptive digital filters (ADF's) for differentially coded signals have been studied. A general formula that realizes the LMS algorithm for differentially coded signals is first derived. We use this formula for realization of ADM and ADPCM ADF's. Then, applying these algorithms to channel equalization, we study the performances of the two filters for the cases of using a time-varying and a constant convergence factor. If we consider the dynamic range and the sensitivity to the variation of parameter values as the important performance factors, the ADPCM ADF with a time-varying convergence factor is preferred. However, when we consider the system complexity, the use of the ADM ADF with a time-varying convergence factor is desirable.
Chong Kwan Un, J. C. Lee
ICASSP3
1985 A frequency-weighted block LMS algorithm and its application to speech processing
abstract
In this letter, we propose a frequency-weighted block LMS (FWBLMS) algorithm that is based on minimization of the frequency-weighted block mean-squared error. The FWBLMS algorithm has an important advantage over the time-domain LMS algorithm in that it can be designed with different frequency weighting on error signal depending on the relative significance of various frequency bands. Application of the FWBLMS algorithm in adaptive linear prediction of speech is discussed.
J. C. Lee, Chong Kwan Un, Dong-Ho Cho
Proc. IEEE1
1975 Optimal Choice of Data Restructuring Points
abstract
Maintaining access efficiency to a data base as updates and/or usage patterns change often requires restructuring the data base. While analytical methods are available for determining the optimal point to restructure, they assume the mean access cost is a smooth function of time or the number of accesses and can be measured exactly at any point in time. The access cost in practice often varies, at least in the short run, In a random manner. This implies a nonzero probability of deciding the optimal reorganization point has been reached when in fact it has not. Determination of the optimal reorganization point must take into account the random behavior of the access cost and the probability (and cost) of deciding too early or too late to perform the reorganization. A technique for choosing the optimal reorganization point subject to random variation in the access cost is developed and some examples are presented.
Leon E. Winslow, J. C. Lee
VLDB2